Löwenheim–Skolem Theorem (downward)
Statement
Let be a countable language and an infinite -structure. Then has a countable elementary substructure , i.e. there is with and countably infinite.
Why is it true?
This shows first-order logic cannot pin down cardinality: any theory with an infinite model (e.g. the axioms of a field, of set theory, ...) already has a countable model, no matter how "big" the original model was built to be. Combined with the upward version (any infinite model has elementary extensions of every larger cardinality), this is the source of Skolem's Paradox — a countable structure can satisfy the same first-order sentences as an uncountable one, including sentences that "assert" uncountability from the inside.
Proof sketch
We build as the union of a countable increasing chain of countable subsets of , using the Tarski–Vaught test: a subset (as a substructure) is elementary iff for every -formula and every tuple from , if there is some with , then there is already such a witness .
Since is countable, there are only countably many formulas . Start with any countably infinite (possible since is infinite). Given a countable , for each formula and each tuple from (still only countably many pairs, since is countable and is countable), if , choose one such witness (using the Axiom of Choice) and add it to form ; this adds only countably many new elements, so stays countable.
Let ; a countable union of countable sets, so is countable (and infinite, since ). We check the Tarski–Vaught test for : given and from , since is a finite tuple it lies entirely in some single (the chain is increasing); if a witness exists for , then by construction of , a witness was already chosen and placed into .
By the Tarski–Vaught test, (with the induced -structure ) satisfies . Elementary substructures satisfy exactly the same sentences as the ambient structure, so is a countably infinite model witnessing the theorem.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Katrin Tent, Martin Ziegler (2012). A Course in Model Theory
- Lou van den Dries (1998). Tame Topology and O-minimal Structures
- Jonathan Pila, Alex J. Wilkie (2006). The rational points of a definable set