Every nonidentity element in a free group $F$ has infinite order I'm trying to prove that every nonidentity element in a free group $F$ has infinite order. I'm really new on free groups and I found this subject really strange I couldn't understand it very well yet, I need a help or a hint to solve this question.
I attached the definition of free groups:

Thanks in advance
 A: A free group $F$ on a set of symbols $S$ is the set of all possible reduced words formed from the symbols and their formal inverses, with multiplication given by concatenation and reduction.  A word is reduced if no symbol appears next to its formal inverse in the word.
For a simple example, let's consider the free group on the $2$ symbols $x$ and $y$.  The following is a list of all possible reduced words of length less than or equal to $2$:
$$\varnothing,x,y,x^{-1},y^{-1},xx,xy,xy^{-1},yx,yy,yx^{-1},x^{-1}y,x^{-1}x^{-1},x^{-1}y^{-1},y^{-1}x,y^{-1}x^{-1},y^{-1}y^{-1}$$
where $\varnothing$ is the empty word.  We multiply by concatenating words, and reducing, that is, removing the subwords $xx^{-1}$, $yy^{-1}$, $x^{-1}x$, and $y^{-1}y$.  For example, we have the products
$$xy^{-1}\cdot xy=xy^{-1}xy\\xy^{-1}\cdot yy=xy^{-1}yy=xy$$
This product satisfies the group axioms, and we see that $\varnothing$ is the identity of the group.
I recommend playing around a bit with arbitrary elements and their concatenations to get a feel for how elements multiply.  Specifically, try to write down an element with finite order, and see what happens.
For a rigorous proof, suppose that for an arbitrary set $S$, we have a reduced word $s_1^{e_1}\ldots s_l^{e_l}$ with finite order, say $n>1$.  Here the $s_i\in S$ and $e_i=1$ or $-1$.  Then we have
$$s_1^{e_1}\ldots s_l^{e_l}s_1^{e_1}\ldots s_l^{e_l}(\ldots) s_1^{e_1}\ldots s_l^{e_l}s_1^{e_1}\ldots s_l^{e_l}=\varnothing$$
where we write the word next to itself $n$ times.  Notice it follows that $s_1^{e_1}s_l^{e_l}=\varnothing$, and that $s_2^{e_2}\ldots s_{l-1}^{e_{l-1}}$ also has order $n$.  We continue this process until we reach the middle of the word, noting that $s_i^{e_i}s_{l-i+1}^{e_{l-i+1}}=\varnothing$ for all $i=1,2,\ldots,\lfloor\frac{l+1}{2}\rfloor$.  Then we can cancel from the inside out, showing that our original word was in fact $\varnothing$, a contradiction as $n>1$.
A: Intuitively, a free group $F$ on a set of generators $S$ is the most economic way of turning $S$ into a group without introducing any relations among the generators other than what is absolutely necessary in order to obtain a group. If $g\in F$ is a non-identity element, then it can't satisfy the relation $g^n=e$, for $n>0$, since that would be an extra relation which is not necessary for $S$ to be turned into a group. So, all non-identity elements have infinite order. 
To prove it, here is a first step. Let $g\in F$. Then $g$ can be represented as a word in the generators $S$ and their formal inverses, and assume it's written in such a way the word can't be reduced (i.e., no adjacent $s$ and $s^{-1}$). Suppose the first letter is $s$. If the last letter is not $s^{-1}$, then the length of any power $g^n$ will be at least the length of the word you started with (since the only way for it to become shorter is for the first and last letter to cancel, which, under the assumption, can't happen). Thus, the only way for any power of $g$ to become the identity (i.e., a word of length $0$), is for the original word to have length $0$, i.e., $g=e$. Now analyze what happens if the first and last letter of $g$ are inverses of each other. 
A: Let $g \in F$ be a non empty reduced word. Take a reduced subword $h$ of $g$ of maximal length such that $g=hxh^{-1}$ for some reduced word $x \in F$. Because $g$ is reduced, $x$ is non empty, and by maximality, there is no cancellation in the product $xx$. Therefore, $hx^nh^{-1}=g^n$ is a reduced word; hence $g^n \neq 1$.
A: Let $F$ be a free group over the generator set $X$.
Assume $F$ has elements of finite order.
As element of $F$, we can write these elements as reduced words with letters from $X\cup X^{-1}$ and their inverses. Let $l(\omega)\in\mathbb N_0$ denote the length of word $\omega$, that is (in your posted definition) the number of sequence terms that are $\ne 1$.
Among all elements $\ne1$ of finite order select one element $\alpha$ that has minimal length $l(\alpha)>0$.
Assume that the last letter of that word $\alpha$ is the inverse of the first letter, so $\alpha=x\beta x^{-1}$ with $l(\beta)=l(\alpha)-2$ (note that $x\ne x^{-1}$ for $x\in X\cup X^{-1}$ by definition, so surely $l(\alpha)\ge2$).
Because $\beta^n=(x^{-1}\alpha x)^n=x^{-1}\alpha^nx=x^{-1}x=1$ if $\alpha^n=1$, we see that $\beta$ has finite order and is shorter than $\alpha$. By minimality of $\alpha$, we conlcude $\beta=1$, but then $\alpha=xx^{-1}$ was not reduced - contradiction.
Therefore the last first and last letter of $\alpha$ are not inverse of each other.
This means that no cancellation takes place when multiplying (i.e. concatenating copies of) $\alpha$ repeatedly. Thus $l(\alpha^n)=n l(\alpha)>0$ and $\alpha^n\ne 1$ for all $n\ge 1$. This contradicts the assumption that $\alpha$ has finite order.
A: This has been satisfactorily answered but I originally came here looking for a proof that appealed to the universal property and without so much explicit computation on the reduced words. I didn't find it so here's my stab.
Let $F$ be free on $X$, let $a\in F$, $|a| = n$. Writing $a$ as a reduced word gives, $a = x^{\delta_1}...x^{\delta_m}$. Let $p$ be a prime s.t. $p>n$ and $p > |\sum \delta_i|$. Consider the map $f:X\rightarrow \mathbb{Z}_p$, $x\mapsto \bar{1}$. By the universal property, $f$ induces a homomorphism $\bar{f}$. We have that $\bar{f}(a) = \sum \delta_i \mod p \neq 0 \mod p$, so the image of $\bar{f}(\langle a \rangle)$ is a non-trivial subgroup of $\mathbb{Z}_p$ of size at most $n$, which is a contradiction since $p$ has no proper divisors.
