Condensation lemma

In set theory, a branch of mathematics, the condensation lemma is a result about sets in the constructible universe.

It states that if X is a transitive set and is an elementary submodel of some level of the constructible hierarchy L_α, that is, ${\displaystyle (X,\in )\prec (L_{\alpha },\in )}$, then in fact there is some ordinal ${\displaystyle \beta \leq \alpha }$ such that ${\displaystyle X=L_{\beta }}$.

More can be said: If X is not transitive, then its transitive collapse is equal to some ${\displaystyle L_{\beta }}$, and the hypothesis of elementarity can be weakened to elementarity only for formulas which are ${\displaystyle \Sigma _{1}}$ in the Lévy hierarchy.^[1] Also, Devlin showed the assumption that X be transitive automatically holds when ${\displaystyle \alpha =\omega _{1}}$.^[2]

The lemma was formulated and proved by Kurt Gödel in his proof that the axiom of constructibility implies GCH.

References

Inline citations

• v
• t
• e

Mathematical logic

General

• Axiom
  • list
• Cardinality
• First-order logic
• Formal proof
• Formal semantics
• Foundations of mathematics
• Information theory
• Lemma
• Logical consequence
• Model
• Theorem
• Theory
• Type theory

Theorems (list)
 and paradoxes

• Gödel's completeness and incompleteness theorems
• Tarski's undefinability
• Banach–Tarski paradox
• Cantor's theorem, paradox and diagonal argument
• Compactness
• Halting problem
• Lindström's
• Löwenheim–Skolem
• Russell's paradox

Logics

Traditional	Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram
Propositional	Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞
Predicate	First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus

Set theory

Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities
Types of sets	Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Maps and cardinality	Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary
Set theories	Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive

Formal systems (list),
language and syntax

Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list

Example axiomatic systems (list)

of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica

Proof theory

• Formal proof
• Natural deduction
• Logical consequence
• Rule of inference
• Sequent calculus
• Theorem
• Systems
  • axiomatic
  • deductive
  • Hilbert
    • list
• Complete theory
• Independence (from ZFC)
• Proof of impossibility
• Ordinal analysis
• Reverse mathematics
• Self-verifying theories

Model theory

• Interpretation
  • function
  • of models
• Model
  • equivalence
  • finite
  • saturated
  • spectrum
  • submodel
• Non-standard model
  • of arithmetic
• Diagram
  • elementary
• Categorical theory
• Model complete theory
• Satisfiability
• Semantics of logic
• Strength
• Theories of truth
  • semantic
  • Tarski's
  • Kripke's
• T-schema
• Transfer principle
• Truth predicate
• Truth value
• Type
• Ultraproduct
• Validity

Computability theory

• Church encoding
• Church–Turing thesis
• Computably enumerable
• Computable function
• Computable set
• Decision problem
  • decidable
  • undecidable
  • P
  • NP
  • P versus NP problem
• Kolmogorov complexity
• Lambda calculus
• Primitive recursive function
• Recursion
• Recursive set
• Turing machine
• Type theory

Related

• Abstract logic
• Algebraic logic
• Automated theorem proving
• Category theory
• Concrete/Abstract category
• Category of sets
• History of logic
• History of mathematical logic
  • timeline
• Logicism
• Mathematical object
• Philosophy of mathematics
• Supertask

Mathematics portal

This set theory-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e