Composition Of Functions Implies Equality

  • Thread starter netcaster
  • Start date
  • #1
4
0
We have three functions: f:A->A, g:A->A and h:A->A
with both f and g bijective and h bijective.

We know that f ° h = h ° g for every x in A.

Is it true that f=g for every x in A?

I have tried to solve it and I am pretty sure it is true but I can find neither a counterexample nor a simple proof.
 

Answers and Replies

  • #2
HallsofIvy
Science Advisor
Homework Helper
41,833
956
Take A= {1, 2, 3}, f= {(1,3), (2,1), (3,2)}, g= {(1,2), (2,3), (3,1)}, h= {(1,3), (2,3), (3, 1)}.
 

Related Threads on Composition Of Functions Implies Equality

  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
3
Views
4K
Replies
1
Views
2K
  • Last Post
Replies
18
Views
4K
  • Last Post
Replies
11
Views
217
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
19
Views
2K
  • Last Post
Replies
3
Views
3K
Replies
8
Views
2K
Top