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 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 → Quantifier Elimination and Decidability → Definability and Applications to Algebraic Geometry → Imaginary Elements and Quotient Sorts

Longest path: 93 steps · 566 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.