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

Existential Closure Under Homomorphisms

Graduate Depth 86 in the knowledge graph I know this Set as goal
4topics build on this
436prerequisites beneath it
See this on the map →
Diagram and Expansion by ConstantsEmbeddings and Preservation of Formulas+1 moreExtension Lemma for Embeddings
existential closure preservation homomorphism

Core Idea

If f: M → N is a homomorphism and φ(x) is an existential formula satisfied by some a in M, then φ(f(a)) is satisfied in N. This is the key property allowing us to push existential properties forward through homomorphisms, and it justifies why embeddings (injective homomorphisms reflecting existentials) are natural in model theory.

Explainer

You already know that a homomorphism f: M → N between structures in the same language preserves atomic formulas: if M ⊨ R(a₁, …, aₙ), then N ⊨ R(f(a₁), …, f(aₙ)). Existential closure under homomorphisms extends this one step: homomorphisms also preserve existential formulas — formulas of the form ∃x₁ … ∃xₙ φ(x₁, …, xₙ, y) where φ is quantifier-free. The key insight is that an existential claim says "there exists something witnessing this property." If witnesses exist in M, their images under f exist in N and satisfy the same atomic conditions, because f preserves atomic truth.

To see why this works, trace through the logic. Suppose M ⊨ ∃x φ(x, a), witnessed by some element b ∈ M with M ⊨ φ(b, a). The formula φ is built from atoms using conjunctions, disjunctions, and negations — but not universal quantifiers. Since f preserves each atomic statement about b and a, and since existential-free Boolean combinations of preserved atomic facts remain preserved, we get N ⊨ φ(f(b), f(a)). Since f(b) exists in N, we get N ⊨ ∃x φ(x, f(a)). The existential witness is simply the image of the original witness.

Crucially, homomorphisms do *not* in general preserve universal formulas or negated atomic formulas. A homomorphism can collapse distinct elements (two elements of M may map to the same element of N), which can destroy universal claims and make false atoms true. For example, if M models "¬R(a,b)" and f(a) = f(b) in N, then N might model R(f(a), f(b)) anyway. This asymmetry explains why embeddings — injective homomorphisms — are more powerful: they reflect as well as preserve atomic facts, and thus preserve and reflect all quantifier-free formulas.

This property is not merely an abstract curiosity. It is the foundation for the diagram technique in model theory: the diagram of a structure M records all atomic facts about its elements, and the existence of a homomorphism from the diagram into N precisely corresponds to satisfying the existential consequences of M's theory. From your prerequisite work on diagram expansion, you know that adding constant symbols for each element of M allows you to state these facts as sentences — and a model of those sentences gives you a homomorphic image of M inside N. Existential closure under homomorphisms is what makes this technique work.

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 SatisfactionModel Instantiation and Structure RealizationEmbeddings and Preservation of FormulasExistential Closure Under Homomorphisms

Longest path: 87 steps · 436 total prerequisite topics

Prerequisites (3)

Leads To (1)