How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Baumgartner's finite-condition generic club forcing is proper
Statement
Let consist of the finite partial functions which are contained in some normal function , ordered by reverse inclusion. Then is proper. If is generic, then is a normal function and its range is a new club subset of .
Facts & Assumptions
Given: ZFC and the forcing in the Statement. A normal function is strictly increasing and continuous at nonzero limit ordinals.
An -master condition is one below the starting condition for which every dense set in has its -part predense below it. Master conditions and proper posets
Verifying the dense-set predensity condition for every relevant countable model proves properness. Master-condition characterizations
A club subset of is closed and unbounded. The club filter and nonstationary ideal
AC supplies the suitable elementary models, their enumerations, and the set-sized genericity choices used in the semantic example. The Axiom of Choice
Verification
Let be a relevant countable elementary submodel, let , and put . Then is an initial segment with no largest member, so is a countable limit ordinal. By elementarity choose in a normal extending . For every , both and belong to , while ; hence and continuity gives . Thus belongs to and satisfies .
For each , the set is dense: extend a witness normal function for and add its value at . Directedness of makes a function, and meeting all makes it total. Given , take two filter conditions specifying the two values and a common stronger condition; its normal extension shows .
Fix . Any normal extension of contains , so strict increase gives for every . Consequently is exactly the part of whose coordinates and values lie below . It is a finite condition, belongs to , and is extended by . If is dense, elementarity supplies with . Every coordinate and value of the finite lies below .
Let be a nonzero limit and put . Suppose , and choose containing . Below , conditions which specify some with and are dense. Indeed, from any , take a normal extension ; continuity at gives an , beyond the finite lower domain of , with , and add . A generic containing meets this dense-below- set (equivalently, adjoin the conditions incompatible with to make it globally dense), contradicting the definition of . Hence , and is normal.
The conditions and are compatible. To verify the point suppressed by the usual proof, choose a normal extending . By elementarity choose a normal extending . Both satisfy : for this follows from , and for by the calculation in step 1.1. Splice below and at with above . The result is normal: both pieces agree at , their values on the lower piece are below , and replacing the lower piece by another sequence cofinal in does not change continuity at any later limit. It extends , so that finite union is a common condition. Therefore is predense below . By F1 and F2, is an -master below , and is proper.
The range is unbounded because strict increase implies . It is closed: if is a limit point of , then is a nonzero limit below , and continuity and cofinality of the selected values give . Thus is club by F3.
Finally fix any ground-model normal function . The set is dense. Given , choose a normal extension , a successor above its finite domain, and two successive values above ; at least one differs from , and replacing the value at that new successor by the chosen larger value and continuing normally witnesses an extension in . Genericity makes for every ground normal . If were in the ground model, its increasing enumeration would be a ground normal function and, as the unique increasing bijection from onto , would equal . This contradiction proves that the club is new. The forcing is nonempty (the empty map is greatest), and all finite, singleton, zero-coordinate, and limit-coordinate cases used above are included.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Karagila, Forcing & Symmetric Extensions, Theorem 8.13, printed pp.40-41 (standard reference, not scraped)