Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Symmetry lemma for forcing automorphisms

Statement

For every forcing automorphism π and formula φ, the ordinary forcing relation satisfies p⊩φ(τ⃗) iff πp⊩φ(πτ⃗) for every tuple of P-names. In a symmetric system with automorphism group G, if π∈G and the parameter names τ⃗ are hereditarily symmetric, then πτ⃗ are hereditarily symmetric and the same ordinary-forcing equivalence applies to these tuples. No separate forcing relation with existential quantifiers restricted to HS names is asserted.

Facts & Assumptions

Given: A forcing automorphism π for the ordinary relation; for the assertion about HS parameter tuples, a symmetric system, π∈G, and HS names τ⃗.

[F1]

Automorphisms acting on forcing names defines the action of an arbitrary forcing automorphism on all P-names, its inverse action, and preservation of name rank, order and compatibility.

[F2]

Atomic forcing relation defines the atomic forcing clauses with the library's name-first pair convention.

[F3]

Forcing relation for all formulas defines the recursive clauses for compound formulas.

[F4]

Symmetric forcing systems, supports, and hereditarily symmetric names gives π‘‘HS=HS when π∈G in the stated symmetric system.

Proof

1.1F1F2

Simultaneously induct on the ranks of σ,τ. In the atomic membership and equality clauses, q≤p iff πq≤πp, compatible extensions correspond under π, and subnames correspond rank-preservingly. Therefore p⊩σ∈τ iff πp⊩πσ∈πτ, and likewise for equality.

2.1F1F3step 1.1

Induct on formula complexity. Boolean clauses commute with the bijection of conditions. For an existential, F1 maps the class of all P-names bijectively to itself, so witnesses correspond; applying the inverse automorphism from F1 gives the reverse implication. This is a syntactic induction on the stated forcing clauses; no semantic-generic existence hypothesis is used.

3.1F3F4step 2.1∎

Now assume π∈G and τ⃗∈HS. F4 makes πτ⃗ an HS tuple. Apply the already-proved ordinary forcing equivalence of step 2.1 to these parameter tuples; its existential name quantifier still ranges over all P-names, exactly as F3 specifies. This proves the asserted parameter-preserving specialization and makes no claim about an unintroduced HS-restricted forcing relation.

Depends on

Dependency tree · 2 levels

Sources