Elementary Substructures and the Lowenheim-Skolem Theorems
A substructure that agrees with its parent on every formula, not just on the atomic ones. The Tarski–Vaught test makes the condition checkable, and Löwenheim–Skolem makes such substructures plentiful.
Engineering · Mathematics11 min readKV-MATH-0249
Learning objectives
Distinguish a substructure from an elementary substructure.
State and apply the Tarski–Vaught test.
State the downward and upward Löwenheim–Skolem theorems.
Construct elementary substructures of prescribed cardinality.
Explain the Skolem paradox and its resolution.
Recognise elementary chains and their unions.
01Elementary substructure
B is a substructure of A when B ⊆ A is closed under the operations with relations restricted. B is an elementary substructure when A and B agree on every formula evaluated at elements of B.
B ≺ A ⟺ B ⊆ A and for every formula φ and every b⃗ ∈ B: B ⊨ φ[b⃗] ⟺ A ⊨ φ[b⃗]
Substructure requires agreement on atomic formulas only. Elementary substructure requires it for all formulas, including quantified ones.
CautionSubstructure and elementary substructure are far apart
The even integers form a substructure of the integers under addition. They are not an elementary substructure: the formula ∃y (y + y ≈ x) is satisfied by every element of the even integers within the even integers only when the witness is also even, and the two structures disagree on which elements are doubles. Quantifiers see the difference; atomic formulas do not.
The difficulty is that quantifiers range over the whole structure. A quantified formula true in A may need a witness lying outside B, so B can fail to reproduce A's verdict even while agreeing on everything atomic.
02The Tarski–Vaught test
Checking every formula is impossible directly. The test reduces the condition to existential formulas with a single quantifier.
ProcedureThe Tarski–Vaught test
in: A, B ⊆ A → out: whether B ≺ A
input: structure A and a substructure B ⊆ A
condition to check:
for every formula φ(x, y⃗) and every b⃗ ∈ B,
if A ⊨ ∃x φ(x, b⃗) then there is some b ∈ B with A ⊨ φ(b, b⃗)
in words: every existential statement about parameters from B that holds in A
already has a witness inside B
if the condition holds, then B ≺ A
proof: induction on formula complexity; the only hard case is ∃, handled
exactly by the hypothesis
Correctness: induction on formulas, with negation and conjunction immediate and the existential case supplied by the hypothesis. Universal quantifiers are handled by rewriting ∀ as ¬∃¬. Caveat: B must already be a substructure — closure under the operations is assumed, not implied.
The test is what makes elementary substructures constructible. It says one need only close a set under witnesses for existential formulas, which is a finitary closure operation and therefore terminates in a set of controlled size.
03Downward Löwenheim–Skolem
Key resultThe downward theorem
If A is a structure for a language L and X ⊆ A, then A has an elementary substructure B with X ⊆ B and |B| ≤ max(|X|, |L|, ℵ₀). In particular every structure in a countable language has a countable elementary substructure.
Start with the seed set
Take X, the elements one wishes to retain.
Close under Skolem witnesses
For each formula ∃x φ(x, b⃗) with parameters from the current set that holds in A, add one witness. This requires choice.
Iterate ω times
Each round adds at most max(|current|, |L|, ℵ₀) elements, and ω rounds keep the bound.
Apply Tarski–Vaught
The limit set satisfies the test by construction, so it is an elementary substructure.
The construction is the finitary closure argument from Chapter I applied to formulas rather than operations, which is why the cardinality bound comes out as it does — formulas are finite, so each round adds boundedly many elements.
04Upward Löwenheim–Skolem
The upward direction produces larger models rather than smaller substructures, and it is a corollary of compactness.
ProcedureBuilding arbitrarily large elementary extensions
in: infinite A, cardinal κ → out: elementary extension of size ≥ κ
input: infinite structure A, cardinal κ ≥ max(|A|, |L|)
expand the language by κ new constant symbols c_i
form the theory T := Th(A with names for all its elements)
∪ { c_i ≉ c_j : i ≠ j }
every FINITE subset of T is satisfiable in A itself
(finitely many new constants can be interpreted as distinct elements,
since A is infinite)
by compactness T has a model B of size at least κ
the interpretation of the original names embeds A elementarily into B
output: B ≻ A with |B| ≥ κ
Compactness is doing all the work, and compactness rests on BPI. Caveat: the hypothesis that A is infinite is essential — a finite structure has no proper elementary extension.
Combining the two directions: any theory with an infinite model has models of every infinite cardinality at least the size of the language. Cardinality is entirely invisible to first-order logic above that threshold.
05The Skolem paradox
Zermelo–Fraenkel set theory, if consistent, has a countable model — yet ZF proves the existence of uncountable sets. The apparent contradiction is the Skolem paradox.
Inside the model
The set is uncountable
The model contains a set x and satisfies 'x is uncountable', meaning no bijection between x and ω exists within the model.
Outside the model
Everything is countable
From the ambient metatheory the model is countable, so x has countably many elements and a bijection with ω exists — but that bijection is not an element of the model.
Key resultThe resolution
Uncountability is not absolute. It is a statement about the non-existence of a bijection, and whether such a bijection exists depends on which sets the model contains. The paradox dissolves once one distinguishes satisfaction within a model from truth in the metatheory — the same distinction Tarski's definition makes precise.
06Elementary chains
A chain of structures each an elementary substructure of the next has a union that is an elementary extension of every member.
A₀ ≺ A₁ ≺ A₂ ≺ ⋯ ⟹ Ai ≺ ⋃n An for every i
The Tarski elementary chain theorem. Proved by induction on formulas, using that every formula mentions finitely many elements, all of which appear at some finite stage.
This is the standard device for constructing models with prescribed properties: build a chain handling one requirement at a time, then take the union. It is the model-theoretic counterpart of the ascending-union argument used for generated subuniverses in Chapter II, and it works for the same reason — formulas, like terms, are finite.
Frequently asked
Does the downward theorem need the axiom of choice?
Yes — selecting a witness for each existential formula is a choice. The theorem is not provable in ZF alone. The upward direction needs compactness, hence BPI, which is weaker.
Can a finite structure have a proper elementary extension?
No. A finite structure satisfies a sentence asserting exactly n elements exist, and any elementary extension must satisfy the same sentence, so it has exactly n elements too. Elementary extensions of finite structures are isomorphic to them.
Is every substructure of a countable elementary substructure elementary?
No — elementarity is not inherited by further substructures. B ≺ A and C ⊆ B gives no information about whether C ≺ B. The Tarski–Vaught test must be verified at each level, which is why elementary chains are constructed deliberately rather than found.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Elementary Substructures and the Lowenheim-Skolem Theorems. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Elementary Substructures and the Lowenheim-Skolem Theorems as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—skolem, elementary, löwenheim, paradox, substructures—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Elementary Substructures and the Lowenheim-Skolem Theorems?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about skolem would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
