estra
- 11
- 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..