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

Homework Help Overview

The discussion revolves around the concept of antichains within the power set of natural numbers, P(N). The original poster is exploring whether P(N) contains an uncountable antichain, referencing known sets and cardinalities.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to establish a bijective map between an antichain of P(N) and known uncountable sets to determine the uncountability of the antichain. Some participants suggest considering the properties of sets formed by selecting elements from pairs of natural numbers.

Discussion Status

Participants are actively engaging with the problem, with hints and suggestions being offered. There is an exploration of the relationship between the cardinality of P(N) and the potential antichain, although there is no explicit consensus on the approach or solution yet.

Contextual Notes

Some participants mention the need to reference Cantor's Theorem and the diagonal argument, indicating that these concepts may be relevant to the discussion but are not fully resolved.

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
4K
Replies
2
Views
3K
  • · Replies 15 ·
Replies
15
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
7
Views
2K