Bijections and Power Sets - Proving

sqrt(-1)NeedHelp

New member
Joined
Nov 17, 2013
Messages
2
Hello, I am in need of some help with the following:

Let A\displaystyle A and B\displaystyle B be sets and let f:AB\displaystyle f:A\rightarrow B. We define the function H:P(A)P(B)\displaystyle H:\mathcal P \left({A}\right)\rightarrow \mathcal P \left({B}\right) as follows: for CP(A)\displaystyle C\in \mathcal P \left({A}\right) let H(C)\displaystyle H(C) be f(C)\displaystyle f(C).
Show: if f\displaystyle f is bijective then H\displaystyle H is bijective.

I know for a function to be bijective it must be injective and surjective. So this is how I am starting the proof, but I think I am going in the wrong direction with it.

Proof:
Let A\displaystyle A and B\displaystyle B be sets and let f:AB\displaystyle f:A\rightarrow B.
Assume that f\displaystyle f is bijective, that is f\displaystyle f is both injective and surjective:
  • Injective: a,aA:f(a)=f(a)a=a\displaystyle \forall a,a' \in A:f(a)=f(a')\Rightarrow a=a'
  • Surjective: bB:aAf(a)=b\displaystyle \forall b \in B: \exists a \in A \ni f(a)=b

I am completely lost... so any guidance would help!
 
Let A\displaystyle A and B\displaystyle B be sets and let f:AB\displaystyle f:A\rightarrow B. We define the function H:P(A)P(B)\displaystyle H:\mathcal P \left({A}\right)\rightarrow \mathcal P \left({B}\right) as follows: for CP(A)\displaystyle C\in \mathcal P \left({A}\right) let H(C)\displaystyle H(C) be f(C)\displaystyle f(C).
Show: if f\displaystyle f is bijective then H\displaystyle H is bijective.

Suppose that H(C)=H(D)\displaystyle H(C) = H(D). That means f(C)=f(D)\displaystyle f(C) = f(D).

If tf(C)\displaystyle t\in f(C) then tf(D)\displaystyle t\in f(D) or (xC)(yD)[f(x)=t=f(y)]\displaystyle \left( {\exists x \in C} \right) \wedge \left( {\exists y \in D} \right)\left[ {f(x) = t = f(y)} \right].
What does that say about x & y \displaystyle x~\&~y~, recall that f\displaystyle f is injective.

Now suppose QP(B)\displaystyle Q\in \mathcal{P}(B). (sQ)(xsA)[f(xs)=s]\displaystyle \left( {\forall s \in Q} \right)\left( {\exists {x_s} \in A} \right)\left[ {f({x_s}) = s} \right] WHY?
Let R={xs:sQ}\displaystyle R = \left\{ {{x_s}:s \in Q} \right\}. What is H(R)= ?\displaystyle H(R)=~?.
What does that prove?
 
Suppose that H(C)=H(D)\displaystyle H(C) = H(D). That means f(C)=f(D)\displaystyle f(C) = f(D).

If tf(C)\displaystyle t\in f(C) then tf(D)\displaystyle t\in f(D) or (xC)(yD)[f(x)=t=f(y)]\displaystyle \left( {\exists x \in C} \right) \wedge \left( {\exists y \in D} \right)\left[ {f(x) = t = f(y)} \right].
What does that say about x & y \displaystyle x~\&~y~, recall that f\displaystyle f is injective.

Now suppose QP(B)\displaystyle Q\in \mathcal{P}(B). (sQ)(xsA)[f(xs)=s]\displaystyle \left( {\forall s \in Q} \right)\left( {\exists {x_s} \in A} \right)\left[ {f({x_s}) = s} \right] WHY?
Let R={xs:sQ}\displaystyle R = \left\{ {{x_s}:s \in Q} \right\}. What is H(R)= ?\displaystyle H(R)=~?.
What does that prove?

So since f(C)=f(D), due to being injective C=D.

As for the second part, I'm not sure I understand 100% why we sayQP(B)\displaystyle Q\in \mathcal{P}(B). Is it because QB\displaystyle Q\subseteq B (since Power sets are sets of all subsets of B)? Other than my confusion from QP(B)\displaystyle Q\in \mathcal{P}(B), I see that (sQ)(xsA)[f(xs)=s]\displaystyle \left( {\forall s \in Q} \right)\left( {\exists {x_s} \in A} \right)\left[ {f({x_s}) = s} \right] is because of f being surjective.
 
Let A\displaystyle A and B\displaystyle B be sets and let f:AB\displaystyle f:A\rightarrow B. We define the function H:P(A)P(B)\displaystyle H:\mathcal P \left({A}\right)\rightarrow \mathcal P \left({B}\right) as follows: for CP(A)\displaystyle C\in \mathcal P \left({A}\right) let H(C)\displaystyle H(C) be f(C)\displaystyle f(C).
Show: if f\displaystyle f is bijective then H\displaystyle H is bijective.


  • Surjective: bB:aAf(a)=b\displaystyle \forall b \in B: \exists a \in A \ni f(a)=b
So since f(C)=f(D), due to being injective C=D. CORRECT

As for the second part, I'm not sure I understand 100% why we sayQP(B)\displaystyle Q\in \mathcal{P}(B). Is it because QB\displaystyle Q\subseteq B (since Power sets are sets of all subsets of B)? Other than my confusion from QP(B)\displaystyle Q\in \mathcal{P}(B), I see that (sQ)(xsA)[f(xs)=s]\displaystyle \left( {\forall s \in Q} \right)\left( {\exists {x_s} \in A} \right)\left[ {f({x_s}) = s} \right] is because of f being surjective.

I quoted your OP.
You said "Surjective: bB:aAf(a)=b\displaystyle \forall b \in B: \exists a \in A \ni f(a)=b"
Well that is exactly what I did.

If QP(B)\displaystyle Q\in \mathcal{P}(B) then there is a RP(A)\displaystyle R\in \mathcal{P}(A) such that H(R)=Q.\displaystyle H(R)=Q..
Go back to my reply see if you can follow my proof.
 
Last edited:
Top