Consider the set A = {x} where x is some set. The axiom of regularity requires A to contain an ∈-minimal element m such that m ∩ A = ∅. If m = x, what does this force about x?
AIt forces x to be the empty set
BIt forces x ∉ x, ruling out self-membership
CIt forces x to have no elements at all
DIt forces x ∩ x = x, which is a tautology and imposes no constraint
The ∈-minimal element of {x} is x itself. For x to be ∈-minimal in {x}, we need x ∩ {x} = ∅ — that is, x shares no members with {x}. But {x} contains only x, so this requires x ∉ x. This is exactly how regularity rules out self-membership: if x ∈ x were true, then x ∩ {x} would contain x, making {x} a non-empty set with no ∈-minimal element, violating regularity. The axiom does not require x to be empty — x can be any set, as long as it doesn't contain itself.
Question 2 Multiple Choice
If the axiom of regularity were removed from ZFC, which of the following would become consistent within the resulting theory?
ASets with more elements than any ordinal — actual proper classes treated as sets
BSets that are members of themselves, such as x = {x}
CSets with uncountably many elements, contradicting Cantor's theorem
DThe empty set having members, violating the axiom of extensionality
Removing regularity makes self-membered sets like x = {x} consistent — this is precisely what Aczel's Anti-Foundation Axiom (AFA) exploits to model circular data structures. Regularity is a restriction on the membership relation ∈ only, and dropping it doesn't affect cardinality results (Cantor's theorem follows from other axioms), the empty set (axiom of extensionality), or the proper-class/set distinction. Non-well-founded set theory has genuine applications in computer science for modeling coinductive processes.
Question 3 True / False
The axiom of regularity is independent of the other ZFC axioms — dropping it yields a consistent theory (ZFC without foundation).
TTrue
FFalse
Answer: True
True. Independence means regularity can neither be proved nor disproved from the other ZFC axioms. This was established by showing: (1) the 'well-founded sets' (those satisfying regularity) form a model of all ZFC axioms including regularity, and (2) non-well-founded sets can be added consistently. Since ordinary mathematics lives entirely within well-founded sets, regularity has no effect on normal mathematical practice — it is extra scaffolding that cleans up the theory of ordinals and ranks without constraining anything mathematicians actually do.
Question 4 True / False
The axiom of regularity prevents self-referential reasoning in mathematics — for example, it rules out circular definitions and self-referential proofs.
TTrue
FFalse
Answer: False
False. Regularity is a structural axiom about the membership relation ∈ only. It rules out sets that contain themselves as members (x ∈ x) or infinite descending membership chains. It says nothing about how we reason, define functions, or write proofs. Self-referential constructions in logic (like Gödel numbering) and circular definitions in programming (like recursive types) are unaffected by regularity. The axiom constrains the universe of sets, not the language or methods of mathematics.
Question 5 Short Answer
What is the cumulative hierarchy V, and what role does the axiom of regularity play in ensuring every set has a rank within it?
Think about your answer, then reveal below.
Model answer: The cumulative hierarchy V = ∪_α V_α is built by stages: V₀ = ∅, V_{α+1} = P(V_α) (the power set), and at limit ordinals V_λ = ∪_{β<λ} V_β. The rank of a set x is the least ordinal α such that x ∈ V_{α+1}. Regularity guarantees that every set appears at some stage, because the well-foundedness of ∈ (which regularity implies) ensures there are no infinite descending membership chains that would allow a set to 'escape' the hierarchy. Without regularity, self-membered sets or infinite descent could exist outside any V_α.
The cumulative hierarchy gives every set a birthday: when it first appears as an element of some V_{α+1}. This makes the universe of sets highly structured and navigable. The natural numbers (as von Neumann ordinals) live at stage ω; sets of natural numbers live at ω+1; and so on. Regularity is what ensures this stratification is exhaustive — every set sits somewhere in V. This is the foundation for rank-based induction and the clean theory of ordinals.