I'm sorry, I'm not sure I understand your question. Can you clarify?

Click For Summary

Homework Help Overview

The discussion revolves around set theory, specifically focusing on the properties of uncountable sets and the relationship between a set and its power set. The original poster seeks clarification on the assertion that there is no set A such that ##2^A## is denumerable.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the definition of denumerable sets and question the comparison of sizes between sets and their power sets. There is confusion regarding the statement that ##|2^A| > |A|## and the implications of this in the context of denumerable versus uncountable sets.

Discussion Status

Some participants have provided insights into the nature of infinite sets and the concept of different orders of infinity. There is an ongoing examination of terminology, particularly the use of "denumerable" and its implications for finite and infinite sets. The discussion remains open with various interpretations being explored.

Contextual Notes

There is a mention of differing definitions of "denumerable" in various textbooks, which may affect the understanding of the problem. Participants are encouraged to refer to their textbooks for clarification on the theorem regarding power sets.

knowLittle
Messages
307
Reaction score
3
Set Theory -- Uncountable Sets

Homework Statement


Prove or disprove.
There is no set A such that ##2^A## is denumberable.

The Attempt at a Solution


A set is denumerable if ##|A| = |N|##

My book shows that the statement is true.
If A is denumerable, then since ##|2^A| > |A|, 2^A ## is not denumerable.


I don't understand why they state that 2^A > A? I thought that in denumerable sets you can't really say that there is one set greater than other? I thought that there is denumerable or uncountable and that's it.
But, there is not a denumerable set greater than another denumerable set.

Help please.
 
Physics news on Phys.org
knowLittle said:
I don't understand why they state that 2^A > A? I thought that in denumerable sets you can't really say that there is one set greater than other?
That's true, but 2A is not countable - that's the point.
I thought that there is denumerable or uncountable and that's it.
Well, no - there are infinitely many orders of infinity. If B is uncountable, there is still no bijection between B and its power set, so |2B| is a higher order of infinity.
Your book appears to be using the general theorem that |2A|>|A|. I suggest you locate that in your book and study it.
 
  • Like
Likes   Reactions: 1 person
Some textbooks use the term "denumerable" to mean "finite or countable".

If A is a finite set then 2^A is also finite so "denumerable".

If, however, you are using "denumerable" to mean "countably infinite" then the statement is true.
 
  • Like
Likes   Reactions: 1 person
So, for a countably(denumerable) infinite A, ## |2^A| ## is an uncountably infinite?
 
knowLittle said:
So, for a countably(denumerable) infinite A, ## |2^A| ## is an uncountably infinite?

Yes.
 
  • Like
Likes   Reactions: 1 person
knowLittle said:
So, for a countably(denumerable) infinite A, ## |2^A| ## is an uncountably infinite?

Since "infinite" is an adjective, the word "an" should not be there!:-p
 
  • Like
Likes   Reactions: 1 person
HallsofIvy said:
Since "infinite" is an adjective, the word "an" should not be there!:-p
Yes.
:/
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
5K
  • · Replies 15 ·
Replies
15
Views
3K
Replies
22
Views
13K
Replies
6
Views
8K
  • · Replies 61 ·
3
Replies
61
Views
8K
  • · Replies 2 ·
Replies
2
Views
1K