Proving Bijective Power Sets of A & B | A, B, C

The1TL
Messages
23
Reaction score
0
Let A,B, and C be non-empty sets. A and B are bijective.

Prove that the power set of A is bijective to the power set of B.

I understand how to prove bijection but can't figure out how to apply this to power sets and can't find any info on this subject.
 
Physics news on Phys.org
You don't have to prove there is a bijection between A and B. The problem is giving you that. The power set of A is the set of all subsets of A. Ditto for B. Use the bijection between A and B to construct a bijection between Pow(A) and Pow(B). I have no idea what C is supposed to be in this problem.
 

Thread 'Finding the nth roots of a complex number'

There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
View full post »

Similar threads

Prove every subset of countable set is either finite or else countable
Replies
1
Views
2K
Problem involving recursion theorem
Replies
11
Views
1K
Prove that every subset ##B## of ##A=\{1,...,n\}## is finite
Replies
4
Views
1K
Every subset of a finite set is finite
Replies
1
Views
2K
Equivalence Relations and Counter Examples for Equinumerous Sets
Replies
4
Views
1K
Bijection of Cartesian products
Replies
1
Views
2K
Proving something that is equinumerous
Replies
5
Views
2K
Abstract Algebra: Bijection, Isomorphism, Symmetric Sets
Replies
2
Views
1K
Bijection between AuB and A with A infinite set and B enumerable set.
Replies
2
Views
3K
Problem showing an equivalence relation
Replies
21
Views
3K

Hot Threads

Recent Insights

Back
Top