Skip to main content
Mathematics LibreTexts

4.5: 4.5 Russell’s Paradox

  • Page ID
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    There is no Nobel prize category for mathematics.1 Alfred Nobel’s will called for the awarding of annual prizes in physics, chemistry, physiology or medicine, literature, and peace. Later, the “Bank of Sweden Prize in Economic Sciences in Memory of Alfred Nobel” was created and certainly several mathematicians have won what is improperly known as the Nobel prize in Economics. But, there is no Nobel prize in Mathematics per se. There is an interesting urban myth that purports to explain this lapse: Alfred Nobel’s wife either left him for, or had an affair with a mathematician — so Nobel, the inventor of dynamite and an immensely wealthy and powerful man, when he decided to endow a set of annual prizes for “those who, during the preceding year, shall have conferred the greatest benefit on mankind” pointedly left out mathematicians.

    One major flaw in this theory is that Nobel was never married.

    In all likelihood, Nobel simply didn’t view mathematics as a field which provides benefits for mankind — at least not directly. The broadest division within mathematics is between the “pure” and “applied” branches. Just precisely where the dividing line between these spheres lies is a matter of opinion, but it can be argued that it is so far to one side that one may as well call an applied mathematician a physicist (or chemist, or biologist, or economist, or . . . ). One thing is clear, Nobel believed to a certain extent in the utilitarian ethos. The value of a thing (or a person) is determined by how useful it is (or they are), which makes it interesting that one of the few mathematicians to win a Nobel prize was Bertrand Russell (the \(1950\) prize in Literature “in recognition of his varied and significant writings in which he champions humanitarian ideals and freedom of thought”).

    Bertrand Russell was one of the twentieth century’s most colorful intellectuals. He helped revolutionize the foundations of mathematics, but was perhaps better known as a philosopher. It’s hard to conceive of anyone who would characterize Russell as an applied mathematician!

    Russell was an ardent anti-war and anti-nuclear activist. He achieved a status (shared with Albert Einstein, but very few others) as an eminent scientist who was also a powerful moral authority. Russell’s mathematical work was of a very abstruse foundational sort; he was concerned with the idea of reducing all mathematical thought to Logic and Set theory.

    In the beginning of our investigations into Set theory, we mentioned that the notion of a “set of all sets” leads to something paradoxical. Now we’re ready to look more closely into that remark and hopefully gain an understanding of Russell’s paradox.

    By this point you should be okay with the notion of a set that contains other sets, but would it be okay for a set to contain itself? That is, would it make sense to have a set defined by

    \(A = \{1, 2, A\}?\)

    The set \(A\) has three elements, \(1\), \(2\) and itself. So we could write

    \(A = \{1, 2, \{1, 2, A\}\},\)

    and then

    \(A = \{1, 2, \{1, 2, \{1, 2, A\}\}\},\)

    and then

    \(A = \{1, 2, \{1, 2, \{1, 2, \{1, 2, A\}\}\}\},\)

    et cetera.

    This obviously seems like a problem. Indeed, often paradoxes seem to be caused by self-reference of this sort. Consider

    The sentence in this box is false.

    So a reasonable alternative is to “do” math among the sets that don’t exhibit this particular pathology.

    Thus, inside the set of all sets we are singling out a particular subset that consists of sets which don’t contain themselves.

    \(\mathcal{S} = \{A | A \text{ is a set } ∧ A \notin A\}\)

    Now within the universal set we’re working in (the set of all sets) there are only two possibilities: a given set is either in \(\mathcal{S}\) or it is in its complement \(\mathcal{S}\). Russell’s paradox comes about when we try to decide which of these alternatives pertains to \(\mathcal{S}\) itself, the problem is that each alternative leads us to the other!

    If we assume that \(\mathcal{S} ∈ \mathcal{S}\), then it must be the case that \(\mathcal{S}\) satisfies the membership criterion for \(\mathcal{S}\). Thus, \(\mathcal{S} \notin \mathcal{S}\).

    On the other hand, if we assume that \(\mathcal{S} \notin \mathcal{S}\), then we see that \(\mathcal{S}\) does indeed satisfy the membership criterion for \(\mathcal{S}\). Thus \(\mathcal{S} ∈ \mathcal{S}\)

    Russell himself developed a workaround for the paradox which bears his name. Together with Alfred North Whitehead he published a \(3\) volume work entitled Principia Mathematica2 [17]. In the Principia, Whitehead and Russell develop a system known as type theory which sets forth principles for avoiding problems like Russell’s paradox. Basically, a set and its elements are of different “types” and so the notion of a set being contained in itself (as an element) is disallowed.


    Exercise \(\PageIndex{1}\)

    Verify that \((A \implies ¬A) ∧ (¬A \implies A)\) is a logical contradiction in two ways: by filling out a truth table and using the laws of logical equivalence.

    Exercise \(\PageIndex{2}\)

    One way out of Russell’s paradox is to declare that the collection of sets that don’t contain themselves as elements is not a set itself. Explain how this circumvents the paradox.

    This page titled 4.5: 4.5 Russell’s Paradox is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Joseph Fields.

    • Was this article helpful?