Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 B consist of the finite partial functions p:ω1⇀ω1 which are contained in some normal function h:ω1→ω1, ordered by reverse inclusion. Then B is proper. If G⊆B is generic, then F=⋃G is a normal function and its range is a new club subset of ω1.

Facts & Assumptions

Given: ZFC and the forcing B in the Statement. A normal function is strictly increasing and continuous at nonzero limit ordinals.

[F1]

An (M,P)-master condition is one below the starting condition for which every dense set in M has its M-part predense below it. Master conditions and proper posets

[F2]

Verifying the dense-set predensity condition for every relevant countable model proves properness. Master-condition characterizations

[F3]

A club subset of ω1 is closed and unbounded. The club filter and nonstationary ideal

[A1]

AC supplies the suitable elementary models, their enumerations, and the set-sized genericity choices used in the semantic example. The Axiom of Choice

Verification

1.1F1A1Given

Let M be a relevant countable elementary submodel, let p∈B∩M, and put δ=M∩ω1. Then M∩ω1 is an initial segment with no largest member, so δ is a countable limit ordinal. By elementarity choose in M a normal h:ω1→ω1 extending p. For every α<δ, both α and h(α) belong to M∩ω1, while h(α)≥α; hence sup⁡h‘‘δ=δ and continuity gives h(δ)=δ. Thus q=p∪{(δ,δ)} belongs to B and satisfies q≤p.

1.2A1Givenconstruct

For each α<ω1, the set Eα={p:α∈dom⁡(p)} is dense: extend a witness normal function for p and add its value at α. Directedness of G makes F=⋃G a function, and meeting all Eα makes it total. Given α<β, take two filter conditions specifying the two values and a common stronger condition; its normal extension shows F(α)<F(β).

2.1F1A1step 1.1

Fix r≤q. Any normal extension of r contains (δ,δ), so strict increase gives α<δ⟺r(α)<δ for every α∈dom⁡(r). Consequently s=r∩M is exactly the part of r whose coordinates and values lie below δ. It is a finite condition, belongs to M, and is extended by r. If D∈M is dense, elementarity supplies r′∈D∩M with r′≤s. Every coordinate and value of the finite r′ lies below δ.

2.2A1step 1.2

Let δ<ω1 be a nonzero limit and put γ=sup⁡F‘‘δ≤F(δ)=β. Suppose γ<β, and choose p∈G containing (δ,β). Below p, conditions which specify some (α,ρ) with α<δ and γ<ρ<β are dense. Indeed, from any s≤p, take a normal extension u; continuity at δ gives an α<δ, beyond the finite lower domain of s, with γ<u(α)<β, and add (α,u(α)). A generic containing p meets this dense-below-p set (equivalently, adjoin the conditions incompatible with p to make it globally dense), contradicting the definition of γ. Hence F(δ)=sup⁡F‘‘δ, and F is normal.

3.1F1F2A1step 1.1step 2.1

The conditions r and r′ are compatible. To verify the point suppressed by the usual proof, choose a normal u extending r. By elementarity choose a normal v∈M extending r′. Both satisfy u(δ)=v(δ)=δ: for u this follows from (δ,δ)∈r, and for v by the calculation in step 1.1. Splice v below and at δ with u 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 r∪r′, so that finite union is a common condition. Therefore D∩M is predense below q. By F1 and F2, q is an (M,B)-master below p, and B is proper.

3.2F3step 1.2step 2.2

The range C=F‘‘ω1 is unbounded because strict increase implies F(α)≥α. It is closed: if η<ω1 is a limit point of C, then ξ=sup⁡{α:F(α)<η} is a nonzero limit below ω1, and continuity and cofinality of the selected values give F(ξ)=η. Thus C is club by F3.

4.1A1step 1.2step 2.2step 3.2∎

Finally fix any ground-model normal function a:ω1→ω1. The set Ea={p∈B:(∃α∈dom⁡(p)) p(α)≠a(α)} is dense. Given p, choose a normal extension u, a successor α above its finite domain, and two successive values above u(α); at least one differs from a(α), and replacing the value at that new successor by the chosen larger value and continuing normally witnesses an extension in Ea. Genericity makes F≠a for every ground normal a. If C were in the ground model, its increasing enumeration would be a ground normal function and, as the unique increasing bijection from ω1 onto C, would equal F. This contradiction proves that the club C 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