There is no set of all sets
From Maths
Provisional page grade: A*
This page is provisional
This page is provisional and the information it contains may change before this notice is removed (in a backwards incompatible way). This usually means the content is from one source and that source isn't the most formal, or there are many other forms floating around. It is on a to-do list for being expanded.The message provided is:
The "core pages" of set theory need to be unified and designed to be viewed in a specific order so all the precursors actually come before
Contents
[hide]Statement
We claim there is no set of all sets[1] Claim:
- ∀X∃Y[Y∉X]
- For any set X there exists a set Y such that Y∉X
Significance
If we take X to be the "set of all sets" we'd reach Russell's paradox, this statement shows half of it. The remainder of the paradox shows that Y∉X is absurd too.
Proof
- Let X be given
- Define Y:={x∈X | x∉x} - which exists by the axiom schema of separation, accordingly Y⊆X[Note 1]
- Suppose that Y∈X
- We now have two cases (as Y∈Y is conceivable (as is Y∉Y) as Y is some subset of X):
- Y∈Y
- But ∀A∈Y[A∉A] is the defining property of Y
- So then Y∉Y (the case where A:=Y) - a contradiction! So we cannot have this!
- But ∀A∈Y[A∉A] is the defining property of Y
- Y∉Y
- As Y∈X by hypothesis, if Y∉Y then Y∈Y by definition of what Y contains from X!
- A contradiction again! So we cannot have this!
- As Y∈X by hypothesis, if Y∉Y then Y∈Y by definition of what Y contains from X!
- Y∈Y
- Thus Y∉X
- We now have two cases (as Y∈Y is conceivable (as is Y∉Y) as Y is some subset of X):
- Suppose that Y∈X
- Define Y:={x∈X | x∉x} - which exists by the axiom schema of separation, accordingly Y⊆X[Note 1]
Note: this is half of Russell's paradox, the other half is showing that Y∉X is absurd too!.
Notes
- Jump up ↑ TODO: Any set constructed by separation is a subset of the bounding set would be a great page to have
References