Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Proper forcing preserves stationary subsets of omega-one

Statement

In ZFC, every proper forcing preserves every ground-model stationary subset of ω1. In particular, proper forcing preserves ω1.

Facts & Assumptions

Given: A proper forcing P, a stationary Sω1 in the ground model, a condition pP, and a name C˙ forced by p to be club in ω1.

[F1]

Master genericity is equivalent to forcing every ordinal-valued name in M to have value in M. Master-condition characterizations

[F2]

Clubs are closed and unbounded, and stationarity means meeting every club. The club filter and nonstationary ideal

[F3]

The forcing theorem supplies names, decision, and truth in the generic extension. Forcing theorem

[A1]

AC supplies ambient well-orders, Skolem functions, and the normal enumeration of a named club. The Axiom of Choice

Proof

1.1

Choose a sufficiently large well-ordered Hθ structure containing P,p,S,C˙, and fix Skolem functions for it. We first derive the elementary-model trace fact needed here. For β<ω1, let Mβ be the Skolem hull of β{P,p,S,C˙} and put f(β)=sup(Mβω1)+1<ω1. The set E of nonzero limit ordinals δ<ω1 closed under f is club. If δE, finite character of Skolem terms gives Mδ=β<δMβ, so Mδω1=δ. By stationarity choose δSE and set M=Mδ. Then M is countable elementary, contains all the required parameters, and has trace Mω1=δ. Properness supplies an (M,P)-master qp.

F1F2A1Given
2.1

In M choose a name f˙ which p forces to be the increasing continuous enumeration of C˙. For every α<δ, one has αM and hence the ordinal name f˙(αˇ) belongs to M. By F1, q forces its value into Mω1=δ. Thus q forces f˙δδ. Since an increasing enumeration satisfies f˙(α)α, its first δ values are cofinal in δ; closure of C˙ then gives qδC˙. As δS is a ground ordinal, qC˙Sˇ.

F1F2F3A1step 1.1
3.1

The choices of p and the club name were arbitrary, so no condition can force a ground stationary S to become nonstationary. To see preservation of ω1 without a hidden cofinality inference, let p force that g˙:ωω1V is any function, choose a relevant countable model M containing p,g˙, and use properness to choose an (M,P)-master qp. F1 then forces each g˙(n) into the fixed countable ordinal Mω1, so the range is bounded and g˙ is not cofinal, hence not surjective. Therefore ω1V remains uncountable and equals the extension's ω1. AC is used exactly in A1.

F1F3A1step 2.1

Depends on

Used by

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