Equivalence of Functions and Power Sets in Set Theory

MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
i need to prove that next three arguments are equivalent:
1)f:X->Y is on Y.
2) f:p(X)->p(Y) is on p(Y).
3)f^-1:p(Y)->p(X) is one-to-one correspondence.
where p is the power set.
 
Physics news on Phys.org
what does 'on' mean? onto? perhaps playing devils advocate a little, but mainly to make you think about the question, if f is defined on X, how is it then defined on its power set (usually denoted P(X), not p(X)).
 
yes, i checked in mathworld, it's onto.
my main problem is with the third statement, i tried imply 3 from 1 and vice versa, but i don't know how to formualte the proof.

any further hints are appreciated.
 
are we assuming the function is unary?
or rather f(s in p(Y)) can be distributed into each element of s since
s is a subset of elements in Y?
 
neurocomp2003 said:
are we assuming the function is unary?
or rather f(s in p(Y)) can be distributed into each element of s since
s is a subset of elements in Y?
no, we don't assume it's unary.
about your second question do you mean if B is a subset of P(Y) then
f:B->f(B)={f(x)|x belongs to B} then yes, otherwise no.
 
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...
Back
Top