Number Theory (Finite and Infinite Sets)

Click For Summary
SUMMARY

The discussion centers on the properties of the set R\Q (the set of real numbers excluding rational numbers) and its countability. It is established that R is uncountable, while Q is countably infinite. The key conclusion is that R\Q cannot be countably infinite or denumerable because it is derived from the uncountable set R, and the union of a countably infinite set (Q) with an uncountable set (R\Q) remains uncountable. The discussion emphasizes the necessity of understanding bijections in set theory to grasp these concepts fully.

PREREQUISITES
  • Understanding of set theory, specifically bijections and countability.
  • Familiarity with the definitions of countably infinite and uncountable sets.
  • Knowledge of real numbers (R) and rational numbers (Q).
  • Basic concepts of unions of sets in mathematics.
NEXT STEPS
  • Study the concept of bijections in set theory.
  • Learn about the properties of countably infinite and uncountable sets.
  • Explore the implications of the union of sets in set theory.
  • Investigate Cantor's diagonal argument to understand uncountability further.
USEFUL FOR

Mathematics students, educators, and anyone interested in advanced set theory concepts, particularly those exploring the nature of infinite sets and their properties.

Ankit Mishra
Messages
6
Reaction score
0

Homework Statement



Why is R\Q not countably infinite or denumerable? Given R (Real Number) is not countably infinite or denumerable and Q (rational number) is denumerable.

Homework Equations



A set is said to be denumberable or countably infinite if there exists a bijestion of N (natural Number) onto S.

The Attempt at a Solution



Let Q be a subset of R and Let S be R-Q, which is denumerable. Via the defn there exists a bijection but R-Q is not bijective R-Q is the set of Real Numbers which is already not denumerable. I showed this to my prof and he said its not correct. He said to use Q u (R-Q)=R, we know Q is denumerable and R not to be denumerable use this to show R-Q is not denumerable? HOW!
 
Physics news on Phys.org
What you need to show is that the union of two countably infinite sets is countable. So take two sets {A_n} and {B_n}. Can you find a bijection from their union to the natural numbers? (hint: it's really easy)
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
Replies
16
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
20
Views
4K
Replies
2
Views
5K
Replies
6
Views
8K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K