FunnyMaths
New member
- Joined
- Aug 22, 2013
- Messages
- 2
Good afternoon, I dont even know where to start for this question.
Let A, B be sets and let f : A -> B be a function.
Define a function h : P(B) -> P(A) by declaring that, for Y E P(B), h(Y) = {x E A : f(x) is not a member of Y}.
P(A) = the power set of A.
Show that if f is bijection, then h is bijection.
----------------------------------------------------------------------------------------------------------
What I know:
h is bijection iff h is 1-to-1 and onto;
1 - 1: f(a)=f(a') => a=a'
onto: for all b E B, there exists a E A such that f(a) = b
P(A), domain, codomain.
-----------------------------------------------------------------------------------------------------------
Any hints/ ideas would be appreciated.
Thank you very much.
Let A, B be sets and let f : A -> B be a function.
Define a function h : P(B) -> P(A) by declaring that, for Y E P(B), h(Y) = {x E A : f(x) is not a member of Y}.
P(A) = the power set of A.
Show that if f is bijection, then h is bijection.
----------------------------------------------------------------------------------------------------------
What I know:
h is bijection iff h is 1-to-1 and onto;
1 - 1: f(a)=f(a') => a=a'
onto: for all b E B, there exists a E A such that f(a) = b
P(A), domain, codomain.
-----------------------------------------------------------------------------------------------------------
Any hints/ ideas would be appreciated.
Thank you very much.