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.
Hereditarily symmetric names have bounded layer support
Statement
Every hereditarily symmetric name in the Feferman–Levy system is fixed by for some . In particular, every real in the symmetric model has a name whose Boolean values are all fixed by one such .
Facts & Assumptions
Given: The Feferman–Levy system and a generic filter used only to interpret names.
The Feferman–Levy symmetric collapse system defines the normal filter as the upward closure of the descending family .
Forcing equivalence and Boolean completion permits passage to the regular-open completion without changing the generic extension or valuations. Its regular-open presentation also lets every order automorphism of act on by .
Symmetry lemma for forcing automorphisms transports the forcing relation under every member of the automorphism group.
Forcing theorem supplies the truth lemma for the fixed atomic membership formulas in the supplied generic.
Proof
Let be hereditarily symmetric. Its stabilizer belongs to . By the definition of the upward closure in F1, some is contained in . Thus every fixes . Notice that this selects one natural number for one given name; it does not choose supports simultaneously for a family.
Now let belong to , and choose one hereditarily symmetric name with value in the supplied generic. By step 1.1 fix such that fixes . In the complete Boolean algebra from F2 put for and form the Boolean name . By F4, the supplied Boolean generic contains exactly when . Hence . This proves equality of the two values in the fixed generic; it does not assert that an arbitrary name which happens to evaluate to a real is forced to be a real in every generic.
Make the Boolean action explicit. In the regular-open presentation from F2, preserves arbitrary unions followed by regularization, intersections, and complements, and so is a complete Boolean automorphism extending . The truth value is the regular open generated by conditions forcing . If , then and ; F3 therefore maps that generating set to itself, whence . Hence fixes the displayed Boolean name and fixes each of its Boolean coefficients. Its only subnames are the canonical natural-number names, so is hereditarily symmetric. This is the asserted common bounded layer support.
Depends on
Used by
Dependency tree · two levels
16 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
- Thomas Jech, The Axiom of Choice, Theorem 10.6, real-name support paragraph, printed p. 143 (standard reference, not scraped)