Conclusion from the factorization theorem of functions.

Click For Summary

Homework Help Overview

The discussion revolves around the factorization theorem of functions, specifically focusing on proving a statement regarding the existence of certain types of functions. The original poster seeks to establish that for any function f from set X to set Y, there exists a set Z and functions h and g such that h is injective and g is surjective, with the relationship f = g ∘ h.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the meaning of the composition notation and clarify the definitions of injective and surjective functions. There is a discussion about the original poster's phrasing and the implications of the factorization theorem, with some participants questioning the interpretation of the theorem's conclusions.

Discussion Status

The conversation is ongoing, with participants seeking clarification on the original statement and its implications. There is recognition of a potential connection to the factorization theorem, but no consensus has been reached on the proof or the approach to take.

Contextual Notes

Participants note the confusion surrounding the notation used and the need for clearer definitions. The original poster acknowledges a miscommunication regarding the symbols and seeks to clarify their intent in proving the statement.

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

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
20
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K