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 more→→Extension 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 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 → Model Instantiation and Structure Realization → Embeddings and Preservation of Formulas → Existential Closure Under Homomorphisms

Longest path: 87 steps · 436 total prerequisite topics

Prerequisites (3)

Leads To (1)