There is no bijection between any set A and its power set P(A) of A.
For finite sets, proof is trivial since |A| = n and |P(A)| = 2^n. For
finite sets, this is done by contradiction. Suppose there is a bijection
$ between a set A and its power set P(A). Consider the set B={x|x is a
member A where x is not a member $(x)}For each element x A, since $ is
a function from A to the power set of A, &(x) ia a subset of A. By our
earlier assumption on set theory that every element is either in a set
or ot in a set, for each x A, w can certainly ask if x is a member of
$(x). Therefore, the set B is well definedB. We know B is a subset of A
and $ is a bijection from A to its power set P(A). For this subset B of
A, there exists an element y is a member of A such that $(y)=B.
Where is y? is y a member of B ? or is y is not a member of B? in both
cases we will obtain a contradiction.. Therefore, our earlier claim
that there is a bijection between A and its power set P(A) is false.
Mathematics Homework Solutions
#24567
Prove that there is no bijection between any set A and its power set P(A) of A.
There is no bijection between any set A and its power set P(A) of A.
For finite sets, proof is trivial since |A| = n and |P(A)| = 2^n. For finite sets, this is done by contradiction. Suppose there is a bijection $ between a set A and its power set P(A). Consider the set B={x|x is a member A where x is not a member $(x)}For each element x A, since $ is a function from A to the power set of A, &(x) ia a subset of A. By our earlier assumption on set theory that every element is either in a set or ot in a set, for each x A, w can certainly ask if x is a member of $(x). Therefore, the set B is well definedB. We know B is a subset of A and $ is a bijection from A to its power set P(A). For this subset B of A, there exists an element y is a member of A such that $(y)=B.
Where is y? is y a member of B ? or is y is not a member of B? in both cases we will obtain a contradiction. Therefore, our earlier claim that there is a bijection between A and its power set P(A) is false.
It is proven that there is no bijection between any set A and its power set P(A) of A.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
- Plain text response
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Bijection is Homeomorphism - Let f : M -> N be a continuous bijection. M is compact. Show that f is a homeomorphism. Isn't a homeomorphism by definition a bijection? And since M is compact, will it not be true that N will be ...
- Homomorphisms, Bijection Map and Continuous Map - 1) Prove that the map GIVEN BY is a homomorphism between the real line and open interval (-1,1). 2) Let be the map given by a) show that f is a bijection map b) show that f is a continu ...
- Functions, Enumeration Schemes and Bijection - Let f:Z+ --> Z be the function defined by... f(n) = {n/2 n even { -(n-1)/2 n odd - n even; The following table indicates the enumeration scheme behind the definiton of the functio ...
- Matrix Theory - See attached file for full problem description.
- Cosets - If H is a subgroup of G, define a mapping $ from the right cosets of H to the left cosets by $(Ha) = a^-1H. Show that $ is a (well defined) bijection.
