generator for the mutiplicative group of a field
Proposition 1
The multiplicative group K* of a finite field
K is cyclic.
Theorem 3.1 in the finite fields (http://planetmath.org/FiniteField) entry proves
this proposition along with a more general result:
Proposition 2
If for every natural number d, the equation xd=1 has at most d solutions in a finite group
G then G is cyclic. Equivalently, for any positive divisor
d of |G|.
This last proposition implies that every finite subgroup of the multiplicative group of a field (finite or not) is cyclic.
We will give an alternative constructive proof of Proposition 1:
We first factorize q-1=∏ni=1peii. There exists an element yi in K* such that yi is not root of x(q-1)/pi-1, since the polynomial has degree less than q-1 . Let zi=y(q-1)/peiii. We note that zi has order peii. In fact zpieii=1 and zpiei-1i=y(q-1)/pii≠1.
Finally we choose the element z=∏ni=1zi. By the Theorem 1 here (http://planetmath.org/OrderOfElementsInFiniteGroups), we obtain that the order of z is q-1 i.e. z is a generator of the cyclic group
K*.
Title | generator for the mutiplicative group of a field |
---|---|
Canonical name | GeneratorForTheMutiplicativeGroupOfAField |
Date of creation | 2013-03-22 16:53:17 |
Last modified on | 2013-03-22 16:53:17 |
Owner | polarbear (3475) |
Last modified by | polarbear (3475) |
Numerical id | 16 |
Author | polarbear (3475) |
Entry type | Result |
Classification | msc 11T99 |
Classification | msc 12E20 |