0

I'm taking a class that's covering cardinalities, and I was introduced to Cantor's diagonal argument today, and I'm having trouble following the logic. The theorem states, "If s[1], s[2], … , s[n], … is any enumeration of elements from T, then there is always an element s of T which corresponds to no s[n] in the enumeration." This sounds more like a logical paradox than a theorem to me.

Specifically, it states that "By construction, s differs from each s[n], since their nth digits differ. Hence, s cannot occur in the enumeration." (from Wikipedia)

However, if s[..] is "any enumeration of elements" in T, then it follows that any s created by choosing elements of T, by whatever method, must occur as some s[n], because s[..] represents every combination of digits possible, right?

This is where I can no longer follow the logic of the proof. Where does the assumption come from, that this diagonal sequence of digits is somehow special and doesn't occur anywhere else in s[..]? Wouldn't that invalidate the first statement of the theorem?

Sorry if this question seems obvious or stupid, but I can't find an explanation that doesn't seem (to me) to invalidate itself.

Andrés E. Caicedo
  • 79,201
HypnoToad
  • 119
  • How about asking your professor or at math.stackexchange? This is not really research-level mathematics... – Per Alexandersson Sep 13 '15 at 02:11
  • 1
    The key is that it is "an enumeration of elements from $T$"; as the argument shows, it cannot be an enumeration of all of the elements of $T$. The set of all elements of $T$ is therefore not enumerable. (Here, I assume we are talking about $T = [0,1)$, or some other uncountable set amenable to the diagonal argument.) – Eric Tressler Sep 13 '15 at 02:26
  • It's an online class, there is no professor. I didn't know mathoverflow was different from math.stackexchange, but I think the moderators moved it to the right place. – HypnoToad Sep 13 '15 at 02:26
  • 1
    Are you familiar with proofs by contradiction? Your objection applies to any proof by contradiction, including much simpler proofs. – littleO Sep 13 '15 at 03:18

1 Answers1

0

That's the whole contradiction: You assume that there is a list of all the elements. Then you go on constructing an element that is not in the list (because it differs by some $n$-th digit). This contradicts the assumption that your list contains ALL elements. Hence there is no list which contains ALL elements. The concludion is that there are so many elements that it is not impossible to enumerate them (at least not by natural numbers). Is this helpful?

Damian Reding
  • 8,773
  • It does not need to take the form of a contradiction: you can instead just show that an arbitrary enumeration of elements from the uncountable set $T$ misses elements of $T$. – Eric Tressler Sep 13 '15 at 02:29
  • Of course, agreed. – Damian Reding Sep 13 '15 at 02:32
  • I'm really trying. But all I keep thinking is that any element you construct IS already in the list, because the list contains ALL elements. Somewhere in that list, the element you constructed already exists. And if creating a new element by rearranging existing elements can prove a set is uncountable, then can you not use the same argument to prove the natural numbers are uncountable? – HypnoToad Sep 13 '15 at 02:47
  • @HypnoToad See my comment on your question above. That is the best way to put it that I could think of, or I would elaborate in an answer myself. Maybe you could try finding other sources online, and reading a few of them? This is a proof that famously causes problems for people, but it is completely valid. – Eric Tressler Sep 13 '15 at 03:02
  • 4
    @HypnoToad your reasoning is circular. Just because one makes a hypothesis (list contains all elements) does not mean that hypothesis is valid. The possible invalidity of a hypothesis is the core of a proof by contradiction. – guest Sep 13 '15 at 03:04
  • I was thinking it was a given that the list contained all elements, not that it was an assumption we're trying to disprove. – HypnoToad Sep 14 '15 at 02:27