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

Imaginary Elements and Quotient Sorts

Research Depth 92 in the knowledge graph I know this Set as goal
566prerequisites beneath it
See this on the map →
Structures and Formal LanguagesDefinability and Applications to Algebraic Geometry
imaginaries quotient-structures extensions

Core Idea

Imaginary elements are equivalence classes of tuples under definable equivalence relations. The imaginary extension Meq of a model M adds all such quotient objects as new sorts, creating a richer structure. Imaginary elements capture definable structure that real elements cannot represent and are essential for category-theoretic properties of model theory.

Explainer

From your study of structures and formal languages, you know that a model M is a domain of elements together with interpretations of the signature. A definable set is a subset of Mn picked out by a first-order formula — it is part of the structure's "visible" geometry. Now consider a definable equivalence relation E on Mn: a formula E(x⃗, y⃗) such that every model satisfies reflexivity, symmetry, and transitivity. The equivalence classes [a⃗]_E are natural mathematical objects — think of the cosets of a definable subgroup, or the orbits under a definable group action. The problem is that these equivalence classes are not elements of M; they are *sets* of elements. This gap between what the structure can define and what it can name is the motivation for imaginary elements.

An imaginary element is an equivalence class [a⃗]_E where E is a definable equivalence relation. The imaginary extension Meq of M is a richer multi-sorted structure that adds, for each definable equivalence relation E on each Cartesian power Mn, a new sort whose elements are the E-classes of n-tuples. The original elements of M are called real elements and form one of the sorts of Meq. There is also a canonical surjection from each sort of n-tuples onto the corresponding quotient sort, which is itself definable in Meq.

Why bother? In many situations, the most natural "points" are not elements of the base structure but quotient objects. In the theory of algebraically closed fields, the coset space G/H (where H is a definable subgroup of a definable group G) is a natural object of study, but its elements are cosets, not field elements. By passing to Meq, these cosets become genuine elements and can be directly quantified over, named by parameters, and handled by the model-theoretic machinery (types, definability, independence). Without imaginaries, one must constantly work around this gap with awkward coding tricks.

The central technical result is that well-behaved theories (specifically, those that eliminate imaginaries) have the property that every imaginary element is interdefinable with a real tuple — the new sorts add no genuinely new information, and the quotient structure is already "visible" in the original model. Strongly minimal theories and algebraically closed fields eliminate imaginaries, which is a key reason these theories have such clean geometric structure (the subject of strongly minimal sets and their geometries). Theories that fail to eliminate imaginaries have definable structure that cannot be reduced to real elements, indicating a richer and more complex geometry of types.

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 TheoriesQuantifier Elimination and DecidabilityDefinability and Applications to Algebraic GeometryImaginary Elements and Quotient Sorts

Longest path: 93 steps · 566 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.