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.
The Axiom of Foundation:
Definition
The Axiom of Foundation, also called the Axiom of Regularity, is the sentence
of the language of set theory (The first-order language of set theory: , , formulas with parameters, and class abbreviations): every set with at least one member has a member that shares no member with it.
It is written here without abbreviations, for the same reason as The Axiom of Infinity: there is a set containing a set with no elements and closed under : the usual statement uses notation introduced later on this page. In that notation it reads: every nonempty set has a member with . Such an is called an -minimal member of .
Remarks
-
What it rules out. A set that had no -minimal member would let one descend forever through membership. The axiom forbids that, and Under Foundation, for every set , there are no sets with , and there are no sets with draws the consequences that this page needs: no set is a member of itself, and there is no membership cycle of length two or three.
-
It is used nowhere else on this page. Every other construction below is carried out without it; the ledger at The axiom ledger for this page: which of the ZFC axioms each construction and each result actually consumes records exactly which results depend on it.
Depends on
Used by
- Ordinal (von Neumann) Definition
- The set of first-order ZF axiom sentences Definition
- The axiom ledger for this page: which of the ZFC axioms each construction and each result actually consumes Remark
- Under Foundation, x ∉ x for every set x, there are no sets with x ∈ y ∈ x, and there are no sets with x ∈ y ∈ z ∈ x Theorem
Dependency tree · one level
1 result within one dependency step 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
- B. Kaya, MATH 320 Set Theory (METU), Axiom 8 (standard reference, not scraped)
- Axiom of regularity (Wikipedia) (standard reference, not scraped)
- Zermelo-Fraenkel set theory (Wikipedia) (standard reference, not scraped)