Recent content by netcaster

  1. N

    Composition of functions implies equality

    Your example is based on permutations.. What if h is only surjective rather than bijective? The counterexample is not anymore valid...
  2. N

    Composition of functions implies equality

    Many thanks! Your solution is simple and hence great!
  3. N

    Composition of functions implies equality

    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 cannot find neither a counterexample nor a...
  4. N

    Graduate Composition Of Functions Implies Equality

    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...