Empty Group Word is Reduced
Jump to navigation
Jump to search
Although this article appears correct, it's inelegant. There has to be a better way of doing it.
Rather than mentioning them in passing and expecting the reader to understand what is meant, we need $w_i$ etc. to be defined. I know from experience that you can't rely on people involved in this website to have adequate knowledge, understanding or deductive abilities to be able to work it out for themselves.
You can help Proof Wiki by redesigning it.
Theorem
Let $S$ be a set
Let $\epsilon$ be the empty group word on $S$.
Then $\epsilon$ is reduced.
Proof
Rather than mentioning them in passing and expecting the reader to understand what is meant, we need $w_i$ etc. to be defined. I know from experience that you can't rely on people involved in this website to have adequate knowledge, understanding or deductive abilities to be able to work it out for themselves.
You can help Proof Wiki by redesigning it.
To discuss this proof in more detail, feel free to use the talk page.
If you are able to fix this proof, then when you have done so you can remove this instance of {{Improve}} from the code.
If you would welcome a second opinion as to whether your improvement is correct, add an invitation to {{Proofread}} the page (see the proofread template for usage).
By definition, a group word $w = w_1 \cdots w_i \cdots w_n$ is reduced if and only if $w_i \ne w_{i + 1}^{-1}$ for all $i \in \set {1, \ldots, n - 1}$, which is vacuously true for $\epsilon$.
$\blacksquare$
