Proving R is Bigger Than N Set Elements

  • Thread starter Thread starter dextercioby
  • Start date Start date
AI Thread Summary
The discussion focuses on proving that the cardinality of the set of real numbers, \mathbb{R}, is greater than that of the natural numbers, \mathbb{N}. It highlights Cantor's theorem, which states that no bijection exists between these two sets. A proof is mentioned that illustrates this concept through a simple idea, although it may not be immediately apparent to those unfamiliar with it. Participants express appreciation for the clarity and effectiveness of the proof. The conversation emphasizes the significance of understanding set cardinality in mathematics.
dextercioby
Science Advisor
Insights Author
Messages
13,398
Reaction score
4,079
that the number of elements of \mathbb{R} (seen as a set, obviously) is bigger than the number of elements of \mathbb{N} ...? :bugeye:

Daniel.
 
Mathematics news on Phys.org
Two sets have the same cardinality iff there exists a bijection between the sets. Cantor showed that there is no bijection between \mathbb{R} and \mathbb{N}. A "[URL proof[/URL] of this involves a very simple idea - simple once one has seen it, but not until then.

Regards,
George
 
Last edited by a moderator:
Thankyou for the reply.

Daniel.
 
Very nice. I've never seen that proof before.
 
Wow...that's good!
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top