Composition Of Functions Implies Equality

Click For Summary
The discussion revolves around the relationship between three bijective functions f, g, and h defined on the same set A. It is established that if f ° h = h ° g for every x in A, the question arises whether this implies f = g for all x in A. A user presents a specific example with A = {1, 2, 3} and defines f, g, and h, seeking to prove or disprove the equality of f and g. Despite attempts to find a counterexample or a straightforward proof, the conclusion remains uncertain. The thread highlights the complexity of function composition and the implications of bijectivity in this context.
netcaster
Messages
4
Reaction score
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.
 
Mathematics news on Phys.org
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)}.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K