A function g from a set to itself satisfies for positive integers m and n with . Here stands for g ◦ g ◦ · · · ◦ g (n times). Show that g is one-to-one if and only if g is onto. (Some of you may have seen the term “one-one function” instead of “one-to-one function”. Both mean the same.)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Only If part. Assume g is 1−1. We will show that g−1 exists and this will prove the claim.
Since g is 1−1, so is gj, for any positive integer j. Now, we have for all x∈X, and the given m and n, gm(x)=gn(x), i.e. gn⊙gm−n(x)=gn(x). From the 1−1 property of gn, we get gm−n(x)=x, for all x∈X. Hence, g−1 exists and is given by gm−n−1 (if m=n+1, g is then the identity mapping). This proves the claim.
If part can be solved by similar ideas.
Log in to reply
Nice!