Cardinality of sets: prove equality

In summary, A is a set of real numbers excluding 0. It is countable and equivalent to the set of natural numbers. However, the set (0,1) is uncountable, leading to the conclusion that the cardinality of A is equal to the cardinality of the continuum. This could be proven using the Continuum Hypothesis or finding a better lower bound. One way to do this is by considering the function that maps natural numbers to their successor in the set of real numbers.
  • #1
Dustinsfl
2,281
5
[tex]A=\mathbb{R}-0[/tex]

[tex](0,1)\subseteq \mathbb{R}-0[/tex]

Assume A is countable.

Since A is countable, then [tex]A\sim\mathbb{N}[/tex].
Which follows that [tex](0,1)\sim\mathbb{N}[/tex].

However, (0,1) is uncountable so by contradiction, Card(A)=c

Correct?
 
Physics news on Phys.org
  • #2


The fact that A is not countable, together with the fact it is a subset of R only proves that
[tex]\aleph_0 < \mathop{Card}(A) \leq c[/tex]​
 
  • #3


So it looks like you will have to use the Continuum Hypothesis!
 
  • #4


Or find a better lower bound. :wink:
 
  • #5


Think about the function that maps [itex]n\mapsto n+1[/itex] for [itex]n\in \mathbb{N}[/itex] where [itex]\mathbb{N}[/itex] is regarded as a subset of [itex]\mathbb{R}[/itex].
 
  • #6


Thanks for the help
 

1. What is the definition of cardinality of a set?

The cardinality of a set is the number of elements in that set. It represents the size or magnitude of a set.

2. How is equality of cardinality proved between two sets?

To prove equality of cardinality between two sets, we need to show that there exists a one-to-one correspondence, or a bijection, between the two sets. This means that each element in one set corresponds to exactly one element in the other set, and vice versa.

3. What is the role of the Cantor-Bernstein-Schroeder theorem in proving equality of cardinality?

The Cantor-Bernstein-Schroeder theorem states that if there exists an injective function from set A to set B and an injective function from set B to set A, then there exists a bijection between the two sets. This theorem is used in proving equality of cardinality between sets, as it provides a way to construct a bijection between two sets.

4. Can two sets with different cardinalities be equal?

No, two sets with different cardinalities cannot be equal. If two sets have equal cardinality, it means that they have the same number of elements. If two sets have different cardinalities, it means that they have a different number of elements, and therefore cannot be equal.

5. What are some common examples of proving equality of cardinality between sets?

Some common examples of proving equality of cardinality include showing that the set of natural numbers and the set of even numbers have the same cardinality, or showing that the set of real numbers and the set of all points on a line have the same cardinality. Other examples can involve finite sets, infinite sets, or sets with different types of elements, such as numbers and functions.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
505
  • Calculus and Beyond Homework Help
Replies
1
Views
578
  • Calculus and Beyond Homework Help
Replies
1
Views
517
  • Calculus and Beyond Homework Help
Replies
3
Views
521
  • Calculus and Beyond Homework Help
Replies
3
Views
813
  • Calculus and Beyond Homework Help
Replies
3
Views
693
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
274
  • Calculus and Beyond Homework Help
Replies
1
Views
460
  • Calculus and Beyond Homework Help
Replies
3
Views
552
Back
Top