Inverse Function Proof: f and g are Isomorphisms

Click For Summary

Homework Help Overview

The discussion revolves around the properties of inverse functions, specifically focusing on the proof that if a function f has an inverse g, then g is both one-to-one and onto. The subject area includes concepts of bijective functions and isomorphisms.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants explore the definitions of one-to-one and onto functions, questioning how these properties relate to the bijectiveness of the inverse function g. There are attempts to clarify the implications of these definitions and how to prove that g is bijective.

Discussion Status

The discussion is active, with participants engaging in clarifying definitions and exploring the proof structure. Some guidance has been provided regarding the steps needed to demonstrate that g is one-to-one, but there is no explicit consensus on the complete proof yet.

Contextual Notes

Participants are working within the constraints of homework rules, focusing on understanding rather than providing complete solutions. There are indications of uncertainty regarding the definitions and the proof process, particularly concerning the terms "codomain" and "range."

kathrynag
Messages
595
Reaction score
0

Homework Statement



If f:x-->y has an inverse function g, then g:y--->x is one to one and onto

Homework Equations





The Attempt at a Solution


Let g be the inverse of f:x--->y
I think this must have something to do with an isomorphism because of one to one and onto.
 
Physics news on Phys.org
has more to do with the function being bijective which is both one-one and onto (injective and surjective)

just have to work the definitions, one-one means that only one distinct element gets mapped, and onto implies that the entire range has to be mapped, together these conditions guarantee that only one element gets uniquely mapped to another element throughout the domain we are working in.
 
Ok, I understand those defintions. My problem is understanding why g has to be bijective.
 
Do you know how to prove that a function is bijective?
 
show a(x)=a(y) implies x=y
onto, not entirely sure. I know it has something to do with showing entire range is used
 
kathrynag said:
onto, not entirely sure. I know it has something to do with showing entire range is used
Not the range, but the codomain, i.e. for every y in the codomain, there is an x in the domain with y = f(x).
 
Let g be the inverse of f:y--->x

Then g(a)=g(b)
a=b
Does this prove one to one? For some resaon I think it doesn't.
 
There is an intermediate step between "g(a) = g(b)" and "a = b". How would get rid of the g in g(a) to get a?
 
I'm blanking on that
 
  • #10
Apply the inverse of g to both sides of the equation.
 
  • #11
so g^(-1)g(a)=g^(-1)g(b)?
 
  • #12
If g is the inverse of f, then what is the inverse of g? Also, what does g^{-1}(g(a)) evaluate to?
 
  • #13
f is the inverse of g?
 
  • #14
That's right. And what about the answer to my second question.
 
  • #15
f(g(a))
 
  • #16
And that simplifies to ...
 
  • #17
a I think
 
  • #18
That's right. Now what is the complete proof that g is one-to-one?
 
  • #19
by showing a=b
 

Similar threads

Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
13
Views
5K
Replies
20
Views
5K
Replies
2
Views
2K
Replies
2
Views
2K