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.
V equals L implies diamond
Statement
ZF proves that implies on . Thus for every , the set of correct guesses is stationary, not merely unbounded.
Facts & Assumptions
Given: Ambient ZF together with . Clubs and stationarity are the notions on in the cited definitions.
Finite-stage L histories and weak limit-level absoluteness supplies a formula defining the actual canonical order and agreeing with its restriction in every nonzero limit -level; the stage-by-stage order makes each an initial segment.
The canonical definable global well-order of L says that well-orders all of by least definition codes.
Canonical L-hulls are elementary and small supplies a canonical countably infinite elementary hull of a finite seed in a nonzero limit -level, without ambient Choice.
Condensation for constructible levels identifies the transitive collapse of such a hull with an actual .
What the collapse fixes gives when that intersection is transitive, and fixes transitive parts pointwise.
Transfinite recursion realizes the deterministic recursive guessing rule.
Diamond on ω1, Closed unbounded subsets of ordinals, and The club filter and nonstationary ideal give the required subset, club, and stationary clauses.
Proof
Define by F6. Having defined the earlier guesses, call bad at when , is club in , and for every . If a bad pair exists, take the -least ordered pair and set ; otherwise set . F2 makes the choice unique and F1 makes this one fixed first-order recursion; , and always .
Assume for contradiction that this sequence is not diamond. By F7 there are and a club such that for every . Among all such global failure pairs choose the -least , possible because and F2 well-orders .
Choose a nonzero limit such that contains . Because is a -initial segment and the badness predicate has only bounded quantifiers once these parameters are fixed, it sees that is the least failure pair. Let be the canonical hull of this finite seed. F3 gives and makes countably infinite. Put . Elementarity makes an ordinal, hence transitive, and countability gives . For every , elementarity applied to the unbounded set produces above ; hence is unbounded in . It follows that is a nonzero countable limit, and closure of gives .
Collapse by to using F4. By F5, . Since every lies in , evaluation of the function puts ; as , F5 fixes it. The collapse equations therefore give , , and .
By elementarity and isomorphism, regards as its -least failure pair for the sequence on its first uncountable ordinal . The predicates “subset of ,” “club in ,” and “fails at every member” are bounded here and are absolute between the transitive and the universe for these fixed parameters. F1 says that and the universe use the same -order on , and that is an initial segment of that order. Therefore no ambient bad pair at can precede : any preceding pair would belong to and contradict internal leastness. Thus step 1.1 sets .
But step 3.1 gives , while step 2.1 says at every member of . This contradicts step 5.1. Hence the sequence is diamond, and its correct-guess set meets every club for every target subset of .
Depends on
- Finite-stage L histories and weak limit-level absoluteness
- Canonical L-hulls are elementary and small
- Condensation for constructible levels
- What the collapse fixes
- The canonical definable global well-order of L
- Transfinite recursion
- Diamond on ω1
- Closed unbounded subsets of ordinals
- The club filter and nonstationary ideal
Used by
- V equals L gives a Suslin tree Corollary
Dependency tree · two levels
35 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
- Lietz, Set Theory, Theorem 7.20 and Proposition 7.21, pp.60–61 (standard reference, not scraped)
- Kunen, Set Theory, Chapter VI Theorem 5.2, pp.177–179 (standard reference, not scraped)