Proving Every Infinite Set Has An Infinite Countable Subset

  • Thread starter Doom of Doom
  • Start date
In summary, an infinite set is a set with an unlimited number of elements, and a countable subset is a subset that can be put into a one-to-one correspondence with the set of positive integers. It is important to prove that every infinite set has an infinite countable subset because it helps us understand the nature of infinity and its relationship with counting and sets. This proof is typically demonstrated using diagonalization, and it is applicable to all types of infinite sets.
  • #1
Doom of Doom
86
0
So, the task is to prove: Every infinite set has a infinite countable subset.


2. A set [tex]S[/tex] is countable if there exists a bijection [tex]\phi: \mathbb{N}\rightarrow X[/tex]


The Attempt at a Solution

 
Physics news on Phys.org
  • #2
You can easily construct a countable subset [itex]\{s_1,s_2,\dots\}[/itex] wiht [itex]s_1,s_2,\dots[/itex] being elements of S.

Let [itex]s_1[/itex] be some element of S. Let inductively [itex]s_n[/itex] be some element of [itex]S-\{s_1,\dots,s_{n-1}\}[/itex].

Can you show that this works for any infinite set, and that it does not work for any finite set?
 
Last edited:

What is an infinite set?

An infinite set is a set that contains an unlimited number of elements. This means that no matter how many elements are already in the set, there is always room for more.

What is a countable subset?

A countable subset is a subset of a set that can be put into a one-to-one correspondence with the set of positive integers. This means that the elements in the subset can be counted and listed in a specific order.

Why is it important to prove that every infinite set has an infinite countable subset?

This proof is important because it shows that even though infinite sets may seem uncountable or too large to comprehend, they still contain subsets that can be counted and understood. It also helps us better understand the nature of infinity and how it relates to counting and sets.

How is this proof typically demonstrated?

This proof is typically demonstrated using a method called diagonalization, where an infinite set is assumed to be countable and then a new element is constructed that is not in the original set, leading to a contradiction. This shows that the original set cannot be countable, and therefore must contain an infinite countable subset.

Is this proof applicable to all types of infinite sets?

Yes, this proof is applicable to all types of infinite sets, including countable and uncountable sets. It is a fundamental concept in set theory and is used in various fields of mathematics and science.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
501
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
495
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
18
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
2K
Back
Top