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.
A bounded-name direct-extension fusion
Example
Let be a normal measure on , let , and suppose
Keeping the stem fixed, decide the membership questions one at a time for . At limit stages, intersect all earlier upper parts. The final intersection is still in because , and the resulting direct extension decides to equal one ground-model subset of .
For the finite sample , a possible decision trace produces the ground set and the final upper part .
Facts & Assumptions
Given: The forcing-theorem setting over a transitive ZFC ground, with as above.
The Prikry property: Every membership sentence has a deciding direct extension, so the next decision can be made without changing .
Prikry forcing adds no bounded subsets of kappa: A name forced to be a subset of is decided by a direct extension to equal a ground-model subset of .
Complete ultrafilters and measurable cardinals: The normal measure is -complete, so the intersection of fewer than members of remains in .
The Axiom of Choice: In the ZFC ground, a selector may be fixed for the nonempty sets of direct deciding extensions.
Verification
For every direct extension and every , let be the nonempty set of direct extensions of deciding “.” Nonemptiness is F1. Use F4 once to choose simultaneously for all such pairs.
Define for . Start with . Given , put . At a nonzero limit , put and . Since , F3 keeps in . Thus this is a direct-extension decreasing recursion, and decides the th membership question.
Put and . The family has cardinality below , so F3 gives and for every . Define For each , the stronger condition preserves the decision of ; hence it forces membership exactly for the ordinals in . Together with and , extensionality gives , the conclusion in F2.
When , the recursion has . If their three successive decisions are “,” “,” and “,” then the defining calculation in step 3.1 gives and . For , there are no decisions, , and the one-factor intersection returns ; for , there is exactly one deciding direct extension.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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.