×

# problem about function and relation mappimg

a function g from a set X to itself satisfies g^m=g^n for positive integers m and n with m>n.Here g^n stands for gogogo.......og(n times).Show that g is one one function iff g is onto function.

Note by Sayan Chaudhuri
5 years, 1 month ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

may I present a solution?

1)If g is one-to-one then:

$$g^{(m)}=g^{(n)}\Rightarrow{g^{(m-n)}(x)=x}$$ and for some $$x_{0}\in{Χ}$$

$$g^{(m-n)}(x_{0})=x_{0}$$

if we set $$g^{(m-n-1)}(x_{0})=a$$ then $$g(a)=x_{0}$$ which implies that for every $$x_{0}\in{X},\exists{a}: g(a)=x_{0}$$, which is the definition of a surjective function.

2)If g is onto, and we set $$g^{(n)}(x_{0})=c$$ for some $$x_{0}$$ then, for all c, we have that $$g^{(m-n)}(c)=c$$.What we don't know yet is whether an $$x_{0}$$ can be assigned to every value of c. But we can easily prove that if g is onto, $$g^{(n)}$$ is onto. Now we can conclude that

$$g(x_{1})=g(x_{2})\Rightarrow{g^{(m-n)}(x_{1})=g^{(m-n)}(x_{2})}\Rightarrow{x_{1}=x_{2}}$$ which is valid for every $$x_{1},x_{2}\in{X}$$ as we proved above, so g is 1-1.

- 5 years, 1 month ago

which book is this excerpt from?

- 5 years, 1 month ago