A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Automorphism Groups and Their Structure

Research Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal
8topics build on this
521prerequisites beneath it
See this on the map →
Basic Model TheoryGroup Definition and Examples+2 more→→Automorphism Orbits and Galois TypesHomogeneous and Universal Models
automorphisms group-structure orbits

Core Idea

The automorphism group Aut(M) of a model M consists of all bijections from M to itself that preserve the structure. The orbits of this group action on n-tuples partition the complete types realized in M. The structure of automorphism groups encodes information about types, definable subgroups, and stability properties of the model.

Explainer

You already know from model theory basics that a model is a set equipped with interpretations for the function and relation symbols of a language. An automorphism of M is a bijection σ: M → M that preserves all of this structure: for every relation symbol R and every tuple ā, M ⊨ R(ā) if and only if M ⊨ R(σ(ā)). Automorphisms are exactly the symmetries of M — they rearrange elements while leaving all logical properties intact.

The collection of all automorphisms of M forms a group under composition, called Aut(M). Composition is associative, the identity map is always an automorphism, and each automorphism has an inverse. From your optional prerequisite on group definitions, you know these are precisely the group axioms. What is new here is that Aut(M) is not just any abstract group — it is a group acting on M by permutation, and this action has deep logical content.

The key theorem connects automorphisms to types. Two elements a and b in M realize the same complete type (the same set of formulas they satisfy) if and only if there exists an automorphism σ ∈ Aut(M) such that σ(a) = b — at least in sufficiently homogeneous models. More generally, the orbits of the action of Aut(M) on n-tuples from M correspond exactly to the complete n-types realized in M. Elements in the same orbit are logically indistinguishable from the model's internal perspective; elements in different orbits are distinguished by some formula.

This orbit-type correspondence gives Aut(M) diagnostic power. If Aut(M) acts transitively on all pairs of realizations of a given type (every element can be mapped to every other), the model is called homogeneous in a strong sense. A model with a very small automorphism group (e.g., a rigid model with only the identity) has many distinct types and many definable singletons. Conversely, a rich automorphism group signals high symmetry and often stability: in the theory of algebraically closed fields, the automorphism group of the algebraic closure of Q is enormous, corresponding to the large number of types over Q that can be automorphically interchanged. Studying Aut(M) is thus studying the "degree of indistinguishability" baked into the model — a precise, algebraic measure of how much structure the first-order theory can pin down.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Satisfiability and Unsatisfiability → Consistency and Inconsistency of Theories → Consistency and Inconsistency → Complete First-Order Theories → First-Order Types and Partial Descriptions → Type Spaces and Stone Topology → Automorphism Groups and Their Structure

Longest path: 93 steps · 521 total prerequisite topics

Prerequisites (4)

Leads To (2)