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 moreAutomorphism 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSatisfiability and UnsatisfiabilityConsistency and Inconsistency of TheoriesConsistency and InconsistencyComplete First-Order TheoriesFirst-Order Types and Partial DescriptionsType Spaces and Stone TopologyAutomorphism Groups and Their Structure

Longest path: 93 steps · 521 total prerequisite topics

Prerequisites (4)

Leads To (2)