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 . In particular, proper forcing preserves .
Facts & Assumptions
Given: A proper forcing , a stationary in the ground model, a condition , and a name forced by to be club in .
Master genericity is equivalent to forcing every ordinal-valued name in to have value in . Master-condition characterizations
Clubs are closed and unbounded, and stationarity means meeting every club. The club filter and nonstationary ideal
The forcing theorem supplies names, decision, and truth in the generic extension. Forcing theorem
AC supplies ambient well-orders, Skolem functions, and the normal enumeration of a named club. The Axiom of Choice
Proof
Choose a sufficiently large well-ordered structure containing , and fix Skolem functions for it. We first derive the elementary-model trace fact needed here. For , let be the Skolem hull of and put The set of nonzero limit ordinals closed under is club. If , finite character of Skolem terms gives , so . By stationarity choose and set . Then is countable elementary, contains all the required parameters, and has trace . Properness supplies an -master .
In choose a name which forces to be the increasing continuous enumeration of . For every , one has and hence the ordinal name belongs to . By F1, forces its value into . Thus forces . Since an increasing enumeration satisfies , its first values are cofinal in ; closure of then gives . As is a ground ordinal, .
The choices of and the club name were arbitrary, so no condition can force a ground stationary to become nonstationary. To see preservation of without a hidden cofinality inference, let force that is any function, choose a relevant countable model containing , and use properness to choose an -master . F1 then forces each into the fixed countable ordinal , so the range is bounded and is not cofinal, hence not surjective. Therefore remains uncountable and equals the extension's . AC is used exactly in A1.
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
- Karagila, Forcing & Symmetric Extensions, Theorems 8.8-8.9 and complete proofs, printed pp. 39-40 (standard reference, not scraped)