Next: Primitive n mathend000#-th roots of
Up: Computing primitive n mathend000#-th roots
Previous: Computing primitive n mathend000#-th roots
Definition 4
Let (G,.)
mathend000# be a (multiplicative) group with neutral element e
mathend000#.
A nonempty subset
H G
mathend000# is a subgroup of G
mathend000#
if the following three statements hold
- e H
mathend000#,
- for every
x, y H
mathend000# we have
x y H
mathend000#,
- for every x H
mathend000# the inverse x-1
mathend000# of x
mathend000# belongs to H
mathend000#.
Theorem 3
For every subgroup H
mathend000# of the additive abelian group
(, +)
mathend000#
there exists an element
a
mathend000# such that H
mathend000# is the set
of the multiples of a
mathend000#, that is
H = a
mathend000#.
Theorem 4
Let G
mathend000# be a multiplicative group with neutral element e
mathend000#.
Let x G
mathend000# an element and gr(x
mathend000#)
the subgroup of H
mathend000# consisting of all powers of x
mathend000# (including
e = x0
mathend000# and x-1
mathend000# the inverse of x
mathend000#).
Let
(x)
mathend000# be the order of gr(x
mathend000#),
that is the cardinality of gr(x
mathend000#).
Then two cases arise
- either gr(x
mathend000#) is infinite and then the powers
of x
mathend000# are pairwise different and thus H
mathend000# is isomorphic to
mathend000#.
- or gr(x
mathend000#) is finite and we have the following properties
-
(x)
mathend000# is the smallest integer n
mathend000# such that xn = e
mathend000#,
-
xm = xm'
mathend000# iff
m m'mod (x)
mathend000#,
- H
mathend000# is isomorphic to
(/n) {0}
mathend000# where
n = (x)
mathend000#,
-
H = {e, x, x2,..., xn-1}
mathend000# where
n = (x)
mathend000#.
Theorem 5 (Lagrange)
For every subgroup H
mathend000# of the finite group G
mathend000#, the
order (that is the cardinality) of H
mathend000# divides that of G
mathend000#.
Next: Primitive n mathend000#-th roots of
Up: Computing primitive n mathend000#-th roots
Previous: Computing primitive n mathend000#-th roots
Marc Moreno Maza
2007-01-10