Proving Injection in Composite Functions

  • Thread starter Thread starter dijkarte
  • Start date Start date
  • Tags Tags
    Injective
AI Thread Summary
To prove that if the composition of two functions (g ° f) is injective, then f must also be injective, one must show that f(a) = f(b) implies a = b. The discussion clarifies that it is unnecessary for g to be injective for this proof. Instead, by assuming f(a) = f(b) and applying g, it follows that g(f(a)) = g(f(b)), leading to the conclusion that a must equal b. A contradiction argument is not required for this proof. A recommended resource for further understanding is "How to Think Like a Mathematician" by Kevin Houston.
dijkarte
Messages
190
Reaction score
0
Given two functions:
f:A --> B
g:B --> C
How to show that if the (g ° f) is injection, then f is injection?

I tried this:

We need to show that g(f(a)) = g(f(b)) ==> a = b holds true for all a, b in A. But there's nothing said about function g.
 
Physics news on Phys.org
I've tried using function mapping diagrams and actually it showed this proposition is wrong.
(g ° f) injective ==> g and f are injective.
 
dijkarte said:
We need to show that g(f(a)) = g(f(b)) ==> a = b holds true for all a, b in A.

No, you don't need to show that, that's given.

You need to show that f is an injection. That is: f(a)=f(b) ==> a=b. That is what you need to show.
 
You are absolutely right, my bad expressing the problem...

And yeah my post should have been moved under elementary school math ;)

But it's not a homework either, it's a question my professor did not have time to clarify well!
 
dijkarte said:
But it's not a homework either

Doesn't really matter. It's the style of homework, so it belongs here. It's irrelevant whether it is actually homework.

So, got any ideas??

You have f(a)=f(b) and you need to prove a=b.
Convert it to g(f(a))=g(f(b)) in some way.
 
But I think in order to show that f(a) = f(b) ==> a = b, g has to be given as injection as well, though I could prove that both functions g and f are injections using function mapping diagram.
 
dijkarte said:
But I think in order to show that f(a) = f(b) ==> a = b, g has to be given as injection as well, though I could prove that both functions g and f are injections using function mapping diagram.

No, you don't need that g is an injection.
And if gf is an injection, then it does NOT imply that g is an injection.
 
Ok I could prove it by contradiction. Assuming f(x) is not injection, then

Then there's the case where f(a) = f(b) and a != b for some a, b

Then g(f(a)) = g(f(b)) where a != b, which contradicts the given argument.
 
That is ok. But there is no need for a contradiction argument.

If f(a)=f(b). Taking g of both sides, we get g(f(a))=g(f(b)). By hypothesis, this implies a=b.
 
  • #10
Got it! Any good reference that helps with doing proper proofs?

Thanks.
 
  • #11
The book "How to think like a mathematician" by Kevin Houston is a good book.
 

Similar threads

Replies
7
Views
2K
Replies
10
Views
2K
Replies
9
Views
2K
Replies
2
Views
2K
Replies
6
Views
2K
Replies
1
Views
1K
Replies
10
Views
2K
Back
Top