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 -closed support . For every formula in the pure membership language,
Consequently, every has a finite support and lies in some set-sized supported stage . More sharply, if is a set of ordinals with a name supported by , then has a canonical name using only the finite coordinate restriction , so .
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.
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.
Symmetry lemma for forcing automorphisms: For pure forcing, iff .
Restriction, amalgamation, and the set-sized Prikry property: Restrictions, finite support extensions, trunk cones and common-trunk intersections preserve conditions and give amalgamation.
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
Suppose but does not force it. By the negation clause there is with . Because the trunk of lies in its upper tree and that tree projects into the upper tree of , lift the trunk to a node of the upper tree of and pass to its cone. This gives with . Use finite support extension and legal successor steps to obtain and on the same finite closed coordinate domain, with equal corresponding section lengths and still . For each coordinate outside , the finite bijection sending to extends to a finite permutation of ; take the identity on , obtaining . Shrink the upper tree of so that no value newly appearing outside lies in the finite range of at that coordinate, and shrink the upper tree of symmetrically away from the range of . The coordinate filters are uniform and hence contain complements of finite sets, so these are direct refinements; by construction lies in the dense action domain . Finally intersect with above their common trunk . F3 makes this a condition ; its inverse image refines , and .
Since fixes every name in , F2 sends to . But , and a common refinement of and would force both alternatives. This contradiction proves the restriction implication. The empty support and identity permutation are allowed, and zero parameters cause no change.
Let be supported by and suppose for a ground ordinal . By the truth lemma choose with . Define the set -name . This is a set because and the finite-coordinate forcing are sets. Step 2.1 says every displayed restriction forces the same membership. If , truth gives ; conversely, if , truth below the chosen gives with forcing membership, and places in . Thus the two values agree.
Every is the value of an HS name, which by definition has some finite support; closing it under remains finite. F1 bounds the transitive closure of that set name in a regular and preserves hereditary symmetry there, giving . For a set of ordinals, choose and apply step 3.1 to obtain the sharper finite-restriction name. No converse from mere membership in 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
- Schürz, Gitik's model, Lemma 7, pages 9–10 (standard reference, not scraped)
- Dimitriou, Symmetric Models, Lemma 2.23 and its approximation consequence, pages 54–55 (standard reference, not scraped)