Showing if f and g are bijective then so is g o f

  • Thread starter Thread starter bonfire09
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving that the composition of two bijective functions, ##g \circ f##, is also bijective. The functions are defined as ##f:A→B## and ##g:B→C##, and participants are exploring the necessary conditions for this property to hold.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the process of proving that ##g \circ f## is one-to-one and onto. There are attempts to clarify the starting points for these proofs, particularly regarding the assumptions made about the functions involved.

Discussion Status

Some participants have provided feedback on the attempts made, suggesting corrections and clarifications. There is an ongoing exploration of the correct approach to demonstrate that ##g \circ f## is onto, with some guidance offered regarding the necessity of starting with arbitrary elements from the respective sets.

Contextual Notes

Participants are navigating the definitions of bijective functions and the implications of these definitions on the composition of functions. There are discussions about the uniqueness of elements in the context of the proofs being presented.

bonfire09
Messages
247
Reaction score
0

Homework Statement


If ##f## and ##g## are bijective functions and ##f:A→B## and ##g:B→C## then ##g \circ f## is bijective.

Homework Equations


The Attempt at a Solution


Showing ##g \circ f## is one to one
Suppose that ##g\circ f(a_1)=g\circ f(a_2)=> g(f(a_1))=g((f(a_2))## Since ##g## is one to one then ##f(a_1)=f(a_2)=b##. But since f is bijective there exists ##a_1## and ##a_2## in ##A## such that ##f(a_1)=b## and ##f(a_2)=b##. Since f is one to one then ##a_1=a_2##
Showing ##g \circ f## is onto
Since ##f## is onto there exists a ##a\in A## such that ##f(a)=b## where ##b\in B##. Then ##g(b)=c## for a ##c\in C## since g is onto. Thus ##g(b)=g(f(a))=c## implies that ##g \circ f## is onto.

Would this be right?
 
Last edited:
Physics news on Phys.org
bonfire09 said:
Showing ##g \circ f## is one to one
Suppose that ##g(b_1)=g(b_2)##
Not a good start. You need to start with supposing ##g \circ f (a_1) = g \circ f (a_2)##
 
I fixed it now. Is the onto part correct?
 
bonfire09 said:
I fixed it now. Is the onto part correct?

Not really. You should start with some arbitrary c in C then prove there exists an a in A such that etc.
 
Oh I was thinking that the range of f is in the domain of g so I thought I could do that. I'm curious why is the way I did it was wrong?
 
bonfire09 said:
Oh I was thinking that the range of f is in the domain of g so I thought I could do that. I'm curious why is the way I did it was wrong?
You started with a b in B and found from that an a in A and a c in C. But the second of those did not require g to be onto. g is defined on B, so there would have to be a c in C. So you did not show that for any c in C there is an a in A.
 
I fixed the onto part.Here it is. Since ##g## is onto then for every ##c\in C## there exists a unique ##b\in B## such that ##g(b)=c##. Since ##f## is onto there exists a ##a\in A## such that ##f(a)=b##. Now we see ##c=g(b)=g(f(a))=g\circ f(a)##. Thus ##g \circ f## is onto
 
bonfire09 said:
I fixed the onto part.Here it is. Since ##g## is onto then for every ##c\in C## there exists a unique ##b\in B## such that ##g(b)=c##. Since ##f## is onto there exists a ##a\in A## such that ##f(a)=b##. Now we see ##c=g(b)=g(f(a))=g\circ f(a)##. Thus ##g \circ f## is onto
Good. (But it is not necessary that b is unique for this part of the proof.)
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
1K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K