axiom of regularity

The axiom of regularity (also known as the axiom of foundation) is one of the axioms of Zermelo-Fraenkel set theory. In first-order logic the axiom reads:

\forall S (S\neq\emptyset \rightarrow

\exists a (a\in S \land a\cap S = \emptyset)). Or in prose:

Every non-empty set

S

contains an element

a

which is disjoint from

S

Two results which follow from the axiom are that "no set is an element of itself", and that "there is no infinite sequence (a_n) such that a_i+1 is an element of a_i for all i". With the axiom of choice, this result can be reversed: if there are no such infinite sequences, then the axiom of regularity is true. Hence the two statements are equivalent. The axiom of regularity is arguably the least useful ingredient of Zermelo-Fraenkel set theory, since virtually all results in the branches of mathematics based on set theory hold even in the absence of regularity. In addition to omitting the axiom of regularity, non-standard set theories have indeed postulated the existence of sets that are elements of themselves. See "Well-foundedness and hypersets" in the article Axiomatic set theory.

Proofs

Axiom of regularity implies that no set is an element of itself Let a be an element of itself. Then define B = {a}, which is a set by the pair axiom. Applying the axiom of foundation to B, we see that the only element of B, namely, a, must be disjoint from B. But by the definitions of a and B we see that they have an element in common (namely, a again). This is a contradiction, and hence no such a exists. Axiom of regularity implies that no infinite descending sequence of sets exists Let f be a function of the natural numbers with f(n+1) an element of f(n) for each n. Define S = {f(n): n a natural number}, the range of f, which can be seen to be a set from the formal definition of a function. Applying the axiom of regularity to S, let f(k) be an element of S which is disjoint from S. But by the definitions of f and S, f(k) and S have an element in common (namely f(k+1)). This is a contradiction, hence no such f exists. No infinite descending sequence of sets implies axiom of regularity Let the non-empty set S be a counter-example to the axiom of regularity, that is every element x of S has a non-empty intersection with S. Let g be a choice function for S, that is a map such that g(s) is an element of s for each non-empty subset s of S. Now define the function f on the non-negative integers recursively as follows:

f(0) = g(S)

f(n+1) = g(f(n) \cap S).

Then for each n, f(n) is an element of S and so the intersection with S is non-empty, so f(n+1) is well-defined and is an element of f(n). So f is an infinite descending chain. This is a contradiction, hence no such S exists.

External links

http://www.trinity.edu/cbrown/topics_in_logic/sets/sets.html contains an informative description of the axiom of regularity under the section on Zermelo-Fraenkel set theory.

<< Previous

Word Browser

Next >>

aircraft hijacking
acropolis, athens
adam weishaupt
acorn electron
a fire upon the deep
aeronautics
auguste and louis lumire
acts of the apostles
assyria
abijah
ark

aphasia
aorta
abimelech
anomalous cognition
anomalous operation
andrew tridgell
applesoft basic
asterix
arizona cardinals
atlanta falcons
satr

ansible
adalbert of prague
alphege
associative algebra
aix operating system
apple ii family
apple iii
avl tree
aliphatic compound
astrology
algebraic extension

ani difranco
arene
arizona diamondbacks
aesthetics
ark of the covenant
angles
aster ct 80
animated television series
atlanta braves
atari st
list of artificial intelligence projects