2025-04-20

1084: For Field and Prime Number, if Characteristic of Field Is 0 or Larger Than Prime Number, Field Can Be Extended to Have Primitive Prime-Number-th Root of 1

<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 and prime number, if characteristic of field is 0 or larger than prime number, field can be extended to have primitive prime-number-th root of 1

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 and any prime number, if the characteristic of the field is 0 or larger than the prime number, the field can be extended to have a primitive prime-number-th root 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 }
Ch(F): = the characteristic of F
p: { the prime numbers }
//

Statements:
Ch(F)=0p<Ch(F)

F{ the extended fields of F}(ωpF(p is the smallest jN{0} such that ωpj=1))
//


2: Proof


Whole Strategy: Step 1: take p(x)=xp1F[x]; Step 2: take an extended field of F, F, such that for the extended polynomial of p(x), p(x)(x)F[x], p(x)(x)=(xα1)...(xαp); Step 3: let the smallest positive natural number power to which αj is 1 be kj, and see that kj is a divisor of p; Step 4: suppose that all the kj s were 1, and find a contradiction; Step 5: conclude the proposition.

Step 1:

Let us take p(x)=xp1F[x].

Step 2:

Let us take an extended field of F, F, such that for the extended polynomial of p(x), p(x)(x)F[x], p(x)(x)=(xα1)...(xαp), which is possible by the proposition that for any field, the polynomials ring over the field, and any larger-than-1-degree irreducible polynomial, the field can be extended to have a root of the polynomial in the polynomials ring over the extended field, which (the extended field) is 'fields - homomorphisms' isomorphic to any smallest such: refer to its Note 2.

Step 3:

Each αj satisfies αjp=1, because p(x)(αj)=αjp1=0.

Let the smallest lN{0} such that αjl=1 be kj. 1kjp.

kj is a divisor of p, because taking p=kjq+r where 0r<kj, αjp=αjkjq+r=αjkjqαjr=(αjkj)qαjr=1qαjr=1αjr=αjr=1, which implies that r=0: otherwise, r would be a smaller than the smallest kj.

So, as p is a prime number, kj=1 or p.

Step 4:

Let us suppose that all the kj s were 1.

That would mean that αj1=αj=1.

p(x)(x)=xp1=(xα1)...(xαp)=(x1)...(x1)=xp(1+...+1)xp1+..., where "1+...+1" is the addition of p 1 s. But as Ch(F)=0 or p<Ch(F), 1+...+10, a contradiction against its being xp1.

So, there is at least 1 kj=p.

Step 5:

Then, αj is a primitive root of 1 on F.


References


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