well-foundedness and axiom of foundation


Recall that a relationMathworldPlanetmath R on a class C is well-founded if

  1. 1.

    For any x∈C, the collectionMathworldPlanetmath {y∈C∣y⁢R⁢x} is a set, and

  2. 2.

    for any non-empty B⊆C, there is an element z∈B such that if y⁢R⁢z, then y∉B.

z is called an R-minimal element of B. It is clear that the membership relation ∈ in the class of all sets satisfies the first condition above.

Theorem 1.

Given ZF, ∈ is a well-founded relation iff the Axiom of FoundationMathworldPlanetmath (AF) is true.

We will prove this using one of the equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath versions of AF: for every non-empty set A, there is an x∈A such that x∩A=∅.

Proof.

Suppose ∈ is well-founded and A a non-empty set. We want to find x∈A such that x∩A=∅. Since ∈ is well-founded, there is a ∈-minimal set x such that x∈A. Since no set y such that y∈x and y∈A (otherwise x would not be ∈-minimalPlanetmathPlanetmath), we have that x∩A=∅.

Conversely, suppose that AF is true. Let A be any non-empty set. We want to find a ∈-minimal element in A. Let x∈A such that x∩A=∅. Then x is ∈-minimal in A, for otherwise there is y∈A such that y∈x, which implies y∈x∩A=∅, a contradictionMathworldPlanetmathPlanetmath. ∎

Title well-foundedness and axiom of foundation
Canonical name WellfoundednessAndAxiomOfFoundation
Date of creation 2013-03-22 17:25:34
Last modified on 2013-03-22 17:25:34
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 6
Author CWoo (3771)
Entry type Theorem
Classification msc 03E30