Proof of Theorem: Composite Function Inverse

Click For Summary
The discussion centers on proving the theorem that states if functions f and g are bijective, then the inverse of their composition (g o f) equals the composition of their inverses (inverse of f o inverse of g). A user requests assistance with the proof, prompting suggestions to define f(x) = y and g(y) = z. The hint encourages computing (g o f) o (g o f)^-1 and (g o f)^-1 o (g o f) to demonstrate that both yield the identity function. This approach is aimed at establishing the validity of the theorem through direct computation. The conversation emphasizes the importance of understanding function composition and inverses in the context of bijective functions.
irvin.b
Messages
2
Reaction score
0
i really need to see the proof of this theorem:

if f and g are bijective then the inverse of (g o f) = inverse of f o inverse of g
 
Physics news on Phys.org
i hope you will help me..
 
what have you tried?
 
Hint: define f(x) = y and g(y) = z.
 
Just compute (g o f) o (g o f)^-1 and (g o f)^-1 o (g o f) and see that they both give you the identity.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 11 ·
Replies
11
Views
729
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K