There is no set of all sets

From Maths
Jump to: navigation, search
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

Statement

We claim there is no set of all sets[1] Claim:

  • XY[YX]
    • For any set X there exists a set Y such that YX

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 YX is absurd too.

Proof

  • Let X be given
    • Define Y:={xX | xx} - which exists by the axiom schema of separation, accordingly YX[Note 1]
      • Suppose that YX
        • We now have two cases (as YY is conceivable (as is YY) as Y is some subset of X):
          1. YY
            • But AY[AA] is the defining property of Y
              • So then YY (the case where A:=Y) - a contradiction! So we cannot have this!
          2. YY
            • As YX by hypothesis, if YY then YY by definition of what Y contains from X!
              • A contradiction again! So we cannot have this!
        • Thus YX

Note: this is half of Russell's paradox, the other half is showing that YX is absurd too!.

Notes

  1. Jump up

References

  1. Jump up Warwick lecture notes - Set Theory - 2011 - Adam Epstein - page 6