Conclusion from the factorization theorem of functions.

estra
Messages
11
Reaction score
0

Homework Statement



Prove that \forall f:X\rightarrowY there \exists Z, h: X\rightarrowZ is injective and g: Z\rightarrowY is surjective, so that f=g*h.


Homework Equations



There is already a conclusion from the factorisation theorem of functions that: \forall f:X\rightarrowY there \exists Z, h: X\rightarrowZ is surjective and g: Z\rightarrowY is injective, so that f=g*h.

But how to prove it just from applaying it from other side..
 
Physics news on Phys.org
estra said:

Homework Statement



Prove that \forall f:X\rightarrowY there \exists Z, h: X\rightarrowZ is injective and g: Z\rightarrowY is surjective, so that f=g*h.


Homework Equations



There is already a conclusion from the factorisation theorem of functions that: \forall f:X\rightarrowY there \exists Z, h: X\rightarrowZ is surjective and g: Z\rightarrowY is injective, so that f=g*h.

But how to prove it just from applaying it from other side..
What do you mean "applaying it from the other side.."?

I for one need some context here. In this equation, f=g*h, '*' looks like ordinary multiplication, but with the sets that are involved, do you mean composition (i.e., g \circ h)?

Also, it's not clear to me what you're saying here:
\forall f:X\rightarrowY there \exists Z, h: X\rightarrowZ is injective and g: Z\rightarrowY is surjective, so that f=g*h.

I don't understand the stuff above. What I think you are saying is:
For any f, where f:X\rightarrowY, there is an injective function h, where h: X\rightarrowZ, and a surjective function g, where g: Z\rightarrowY, so that f = g\circh.
 
Ok. Don't watch the stuff above then. I might have sentenced it wrong.

What I think you are saying is:
For any f, where f:X\rightarrowY, there is an injective function h, where h: X\rightarrowZ, and a surjective function g, where g: Z\rightarrowY, so that f = g\circh.

You are absoultely right. This is what I try to say and proof. Yes I mean composition. Sorry about the wrong symbol. g \circ h is what i meant.
 
So what did you mean by "applaying it from the other side.."?
 
I just tried to say that almost the same sentence (only when function h is surjective and function g is injective) is a conclusion from a theorem(functions factorization theorem). but i try to proof the sentence where h is injective and g is surjective.. so i thought maybe it can be proved on the same way..
 
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