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

Finite-support symmetry and bounded-stage approximation

Statement

Let τ⃗ be hereditarily symmetric names with a common finite cf⁡′-closed support e. For every formula φ in the pure membership language,

p⊩3φ(τ⃗)⟹p↾e⊩3φ(τ⃗).

Consequently, every x∈NG has a finite support and lies in some set-sized supported stage NGθ. More sharply, if x is a set of ordinals with a name supported by e, then x has a canonical name using only the finite coordinate restriction Pe, so x∈M[G↾e].

The restriction assertion is intentionally for the pure membership language. It is not asserted for formulas mentioning the expanded predicate for the full generic class.

Facts & Assumptions

Given: The Gitik symmetric system and names/support as in the statement.

[F1]

Gitik's finite-support symmetric submodel: Finite coordinate stabilizers act on the completion, define hereditary symmetry, and every symmetric value lies in some complete set-stage interpretation.

[F2]

Symmetry lemma for forcing automorphisms: For pure forcing, p⊩φ(τ⃗) iff πp⊩φ(πτ⃗).

[F3]

Restriction, amalgamation, and the set-sized Prikry property: Restrictions, finite support extensions, trunk cones and common-trunk intersections preserve conditions and give amalgamation.

[F4]

The forcing theorem for Gitik's expanded proper-class language: The class forcing relation is definable and satisfies truth; its pure membership fragment agrees with the eventual set-stage relation.

Proof

1.1F1F3F4

Suppose p⊩3φ(τ⃗) but p↾e does not force it. By the negation clause there is q≤p↾e with q⊩3¬φ(τ⃗). Because the trunk of q lies in its upper tree and that tree projects into the upper tree of p↾e, lift the trunk q↾e to a node of the upper tree of p and pass to its cone. This gives p∗≤p with p∗↾e=q↾e. Use finite support extension and legal successor steps to obtain p1≤p∗ and q1≤q on the same finite closed coordinate domain, with equal corresponding section lengths and still p1↾e=q1↾e. For each coordinate outside e, the finite bijection sending p1(α)(n) to q1(α)(n) extends to a finite permutation πα of α; take the identity on e, obtaining π∈He. Shrink the upper tree U1 of p1 so that no value newly appearing outside e lies in the finite range of q1 at that coordinate, and shrink the upper tree V1 of q1 symmetrically away from the range of p1. The coordinate filters are uniform and hence contain complements of finite sets, so these are direct refinements; by construction (p1,U1′) lies in the dense action domain Pπ. Finally intersect πU1′ with V1′ above their common trunk πp1=q1. F3 makes this a condition q′≤q1; its inverse image p′=π−1q′ refines p1, and πp′=q′.

2.1F1F2step 1.1

Since He fixes every name in τ⃗, F2 sends p′⊩3φ(τ⃗) to πp′⊩3φ(τ⃗). But q′⊩3¬φ(τ⃗), and a common refinement of πp′ and q′ would force both alternatives. This contradiction proves the restriction implication. The empty support and identity permutation are allowed, and zero parameters cause no change.

3.1F3F4step 2.1

Let x˙ be supported by e and suppose x˙G⊆γ for a ground ordinal γ. By the truth lemma choose p0∈G with p0⊩3x˙⊆γˇ. Define the set Pe-name x˙e={(αˇ,p↾e):α<γ, p≤p0, p⊩3αˇ∈x˙}. This is a set because γ and the finite-coordinate forcing Pe are sets. Step 2.1 says every displayed restriction forces the same membership. If α∈(x˙e)G↾e, truth gives α∈x˙G; conversely, if α∈x˙G, truth below the chosen p0∈G gives p∈G with p≤p0 forcing membership, and p↾e∈G↾e places α in (x˙e)G↾e. Thus the two values agree.

4.1F1step 3.1∎

Every x∈NG is the value of an HS name, which by definition has some finite support; closing it under cf⁡′ remains finite. F1 bounds the transitive closure of that set name in a regular Pθ and preserves hereditary symmetry there, giving x∈NGθ. For a set of ordinals, choose γ>sup⁡x and apply step 3.1 to obtain the sharper finite-restriction name. No converse from mere membership in M[G↾e] to symmetry is claimed.

Depends on

Used by

Dependency tree · two levels

15 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