Math 2.0

statement theorem

Russell's paradox

Statement

There is no set RR such that, for each set xx, x∈Rx \in R if and only if x∉xx \notin x.

Remarks

Proof: if such an RR exists, apply the condition to x=Rx = R. Then R∈RR \in R if and only if R∉RR \notin R, which is a contradiction. So the collection {x∣x∉x}\{x \mid x \notin x\} is not a set. Unrestricted comprehension, which makes a set from each property, is inconsistent. It follows that there is no set of all sets. Otherwise, separation would give RR as a subset of it.

History

Bertrand Russell found the paradox in May 1901. Ernst Zermelo found it independently, by 1902 and possibly in 1899, but he did not publish it. In a 1902 letter, Russell told Gottlob Frege that the paradox arises in the logical system of Frege. Axiomatic set theories, such as Zermelo–Fraenkel set theory, avoid it with a restricted form of comprehension.

Explanations

L1 human

Try to form "the set of all sets that do not contain themselves". Ask whether this set contains itself: both answers lead to a contradiction. So some collections are too large to be sets.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Russell's_paradox, lead section