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.
Symmetric and hereditarily symmetric sets
Definition
A ZFA atom is a hereditarily -symmetric base case: its singleton stabilizer belongs to the normal filter by Permutation groups, stabilizers, supports, and normal filters. For an atom put . For a set define the membership-descendant closure by rank recursion,
A set is hereditarily -symmetric when every object in is -symmetric. Rank induction on the displayed recursion proves equivalently that is symmetric and every is hereditarily symmetric, using the atom base case when is an atom. On pure sets this closure agrees with Transitive closure of a set. Write for all hereditarily symmetric objects, with inherited membership and the original atoms. If , the recursive clause gives , so this permutation subuniverse is transitive. Symmetry alone is insufficient: a symmetric set can contain a nonsymmetric member.
Depends on
Used by
Dependency tree · two levels
6 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
- Jech, The Axiom of Choice, §4.2, pp. 46–47 (standard reference, not scraped)