2025-01-19

969: For Field, if Field Has Primitive Positive-Natural-Number-th Root of 1, 1 to Natural-Number Powers of Primitive Root Are Roots

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for field, if field has primitive positive-natural-number-th root of 1, 1 to natural-number powers of primitive root are roots

Topics


About: field

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any field, if the field has a primitive positive-natural-number-th root of 1, the 1 to the-natural-number powers of the primitive root are the the-natural-number-th roots of 1.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
F: { the fields }
n: N{0}
R1,n: ={αF|αn=1}
//

Statements:
ωF(ωn=1j{1,...,n1}(ωj1))

R1,n={ω,...,ωn=1}
//

When n=1, j{1,...,n1}(ωj1) is vacuously true.


2: Note


There may not be such any ω. For example, when F=R and n=3, x3=1 has only 1 root, 1, which does not satisfy the condition: x1=1. Of course, if we take F=C, there is ω=e2πi/3F.


3: Proof


Whole Strategy: Step 1: see that {ω,...,ωn=1} is distinct; Step 2: see that each ωjR1,n; Step 3: see that there is no other element in R1,n.

Step 1:

Let us see that {ω,...,ωn=1} is distinct.

Let us suppose that ωj=ωk where 1j,kn with jk without loss of generality.

ω0, because if ω=0, ωn=0, by the proposition that for any field, any positive-natural-number-th root of 0 is 0, but 01 and ωn=01, a contradiction.

So, there is an inverse, ω1. 1=ωjωj=ωkωj=ωkj. As 0kj<n, kj=0, which means that k=j.

Step 2:

Let us see that each ωj where 1jn is in R1,n.

(ωj)n=ωjn=(ωn)j=1j=1.

Step 3:

Let us see that there is no other element in R1,n.

Let us think of the polynomials ring over F, F[x].

Take p(x)=xn1F[x].

p(ω)=ωn1=0, so, p(x)=(xω)q1(x) for a q1(x)F[x], an (n1)-degree polynomial, by the proposition that for the polynomials ring over any field and any nonconstant polynomial, if and only if the evaluation of the polynomial at a field element is 0, the polynomial can be factorized with x - the element.

0=(ω2)n1=p(ω2)=(ω2ω)q1(ω2), but ω2ω0, and so, q1(ω2)=0. So, q1(x)=(xω2)q2(x) for a q2(x)F[x], an (n2)-degree polynomial, by the proposition that for the polynomials ring over any field and any nonconstant polynomial, if and only if the evaluation of the polynomial at a field element is 0, the polynomial can be factorized with x - the element.

And so on, after all, p(x)=(xω)...(xωn)qn(x) for a qn(x)F[x], an (nn=0)-degree polynomial, in fact, a nonzero constant, qn(x)=c.

Then, for any aF{ω,...,ωn=1}, p(a)0, because each aωj0: if (aω)...(aωn)c=0, aω=(aω)...(aωn)cc1(aωn)1...(aω2)1=0c1(aωn)1...(aωn)1=0, a contradiction.


References


<The previous article in this series | The table of contents of this series | The next article in this series>