This paper introduces a new structure theorem for finite fields of odd order, linking their multiplicative and additive properties, with applications to polynomials and number theory.
Contribution
It presents a novel structure theorem for finite fields of odd order, enhancing understanding of their algebraic properties and applications.
Findings
01
Improved understanding of Dickson and Chebyshev polynomials
02
New formulas with number-theoretic significance
03
Enhanced structural insights into finite fields
Abstract
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev polynomials and some formulas with a number-theoretic flavor. This paper is an abridged version of two math arXiv articles by the author [arXiv:1707.06870, arXiv:1707.06877].
Equations89
Ov={v,1/v,−v,−1/v},
Ov={v,1/v,−v,−1/v},
(τ+τ−1)A=τ+Aτ−1.
(τ+τ−1)A=τ+Aτ−1.
(qτ)=A,(qτ−1)=B⟺vq−AB=A.
(qτ)=A,(qτ−1)=B⟺vq−AB=A.
vq=(τ)q+(τ−1)q=Aτ+Bτ−1=A(τ+ABτ−1)=AvAB.
vq=(τ)q+(τ−1)q=Aτ+Bτ−1=A(τ+ABτ−1)=AvAB.
O1↦(1/4)(1+1/1)2=1;1↦{±1±0}={1,−1}.
O1↦(1/4)(1+1/1)2=1;1↦{±1±0}={1,−1}.
Oi↦(1/4)(i+1/i)2=0;0↦{±0±−1}={i,−i}
Oi↦(1/4)(i+1/i)2=0;0↦{±0±−1}={i,−i}
Oζ↦(ζ+1/ζ)2/4=(i+1/i+2)/4=2/4=2;
Oζ↦(ζ+1/ζ)2/4=(i+1/i+2)/4=2/4=2;
2↦{±2±1}={±−1±1}={±i±1}=?Oζ
2↦{±2±1}={±−1±1}={±i±1}=?Oζ
(i−1)2=−1+1−2i=i,so i−1=±ζ in char.3, showing i−1∈Oζ.
(i−1)2=−1+1−2i=i,so i−1=±ζ in char.3, showing i−1∈Oζ.
Dk(2)=2,Dk(0)=⎩⎨⎧0−22if k is oddif k≡2(mod4)if k≡0(mod4)Dk(−1)={2−1if 3∣kif 3∤k.
Dk(2)=2,Dk(0)=⎩⎨⎧0−22if k is oddif k≡2(mod4)if k≡0(mod4)Dk(−1)={2−1if 3∣kif 3∤k.
Dm(x)=∏{x−b:b∈Fq,(q2−b)=(q2+b)=−1}.
Dm(x)=∏{x−b:b∈Fq,(q2−b)=(q2+b)=−1}.
Dm(x)=(q2)∏{b−x:b∈Fq,(q2−b)=(q2+b)=−1}.
Dm(x)=(q2)∏{b−x:b∈Fq,(q2−b)=(q2+b)=−1}.
D6(x)≡(x−3)(x−5)(x−8)(x−15)(x−18)(x−20)(mod23).
D6(x)≡(x−3)(x−5)(x−8)(x−15)(x−18)(x−20)(mod23).
Dm(b)=Dm(v2+1/v2)=v2m+1/v2m=v(q−ε)/2+v−(q−ε)/2.
Dm(b)=Dm(v2+1/v2)=v2m+1/v2m=v(q−ε)/2+v−(q−ε)/2.
Dm(x)=(−1)m∏{−(x−b):b∈Fq,(q2−b)=(q2+b)=−1}.
Dm(x)=(−1)m∏{−(x−b):b∈Fq,(q2−b)=(q2+b)=−1}.
Dm(2)=∏{2−b:2−b and 2+b are nonsquares}
Dm(2)=∏{2−b:2−b and 2+b are nonsquares}
2=∏{a∈Fq:a and 4−a are nonsquares}.
2=∏{a∈Fq:a and 4−a are nonsquares}.
(q2)2=∏{a∈Fq:−a and 4+a are nonsquares}.
(q2)2=∏{a∈Fq:−a and 4+a are nonsquares}.
∏{a∈Fq:s2−a and t2+a are nonsquares}=(q2+s)2=(q2)(q2+t)2.
∏{a∈Fq:s2−a and t2+a are nonsquares}=(q2+s)2=(q2)(q2+t)2.
Dm(w4+w−4)
Dm(w4+w−4)
∏{a∈Fq:s2−a and t2+a are nonsquares}=(q2)(qt+2)2.
∏{a∈Fq:s2−a and t2+a are nonsquares}=(q2)(qt+2)2.
∏{a∈Fq:2−a and 2+a are nonsquares}=(q2+2)2.
∏{a∈Fq:2−a and 2+a are nonsquares}=(q2+2)2.
C1(x)=x,C2(x)=2x2−1,C3(x)=4x3−3x.
C1(x)=x,C2(x)=2x2−1,C3(x)=4x3−3x.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We present a new structure theorem for finite fields of odd order
that relates multiplicative
and additive properties in an interesting way. This theorem has several applications, including an improved understanding of Dickson
and Chebyshev polynomials and some formulas with a number-theoretic flavor.
This paper is an abridged version of two Math ArXiv articles by the author.
1 The structure theorem
This paper is an abridged “less-is-more” version of two articles [1, 2], and it was written with the purpose
to accompany a lecture that will be given at the Fq14 conference in Vancouver in June 2019.
We present a new structure theorem for finite fields of odd order
that relates multiplicative
and additive properties in an interesting way. This theorem has several applications, including an improved understanding of Dickson
and Chebyshev polynomials and some formulas with a number-theoretic flavor.
In particular, the theorem is used to prove:
(i)
\prod\left\{\,a\in{{\mathbb{F}}}_{q}:\text{aand4-a are nonsquares}\,\right\}=2.
2. (ii)
The set S=\left\{\,a\in{{\mathbb{F}}}_{q}:\text{2+2aand2-2a are squares}\,\right\} is preserved by Chebyshev polynomials; that is,
s∈S implies Ck(s)∈S, where Ck(x) is the polynomial such that Ck(cosθ)=cos(kθ).
(E.g. C2(x)=2x2−1 and C3(x)=4x3−3x.)
This article contains complete proofs of these assertions.
We assume the reader has a solid understanding of finite fields. Let q be an odd prime power,
Fq the field with q elements, Fq its algebraic closure, and Fq× its nonzero elements, considered as a group under
multiplication.
If k>0 is relatively prime to q, let μk denote the group of kth roots of unity in Fq. Then μk has cardinality k,
and μq−1=Fq×.
If a∈Fq then (qa)∈Z
denotes the Legendre symbol, equal to 1, −1, or 0 according as
a is a nonzero square, a nonsquare, or 0. This is multiplicative:
(qab)=(qa)(qb). Also, when considered as an element
of Fq, (qa)=a(q−1)/2.
If 0=v∈Fq, define
[TABLE]
which we call the orbit of v. If w∈Ov, then Ow=Ov.
Thus, the decision on which element will label the orbit is arbitrary.
Here are some easy lemmas about Ov. At the end of this section, the lemmas will be pieced together into one theorem.
Lemma 1.1
w∈Ov⟺(v+1/v)2=(w+1/w)2⟺Ov=Ow.
Proof. The reader can verify the identity (w+1/w)2−(v+1/v)2=w−2(w−v)(w+v)(w−1/v)(w+1/v).
The left side vanishes if and only if (v+1/v)2=(w+1/w)2, and the right side vanishes if and only if w∈{v,−v,1/v,−1/v}=Ov.
Lemma 1.2
#Ov<4* if and only if v4=1. The orbits with fewer than 4 elements are {1,−1} and
{i,−i}, where i2=−1.*
Proof. If #Ov<4 then two of v,−v,1/v,−1/v coincide. The two elements v,−v are distinct since v is nonzero and the characteristic is odd.
Likewise 1/v,−1/v are distinct. So the only way that two can coincide is if v=1/v or v=−1/v. In the former case, v2=1 and the orbit
is {1,−1}. In the latter case, v2=−1 and the orbit is {i,−i}.
Lemma 1.3
Let f(x)=(x+1/x)2/4.
For v∈Fq×, f(v)∈Fq⟺v∈μ2(q−1)∪μ2(q+1).
Proof.
Let τ=f(v). Then
τ∈Fq⟺τ=τq⟺f(v)=f(vq)⟺vq∈Ov={v,−v,1/v,−1/v}.
The latter condition holds if and only if
vq−1=±1 or vq+1=±1, i.e., v∈μ2(q−1)∪μ2(q+1).
If k is even, then μk is closed under reciprocal and negation, so it partitions into disjoint orbits.
The intersection of μ2(q−1) and μ2(q+1) is μ4, which decomposes into the two “short obrits”
{1,−1}∪{i,−i}.
All orther orbits in μ2(q−1)∪μ2(q+1) have size 4.
The total number of orbits in μ2(q−1)∪μ2(q+1) is
2+(2q−2−4)/4+(2q+2−4)/4=q.
Lemma 1.4
The orbits of μ2(q−1)∪μ2(q+1) are in
bijection with Fq by the map Ov↦τ=f(v), where
f(x)=(x+1/x)2/4.
The orbit {1,−1} corresponds to τ=1 and the orbit
{i,−i} corresponds to τ=0.
Proof. This is immediate from Lemma 1.1, Lemma 1.3, and the observation in the previous paragraph that
μ2(q−2)∪μ2(q+2) has exactly q orbits.
Lemma 1.5
If τ∈Fq then the four elements
τ+τ−1, τ−τ−1,
−τ+τ−1, −τ−τ−1
constitute an orbit. Here any choice can be made for the square roots of
τ and τ−1. For A∈{1,−1} we have
[TABLE]
Proof. From the calculation (τ+τ−1)(τ−τ−1)=τ−(τ−1)=1, we see that
τ−τ−1
is the reciprocal of τ+τ−1. The result follows.
(Structure Theorem; [2, Theorem 4.1]).*
Let f(x)=(x+1/x)2/4. The map Ov↦f(v) gives a bijection
between orbits of
μ2(q−1)∪μ2(q+1) and elements of Fq. The inverse
map is τ↦Ov, where v=τ+τ−1
(and this orbit consists of the four elements
±τ±τ−1).
The two short orbits {1,−1} and {i,−i} correspond to τ=1 and τ=0, respectively.
If τ∈{0,1} (equivalently, v4=1),
then for A,B∈{1,−1} we have*
[TABLE]
Proof. The map Ov↦f(v) determines a well-defined
bijection from orbits of μ2(q−1)∪μ2(q+1) onto Fq
by Lemma 1.4. Let v=τ+τ−1, so
1/v=τ−τ−1. Then
f(v)=(v+1/v)2/4=(2τ)2/4=τ.
This shows that τ↦Ov is the inverse bijection.
The orbit Ov consists of the elements
±τ±τ−1 by Lemma 1.5.
Now we prove the last assertion. Assume
τ∈{0,1} and let (qτ)=A and
(qτ−1)=B.
By Lemmas 1.6 and 1.5,
[TABLE]
This shows that vq−AB=A, as claimed.
It is worth noting that if v∈μ2(q−1)∪μ2(q+1) then either (vq−1)2=1 or (vq+1)2=1, so there are A,B∈{1,−1} such that vq−AB=A.
If v∈{1,−1} then vq−1=vq+1=1 and
if v∈{i,−i} then
vq−1=(q−1) and vq+1=−(q−1). Thus, for v∈μ4,
values A,B are not unique. However, for all other
v∈μ2(q−1)∪μ2(q+1),
A and B are uniquely determined from v.
Example 1: Illustrate the theorem for F3. For q=3, μ2(q−1)∪μ2(q+1)=μ4∪μ8=μ8.
Let ζ be a primitive eighth root of unity and set i=ζ2, so i2=−1.
The orbits are O1={1,−1}, Oi={i,−i}, and Oζ={ζ,−ζ,1/ζ,−1/ζ}={ζ,ζ5,ζ7,ζ3}. The bijection is:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We illustrate the last sentence of theorem for τ=2:
A:=(qτ)=(32)=−1;
B:=(qτ−1)=(31)=1,
therefore v=ζ should satisfy vq−AB=A, i.e. v4=−1.
Exercise: Illustrate the theorem for F5.
Examples 2 and 3 use the structure theorem to derive formulas for the Legendre symbols (q2) and (q−3).
Example 2: Since 8 divides 2(q−1) or 2(q+1) for any q, Oζ is always an orbit of μ2(q−1)∪μ2(q+1), where ζ4=−1.
The image of Oζ is (ζ+1/ζ)2/4=1/2.
The inverse bijection sends 1/2 to {±1/2±−1/2}.
Thus, {±ζ,±1/ζ}={±1/2±−1/2}.
Let A=(q1/2)=(q2) and B=(q−1/2)=ε(q2),
where ε=(q−1)=(−1)(q−1)/2. Note that ε=1⟺(q−1)/2 is even ⟺q≡1(mod4)
and ε=−1⟺q≡3(mod4). Thus, q≡εmod4. By the theorem, we have
ζq−AB=A, which can be written as ζq−ε=(q2), or alternatively,
[TABLE]
This is a known result, but it is interesting to see how it relates to the theorem.
Example 3: Suppose that 3∤q. Then 3 divides 2(q−1) or 2(q+1). Let ω be a primitive cube root of unity, so ω2+ω+1=0.
Then Oω↦(ω+1/ω)2/4=(ω2+1/ω2+2)/4=(ω2+ω+2)/4=(−1+2)/4=1/4.
The inverse bijection sends τ=1/4 to the orbit {±1/4±−3/4}={±(1/2)±(−3/2)}.
Let A=(qτ)=1 and B=(qτ−1)=(q−3/4)=(q−3). The structure theorem guarantees that ωq−B=1.
Thus, 3∣(q−B)=q−(q−3). In other words, (q−3)=1 if and only if q≡1(mod3).
Again, this is a known result.
Exercise:
Suppose that 5∤q, and let ζ∈Fq be a
primitive fifth root of unity. Use the structure theorem to show
that Oζ corresponds to an element of Fq iff q≡±1(mod5). Next, show that u=4f(ζ)−2 satisfies u2+u−1=0, and that f(ζ)=(2+u)/4∈Fq⟺(q5)=1. Conclude
that (q5)=1⟺q≡±1(mod5).
2 Dickson and Chebyshev polynomials
The kth Dickson polynomial of the first kind, Dk(x)∈Z[x], is determined by the recursion
[TABLE]
The first few are:
[TABLE]
[TABLE]
It can be shown by induction that Dk(x) is a monic polynomial of degree k, and
[TABLE]
where u is an indeterminate. In fact, this functional equation determines Dk uniquely and could
serve as an alternate definition. Substituting −u for u in the functional equation implies the well-known fact that
[TABLE]
Substituing u=1, i, or ω in the functional equation (where ω2+ω+1=0), we find
[TABLE]
Let m=(q−ε)/4, where ε=(−1)(q−1)/2. In Eq. (1) we observed that m∈Z and (−1)m=(q2).
We use the structure theorem to prove a new factorization for Dm(x) in Fq[x].
Theorem 2.1
(Factorization of Dickson polynomials;
[2, Theorem 8.1]).* In Fq[x], we have*
[TABLE]
Also,
[TABLE]
Example:q=23. Then ε=(−1)(23−1)/2=−1, m=(q−ε)/4=6,
D6(x)=x6−6x4+9x2−2. It is easy to verify that 2±b are both nonsquares iff b∈{3,5,8,15,18,20}. The theorem asserts that
[TABLE]
Proof. To prove (2), we’ll show: (i) if b∈Fq and 2±b are nonsquares, then Dm(b)=0;
and (ii) there are m such b’s.
Write b=v2+1/v2. Then
[TABLE]
Let Ov⟷τ. Then τ=(v+1/v)2/4=(b+2)/4. Let A=(qτ) and B=(qτ−1).
Then A=(qb+2)=−1 and B=(q−1)(q2−b)=−ε.
By the structure theorem, vq−AB=A, i.e., vq−ε=−1.
Then v(q−ε)/2=i is a square root of −1, and so Dm(b)=i+1/i=0.
To show there are exactly m such b’s, the above calculation shows that
τ=(b+2)/4=(v+1/v)2/4 such that vq−ε=−1.
There are exactly q−ε such v, and if v is a solution then
so is every element of its orbit. Note that
v4=1, as otherwise vq−ε=(v4)m=1m=1.
Thus, the solutions to vq−ε=−1 partition into exactly
(q−ε)/4=m orbits, hence m such b’s. This proves (2).
To prove (3), multiply each term in the product by −1 to obtain:
Examples: We illustrate the formula (4) for q=7 and q=9.
q=7: The nonsquares in F7 are 3, 5, 6. Both a and 4−a are nonsquares iff a∈{5,6}. The product of these is
5×6=2(mod7).
q=9:
F9={c+di:c,d∈{0,1,2}},
where i2=−1. The squares are (c+di)2=c2−d2−cdi, and the nonsquares
are {c+di:cd=0}.
Both a and 4−a are nonsquares if and only if a=2±i, and their product is (2+i)(2−i)=4+1=2.
3 Wilson-like theorems
Wilson’s Theorem famously states that
∏Fq×=−1. We give the name “Wilson-like theorems” for theorems in which the product over an easily-described subset of
Fq× gives an easily-described result. Formulas (4) and (5) are examples of Wilson-like theorems. We can obtain many more.
Proof. The first two formulas are (4) and (5), and they were obtained by setting x=2 in
(2) and (3).
For the third formula, set x=−1 in (2) and use similar arguments.
The formula for Dk(−1) was given in the previous section: it is 2 or −1 according
as 3∣k or 3∤k. Note that 3∣m⟺12∣q−ε⟺q≡±1(mod12).
Now we prove the fourth formula. Let τ=(t+2)/4 correspond to
Ow, so t+2=(w+1/w)2. Then t=w2+1/w2 and t2−2=w4+1/w4.
Since s=0, we know t∈{2,−2}, so τ∈{0,1}. By the structure theorem, it follows that w4=1,
and wq−AB=A,
where A=(qτ)=(qt+2) and B=(qτ−1)=(qt−2).
Note that AB=(q(t−2)(t+2))=(q−s2)=(q−1)=ε.
Therefore wq−ε=(qt+2).
Setting x=t2−2 in (3) and then substituting b=a+t2−2 gives
[TABLE]
The left side is w4m+w−4m=wq−ε+1/wq−ε=2(qt+2).
We have shown that
[TABLE]
We claim that in general if α,β,γ∈Fq, α2+β2=γ2 and
αβ=0, then (qα+γ)=(q2)(qβ+γ).
To see this, note that
(α+β+γ)2=α2+β2+γ2+2αβ+2αγ+2βγ=2(γ2+αβ+αγ+βγ)=2(α+γ)(β+γ), therefore 2(α+γ)(β+γ) is a square.
It is also nonzero, because (α+γ)(β+γ) divides
(γ2−α2)(γ2−β2)=β2α2 and αβ=0 by hypothesis.
Thus, the Legendre symbol of 2(α+γ)(β+γ) is 1,
and the claim follows.
Applying this with α=s, β=t, γ=2 gives us that (qs+2)=(q2)(qt+2), which completes the proof.
Example. Suppose that (q2)=1; equivalently q≡±1(mod8). Let s=t=2. Then Theorem 3.1 says that
[TABLE]
For the case q=7, we can take 2=3, and (q2+2)=(75)=−1. So the right side is −2.
On the left side, 2±a are nonsquares iff a∈{3,4} and 3×4=12=−2 in F7.
4 Chebyshev polynomials
Chebyshev polynomials of the first kind, denoted Ck, are determined by the property that cos(kθ)=Ck(cosθ). The first few
are given by
[TABLE]
They are closely related to Dickson polynomials as follows:
is preserved by Chebyshev polynomials; that is,
s∈S implies Ck(s)∈S.
Proof.
Let a∈S and let τ=(a+1)/2⟷Ov. Then τ and τ−1 are squares.
First assume τ∈{0,1}. Then by the structure theorem, v4=1 and vq−1=1, i.e. v∈Fq×.
Then Ck(a)=Ck(2τ−1)=(1/2)Dk(4τ−2)=(1/2)Dk((v+1/v)2−2)=(1/2)Dk(v2+1/v2)=(1/2)(v2k+1/v2k).
We claim this belongs to S. Indeed, if b=(1/2)(v2k+1/v2k) then 2b+2=(vk+1/vk)2 and 2b−2=(vk−1/vk)2.
This proves the result when τ∈{0,1}, i.e. when a∈{1,−1}. If a=1 then Ck(a)=(1/2)Dk(2)=1=a∈S.
If a=−1∈S then Ck(a)=(1/2)Dk(−2)=(−1)k. When k is odd, this equals a, which is assumed to be in S.
When k is even, this equals 1, and 1∈S because 4 and 0 are squares.
5 Further results
We highlight some additional applications of the structure theorem from [1, 2], omitting the proofs.
Factorization of Dickson polynomials. Define Ek∈Z[x] for k≥0 by
[TABLE]
This is called a Dickson polynomial of the second kind, and like Dk, it has
been widely studied. It is well known (and can easily be shown by
induction on k) that Ek is a monic polynomial of degree k, and
[TABLE]
We showed in this note that if ε=(−1)(q−1)/2 and m=(q−ε)/4 then
[TABLE]
It turns out that there is an analogous factorization for Em−1 (see [2, Theorem 8.1]):
[TABLE]
Oddball formulas. The following results can be found in [1].
Theorem 5.1
Let S={b∈Fq:(q2−b)=−1,(q2+b)=1}. Then b↦b2−2 is a permutation of S, and the
inverse permutation is
[TABLE]
Theorem 5.2
For any c∈Fq,
[TABLE]
More Wilson-like theorems. The article [2] contains closed formulas for every product of the form
[TABLE]
where ε1,ε2∈{1,−1} and k,ℓ∈Fq. Theorem 3.1 contains a few formulas
of this type, but there are many more.
Here are some specific examples.
If j is a square and 4−j is not, then
\prod\left\{\,a\in{{\mathbb{F}}}_{q}^{\times}:\text{j-aand4-j+a are nonsquares}\,\right\} is a square root of j.
If 4−j is a square and j is not, then
\prod\left\{\,a\in{{\mathbb{F}}}_{q}^{\times}:\text{j-aand4-j+a are nonsquares}\,\right\} is a square root of 4−j.
If j and 4−j are nonsquares, then
[TABLE]
is a square root of j/(4−j).
Other results from [2] apply to a restricted set of q. For example, suppose that (q5)=1
(equivalently, q≡±1(mod5) by quadratic reciprocity or by the exercise at the end of Section 1), and let r=(1−5)/2, where 5 denotes a (fixed) square root of 5. Then
[TABLE]
[TABLE]
Generalization of structure theorem.
Fix 0=c∈Fq×, and define a c-orbit to be
Ov,c={±v,±c/v}, where v∈Fq×. Let f(x)=(x+c/x)2/4. Then for v,w∈Fq×,
f(v)=f(w)⟺w∈Ov,c⟺Ov,c=Ow,c. Also, if τ=f(v) then τ∈Fq⟺vq∈Ov,c⟺vq−1=±1 or
vq+1=±c. If τ∈Fq, then the c-orbit corresponding to τ is {±τ±τ−c}.
If (qτ)=A
and (qτ−c)=B, and if τ∈{0,c}, then every v in the corresponding c-orbit
satisfies vq−AB=Ac(1−AB)/2.
The generalized structure theorem is only mildly useful, because it can be obtained from the usual one by rescaling. Namely, if Ov,c⟷τ
( i.e., τ=(v+c/v)2/4), then c−1τ=(w+1/w)2/4, where w=v/c.
Acknowledgement. The author thanks Dr. Art Drisko for his careful review of this article. His comments have benefitted the exposition.
Bibliography2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Antonia W. Bluher, Permutation properties of Dickson and Chebyshev polynomials and connections to number theory , ar Xiv:1707.06877 v 2 [math.NT], July 21, 2017, revised January 31, 2018.
2[2] Antonia W. Bluher, New Wilson-like theorems arising from Dickson polynomials , ar Xiv:1707.06870 v 2 [math.NT], July 21, 2017, revised November 16, 2017.