Proving Cardinality of Sets: $\{a_n: n \in \omega\}$

In summary, the proof shows that for any countable set $X$, there exists a bijection between $X$ and $X \cup \{b\}$, where $b$ is an element not in $X$. This can be extended to show that for any countable set $B$ that does not intersect with $X$, there exists a bijection between $X$ and $X \cup B$.
  • #1
evinda
Gold Member
MHB
3,836
0
Hello! (Wave)

Suppose that $X$ contains a countable set. Let $b \notin X$. Show that $X \sim X \cup \{b\}$.
Prove that in general if $B$ is at most countable with $B \cap X=\varnothing$ then $X \sim X \cup B$.

Proof:We will show that $X \sim X \cup \{b\}$.
There is a $\{ a_n: n \in \omega \} \subset X$.
We define the function:
$$f: \{ a_n: n \in \omega \} \cup \{ b \} \overset{\text{bijective}}{\to} \{ a_n: n \in \omega \}$$
as follows:

$$f(b)=a_0\\f(a_n)=a_{n+1} \text{ for each } n \in \omega$$
We easily see that $f$ is 1-1 and surjective.

We define $g: X \cup \{b\} \to X$ as follows:

$$g(x)=x \text{ if } x \in X-(\{ a_n: n \in \omega \} \cup \{ b \})\\g(x)=f(x) \text{ if } x \in (\{ a_n: n \in \omega \} \cup \{b\})$$

Then $g$ is 1-1 and surjective.
From which point do we deduce that there is a $\{ a_n: n \in \omega \} \subset X$ ? (Thinking)
 
Physics news on Phys.org
  • #2
evinda said:
From which point do we deduce that there is a $\{ a_n: n \in \omega \} \subset X$ ? (Thinking)
From the fact that $X$ contains a countable set.
 

1. What is the definition of cardinality?

Cardinality is a mathematical concept that refers to the size or number of elements in a set. It can also be thought of as the number of unique objects in a set.

2. How do you prove the cardinality of a set?

To prove the cardinality of a set, you must show that there is a one-to-one correspondence between the elements of the set and the counting numbers. This means that each element in the set can be matched with a unique counting number, and vice versa.

3. What is the cardinality of the set $\{a_n: n \in \omega\}$?

The cardinality of this set is equal to the cardinality of the set of natural numbers, denoted by $\aleph_0$. This means that there are countably infinite elements in the set.

4. How do you show a one-to-one correspondence between the elements of a set and the counting numbers?

To show a one-to-one correspondence, you must demonstrate a function that maps each element of the set to a unique counting number, and another function that maps each counting number back to a unique element in the set. This shows that there is a bijection between the two sets.

5. Can the cardinality of a set be larger than $\aleph_0$?

Yes, the cardinality of a set can be larger than $\aleph_0$. For example, the cardinality of the set of real numbers, denoted by $\mathbb{R}$, is greater than $\aleph_0$ and is equal to $\mathfrak{c}$. This means that there are uncountably infinite elements in the set.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
19
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
693
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
14
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
876
Back
Top