How Do You Prove That g Equals f^-1 Given Composition Identities?

[Punkyc7]

Let f and g be functions such that (g\circf)(x)=x for all x \epsilonD(f) and (f\circg)(y)=y for all y \epsilonD(g). Prove that a g = f^-1

Pf/

How would you go about starting this besides saying

Let f and g be functions such that (g\circf)(x)=x for all x \epsilonD(f) and (f\circg)(y)=y for all y \epsilonD(g).

isn't obvious that the functions would have to be the inverse of each other, How else could you get the identity? So how do you prove it, can I just say clearly it is.

 

[benorin]

What does g = f^-1 mean? My calc text gives this definition:

g = f^-1 if, and only if, f(x) is a one-to-one function with domain D(f) and range D(g) such that

g(y)=x <=> f(x)=y for all y in D(g).

Start with the given and prove this definition must be true.

 

[Punkyc7]

g= f^-1 means that g is the inverse of f

 

[Punkyc7]

How do you prove a definition true. If its a definition shouldn't it always be true?

 

[Punkyc7]

This is what I have been able to get to

(g\circf)(x)=x for all x ϵD(f) and (f\circg)(y)=y for all y ϵD(g).So choose
g(y)=x and f(x)=y

so

x=g(y)=f^-1(y)

ans since f and g are bijections we can conclude g=f^-1does that work