Fix several typos

This commit is contained in:
Anton Mosich 2023-01-26 21:05:22 +01:00
parent 81795e79c8
commit cc47b505a4
Signed by: Flugschwein
GPG key ID: 9303E1C32E3A14A0

View file

@ -403,10 +403,10 @@ $e = 0, g^n = n \cdot g, \inv g = -g$
$a^r = e, b^s = e \implies a^{rs} = e, b^{rs} = e \overset{\text{abelsch}}{\implies} (ab)^rs = e
\implies \ord_G(ab) \mid rs$ \\
Angenommen: $\ord_G(ab) < rs$. Dann $\exists p \in \Primes: (ab)^{\frac{rs}p} = e$. \\
Sei oBdA $p\mid r (\implies p \nmid r, \text{ weil }(r, s) = 1)$
Sei oBdA $p\mid r (\implies p \nmid s, \text{ weil }(r, s) = 1)$
\[
(ab)^{\frac{rs}p} = a^{\frac{rs}p} \cdot b^{\frac{rs}p} = (a^s)^{\frac rp} \cdot
{\underbrace{(b^s)}_{=e}}^{\frac{rs}p} = (a^s)^{\frac{rs}p} = e
{\underbrace{(b^s)}_{=e}}^{\frac{r}p} = (a^s)^{\frac{r}p} = e
\]
Die Ordnung von $a$ und daher von $a^s$ ist aber $r$ und daher sicher $>
\frac rp$. \qed