Proving the Countable Union Theorem for Sets with a Prime Mapping Approach

  • Thread starter Thread starter cragar
  • Start date Start date
  • Tags Tags
    Proof Union
Click For Summary
SUMMARY

The Countable Union Theorem states that the union of countable sets A_1, A_2, ..., A_n is countable. The discussion proposes a prime mapping approach where each element of A_1 is assigned to the first prime, with subsequent sets A_2, A_3, ..., A_n mapped to the second, third, and nth primes respectively. By utilizing the properties of natural numbers and modular arithmetic, the union of these sets can be shown to be enumerable, establishing a bijection to the natural numbers.

PREREQUISITES
  • Understanding of countable sets and their properties
  • Familiarity with prime numbers and their significance in set theory
  • Knowledge of bijections and enumerability in mathematics
  • Basic concepts of modular arithmetic
NEXT STEPS
  • Study the principles of set theory, focusing on countable versus uncountable sets
  • Explore the concept of bijections in more detail, particularly in relation to infinite sets
  • Investigate the applications of prime numbers in mathematical proofs and set mappings
  • Learn about modular arithmetic and its role in enumerating sets
USEFUL FOR

Mathematicians, students studying set theory, educators teaching advanced mathematics, and anyone interested in the applications of prime numbers in proofs.

cragar
Messages
2,546
Reaction score
3

Homework Statement


If A_1,A_2...A_n are countable sets. Then the union
A_1 \cup A_2\cup ...\cup A_n is countable.

The Attempt at a Solution


Since we know there are an infinite amount primes I will assign each element in
A_1 to the first prime. I will take every element in A_1
and raise this element to 2^x where x is the ith element of the first set.
then I will map all the elements in the second set the second prime.
so the nth set will go to the nth prime.
since these will all be natural numbers, the union of these sets is countable.
 
Last edited:
Physics news on Phys.org
It's easier than this, for A_1, align them to the set that of numbers 1 mod n, A_2 to the set of numbers 2 mod n, ..., A_n to sets of numbers of 0 mod n.
each such set is enumarable and this is self evident a bijection from the union of A_i to N.

Cheers!
 
ok, you that's a good way.
 

Similar threads

Union of Prime Ideals Contains an Ideal
  • · Replies 5 ·
Replies
5
Views
3K
Prove every subset of countable set is either finite or else countable
  • · Replies 1 ·
Replies
1
Views
2K
Proof that algebraic numbers are countable
  • · Replies 6 ·
Replies
6
Views
3K
Proving that the algebraic numbers are denumerable
  • · Replies 3 ·
Replies
3
Views
2K
How Do Vector Spaces of Linear Maps Differ from Standard Vector Spaces?
  • · Replies 9 ·
Replies
9
Views
2K
Union of countable sets is countable
  • · Replies 2 ·
Replies
2
Views
3K
Let [ ] be a countable number of finite sets. Prove [ ]
  • · Replies 5 ·
Replies
5
Views
2K
Repeated Roots and Being Relatively Prime w/Derivative
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Countability of Finite Product Sets: Foundational Issues?
  • · Replies 2 ·
Replies
2
Views
1K
Undergrad The set of nonzero values of pmf is at most countable
  • · Replies 3 ·
Replies
3
Views
4K