Wednesday, 10 December 2014

functions - Proving the Equality if f(U and V) = f(U) and f(V)



If f:XY is a function and U and V are subsets of X, then f(UV)=f(U)f(V).




I am a little lost on this proof. I believe it to be true, but I am uncertain as to where to start. Any solutions would be appreciated. I have many similar proofs to prove and I would love a complete one to base my further proofs on.


Answer



You can't prove it, since it is false. Take a set X with more than one point, take x,xX with xx and let f be a constant function. Thenf({x}{x})=f()=f({x})f({x}).



Actually, the assertion that you want to prove is equivalent to the assertion that f is injective.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...