Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Hereditarily symmetric names have bounded layer support

Statement

Every hereditarily symmetric name in the Feferman–Levy system is fixed by Hm for some m<ω. In particular, every real in the symmetric model N has a name whose Boolean values are all fixed by one such Hm.

Facts & Assumptions

Given: The Feferman–Levy system and a generic filter used only to interpret names.

[F1]

The Feferman–Levy symmetric collapse system defines the normal filter as the upward closure of the descending family (Hm)m<ω.

[F2]

Forcing equivalence and Boolean completion permits passage to the regular-open completion B=RO(P) without changing the generic extension or valuations. Its regular-open presentation also lets every order automorphism π of P act on B by UπU.

[F3]

Symmetry lemma for forcing automorphisms transports the forcing relation under every member of the automorphism group.

[F4]

Forcing theorem supplies the truth lemma for the fixed atomic membership formulas in the supplied generic.

Proof

technique · direct support extraction followed by Boolean nice-name replacement
1.1

Let x˙ be hereditarily symmetric. Its stabilizer belongs to F. By the definition of the upward closure in F1, some Hm is contained in sym(x˙). Thus every πHm fixes x˙. Notice that this selects one natural number for one given name; it does not choose supports simultaneously for a family.

F1
2.1

Now let xω belong to N, and choose one hereditarily symmetric name x˙ with value x in the supplied generic. By step 1.1 fix m such that Hm fixes x˙. In the complete Boolean algebra B from F2 put bk=kˇx˙B for k<ω and form the Boolean name y˙={kˇ,bk:k<ω}. By F4, the supplied Boolean generic contains bk exactly when kx˙G=x. Hence y˙G={k:bkG}=x. 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.

F2F4step 1.1
3.1

Make the Boolean action explicit. In the regular-open presentation from F2, π^(U)=πU preserves arbitrary unions followed by regularization, intersections, and complements, and so is a complete Boolean automorphism extending pπp. The truth value bk is the regular open generated by conditions forcing kˇx˙. If πHm, then πkˇ=kˇ and πx˙=x˙; F3 therefore maps that generating set to itself, whence π^(bk)=bk. Hence Hm fixes the displayed Boolean name y˙ and fixes each of its Boolean coefficients. Its only subnames are the canonical natural-number names, so y˙ is hereditarily symmetric. This is the asserted common bounded layer support.

F2F3step 2.1

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