Antichain of P(N): Determining Uncountability with Known Sets

  • Thread starter Thread starter R.P.F.
  • Start date Start date
  • Tags Tags
    Set
Click For Summary
SUMMARY

The discussion centers on the concept of antichains within the power set P(N) and their uncountability. Participants explore the relationship between antichains and known uncountable sets, particularly referencing Cantor's Theorem. It is established that P(N) is uncountable, and an antichain can be constructed with the same cardinality, confirming its uncountability. Key steps include demonstrating that the resulting sets form an antichain and verifying their cardinality matches that of P(N).

PREREQUISITES
  • Understanding of power sets, specifically P(N)
  • Familiarity with Cantor's Theorem
  • Knowledge of cardinality and bijective mappings
  • Basic concepts of set theory and antichains
NEXT STEPS
  • Study Cantor's Diagonal Argument in detail
  • Explore the properties of antichains in set theory
  • Learn about cardinality comparisons between different sets
  • Investigate examples of uncountable sets beyond P(N) and R
USEFUL FOR

Mathematicians, students of set theory, and anyone interested in advanced concepts of uncountability and cardinality in mathematics.

R.P.F.
Messages
210
Reaction score
0

Homework Statement



P(B) refers to the collection of all subsets of B.
Given a set B, a subset A of P(B) is called an antichain if no element of A is a subset of any other element of A. Does P(N) contain an uncountable antichain?


Homework Equations





The Attempt at a Solution



If I can build a bijective map between an antichain of P(N) and another set of known cardinality, then I will be able to know if the antichain is uncountable. Sets I know that are uncountable: R, sequences of 0's and 1's. Is it one of these two?

Sorry I'm not able to do much with this problem. Any help is appreciated.
 
Physics news on Phys.org
hmm...you've got me interested! but I can't put together a full proof at the moment, maybe in the morning after some sleep haha. If it's of any help, here's one more uncountable set to add to your list: P(N). If this is new to you, read through an explanation of Cantor's Theorem.
 
Hint: divide N into pairs, {1,2}, {3,4}, {5,6}... Now form sets by choosing exactly one element of each pair. What properties does the resulting collection of sets have?
 
Dick said:
Hint: divide N into pairs, {1,2}, {3,4}, {5,6}... Now form sets by choosing exactly one element of each pair. What properties does the resulting collection of sets have?

Raskolnikov said:
hmm...you've got me interested! but I can't put together a full proof at the moment, maybe in the morning after some sleep haha. If it's of any help, here's one more uncountable set to add to your list: P(N). If this is new to you, read through an explanation of Cantor's Theorem.

I think I kinda got it. So this has to do with the cardinality of P(N) right? Because P(N) is uncountable and we could build an antichain of the same cardinality, so the antichain is also uncountable.
Thank you both!
 
Oh sorry I think I got it wrong. I still need to use Cantor's diagonal Thm.

Thanks!
 
R.P.F. said:
I think I kinda got it. So this has to do with the cardinality of P(N) right? Because P(N) is uncountable and we could build an antichain of the same cardinality, so the antichain is also uncountable.
Thank you both!

Yes. You need to show i) the resulting sets are an antichain and ii) the cardinality of the antichain is the same as P(N).
 

Similar threads

Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
7
Views
2K