This paper explicitly computes the Artin map for subgroups of PGL_2 over finite fields, revealing new insights into finite fields, additive polynomials, and conjugacy classes, with applications to characterizations and symbols.
Contribution
It provides explicit calculations of the Artin map for various subgroups of PGL_2 over finite fields, leading to new characterizations and structures related to finite fields and polynomials.
Findings
01
New characterization for when additive polynomials split over finite fields
02
Information about conjugacy classes of PGL_2(F_q)
03
A natural tripartite symbol on F_q with values in Z/3Z
Abstract
Let G be a subgroup of PGL2(Fq), where q is any prime power, and let Q∈Fq[x] such that Fq(x)/Fq(Q(x)) is a Galois extension with group G. By explicitly computing the Artin map on unramified degree-1 primes in Fq(Q) for various groups G, interesting new results emerge about finite fields, additive polynomials, and conjugacy classes of PGL2(Fq). For example, by taking G to be a unipotent group, one obtains a new characterization for when an additive polynomial splits completely over Fq. When G=PGL2(Fq), one obtains information about conjugacy classes of PGL2(Fq). When G is the group of order 3 generated by x↦1−1/x, one obtains a natural tripartite symbol on Fq with values in Z/3Z.…
v∈S⟺Ov is short⟺γ1(v)=γ2(v)for a pair of distinct elements γ1,γ2∈G,
v∈S⟺Ov is short⟺γ1(v)=γ2(v)for a pair of distinct elements γ1,γ2∈G,
S=∪1=γ∈GFγ,
S=∪1=γ∈GFγ,
γ∈G∏(x−γ(v))=(w∈O∏(x−w))mult(O).
γ∈G∏(x−γ(v))=(w∈O∏(x−w))mult(O).
Aγ,q={v∈Fq:vq=γ(v)},Lγ,q=Aγ,q∖Fq2.
Aγ,q={v∈Fq:vq=γ(v)},Lγ,q=Aγ,q∖Fq2.
deg(f)=max{deg(p1),deg(p2)}.
deg(f)=max{deg(p1),deg(p2)}.
γ(x)=(ax+b)/(cx+d),deg(γ)=1.
γ(x)=(ax+b)/(cx+d),deg(γ)=1.
Σ={f(x)∈K(x):f∘γ(x)=f(x) for all γ∈G}.
Σ={f(x)∈K(x):f∘γ(x)=f(x) for all γ∈G}.
F(y)=γ∈G∏y−γ(x)∈K(x)[y].
F(y)=γ∈G∏y−γ(x)∈K(x)[y].
f(v2)−Q(v1)g(v2)=γ∈G∏v2−γ(v1).
f(v2)−Q(v1)g(v2)=γ∈G∏v2−γ(v1).
F(x,y)=g(x)γ∈G∏(y−γ(x)).
F(x,y)=g(x)γ∈G∏(y−γ(x)).
u(x)=(cadb)∈G∏(cx+d).
u(x)=(cadb)∈G∏(cx+d).
F(x,y)=u(x)g(x)(cadb)∈G∏((cx+d)y−(ax+b)).
F(x,y)=u(x)g(x)(cadb)∈G∏((cx+d)y−(ax+b)).
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.
Full text
Explicit Artin maps into PGL2
Antonia W. Bluher
National Security Agency
(June 2019, revised August 2021)
Abstract
Let G⊂PGL2(Fq) where q is any prime power, and let Q∈Fq(x) such that Fq(x)/Fq(Q) is a Galois extension with group G.
By explicitly computing the Artin map on unramified degree-1 primes in Fq(Q) for various groups G,
interesting new results emerge about finite fields, additive polynomials,
and conjugacy classes of PGL2(Fq).
For example, by taking G to be
a unipotent group, one obtains
a new characterization for when an additive polynomial splits completely over Fq.
When G=PGL2(Fq), one obtains information about conjugacy classes
of PGL2(Fq).
When G is the group of order 3 generated
by (110−1), one obtains a natural tripartite symbol on Fq
with values in Z/3Z.
Some of these results generalize to PGL2(K) for arbitrary fields K.
1 Introduction
Let K be a field and G a finite subgroup of PGL2(K). It is
well known, and will be proved in Section 3, that there is
Q∈K(x)
such that K(x)/K(Q(x)) has Galois group G. Normalize Q so that
Q(∞)=∞; Q will be called a quotient map for G. If τ∈K∪{∞}, then Q−1(τ) is a G-orbit in K∪{∞}.
If ∣Q−1(τ)∣=∣G∣, then τ is said to be regular.
Let σ∈Aut(K/K) such that σ(τ)=τ. Then Q−1(τ) is closed under σ, and it is a G-orbit,
so for each v∈Q−1(τ) there is γ∈G such that σ(v)=γ(v).
If τ is regular, then γ is uniquely determined by v and σ, and the conjugacy class
Cγ,G={αγα−1:α∈G} is uniquely determined by τ and σ.
In that case, define
[TABLE]
If G is abelian, so that Cγ,G={γ}, then we write more simply invQ(τ,σ)=γ. We abbreviate Cγ=Cγ,G if G is clear from the context.
If K=Fq and σ(v)=vq, where q is any prime power, then we write invQ(τ,q) instead of invQ(τ,σ),
or just inv(τ) if Q and q are clear from the context.
In that case,
Xander Faber astutely observed that the map τ↦inv(τ)=Cγ is essentially the Artin map for the extension
Fq(x)/Fq(Q(x)).
The connection is as follows.
Let τ∈Fq.
The polynomial Q−τ∈Fq(Q) corresponds to a degree-1 place P=(Q−τ) of Fq(Q(x)). This place is unramified in Fq(x)
if and only if τ has ∣G∣ distinct preimages in Fq;
this coincides with our definition that τ is regular.
If v∈Q−1(τ)
and g is its minimal polynomial over Fq, then g corresponds to a place P in Fq(x) that lies over P.
The element γ such that vq=γ(v) is the Frobenius automorphism of P for the extension Fq(x)/Fq(Q),
and the map P↦Cγ
is the Artin map. For a more general discussion of the Artin map over function fields, see Rosen [17, Ch. 9].
The Artin map is defined in [17, page 122]. Because of this close relation with the Artin map, we call invQ(τ,σ)
the Artin invariant of τ with respect to Q and σ.
While the existence and general properties of the Artin map are widely known, what has not been previously appreciated is
how interesting the examples are, even in the genus-0 case, i.e., over the rational function field Fq(x).
Thus, the emphasis in this article is not so much on the existence of inv(τ), but rather on the
wealth of arithmetic information that is revealed by specific examples. Some of this arithmetic information was previously known, and some is new.
Example 1.1
The simplest example is G={(0110),(0−110)} and Q(x)=x2 over Fq.
Here one should assume 1=−1, i.e., q is odd.
All τ∈Fq are regular except τ=0. If v2=τ=0 then
[TABLE]
where (qτ) is the quadratic residue symbol: 1 if τ is a nonzero square, or −1 if
τ is a nonsquare. Thus, vq=γ(v) with γ=(0(qτ)10), and inv(τ)=γ.
As can be seen, the Artin invariant for this group is intimately connected with the quadratic residue symbol.
The next example is related to the theory of Kummer extensions. For an exposition on Kummer extensions,
see [1, §II.L] or [16, Ch. 4, §4]. If (n,q)=1 then let μn denote the group of nth roots of unity
in Fq.
Example 1.2
Let q be any prime power (possibly even).
Suppose that n divides q−1, and let G={(0ζ10):ζn=1}⊂PGL2(Fq).
The quotient map is Q(x)=xn, and every element of Fq is regular except 0.
Let τ∈Fq× and inv(τ)=(0ζ10).
Then τ=vn∈Fq×⟺vq=ζv.
The field extension Fq(v)=Fq(τ1/n) is a Kummer extension. The Galois group sends v to vq=inv(τ)(v)=ζv.
To express inv(τ) directly in terms of τ, note that ζ=vq−1=(vn)(q−1)/n=τ(q−1)/n.
Example 1.1 is the special case n=2.
Example 1.3
(Klein Group) Let G={(0110),(0−110),(1001),(100−1)}⊂PGL2(Fq). Here assume
1=−1, so q is odd.
Q(x)=(x+1/x)2/4 is a quotient map. Let τ=Q(v)∈Fq.
Then τ is regular iff τ∈{0,1} iff v4=1. The following theorem pertains to this example.
Theorem.Let q be an
odd prime power. Every element τ∈Fq can be written as
[TABLE]
*Moreover, if τ∈{0,1}, then vq−AB=A, where
A=(qτ) and B=(qτ−1). *
The theorem implies vq=AvAB=γ(v), where
[TABLE]
In other words, inv(τ,q) is given explicitly in terms of (qτ) and (qτ−1).
The above theorem is proved in [3, Theorem 4.1] and is used in [4, 3]
to obtain a new factorization formula for Dickson and Chebyshev polynomials
and new theorems in elementary number theory. For a short and self-contained exposition on these topics, see [2].
In fact, the article [2] directly motivated the current article.
The next example (explained in Section 10) computes the Artin invariant when G is a unipotent subgroup of
PGL2(Fq), and leads to unexpected results about additive polynomials that have all their roots in the ground field.
Example 1.4
Let G={(011b):b∈Fq}.
A quotient map is QG(x)=xq−x. If QG(v)=τ∈Fq, then vq=v+τ=(011τ)(v). Thus, inv(τ)=(011τ).
More generally,
let q=pn, where p is a prime or a prime power, let W⊂Fq be a d-dimensional Fp-vector subspace
of Fq, and GW={(011w):w∈W}. As is well known, the quotient map is QW(x)=∏w∈W(x−w), which is an Fp-additive polynomial,
i.e., QW(λx+y)=λQW(x)+QW(y) for λ∈Fp. QW can be regarded as an Fp-linear map from Fq to Fq with kernel W.
Let Y=QW(Fq). Then Y
is an (n−d)-dimensional Fp-vector subspace of Fq, and for τ∈Fq we will prove in Section 10
that
[TABLE]
In particular, QY(τ)∈W, which is not otherwise obvious. This observation implies the
following symmetric relation between W and Y. Though easy to prove, to our knowledge it was not previously noticed.
Proposition.Let q=pn, let W be an Fp-vector subspace of Fq, QW(x)=∏w∈W(x−w), and Y=QW(Fq). Then
W=QY(Fq), and there are short exact sequences
[TABLE]
and
[TABLE]
These observations lead to a simple characterization of when an Fp-additive polynomial splits in Fq.
(See Proposition 10.6).
Splitting Criterion.Let q=pn where p is a prime or a prime power, and let L(x)=xpd+∑i=0d−1aixpi be an Fp-additive polynomial, where ai∈Fq, a0=0, and d≥1. Then all the roots of L
are in Fq if and only if there is an Fp-additive polynomial M(x)=xpn−d+∑i=0n−d−1bixpi∈Fq[x] with M∘L(x)=xq−x.
In that case, it is also true that L∘M(x)=xq−x.
This splitting criterion is simpler than
characterizations that are currently in the literature.
The criterion in current use is as follows. (See McGuire and Sheekey [14] and Csajbók et al [7].)
Let L(x)=xpd+∑i=0d−1aixpi∈Fq[x], and define d×d matrices CL and AL by
[TABLE]
[TABLE]
where C(pi) means raising every matrix entry to the power pi. Then L has all its roots in Fq if and only if AL is equal to the identity matrix.
As an example, let q=P7 and
[TABLE]
where a,b∈Fq and a=0. It was shown by Csajbók et al [6, Theorem 3.3] using combinatorial arguments that L can have all its roots in Fq only if q is even. A complete characterization of when L has all its roots in Fq was found by G. McGuire and D. Mueller [13]. One can obtain this result more simply using the new splitting criterion. Namely, let M(x)=xP4+u3xP3+u2xP2+u1xP+u0x∈FP7[x] and try to solve M∘L(x)=xP7−x. From the coefficients of xP6, xP5, xP4, and x one finds that u3=0, u2=bP4, u1=aP4, and u0=1/a. The equation M∘L(x)=xP7−x then simplifies to
[TABLE]
Then a=b−P4−P2, and in particular b=0. From the coefficient of xP2, and using bP7=b, we have
0=aP2bP4+aP4bP=b−P6−P4bP4+b−P8−P6bP=2b−P6. Thus, 2=0, showing q is even. Finally,
aP4+P+b/a=0 yields b=aP4+P+1=(b−P4−P2)P4+P+1, which simplifies to NFq/FP(b)=1. The conclusion is that L has all its roots in Fq iff q is even,
NFq/FP(b)=1, and a=b−P4−P2.
Example 1.5
The case G=PGL2(Fq), studied in Section 12, reveals nontrivial information about conjugacy classes of PGL2(Fq).
If K is any field and if g=(cadb)∈GL2(K), let
[TABLE]
Then ι(cg)=ι(g) for c∈K×, so ι is well defined on PGL2(K). Also, ι(hgh−1)=ι(g) for h∈GL2(K),
so ι is constant on conjugacy classes. If e1,e2 are the roots of the characteristic polynomial of g, then ι(g)=e1/e2+e2/e1+2.
The following results concerning the map ι will be proved in Section 12.
Theorem. *A quotient map for PGL2(Fq) is
Q(x)=(xq2−x)q+1/(xq−x)q2+1, and τ∈Fq is regular with respect to Q iff τ=0.
Let K denote the set of conjugacy classes Cγ such that ∘(γ)≥3.
Then ι induces a bijection from K onto Fq×, and the inverse bijection is invQ.
*
The bijections in the theorem are pictured here:
[TABLE]
Let H be any subgroup of G=PGL2(Fq), QH a quotient map for H, and QG(x)=(xq2−x)q+1/(xq−x)q2+1.
It is shown in Lemma 3.7 that there is a unique rational function h∈Fq(x) such that QG=h∘QH. We will prove:
Theorem. *Let H,QH,h be as above. Suppose τ∈Fq is regular with respect to QH and let invQH(τ,q)=Cγ,H. If γ=1 then
h(τ)=∞. If γ=1 then h(τ)=ι(γ). *
Example 1.6
Section 7 considers
G={I,β,β2}⊂PGL2(K), where β=(110−1) and K is any field.
A quotient map is Q(x)=(x3−3x+1)/(x(x−1)), and τ∈K is regular if and only if τ2−3τ+9=0.
Let σ∈Aut(K/K), τ∈K
such that τ2−3τ+9=0 and σ(τ)=τ. Let v∈K such that Q(v)=τ.
Then there is a unique ℓ∈Z/3Z such that σ(v)=βℓ(v). By definition, βℓ=invQ(τ,σ).
Section 7 presents formulae for ℓ in terms of τ, as follows.
Theorem.With notation as above, if invQ(τ,σ)=βℓ then ℓ(mod3) is determined by:
If char(K)=3, let ω∈K denote a primitive cube root of unity and let ζ∈K satisfy
ζ3=(τ+3ω2)/(τ+3ω). Then σ2(ζ)/ζ=ωℓ.
2. 2.
If char(K)=3, let ζ∈K satisfy ζ3−ζ=1/τ. Then ℓ=σ(ζ)−ζ.
3. 3.
In the special case where K=Fq and σ is the Frobenius, σ(x)=xq, then
[TABLE]
This article has three parts. Part I (Sections 2–4) presents the general theory.
Specifically, Section 2 discusses G-orbits in K∪{∞},
Section 3 discusses existence and computation of quotient maps,
and Section 4 defines the invariant inv(τ).
Part II (Sections 5–8) considers finite groups that are naturally defined over PGL2(K) for any K.
Section 5 considers G={(0110),(1001)}⊂PGL2(K) and shows how the Artin invariant for this group
in the case K=Fq
is related to the well-known fact: Fq={ζ+1/ζ:ζq−1=1orζq+1=1}.
Section 6 generalizes Examples 1.2 and 1.3 to arbitrary fields K.
Section 7 considers the order-3 group given in Example 1.6.
Section 8 considers the dihedral group of order six in PGL2(K) generated by (110−1) and (1001).
Part III considers subgroups of PGL2(Fq), including Borel subgroups, unipotent subgroups, cyclic subgroups,
PGL2(Fq), and PSL2(Fq). Some applications are given.
Part I General Theory
2 Orbits
Let K be any field and K its algebraic closure.
The projective linear group PGL2(K) is defined as the group of invertible 2×2 matrices
with entries in K, modulo the scalar matrices, (0cc0), where c∈K×.
As is well known, if K⊂L where L is a field, then PGL2(K) acts on L∪{∞} via
[TABLE]
This equation is self-explanatory if v∈L and cv+d=0. If v=∞, then
(cadb)(v)=a/c, where we interpret a/0=∞. Also, if v∈L and cv+d=0, then (cadb)(v)=∞.
The reader can verify that if γ,δ∈PGL2(K) then γ(δ(v))=(γδ)v.
PGL2(K) acts triply transitively on K∪{∞}, i.e., for any distinct a,b,c∈K∪{∞} there is γ∈PGL2(K)
taking ∞ to a, 0 to b, and 1 to c. In fact, γ is uniquely determined and it equals
[TABLE]
if a,b,c are all finite, or (0c−b1b) if a=∞, (1a0c−a) if b=∞, (1a−1−b) if c=∞.
Thus, PGL2(K) is in one-to-one correspondence with the set of ordered triples (a,b,c) of
distinct elements in K∪{∞}, and in particular
[TABLE]
Let G be a finite subgroup of PGL2(K), and let ∣G∣ denote its cardinality.
If v∈L∪{∞}, then the G-orbit containing v, or simply orbit if G is clear from context, is
defined as
[TABLE]
Orbits partition L∪{∞} into disjoint sets.
We will say an orbit is short if it has fewer than ∣G∣ elements;
otherwise the orbit is full-sized.
Lemma 2.1
Let G be a finite subgroup of PGL2(K) and let L/K be an extension of fields.
An element v∈L∪{∞} belongs to a short orbit if and only if there is γ∈G, γ=(0110),
such that γ(v)=v. Every short orbit is contained in K∪{∞} or a quadratic extension of K.
The union of short orbits has at most 2(∣G∣−1) elements.
Proof. Let S denote the union of short orbits in L. Then
[TABLE]
and in that case, γ1−1γ2 fixes v. Thus,
[TABLE]
where Fγ={v∈L∪{∞}:γ(v)=v}. Since ∣Fγ∣≤2 and consists of rational elements in K∪{∞} or a pair of conjugate elements, the result follows.
Lemma 2.2
Let G be a finite subgroup of PGL2(K), and let O⊂L∪{∞} be a G-orbit,
where L/K is an extension field.
Then ∣O∣ divides ∣G∣, and each element of O is fixed by exactly ∣G∣/∣O∣ elements of G. The integer
mult(O)=∣G∣/∣O∣ is called the multiplicity of O.
If O=O∞ and v∈O, then
[TABLE]
Proof. This follows from standard facts about groups acting on sets, as can be found for example in [10, Section 4.1, Prop. 2].
If v∈K,
define degK(v)=[K(v):K]. Note that degK(v)=degK(γ(v)) for all
γ∈PGL2(K), because v and γ(v) generate the same field over K. Consequently,
degK(v) is constant on orbits. If K=Fq, we write degq(v) instead of degK(v). Then Fq(v)=Fqt, where t=degq(v).
Lemma 2.3
Let γ∈PGL2(Fq) and suppose ∘(γ)=t>1, where ∘(γ) denotes the order of γ.
If v∈Fq and
vq=γ(v) then vqi=γi(v) for all i≥1, and degq(v) divides t. If in addition v,γ(v),…,γt−1(v) are distinct,
then degq(v)=t.
Proof. Note that vq2=(vq)q=(γ(v))q. Since γ has entries in Fq, this equals γ(vq)=γ(γ(v))=γ2(v).
By induction one can show that vqi=γi(v) for all i≥1. Thus, the G-orbit Ov is the set of Fq-conjugates of v, where
G is the cyclic group of order t generated by γ. Then degq(v)=∣Ov∣=t/mult(Ov). This shows that degq(v)
divides t, and degq(v)=t iff Ov has full size, i.e., iff γi(v) for 0≤i<t are distinct.
The next proposition will be useful in determining how many field elements τ have the same invariant Cγ, assuming that ∘(γ)≥3.
See Section 11.4 and Proposition 12.9 for
further study of the equation vq=γ(v).
Proposition 2.4
Suppose that γ∈PGL2(Fq) has order t≥3. Let
[TABLE]
Let G⊂PGL2(Fq) be a group that contains γ and let Cγ={αγα−1:α∈G}.
(i)
If v∈Aγ,q then the G-orbit Ov={β(v):β∈G} has full size if and only if v∈Lγ,q.
2. (ii)
∣Lγ,q∣=q+κ* with κ∈{0,1,−1}, and t divides q+κ. (Note that κ is uniquely determined
from t, since t≥3 and κ≡−q(modt)).*
3. (iii)
Let L=∪β∈CγLβ,q.
Then L decomposes into exactly rG-orbits, all of full size, where r=∣Cγ∣(q+κ)/∣G∣.
Proof.(i) Let v∈Aγ,q, so vq=γ(v). We will show that the G-orbit Ov has full size if and only if v∈Lγ,q.
Since all short orbits are contained in Fq2∪{∞}, v∈Lγ,q implies that Ov has full size.
Conversely, if Ov has full size then γi(v) are distinct for i=0,1,…,t−1, so degq(v)=t
by Lemma 2.3. In particular, v∈Fq2 so v∈Lγ,q.
(ii) Write γ=(cadb). Aγ,q is the set
of solutions in Fq to f(x)=0, where f(x)=xq(cx+d)−ax−b. We claim the roots are distinct.
For if r is a repeated root, then f(r)=f′(r)=0, so rqc−a=0.
Either c=a=0 (contradicting that ad−bc=0) or r=a/c. But r=a/c implies
f(r)=(a/c)(a+d)−a2/c−b=(ad−bc)/c=0, contradicting that r is a root of f. This establishes that f has no repeated roots, so it has deg(f)
distinct roots in Fq. So ∣Aγ,q∣=deg(f), which equals q+1 if c=0, or q if c=0.
Let X=Aγ,q∩Fq2. Any v∈X satisfies v=vq2=γ2(v), so it is a fixed
point of γ2. There are at most two fixed points, so ∣X∣≤2. Further, if c=0 then γ2 fixes ∞,
so it can fix at most one other point, and it follows that ∣X∣≤1 when c=0.
Since Aγ,q is the disjoint union of Lγ,q and X, ∣Lγ,q∣=∣Aγ,q∣−∣X∣. If c=0 then ∣Aγ,q∣=q and ∣X∣∈{0,1},
and if c=0 then ∣Aγ,q∣=q+1 and ∣X∣∈{0,1,2}. In either case, ∣Lγ,q∣∈{q−1,q,q+1}, i.e.,
∣Lγ,q∣=q+κ where κ∈{−1,0,1}.
To see that t divides ∣Lγ,q∣, observe that γ permutes Lγ,q and has no fixed points. The permutation breaks into cycles, each of order t,
so the cardinality of Lγ,q must be a multiple of t.
(iii) If v∈L and α∈G then we claim α(v)∈L. Indeed, vq=β(v) for some
β=εγε−1∈Cγ,
so if w=α(v) then wq=α(vq)=αεγε−1(v)=αεγε−1α−1(w)=(αε)γ(αε)−1(w). Further, degq(w)=degq(v)=t, so w∈Fq2.
This shows α(v)∈L, as claimed. Then L splits into G-orbits. All have full length by (i), so ∣G∣ divides ∣L∣, and the number of G-orbits is ∣L∣/∣G∣.
Finally, L is a disjoint union of the sets Lβ,q with β∈Cγ, because if vq=β(v) and vq=β′(v) then β(v)=β′(v), β−1β′(v)=v.
Since degq(v)>2, this forces β=β′. Note that order(εγε−1)=∘(γ)=t for each β=εγε−1∈Cγ, so each set Lβ,q has the same cardinality, q+κ, where κ∈{−1,0,1} and κ≡−q(modt). We conclude that ∣L∣=(q+κ)∣Cγ∣
and the number of G-orbits is r=(q+κ)∣Cγ∣/∣G∣.
3 Quotient maps
Let G be a finite subgroup of PGL2(K), where K is any field.
A quotient map for G is a rational function Q(x) such that the extension field K(x)/K(Q) has Galois group G. We further require that Q(∞)=∞.
This section gives proof of existence, properties, examples, and computational aspects of quotient maps.
We remark that existence of Q is well known to algebraic geometers; see
Mumford [15].
3.1 Existence of quotient maps.
The existence of a quotient map essentially follows from Galois theory of the field K(x) (see Artin [1]), together with some facts about subfields of K(x)
(see van der Waerden [18]), where K(x)/K is transcendental.
Every nonzero f∈K(x) can be written uniquely as p1(x)/p2(x), where
p1 and p2 are relatively prime polynomials and p2 is monic. Define
[TABLE]
If γ=(cadb)∈PGL2(K), then it may be viewed as an element of K(x) of degree 1:
[TABLE]
Lemma 3.1
*(i) If f∈K(x) is nonconstant then [K(x):K(f)]=deg(f).
(ii) If f,g∈K(x)
are nonconstant then deg(f∘g)=deg(f)deg(g).*
(ii) Let y=g(x). Since [K(x):K(y)]=deg(g), we have [K(y):K]=∞ and so y is transcendental.
By (i), deg(f∘g)=[K(x):K(f(g(x)))]=[K(x):K(y)][K(y):K(f(y))]=deg(g)deg(f).
Corollary 3.2
If γ∈PGL2(K) and f∈K(x), define Aγ(f)=f∘γ−1. Then γ↦Aγ is an isomorphism
from PGL2(K) onto Aut(K(x)/K).
Proof. This is well known, but we give a proof for completeness. Aut(K(x)/K) is defined as the group of isomorphisms from K(x) to K(x) that
fix all elements of K.
First, Aγ∈Aut(K(x)/K) because Aγ(f+g)=Aγ(f)+Aγ(g), Aγ(f)Aγ(g)=Aγ(fg) when f,g∈K(x),
Aγ(c)=c when c∈K, and Aγ−1=Aγ−1. Clearly Aγ=1⟺γ−1(x)=x⟺γ=1.
Further, Aγ(Aδ(f))=Aγ(f∘δ−1)=f∘δ−1∘γ−1=f∘(γδ)−1=Aγδ(f). So PGL2(K) injects into Aut(K(x)/K), and we just need to show it is surjective.
Let A be any automorphism of K(x)/K.
Since x generates K(x) over K, so does A(x). Then deg(A(x))=1 by Lemma 3.1.
Write A(x)=(ax+b)/(cx+d), where ax+b and cx+d have no common factor and
a or c is nonzero. Then ad−bc=0, so γ=(cadb) is in PGL(2,K). Evidently A(x)=Aγ−1(x), and since an automorphism
of K(x)/K is determined by the image of x, it follows that A=Aγ−1. This proves surjectivity.
Let Σ be the fixed field of G:
[TABLE]
Proposition 3.3
There is a function Q(x)∈K(x) of degree ∣G∣ such that Σ=K(Q). Moreover, [K(x):Σ]=∣G∣, K(x)/Σ is Galois,
and its Galois group is isomorphic to G. If Q′(x)∈Σ and deg(Q′)=∣G∣ then there is α∈PGL2(K) such that Q′=α∘Q.
Proof. Let x,y be independent transcendentals and consider
[TABLE]
F(y) has degree ∣G∣ and its coefficients are in Σ.
Since F∈Σ[y] and F(x)=0, this shows K(x) is an algebraic extension of Σ and [K(x):Σ]≤∣G∣.
The group G is contained in Aut(K(x)/K) by Corollary 3.2, and it fixes all elements of Σ, therefore [K(x):Σ]≥∣G∣
by Galois theory (see the corollary to Theorem 13 in [1]). Combining these inequalities gives [K(x):Σ]=∣G∣. Since the degree of the extension equals
the order of the group of automorphisms of K(x) that fix Σ, the extension is Galois.
Lüroth’s Theorem [18, §10.2, p. 218] states that any field E such that K⊂E⊂K(x) and [K(x):E]<∞ has the form E=K(f),
where f∈K(x)∖K. Therefore, Σ=K(Q) for some Q∈K(x). By Lemma 3.1(i),
deg(Q)=[K(x):K(Q)], which equals ∣G∣.
If Q′∈Σ=K(Q) then Q′=h(Q) for some h∈K(x). By Lemma 3.1(ii),
if deg(Q′)=∣G∣ then deg(h)=1, so h∈PGL2(K).
Proposition 3.4
Let K be any field and let G be a finite subgroup of PGL2(K).
There is a rational function Q∈K(x) such that
Q(γx)=Q(x)* for all γ∈G;*
2. 2.
If Q is written as a reduced fraction, i.e., Q=f/g where f,g∈K[x]
and GCD(f,g)=1, then ∣G∣=deg(f)>deg(g).
Further, if Q is another function with these properties, then
Q(x)=aQ(x)+b for some a∈K× and b∈K.
Proof. Let Q0=f0/g0 be a function as in Proposition 3.3, so deg(Q0)=∣G∣ and Q0∘γ=Q0 for all γ∈G.
Then α∘Q0 satisfies
these conditions also, for any α∈PGL2(K). We claim that α can be chosen so that α∘Q0=f/g, where deg(f)=∣G∣>deg(g).
If deg(g0)<∣G∣, take α=(0110), the identity map. If deg(g0)=∣G∣ and deg(f0)<∣G∣, then take α=(1001), the reciprocal map.
Finally, if deg(f0)=deg(g0)=∣G∣, then there is c∈K such that deg(f0+cg0)<∣G∣, and (1001)(011c)∘Q=g0/(f0+cg0) has the desired form.
For the last statement, Q=α∘Q for α∈PGL2(K) by Proposition 3.3. The condition on the degrees of the denominators
forces α to have the form (0a1b).
Because the functions in Proposition 3.4 are so central to this article, we give them a name.
Definition 3.5
A function Q∈K(x) that satisfies the two conditions of Proposition 3.4 is called
a quotient map for G.
Proposition 3.6
If Q(x) is a quotient map for G then K(Q(x))=Σ, where Σ is defined in (4).
In particular, K(x)/K(Q) is Galois, and
its automorphism group is isomorphic to G.
Proof.Q∈Σ by the first part of the definition, so K(Q)⊂Σ.
Also, deg(Q)=∣G∣ by the second part of the definition, so [K(x):K(Q)]=deg(Q)=∣G∣=[K(x):Σ]. We conclude that K(Q)=Σ. Then K(x)/K(Q)=K(x)/Σ is Galois, and its Galois group is isomorphic to G by
Proposition 3.3.
3.2 Properties of quotient maps.
Proposition 3.7
If H⊂G⊂PGL2(K) are finite subgroups and QH, QG are quotient maps for these groups then QG=h(QH) for a unique h∈K(x),
and deg(h)=∣G∣/∣H∣.
Proof. Let \Sigma_{H}={\left\{\,u\in K(x):\text{u\circ\gamma=uforall\gamma\in H}\,\right\}} and define ΣG similarly.
By Proposition 3.6, ΣG=K(QG) and ΣH=K(QH).
Since QG∈ΣG⊂ΣH=K(QH), QG=h(QH) for some rational function h. Since QH is transcendental over K, h is unique.
∣G∣=deg(QG)=deg(h(QH))=deg(h)deg(QH)=deg(h)∣H∣ by Definition 3.5 and Lemma 3.1. Thus, deg(h)=∣G∣/∣H∣.
The next proposition (especially (i)) illustrates that quotient maps have very strong arithmetic properties.
Proposition 3.8
Let Q(x)∈K(x) be a quotient map for G, where G⊂PGL2(K). Write Q(x)=f(x)/g(x) where f,g are relatively prime polynomials and f is monic.
Let L/K be an extension field and let x,y be independent transcendentals over L. Then
(i)
f(y)−Q(x)g(y)=∏γ∈G(y−γ(x))*. *
2. (ii)
*If v1,v2∈L and Q(v2)=∞ then Q(v1)=Q(v2) if and only if v2=γ(v1) for some γ∈G. Consequently, if w∈L then Q−1(w)
is a G-orbit in L. *
3. (iii)
*If w∈L and O=Q−1(w) is the corresponding orbit in L, then f(x)−wg(x)=(∏v∈Ox−v)mult(O). *
4. (iv)
g(x)=a∏v∈O∞,v=∞(x−v)mult(O∞), where a∈K×. Here
O∞={γ(∞):γ∈G} and mult(O∞)=∣H∣,
where H={γ∈G:γ(∞)=∞}={(cadb)∈G:c=0}.
Proof.(i) By Definition 3.5, deg(f)=∣G∣>deg(g). The left and right sides of the equation in (i), when regarded as polynomials in y,
are both monic polynomials
of degree ∣G∣ with coefficients in Σ, where Σ is defined in (4). Also, both vanish at y=x.
Since [K(x):Σ]=∣G∣ by Proposition 3.3, both are minimal polynomials for x over Σ. Then each divides the other, so they are equal.
(ii) If v2=γ(v1) for some γ∈G, then Q(v2)=Q∘γ(v1)=Q(v1), since Q∘γ=Q. Now assume
Q(v1)=Q(v2). By hypothesis, this is finite, so g(v2)=0. By part (i),
[TABLE]
The left side vanishes since Q(v1)=Q(v2). Thus, v2=γ(v1) for some γ∈G.
(iii) Let v∈Q−1(w). Set x=v in the identity of part (i)
to obtain that f(y)−wg(y)=∏γ∈Gy−γ(v), then
apply
Lemma 2.2.
(iv) Let F(x,y)=g(x)f(y)−f(x)g(y)∈K[x,y]. Since deg(f)=∣G∣>deg(g), this polynomial has degree ∣G∣ in each variable, and by (i),
[TABLE]
Let
[TABLE]
(Since G is projective, u(x) is well-defined only up to a nonzero scalar multiple in K×.)
Let H={(cadb)∈G:c=0}, so ∣H∣=mult(O∞).
Then deg(u)=∣G∣−∣H∣, and
[TABLE]
Note that (cx+d)y−(ax+b) has degree 1 in y because c or d is nonzero; also it has degree 1 in x because c or a is nonzero. Let
[TABLE]
This has degree ∣G∣ in x and in y.
Also, P(x,y) is not divisible by any linear factor rx+s∈K[x] with r=0, because (cx+d)y+(ax+b) can be divisible by rx+s only if
it vanishes at x=−s/r, in which case (cadb)(1−s/r)=(00), contradicting that (cadb) is invertible.
In particular, P(x,y) is not divisible by any nonconstant factor cx+d of u(x), and so it is relatively prime to u(x).
Since u(x)F(x,y)=g(x)P(x,y), u(x) is relatively prime to P(x,y), u(x) must divide g(x).
F(x,y) and P(x,y) both have degree ∣G∣ in x, therefore degx(g/u)=0, i.e., it is constant.
To complete the proof, it remains only to prove that u(x) is a constant multiple of ∏v∈O∞,v=∞(x−v)∣H∣.
Since (cadb)−1=(−cda−b) in PGL2(K) and γ→γ−1 is a bijection of G,
[TABLE]
where the symbol ≡∗ indicates “up to a constant multiple in K×”. Now
−cx+a≡∗1 if c=0, −cx+a≡∗x−a/c if c=0, and a/c=(cadb)(∞)∈O∞.
Thus,
[TABLE]
Let R be a complete set of coset representatives for G/H, excluding the identity coset, so G∖H is the disjoint union of rH for r∈R.
Writing γ=rh with r∈R, h∈H we have γ(∞)=rh(∞)=r(∞), so O∞∖{∞}={r(∞):r∈R}.
Also, {r(∞):r∈R} are distinct, for r(∞)=r′(∞) would imply r−1r′∈H and consequently r′H=rH.
Thus,
[TABLE]
Since g is a constant multiple of u and both have coefficients in K, this proves the result.
Parts (ii) and (iv) of Proposition 3.8
together imply:
[TABLE]
Proposition 3.9
Let G be a finite subgroup of PGL2(K) and Q a quotient map for G. If w∈K∪{∞} then
Q−1(w) is a G-orbit in K∪{∞}.
Proof. First we show that Q−1(w) is nonempty. If w=∞ then ∞∈Q−1(w). Now assume w is finite, and let v∈K
be a root of g(x)w−f(x), where Q=f(x)/g(x) and f,g are relatively prime. If g(v)=0 then the equation g(v)w−f(v)=0 forces f(v)=0, contradicting
that f,g are relatively prime. We conclude that g(v)=0, so w=f(v)/g(v)=Q(v) and v∈Q−1(w). The fact that Q−1(w) is a
G-orbit follows from Proposition 3.8(ii) if w∈K or Proposition 3.8(iv) if w=∞.
3.3 Computation of quotient maps.
From the perspective of Galois theory,
quotient maps arise from invariant theory. We show in this section that they may also be computed
by considering their zeros and poles.
Theorem 3.10
Let G be a finite subgroup of PGL2(K). Let O⊂K be a G-orbit that does not contain ∞ and let mult(O)=∣G∣/∣O∣ be its multiplicity.
Let
[TABLE]
Then there is w∈K such that fO(x)/g(x)+w is a
quotient map for G.
Proof.
Let Q be a quotient map for G. By Proposition 3.8(iv), Q=f/g for some f∈K[x]. On replacing Q by a constant multiple, we can assume that f is monic.
Let v∈O and w=Q(v)∈K.
By Proposition 3.8(iii), f(x)−wg(x)=fO(x). Thus, Q(x)=f(x)/g(x)=fO(x)/g(x)+w.
Example 3.11
Let G={1,β,β2} where β=(110−1). Then
[TABLE]
The denominator of Q is therefore x(x−1). To compute the numerator, select any v∈K∖{0,1} and compute its orbit O.
If the characteristic is not 2, taking v=−1 gives
O={−1,2,1/2}, and fO(x)=(x+1)(x−2)(x−1/2).
The formula for Q will be prettier if we add 3/2, so we take
[TABLE]
It turns out that this formula works for characteristic 2 as well. To see this, suppose that K has characteristic 2 and let ω be a primitive
cube root of 1 in K. Then {ω} is a G-orbit of multiplicity 3, and a quotient map is
[TABLE]
This equals (x3−3x+1)/(x(x−1)) since −3=1 in characteristic 2. Thus, the formula Q(x)=(x3−3x+1)/(x(x−1)) works for all fields.
Example 3.12
Consider G=PGL2(Fq).
Then O∞=Fq∪{∞}, the multiplicity of this orbit is (q3−q)/(q+1)=q2−q, and
∏v∈O∞,v=∞(x−v)=∏v∈Fq(x−v)=xq−x, so g(x)=(xq−x)q2−q.
To compute the numerator, select v∈Fq3∖Fq.
Every element γ(v) has the same degree as v, so the
orbit is contained in Fq3∖Fq.
Further, Ov has full size, because all short orbits are contained
in Fq2∪{∞} by Lemma 2.1. Since ∣PGL2(Fq)∣=q3−q=∣Fq3∖Fq∣, it
follows that Ov=Fq3∖Fq
and we may take the numerator to be
[TABLE]
We obtain f(x)/g(x)=(xq3−x)/(xq−x)q2−q+1. After working out formulas for inv(τ), we decided to alter the definition to
QG(x)=(xq3−x)/(xq−x)q2−q+1+1 because that made the statement of our main theorem for PGL2(Fq) more aesthetic.
If instead we had selected v∈Fq2∖Fq, the orbit would be O=Fq2∖Fq, with multiplicity ∣G∣/∣O∣=(q3−q)/(q2−q)=q+1. Then fO(x)=((xq2−x)/(xq−x))q+1 and
a quotient map is fO(x)/g(x)=(xq2−x)q+1/(xq−x)q2+1.
It turns out that QG and fO(x)/g(x) are equal. In fact, since (xq2−x)q+1=(xq2−x)q(xq2−x),
[TABLE]
Then
[TABLE]
The above method to compute f and g by creating orbits finds quotient maps for most groups we considered. However, it did not work well
when attempting to find a quotient map
for a cyclic group of PGL2(Fq) of order ℓ when ℓ≥3 and ℓ∣q+1, as it is difficult to find an expression for ∏v′∈Ov(x−v′).
Instead, we took advantage that such G is conjugate over a quadratic extension to a diagonal subgroup, and for this group it is easy to find
Q. By composing Q with the element of PGL2(Fq2) that establishes the conjugacy, one obtains an invariant function Q0, but it is not rational
and the denominator has degree ∣G∣. By applying an appropriate linear fractional transformation to Q0, one can regain rationality and the property that the
degree of the denominator is smaller than the degree of the numerator.
This lengthy computation was done in an earlier draft of the article. Fortunately, Xander Faber found a much easier method to compute this quotient map,
given in Proposition 11.4.
The following lemma describes how quotient maps are related when G1 and G2 are conjugate subgroups of
PGL2(K), where K is any field.
Lemma 3.13
Let G1, G2 be finite subgroups of PGL2(K) that are conjugate to one another; i.e., there is α∈PGL2(K)
such that G2={αγα−1:γ∈G1}.
If Q1 is a quotient map for G1 then let Q′=Q1∘α−1 and k=Q′(∞).
Let β be any element of PGL2(K) such that β(k)=∞. Then Q2=β∘Q1∘α−1 is a quotient map for G2.
Proof.Q2∘δ(x)=Q2(x) for all δ∈G2 because for γ∈G1,
[TABLE]
Further, deg(Q2)=deg(Q1)=∣G∣ since linear fractional transformations do not affect the degree.
Finally, Q2(∞)=β∘Q′(∞)=β(k)=∞, therefore the degree of the numerator of Q2 exceeds the degree of the denominator.
Thus, Q2(x) is a quotient map for G2.
4 Artin invariant
Let K be a field and let G be a finite subgroup of PGL2(K).
In the previous section we defined a quotient map for G to be a G-invariant function Q(x)=f(x)/g(x)∈K(x) such that deg(f)=∣G∣>deg(g), and we proved
existence and some properties. In particular, if τ∈K∪{∞} then Q−1(τ) is a G-orbit in K∪{∞}.
Definition 4.1
Let τ∈K∪{∞}.
If the G-orbit Q−1(τ) has full size, i.e., ∣Q−1(τ)∣=∣G∣, then we say that τ is regular (with respect to Q); otherwise it is irregular.
Proposition 4.2** (Definition of Artin invariant)**
Let τ∈K and σ∈Aut(K/K) such that σ(τ)=τ.
Let v∈K such that Q(v)=τ. Then there is γ∈G such that σ(v)=γ(v).
If τ is regular, then the conjugacy class Cγ={δγδ−1:δ∈G} is independent of the
choice of v∈Q−1(τ).
In that case, we write invQ(τ,σ)=Cγ, and we call invQ(τ,σ) the Artin invariant of τ with respect to Q and σ.
If ∞ is regular, i.e., Q−1(∞) has full size, then we define invQ(∞,σ)=C(0110).
Proof.Q−1(τ) is a G-orbit by Proposition 3.9. Since
Q(σ(v))=σ(Q(v))=σ(τ)=τ, v and σ(v)
are both in Q−1(τ), therefore there is γ∈G such that σ(v)=γ(v).
Now suppose that τ is regular. Then ∣Q−1(τ)∣=∣G∣, so γ is uniquely determined from σ and v. We claim that Cγ
depends only on σ and τ, and not on the choice of v∈Q−1(τ). Indeed, suppose that w∈Q−1(τ), and we will show that
σ(w)=α(w) where α∈Cγ.
There is δ∈G such that w=δ(v). Since the entries of δ are rational, σ(w)=σ(δ(v))=δ(σ(v))=δ(γ(v))=δγδ−1(w). Here
δγδ−1∈Cγ, as required.
When τ=∞, then Q−1(τ)={γ(∞):γ∈G}⊂{∞}∪K. If one defines σ(∞)=∞ for all σ∈Aut(K/K),
then σ(v)=v for all v∈Q−1(τ). This is why it makes sense to define inv(∞,σ)=C(0110) when ∞ is regular.
A benefit of this defintion is that it makes certain statements cleaner, for example Proposition 11.10.
If K=Fq and σ=Frobq∈Aut(Fq/Fq)
is the q-power Frobenius, then we will write invQ(τ,q) instead of invQ(τ,Frobq), or simply
inv(τ) if Q and q are understood from the context.
For future reference, the definition of Artin invariant may be briefly summarized as follows when K=Fq and τ∈Fq is regular:
[TABLE]
For arbitrary K, when τ∈K is regular, σ∈Aut(K/K), and σ(τ)=τ, the criterion is:
[TABLE]
If G is abelian, then Cγ={γ}. In that case, we sometimes write invQ(τ,σ)=γ, instead of invQ(τ,σ)=Cγ={γ}.
For every subgroup of PGL2(Fq) that we have investigated,
inv(τ) can be described directly in terms of τ, e.g., involving Legendre symbols or other numerical invariants, without reference to v.
As a matter of notation, we often use a symbol
[τ/q] to denote these values that are directly computed from τ. For instance, in Example 1.3, we can define [τ/q]=((qτ),(qτ−1)) for τ∈Fq∖{0,1}, and then (1) describes inv(τ,q) directly in terms of [τ/q].
Proposition 4.3
Let q be a prime power, G a subgroup of PGL2(Fq), and Q∈Fq(x)
a quotient map for G, as in Definition 3.5.
(i)
For γ∈G, let
[TABLE]
Then VG,q decomposes into exactly qG-orbits, and Q induces a bijection between these orbits and Fq.
2. (ii)
If v∈VG,q and ∣Ov∣=∣G∣, then there is a unique γ∈G
such that v∈Vγ,q.
3. (iii)
For each τ∈Fq there is a conjugacy class C⊂G
such that Q−1(τ)⊂∪γ∈CVγ,q.
If τ is regular ( i.e., ∣Q−1(τ)∣=∣G∣), then C is uniquely determined and C=invQ(τ,q).
4. (iv)
If G is abelian, then for each τ∈Fq there is γ∈G such that Q−1(τ)⊂Vγ,q. If in addition
τ is regular, then γ=invQ(τ,q).
5. (v)
Suppose γ∈G has order t≥3, and let Cγ={αγα−1:α∈G}. Then t∣(q+κ) for a unique κ∈{0,1,−1},
and the number of regular elements τ∈Fq with invQ(τ,q)=Cγ is
exactly ∣Cγ∣(q+κ)/∣G∣. In particular, if G is abelian then there are exactly
(q+κ)/∣G∣ regular elements τ∈Fq with invQ(τ,q)=γ.
Proof.(i) Let v∈Fq∖O∞ and τ=Q(v)∈Fq.
Since each preimage set Q−1(τ) is a G-orbit by Proposition 3.9,
[TABLE]
This shows
[TABLE]
Since each preimage set Q−1(τ) is a G-orbit
and Fq has q elements, VG,q partitions into exactly q orbits.
(ii) If v∈VG,q, then v∈Vγ,q for some γ∈G, so vq=γ(v). If in addition the orbit of v has full size,
then the elements γ(v) for γ∈G are distinct, so that γ is uniquely determined from v and q.
(iii) and (iv) Suppose τ∈Fq and v∈Q−1(τ).
By part (i), which we have already proved,
there is γ∈G such that vq=γ(v).
Let C={αγα−1:α∈G}, the conjugacy class of γ. We claim that
Ov⊂∪β∈CVβ,q. To see this, let w=α(v)∈Ov, where α∈G.
Since the entries of α are in Fq,
[TABLE]
therefore w∈Vβ,q where β=αγα−1∈C. This proves the claim. Now suppose τ is regular.
For any v∈Q−1(τ) there is β∈C such that vq=β(v). Then
invQ(τ,q)=Cβ by (8). Since β∈C, C=Cβ.
(v) By (iii), the number of regular τ∈Fq with invQ(τ,q)=Cγ is the number of full-sized G-orbits in
∪β∈CγVβ,q. By Proposition 2.4, this number is ∣Cγ∣(q+κ)/∣G∣.
Recall that if G⊂PGL2(K), there was some choice in the definition of Q, as one could change it to aQ+b, where a,b∈K and a=0.
Since τ=Q(v)⟺aτ+b=(aQ+b)(v), the set of preimages of τ under Q is the same as the set of preimages of aτ+b under aQ+b.
In particular, τ is regular with respect to Q iff aτ+b is regular with respect to aQ+b, and in that case
[TABLE]
We select a,b so that the invariants, when expressed in terms of τ, have simple and natural expressions.
If two finite subgroups of PGL2(K) are conjugate to one another by a rational linear fractional transformation, then their Artin invariants are
essentially equivalent, as shown below.
Thus, we are free to normalize groups via rational conjugation when possible. If σ∈Aut(K/K) then we define σ(∞)=∞.
Lemma 4.4
Suppose that G1,G2 are finite subgroups of PGL2(K) that are conjugate to one another; that is, there is α∈PGL2(K) such that
G2={αγα−1:γ∈G1}. If Q1 is a quotient map for G1 then let Q2=β∘Q1∘α−1
be a quotient map for G2, as in Lemma 3.13. Then τ∈K∪{∞} is regular with respect to Q1 iff β(τ) is regular
with respect to G2. Further, if τ∈K∪{∞} is regular, σ∈Aut(K/K), and σ(τ)=τ then
[TABLE]
Proof.Q1(v)=τ iff β∘Q1(v)=β(τ)
iff Q2(α(v))=β(τ). Therefore, Q2−1(β(τ))=α(Q1−1(τ)).
It follows that Q1−1(τ) has full size iff Q2−1(β(τ)) has full size, so τ is regular wrt Q1 iff β(τ) is regular
wrt Q2. In that case, γ∈invQ1(τ,σ) iff there is v∈Q1−1(τ) with σ(v)=γ(v) iff there is w=α(v)∈Q2−1(β(τ)) with
σ(w)=α(σ(v))=αγ(v)=αγα−1(w) iff αγα−1∈invQ2(β(τ)).
Note that this proof is valid even when τ=∞ or β(τ)=∞.
The next lemma shows that if H⊂G are finite subgroups
of PGL2(K) then their Artin invariants
are closely related. If δ∈H, let Cδ,H={γδγ−1:γ∈H}.
Then Cδ,H⊂Cδ,G.
Let QG, QH be quotient maps for G and H.
By Proposition 3.7, there is a unique rational function
h∈K(x) of degree ∣G∣/∣H∣ such that QG=h∘QH.
Lemma 4.5
Let G,H,QG=h(QH) be as above.
Suppose h(τ) is regular with respect to G, where τ∈K∪{∞}.
Then τ is regular with respect to H, and for any σ∈Aut(K/K)
such that σ(τ)=τ, there is δ∈H such that
[TABLE]
Proof. Let V=QH−1(τ); this is an H-orbit by Proposition 3.9.
Let v∈V. Then σ(v)∈V, and there is δ∈H such that σ(v)=δ(v).
Since QG(v)=h(QH(v))=h(τ), v is in the G-orbit QG−1(h(τ)).
By hypothesis, h(τ) is regular with respect to QG, therefore
γ(v) for γ∈G are distinct.
Then V={γ(v):γ∈H} has ∣H∣ distinct elements, so τ is regular with respect to QH.
Since QH(v)=τ, QG(v)=h(τ), and σ(v)=δ(v), (9) implies
invQH(τ,σ)=Cδ,H and invQG(h(τ),σ)=Cδ,G.
Part II Small subgroups of PGL2(K)
This part considers finite subgroups that are contained in PGL2(K) for any K. Sections 5 and 6
contain known examples, and Sections 7 and 8 contain new ones.
5 An example related to Dickson polynomials
Anyone who has studied Dickson polynomials is probably familiar with the lemma that v↦v+1/v
gives a surjective map from μq−1∪μq+1 onto Fq.
This lemma appears in a 1961 article by Brewer [5], and was probably known earlier.
This section examines that lemma from the Artin invariant perspective.
Let K be any field, c∈K×, and
G={(0110),(100c)}⊂PGL2(K).
The G-orbits are Ov={v,c/v} for v∈K∪{∞}, and the short orbits are {c} and {−c}.
A quotient map is Q(x)=x+c/x.
The short orbits {c} and {−c} are sent under Q to 2c and −2c, respectively;
these are the irregular elements of K∪{∞}.
Proposition 5.1
Let G and Q be as above.
Let τ∈K be regular (equivalently, τ2−4c=0) and let σ∈Aut(K/K)
such that σ(τ)=τ. If char(K)=2, then
inv(τ,σ)=(100c)(1−A)/2, where A=σ(τ2−4c)/τ2−4c∈{1,−1}.
If char(K)=2, let X be a root of X2+X+c/τ2=0. Then σ(X)=X+j, where j∈F2, and inv(τ,σ)=(100c)j.
Proof. The solutions to Q(v)=τ are the roots of x2−τx+c. Denote these roots by v and v′. Let γ=inv(τ,σ)∈G, so σ(v)=γ(v).
If char(K)=2 then {v,v′}={(τ±τ2−4c)/2}.
If σ(v)=v then σ(τ2−4c)=τ2−4c and γ=1; otherwise σ(v)=v′, σ(τ2−4c)=−τ2−4c, γ=(100c).
This proves the proposition when the characteristic is not 2.
If char(K)=2, then v/τ, v′/τ are the two solutions to X2+X=c/τ2, and v′/τ=(v/τ)+1.
If σ(v)=v then σ(X)=X and γ=(0110). If σ(v)=v then σ(v)=v′, σ(X)=X+1 and γ=(100c). The result follows.
Consider the case K=Fq and σ(x)=xq. If τ∈Fq then Q−1(τ) is a G-orbit, say {v,c/v}, and τq=τ iff vq∈{v,c/v}.
When c=1, then vq∈{v,1/v} iff v∈μq−1∪μq+1, and one obtains the result mentioned above
that v↦v+1/v gives a surjective map of μq−1∪μq+1 onto Fq.
Proposition 5.1 in this case is due to Brewer [5] for q odd, and Dillon-Dobbertin [9] when q is even.
In the case where q is even, the element j in Proposition 5.1 is equal to TrFq/F2(c/τ2).
Proposition 5.2
(Brewer [5] for q odd; Dillon and Dobbertin [9] for q even).*
Let q be a prime power and Q(x)=x+c/x, where c∈Fq×. Every τ∈Fq may be written as τ=Q(v), where v∈Fq×
and where
vq=v or vq=c/v. Conversely, if vq=v or vq=c/v then Q(v)∈Fq.
Let τ=Q(v)∈Fq.
If τ2=4c then v=±c and vq=v=c/v. If τ2=4c, then*
for q odd: vq=v⟺(qτ2−4c)=1; vq=c/v⟺(qτ2−4c)=−1;
2. 2.
for q even: vq=v⟺TrFq/F2(c/τ2)=0; vq=c/v⟺TrFq/F2(c/τ2)=1.
Brewer proved Proposition 5.2(1) and used it to compute the number of Fp-rational points
of a curve y2=Dn(x) over a prime field Fp, where Dn(x) is a Dickson polynomial, determined by the property that Dn(x+1/x)=xn+1/xn.
These point-counting formulas were applied to determine some character sums.
Dillon and Dobbertin proved Proposition 5.2(2) and used it to show that for q even, Dn(Sj)⊂Sj∪{0}, where
Sj={τ∈Fq×:TrFq/F2(1/τ)=j} for j∈{0,1}.
Analogues of the result of Dillon and Dobbertin for the case of odd characteristic are formulated in [4].
Remark. The large difference in behavior between odd or even characteristic in Proposition 5.2
is attributable to the fact that the transformation x↦c/x has a unique fixed point in the algebraic closure in characteristic 2, but two fixed points in odd characteristic.
Consequently, G is conjugate to the unipotent group {(0110),(0111)} in characteristic 2.
Unipotent groups are related to additive or linear
maps (see Section 10), consistent with the appearance of a trace map in Proposition 5.2(2).
This phenomenon will revisit us in Section 7, when we study a group of order 3.
As shown in [3, Section 9], Proposition 5.2
can be used to obtain a quick proof of Legendre symbol formulas (q2), (q3), and (q5).
6 Kummer and Klein examples
This section shows that two groups that were considered in the introduction for finite fields generalize to an arbitrary field K.
Kummer extensions. (See Example 1.2.)
Suppose K contains the primitive nth roots of unity, so in particular p∤n if K has finite characteristic p.
Let G={(0a10):an=1}⊂PGL2(K). Then Q(x)=xn is a quotient map. If τ∈K× then τ is regular, Q−1(τ)={aτ1/n:an=1}, and if σ∈Aut(K(τ1/n)/K) then invQ(τ,σ)=(0a10), where a=σ(τ1/n)/τ1/n∈μn.
Klein group. (See Example 1.3 and [2].)
Let G={(0110),(0−110),(100b),(100−b)}⊂PGL2(K), where b is a fixed element of K×. Assume the
characteristic of K is not 2. The short orbits are
O∞={∞,0}, {±b}, and {±−b}. A quotient map is Q(x)=(x+b/x)2/4, and b,0,∞ are irregular.
Let τ∈K. Then Q−1(τ)={±τ±τ−b}, and if v=τ+τ−b
(for some choices of square root), then b/v=τ−τ−b. Suppose that τ is regular (i.e., τ∈{0,b}),
σ∈Aut(K/K), and σ(τ)=τ.
Let A=σ(τ)/τ
and B=σ(τ−b)/τ−b. Then inv(τ,σ)=(0A10)(100b)(1−AB)/2.
7 Artin invariant for a transformation group of order 3
Consider
G3={I,β,β2} where
[TABLE]
and K is any field.
The G3-orbits of K∪{∞} are O∞={∞,1,0} and
[TABLE]
G3 is normalized by the map ρ=(1001) that takes v to 1/v:
ρβρ=β2=β−1. This feature will appear in our
analysis. (See Lemma 7.4.)
The characteristic-3 case turns out to be very different from other characteristics.
In fact, our result for characteristic 3 is strikingly similar to the theorem
of Dillon and Dobbertin (see Prop. 5.2(2)).
This phenomenon will be explained at the end of this section.
7.1 Short orbits, quotient map, irregular elements.
Lemma 7.1
The short orbits of G3 (that is, the orbits with fewer than three
elements) are {−1} in characteristic 3, or {−ω}
and {−ω2} in characteristic different from 3, where ω
is a primitive cube root of unity in K.
Proof.
By Lemma 2.1, v is in a short orbit if
and only if v=β(v) or v=β−1(v), or equivalently,
v2−v+1=0. In characteristic 3, this factors as (v+1)2=0, so
{−1} is the only short orbit. If the characteristic is not three,
then v2−v+1=0⟺v∈{−ω,−ω2}.
Lemma 7.2
Q3(x)=(x3−3x+1)/(x(x−1))* is a quotient map for G3 over any field.
The set of irregular elements of K∪{∞} is {0} if char(K)=3 and
{−3ω,−3ω2} if char(K)=3, where ω is a
primitive cube root of unity in K. That is, the irregular elements are the roots
of τ2−3τ+9=0.*
Proof. The formula for the quotient map was computed in Example 3.11.
The irregular points are the images under Q3 of the short orbits. These are
Q3(−1)=0 in char. 3, and Q3(−ω)=−3ω,
Q3(−ω2)=−3ω2 in char. =3.
Lemma 7.3
Q3(1/x)=3−Q3(x).
Proof. This is a simple computation.
Lemma 7.4
If τ∈K is regular then so is 3−τ, and for any σ∈Aut(K/K)
such that σ(τ)=τ we have
invQ3(3−τ,σ)=invQ3(τ,σ)−1.
Proof. By Lemma 7.3, τ=Q3(v)⟺3−τ=Q3(1/v). The short elements of K are closed under reciprocal,
therefore τ is regular iff 3−τ is regular. Let ρ=(1001). Now
[TABLE]
Since Q3(1/v)=3−τ and σ(1/v)=β−j(1/v), this shows that inv(3−τ,σ)=β−j=inv(τ,σ)−1.
If τ∈Fq is regular then inv(τ)∈G3
is the unique element γ∈G3 such that vq=γ(v) for any (hence every) v∈Q3−1(τ). Recalling that β=(110−1),
and noting that v∈O∞={∞,0,1},
[TABLE]
7.2 Explicit description of inv(τ,σ) when char(K)=3.
We wish to express inv(τ,σ)
purely in terms of τ, without reference to v.
Our method is to solve for v in terms of τ
and then determine how the Galois group permutes the solutions.
The equation relating v and τ is cubic in v,
namely,
[TABLE]
There are well-documented ways to explicitly solve a cubic dating back to the 1500’s, however
these fail in characteristic 3. This section assumes char(K)=3,
and the characteristic-3 case will be considered
in Section 7.3.
Let ω denote a fixed primitive cube root of 1 in K.
Then ω2+ω+1=0.
The first step to solve a cubic x3+Ax2+Bx+C is to make a change of
variables y=x+A/3 so as to eliminate the x2 term. Writing
y3+Dy+E=0, substitute y=z+k/z to obtain
[TABLE]
By setting k=−D/3, the z and z−1 terms drop out:
[TABLE]
Then z3=(−E±E2+4D3/27)/2.
The right side has two possible values, so z has six possible values,
however y=z+k/z turns out to have only three possible values.
Then z6−(2τ^−1)Rz3+R3=0, so (z3/R)2−(2τ^−1)(z3/R)+R=0 and
[TABLE]
Note that (2τ^−1)2−4R=−3 and ω=(−1+−3)/2 for
an appropriate choice of −3. Thus, one choice of z satisfies
[TABLE]
Fix λ,μ∈K such that
[TABLE]
Then λμ is a cube root of R, so one solution for z is
z=λ2μ. Then v=y+τ^=τ^+z+R/z=τ^+λ2μ+λ3μ3/(λ2μ)=τ^+λ2μ+λμ2.
If we set λ′=ωjλ for j∈Z/3Z and use λ′ in the above
construction instead of λ, then we arrive at a solution
[TABLE]
Proposition 7.5
Suppose char(K)=3, let τ∈K
and λ,μ,vj as in (15) and (16).
Then Q3(vj)=τ, where Q3(x)=(x3−3x+1)/(x2−x). Also,
[TABLE]
Proof. That Q3(vj)=τ was proved above. By Proposition 3.9, v0, v1, and v2
belong to the same G3-orbit. Either v1=1−1/v0, in which case v0v1=v0−1,
or v1=1/(1−v0), in which case v0v1=v1−1.
To see which of these holds, we compute v0v1. As before, let τ^=τ/3. Then
[TABLE]
This computation shows that v1=1−1/v0, i.e., v1=β(v0), where β=(110−1).
Since {v0,v1,v2} is an orbit, it must be that v2=β(v1).
It is interesting to note what happens when τ is irregular.
Then, as shown in Section 7.1, τ∈{−3ω,−3ω2}, therefore
λμ=0 and vj=τ/3 for all j.
The labeling of v’s depends on the choices for ω, λ and μ.
However, for any such choice, β(vj)=1−1/vj=vj+1 for each j. In other words,
[TABLE]
The next theorem describes invQ3(τ,σ) directly in terms of σ and τ.
Theorem 7.6
*Suppose char(K)=3, and let σ∈Aut(K/K).
If τ∈K∖{−3ω,−3ω2} and σ(τ)=τ, then
invQ3(τ,σ)=βℓ where ℓ is determined from τ as follows.
(i) Let ζ∈K such that*
[TABLE]
*Then σ2(ζ)/ζ=ωℓ.
(ii) If K=Fq and σ(x)=xq, where 3∤q, then*
[TABLE]
Proof.
Since Q(vj)=τ and inv(τ,σ)=βℓ, (9) and (18) imply
σ(vj)=βℓ(vj)=vj+ℓ, hence
[TABLE]
Let λ,μ be as in (15) and ζ0=μ/λ.
Then ζ03=(τ+3ω2)/(τ+3ω)=ζ3, therefore ζ=ωiζ0
for some i∈Z/3Z. Since ω is defined over at most a quadratic
extension of K, σ2(ω)=1 and hence σ2(ζ)/ζ=σ2(ζ0)/ζ0.
Now σ2(ζ0)/ζ0
is a cube root of unity, because its cube is equal to σ2(ζ03)/ζ03=1.
Let ωk=σ2(ζ0)/ζ0.
which implies σ2(vj)=vj−k=vj+2k.
We have shown σ2(vj)=vj+2k=vj+2ℓ. Since v0,v1,v2
are distinct when τ is regular, it follows that k≡ℓ(mod3).
This proves (i).
If K=Fq and σ(x)=xq, then
[TABLE]
proving (ii).
If the choice of ω is changed to ω~=ω2, then ℓ does not change:
λ and μ are exchanged, and so the new ζ0 value is ζ0=1/ζ0
and σ2(ζ)/ζ=σ2(ζ−1)/ζ−1=ω−ℓ=ωℓ.
This is to be expected; for example when K=Fq, βℓ reflects the form of
equation satisfied by v∈Q3−1(τ) (see (13)),
and this is certainly independent of the choice of ω.
7.3 Explicit description of inv(τ,σ) in characteristic 3.
As promised, we return to the case of char. 3.
Then the only short G3-orbit is {−1}, and the only irregular element is Q3(−1)=0. Let τ∈K× and write τ=Q3(v)=(v+1)3/(v(v−1)).
Note that v∈F3 since τ∈{∞,0}.
Suppose σ∈Aut(K/K) and σ(τ)=τ.
Then invQ3(τ,σ)=βℓ is determined from
σ(v)=βℓ(v). We wish to describe invQ3(τ,σ)
purely in terms of τ and σ, without reference to v. The approach of solving for v in terms of τ
no longer works in characteristic 3, so we must try something different.
Proposition 7.7
Let K be a field of characteristic 3 and let τ∈K be regular (so τ=0).
Let σ∈Aut(K/K)
and assume σ(τ)=τ. Let ζ∈K satisfy ζ3−ζ=1/τ. Then there is ℓ∈F3 such that σ(ζ)=ζ+ℓ,
and we have invQ3(τ,σ)=βℓ.
Proof.
Let v∈Q−1(τ). Since τ=(v3+1)/(v2−v), v3−τv2+τv+1=0. Since τ∈{0,∞},
v∈F3. The substitution y=v+1 eliminates the linear term:
[TABLE]
Let ζ=−1/y=−1/(v+1). (Here note that y=0 since v∈F3.) Then
[TABLE]
Let ℓ=σ(ζ)−ζ. Then ℓ∈F3, because
[TABLE]
The other roots of x3−x=1/τ are ζ+i, i∈F3, and σ(ζ+i)−(ζ+i)=ℓ for all three roots.
Since ζ=−1/(v+1)=(101−1)(v),
[TABLE]
Thus, invQ3(τ,σ)=βℓ, where ℓ=σ(ζ)−ζ.
Corollary 7.8
If τ∈Fq×, where q=3n, then invQ3(τ,q)=βℓ, where ℓ=TrFq/F3(1/τ).
Proof. Let ζ∈Fq satisfy ζ3−ζ=1/τ. By Proposition 7.7, ζq=ζ+ℓ for some ℓ∈F3, and invQ3(τ,q)=βℓ.
We claim that ℓ=TrFq/F3(1/τ). Indeed,
[TABLE]
7.4 A symbol with values in Z/3Z.
Let K=Fq, where q is any prime power. Then
inv(τ,q)∈G3={I,β,β−1} for regular τ∈Fq. G3 is isomorphic to Z/3Z abstractly, but making this explicit
requires selecting a preferred generator, which seemingly could equally well be β or β−1. On the other hand, Corollary 7.8 relates
inv(τ,q) with the absolute trace map in char. 3, which
is genuinely a map to Z/3Z. Specifically, if q=3n and τ=Q3(v)∈Fq×, then
[TABLE]
The trace map
determines the preferred generator β∈G3, or equivalently a preferred isomorphism logβ:G3→Z/3.
Then, for all characteristics, logβ(inv(τ)) takes values in Z/3Z. We summarize this in the theorem below.
Theorem 7.9
(A tripartite symbol)*
Let q be any prime power. Let τ∈Fq, and assume τ2−3τ+9=0.
Define a symbol [τ/q]∈Z/3Z by*
[TABLE]
[TABLE]
where ω is any primitive cube root of unity in Fq when 3∤q.
Let β=(110−1)∈PGL2(Fq).
Then β has order 3, so βj is well defined for j∈Z/3Z.
If v∈Fq such that v3−3v+1=v(v−1)τ, then
[TABLE]
Moreover, (19) determines [τ/q]∈Z/3Z uniquely and could serve as an alternative definition for the symbol.
Proof. This is immediate from Theorem 7.6 and
Corollary 7.8.
Theorem 7.9 weaves together fields of different characteristic in a remarkable way.
The group G3 is defined over the integers, so G3⊂PGL2(K) for any field K. Taking K=Fq,
this is consistent with the fact that 3 divides ∣PGL2(Fq)∣=q(q−1)(q+1); in particular, 3 could divide q, q−1, or q+1.
Generally speaking, these three cases behave very differently, e.g.,
when 3∣q, β has a single eigenvalue and it is conjugate to (0111). If 3∣q−1 then β has two rational eigenvalues and it is
conjugate to a diagonal matrix of order 3. If 3∣q+1, then β has a pair of quadratic irrational eigenvalues. The equation (19)
applies to all these cases simultaneously.
We point out the similarity between Corollary 7.8
(when q=3n) and Proposition 5.2(2) (when q=2n).
(See the remark following Proposition 5.2.)
In Corollary 7.8, the order-3 element β is conjugate to (0111) in characteristic 3, and
[TABLE]
In Proposition 5.2(2) with G={(0110),(1001)}, the order-2 element γ=(1001) is conjugate to
(0111) in characteristic 2, and
[TABLE]
In both cases, the appearance of the trace map can be explained by Lemma 4.4
and Proposition 10.7(i).
8 The dihedral group of order 6
Consider the subgroup G6⊂PGL2(K) that is generated by the transformations
β(x)=1−1/x and ρ(x)=1/x. This group is dihedral of order 6 since β3=1, ρ2=1,
and ρβiρ=β−i.
The orbit of v∈K∪{∞} is
[TABLE]
Note that O∞={∞,1,0} is short.
To find the other short orbits, we find all v∈K∖{0,1} such that v=γ(v) for some 1=γ∈G.
If char(K)∈{2,3}, then
•
v=1−1/v iff v∈{−ω,−ω2}, where ω2+ω+1=0;
•
v=1/(1−v) iff v∈{−ω,−ω2};
•
v=1/v iff v=−1. (Here v=1 is excluded since it belongs to O∞.)
•
v=v/(v−1) iff v=2. (Here v=0 is excluded since it belongs to O∞.)
•
v=1−v iff v=1/2.
The short orbits are {−ω,−ω2}, {−1,2,1/2}, and O∞ in that case.
If char(K)=2 then the latter three equations have no solutions in K∖F2, and the only short orbits in K∪{∞}
are {−ω,−ω2}=F4∖F2 and O∞=F2∪{∞}. Finally, if char(K)=3 then
the short orbits are {−1} and O∞.
Lemma 8.1
The function
[TABLE]
is a quotient map for G6 over any field K.
The set of irregular elements of K∪{∞} is S∪{∞}, where
[TABLE]
Proof. Note that Q6(x)=−Q3(x)Q3(1/x), where Q3(x)=(x3−3x+1)/(x(x−1)) is the quotient map for G3
given in Lemma 7.2.
It is clear that Q6(x)=Q6(1/x). Also,
Q6(β(x))=−Q3(β(x))Q3(ρ(β(x)))=−Q3(x)Q3(β2ρ(x))=Q6(x). This proves G-invariance. The degree of
the numerator is 6=∣G6∣ and the degree of the denominator is <∣G6∣. Thus, Q6 satisfies all required properties to be a quotient map for G6.
The irregular elements are Q6(v), where v is in a short G6-orbit. The short G6-orbits were computed in the paragraph preceding the statement of the lemma.
Computing their images under Q6 demonstrates that the irregular elements are S∪{∞}.
Amusingly, Artin [1, §II.G] considers the
particular example of finding the fixed field in K(x) to the set of automorphisms f(x)↦f(γ(x)) for γ∈G6.
He finds that the fixed field is K(I) where I(x)=(x2−x+1)3/(x2(x−1)2).
Note that I(x)=Q6(x)+9. In the notation of Theorem 3.10, I(x)=fO(x)/g(x), where O={−ω,−ω2}.
Recall that invQ6(τ,σ) is a certain conjugacy class in G6. The conjugacy classes are
[TABLE]
The next proposition computes invQ6(τ,σ).
Proposition 8.2
*Let τ∈K be regular with respect to Q6
and let σ∈Aut(K/K) such that σ(τ)=τ.
Let z∈K satisfy z2−3z=τ. Then
(i) z is regular with respect to Q3.
(ii) If σ(z)=z then γ=invQ3(z,σ)∈G3 is defined, and invQ6(τ,σ)=Cγ.
(iii) If σ(z)=z, then invQ6(τ,σ)=Cρ.
(iv) If char(K)=2, then σ(z)=z iff σ(9+4τ)=9+4τ. If K=F2n and σ(x)=x2n, then
σ(z)=z iff TrF2n/F2(τ)=0.*
Proof. By Lemma 7.3, Q6(x)=−Q3(x)Q3(1/x)=−Q3(x)(3−Q3(x)). Thus, Q6(x)=h∘Q3(x)
and τ=h(z), where h(x)=x2−3x. The statements (i) and (ii) are true by Lemma 4.5, and (iv) is well known.
It remains only to prove (iii). Let v∈Q3−1(z).
Then Q6(v)=h(Q3(v))=h(z)=τ, so that by Proposition 3.9, Q6−1(τ)={γ(v):γ∈G}.
Since Q6(σ(v))=σ(τ)=τ, σ(v)=γ(v) for some γ∈G6, and by (9), invQ6(τ,σ)=Cγ.
If γ∈H, then
[TABLE]
contrary to the hypothesis that σ(z)=z. Then γ∈G∖H=Cρ, so Cρ=Cγ=invQ6(τ,σ).
Part III Subgroups of PGL2(Fq)
This part considers many different subgroups of PGL2(Fq), including Borel subgroups, unipotent subgroups, cyclic subgroups,
PGL2(Fq), and PSL2(Fq). As indicated in the introduction (Examples 1.4 and 1.5), explicit computation of Artin invariants
reveals arithmetic information about additive polynomials and conjugacy classes of PGL2(Fq).
9 Borel subgroup of PGL2(Fq)
The Borel subgroup Bq⊂PGL2(Fq) is defined as
[TABLE]
The cardinality is q(q−1), and the short orbits are {∞} and Fq. The orbit Fq has multiplicity ∣Bq∣/q=q−1. By
Theorem 3.10, a quotient map is given by
[TABLE]
The irregular elements are the images of the short orbits under Q, namely 0 and ∞.
The conjugacy classes of Bq are C(0a10) for a∈Fq× and C(0111).
No element τ∈Fq× has inv(τ)=C(0110), because vq=v implies that v belongs to a short Bq-orbit.
Proposition 9.1
If τ∈Fq× then
[TABLE]
Proof. If v∈Fq∖Fq and vq=(0111)(v)=v+1 then Q(v)=(vq−v)q−1=1. Thus, inv(1)=C(0111).
If τ=1 and vq=(0τ10)(v)=τv then
Q(v)=(vq−v)q−1=vq−1(vq−1−1)q−1=τ(τ−1)q−1=τ. Thus, inv(τ)=C(0τ10) when τ=1.
Now we generalize. Suppose that q=Pe, where P is a prime power, and let
[TABLE]
Then QH(x)=(xP−x)P−1 is a quotient map, {∞} and FP are the only short BP-orbits, and 0 and ∞ are irregular.
The conjugacy classes of H are C(0a10),H with a∈FP× and C(0111),H, where Cγ,H denotes {αγα−1:α∈H}.
Let N and Tr denote the polynomials in Fq[x]:
[TABLE]
If τ∈Fq then N(τ)=NFq/FP(τ) and Tr(τ)=TrFq/FP(τ).
For each a∈FP, there are exactly q/P elements in Fq with trace a,
and q/P is the degree of Tr(x), thus
[TABLE]
Likewise, if τ∈Fq and N(τ)∈FP× then τ∈Fq×, because τq−1=N(τ)P−1=1.
Note also that if τ=sP−1 and N(τ)=1 then s∈Fq×, because sq−1=N(sP−1)=N(τ).
Proposition 9.2
*With respect to H and QH given above, for τ∈Fq×:
(i) If N(τ)=1 then invQH(τ,q)=C(0N(τ)10),H.
(ii) If N(τ)=1 then we may write τ=sP−1 with s∈Fq×, and*
[TABLE]
Proof. We will apply Lemma 4.5, taking G=Bq and H=BP. First, we compute a function h such that QG=h∘QH:
[TABLE]
Thus, h(x)=N(x)f(x)q−1.
Let τ∈Fq× and v∈QH−1(τ), so τ=(vP−v)P−1. Then h(τ)=h∘QH(v)=QG(v)=(vq−v)q−1. Since
f(τ)∈Fq, h(τ)=N(τ)f(τ)q−1∈{N(τ),0}. On the other hand, h(τ)=(vq−v)q−1 vanishes if and only if v∈Fq. Thus,
[TABLE]
Since (vP−v)P−1=τ=0, v∈FP.
Let s∈Fq such that τ=sP−1. Then
(s/(vP−v))P−1=1, so s=c(vP−v) with c∈FP×, and Tr(s)=cTr(vP−v)=c(vq−v). In particular, Tr(s)=0 iff v∈Fq∖FP. Thus, if Tr(s)=0 then
N(τ)=(vP−v)q−1=1,
and the formulas τ=QH(v), vq=v imply invQH(τ)=C(0110).
Now suppose Tr(s)=0, so v∈Fq.
Then h(τ)=N(τ)=0, so it is regular with respect to QG. By Lemma 4.5,
there is δ∈H such that invQH(τ,q)=Cδ,H and invQG(N(τ),q)=Cδ,G. On the other hand, Proposition 9.1 implies
invQG(N(τ),q)=Cγ,G, where γ=(0N(τ)10) if N(τ)=1 and γ=(0111) if N(τ)=1. In both cases,
Cγ,G={(0N(τ)1b):b∈Fq} and Cγ,G∩H=Cγ,H. Since δ∈Cδ,G∩H=Cγ,G∩H=Cγ,H,
it follows that invQH(τ,q)=Cδ,H=Cγ,H.
10 Unipotent subgroups of PGL2(Fq)
Let q=pn where p is prime.
A unipotent subgroup of PGL2(Fq) is a group GW={(011w):w∈W}, where W is an Fp-vector subspace of Fq.
Note that {∞} is the only short orbit. All other orbits are cosets of W in Fq, and each has cardinality ∣GW∣=pdim(W).
Every element of Fq is regular.
Thus, for each τ∈Fq, there is a unique γ=(011j)∈GW such that
vq=γ(v) for all v∈QW−1(τ). Otherwise put, if QW(v)=τ∈Fq, then j:=vq−v∈W, and j depends only on τ.
A simple example is W=Fp⊂Fq, and GW⊂PGL2(Fq) is the subgroup of order p generated by (0111). Then Q(x)=xp−x
is a quotient map111The polynomial xp−x−τ is called an Artin-Schreier polynomial.
If TrFq/Fp(τ)=0 then its splitting field has degree p
and Galois group Z/pZ. See [12, VI, §6, Th. 6.4]..
Let τ=Q(v)∈Fq. Then
vq=(011j)v=v+j for some j∈Fp, and inv(τ)=(011j).
To relate inv(τ) to a quantity that is directly computable from τ, we note that
[TABLE]
Thus, the invariant coming from this group is essentially the absolute trace of τ.
Now let W be an arbitrary Fp-vector subspace of Fq. Then
[TABLE]
is easily seen to be GW-invariant, so it is a quotient map for GW.
Lemma 10.1
QW(x)* is an additive polynomial, i.e., QW(x+y)=QW(x)+QW(y).*
Proof. See Goss [11], Theorem 1.2.1. Alternatively, observe that QW(x) and QW(x+y) are both quotient maps for GW
over the field Fq(y), as both are invariant under GW and of the right form. By Proposition 3.4,
there are a,b∈Fq(y) with a=0 such that QW(x+y)=aQW(x)+b. Since QW(x+y) and QW(x) are both monic as polynomials in x,
a must be 1. The value for b can be found by setting x=0: QW(y)=QW(0)+b=b. Hence, QW(x+y)=QW(x)+QW(y).
Suppose now that P is a power of p and Fp⊂FP⊂Fq, and that W is an FP-vector subspace of Fq. In that case, QW is FP-additive, meaning that it is additive and it satisfies the additional property that QW(ax)=aQW(x) for all a∈FP.
Lemma 10.2
A monic polynomial L(x)∈Fq[x] is FP-additive if and only if it has the form xPd+∑i=0d−1aixPi,
where ai∈Fq.
Let q=Pe.
Let W⊂Fq be a d-dimensional FP-vector subspace and Y=QW(Fq). Then Y is an (e−d)-dimensional
FP-vector subspace of Fq, and QY∘QW(x)=xq−x.
Proof. Since QW is FP-additive, it may be viewed as an FP-linear map from Fq to Fq. Its image Y is then an FP-vector subspace of Fq.
Note that W is the kernel. Because of the exact sequence 0→W→Fq→Y→0, dimFP(W)+dimFP(Y)=dimFP(Fq)=e.
Let Z be a complementary subspace to W, that is, dimFP(Z)=e−d and Z+W=Fq. Then QW maps Z isomorphically onto Y, and
[TABLE]
Proposition 10.4
Let W and Y be as in Proposition 10.3.
If τ∈Fq then QW−1(τ) is a GW-orbit ( i.e., a coset v+W⊂Fq), and there is a unique γ=(011w)∈GW
such that vq=γ(v)=v+w for all v∈QW−1(τ). Moreover, w=QY(τ)∈W.
Proof. Writing QW(v)=τ, we have 0=τq−τ=QW(vq)−QW(v)=QW(vq−v), so vq−v∈W. Set w=vq−v.
By Proposition 10.3, w=vq−v=QY(QW(v))=QY(τ).
In the above proposition, γ=invQW(τ) is expressed directly in terms of τ:
[TABLE]
This is surprising, as it is not even obvious that QY(τ) belongs to W.
The following corollary may be of independent interest.
Corollary 10.5
(Reciprocity)* If q=Pe, W is a d-dimensional FP-vector subspace of Fq, and Y=QW(Fq), then there are short exact
sequences of FP-vector spaces:*
[TABLE]
and
[TABLE]
Moreover, QY∘QW(x)=QW∘QY(x)=xq−x.
Proof.QW is an FP-linear map from Fq to Fq, has kernel W, and has image Y, thus the first short exact sequence holds, and Y is an FP-subspace of Fq of dimension
e−d. Likewise, there is a short exact sequence of FP-vector spaces
[TABLE]
where dimFP(V)=e−(e−d)=d.
By Proposition 10.4, if τ∈Fq then
QY(τ)∈W, thus
V=QY(Fq)⊂W. Since V and W have the same dimension, they are equal. Proposition 10.3
shows QY∘QW(x)=xq−x. Applying Proposition 10.3 again, but with the roles of Y and W reversed,
and using that W=QY(Fq) (which we have already proved), we deduce QW∘QY=xq−x also.
Proposition 10.6
Let q=Pe and let L(x)=xPd+∑i=0d−1aixPi be an FP-additive polynomial,
where ai∈Fq and a0=0. Then all the roots of L
are in Fq if and only if there is an additive polynomial M(x)=xPe−d+∑bixPi∈Fq[x] with M∘L(x)=xq−x.
In that case, it is also true that L∘M(x)=xq−x, all the roots of M are in Fq, and M=QY where Y=L(Fq).
Proof. The roots of L in Fq comprise a d-dimensional FP-vector subspace W⊂Fq. If W⊂Fq, then L=QW and the result follows
from Corollary 10.5. Conversely, if there is an FP-additive polynomial M(x) satisfying M∘L(x)=xq−x, then for any root w∈Fq of L we have
0=M∘L(w)=wq−w, showing that w∈Fq. Thus, L=QW where W⊂Fq. By Corollary 10.5, QY∘L=xq−x, where Y=QW(Fq).
Then M∘L(x)=xq−x=QY∘L(x). Set z=L(x), which is transcendental. Since M(z)=QY(z), M=QY.
By Corollary 10.5, L∘M=QW∘QY=xq−x.
Proposition 10.7
*Suppose q=Pe, where P is a prime power.
(i) Let W be a one-dimensional FP-subspace of Fq, so W=cFP where c∈Fq×. A quotient map is QW(x)=xP−cP−1x.
If τ∈Fq then invQW(τ)=(011w), where w=cTrFq/FP(τ/cP). That is, QW(v)=τ∈Fq implies vq−v=cTrFq/FP(τ/cP).
(ii) If Y is an (e−1)-dimensional FP-vector subspace of Fq, then for τ∈Fq,*
[TABLE]
That is, QY(v)=τ∈Fq implies vq−v=τP−τ/a0.
Also, a0=1/cP−1 for some c∈Fq×, and QY(Fq)=cFp.
Proof. Corollary 10.5 implies W⟷Y gives a bijection between the set of all 1-dimensional FP-vector spaces W=cFP and the set of all
(e−1)-dimensional vector spaces Y. In this correspondence, Y=QW(Fq), W=QY(Fq), and QW∘QY=QY∘QW=xq−x.
Assume W and Y are so related.
First, QW(x)=∏j∈FP(x−jc)=cP∏j∈FP((x/c)−j)=cP((x/c)P−(x/c))=xP−cP−1x.
If Tr is the polynomial ∑i=0e−1xPi and L(x)=cTr(x/cP) then
[TABLE]
therefore L=QY. Since invQW(τ)=(011QY(τ)), (i) follows.
Next, invQY(τ)=(011QW(τ)), and QW(τ)=τP−cP−1τ. Let a0=∏0=y∈Yy. Since QY(x)=∏y∈Y(x−y)=∏y∈Y(x+y), a0 is
the coefficient of x in QY(x). Since QY=L, this coefficient is 1/cP−1. Thus, QW(τ)=τP−τ/a0. This proves (ii).
11 Cyclic subgroups of PGL2(Fq)
In this section, we find quotient maps and Artin invariants of cyclic subgroups G⊂PGL2(Fq), and prove that the Artin invariant is equidistributed – every γ∈G
has the same number of regular elements τ∈Fq∪{∞} such that inv(τ)=γ. We also study
the equation vq=γ(v) when γ∈PGL2(Fq) and v∈Fq∪{∞}.
11.1 Dickson’s analysis.
Cyclic subgroups of PSL2(Fq) were analyzed
by Dickson [8]. We modify his analysis to obtain the cyclic subgroups of PGL2(Fq).
It is useful to introduce the following matrices.
For λ∈Fq2∖Fq, define Cλ∈GL2(Fq2) by
[TABLE]
Then
[TABLE]
so Cλq(x)=Cλ(1/x). Note that Cλ(∞)=λ, Cλ(0)=λq, Cλ(1)=∞.
If M∈Fq×GL2(Fq) then its order as an element of PGL2(Fq) is
the least ℓ≥1 such that Mℓ is a scalar matrix.
Proposition 11.1
Suppose that M∈GL2(Fq) and that M has order ℓ>1 as an element of PGL2(Fq).
Then exactly one of the following holds: (a) M has a unique fixed point z∈Fq∪{∞}, which is rational over Fq;
(b) M has two distinct fixed points z1,z2∈Fq∪{∞}, which are both rational;
or (c) M has two fixed points in Fq∪{∞}, which
are a conjugate pair {λ,λq}, with λ∈Fq2∖Fq.
If (a) holds, then ℓ=p, the prime that divides q. If z=∞ then
kM=(011b) for some b,k∈Fq×. If z∈Fq then kM=α(011b)α−1 for some b,k∈Fq×,
where α=(1z10)∈PGL2(Fq).
If (b) holds then ℓ divides q−1.
Let α∈GL2(Fq) such that α(z1)=∞ and α(z2)=0, for example α=(11−z1−z2).
Then αMα−1=(0ad0), where a,d∈Fq×
and a/d has order ℓ.
If (c) holds then ℓ divides q+1, and there is
δ∈Fq2∖Fq such that M=Dδ,λ, where
[TABLE]
Further, δq−1 is a primitive ℓth root of unity.
Conversely, if δ,λ∈Fq2∖Fq and M=Dδ,λ, then M∈GL2(Fq), the fixed points of M in Fq∪{∞} are
{λ,λq}, and the order of M as an element of PGL2(Fq) equals ∘(δq−1), the multiplicative order of δq−1.
Proof. Write M=(cadb). The fixed points of M in Fq are z such that
az+b=z(cz+d). Note that ∞ is a fixed point if and only if c=0, and it is the unique fixed point if and only if c=0, a=d, and b=0.
The quadratic either has a single repeated root in Fq∪{∞},
two distinct roots in Fq∪{∞}, or a pair of conjugate roots
λ,λq where λ∈Fq2∖Fq. This gives rise to the mutually exclusive cases (a), (b), and (c).
(a) Suppose the quadratic equation has a single repeated root z∈Fq∪{∞}. Let α∈GL2(Fq) such that α(z)=∞.
Then αMα−1 fixes ∞ only, so it
is a scalar multiple of (011b), where b∈Fq and b=0. The order of M as an element of PGL2(Fq) is
equal to p, the characteristic of Fq.
(b) Suppose the quadratic equation has two distinct roots z1,z2∈Fq∪{∞}. Let α∈GL2(Fq) such that α(z1)=∞ and α(z2)=0.
Then αMα−1 fixes 0 and ∞, so it has the form (0ad0).
(c) Finally, suppose that the quadratic equation has no rational roots. Then c=0. The roots of the quadratic are a pair λ,λq∈Fq2.
Cλ−1MCλ fixes ∞ and [math], so it has the form (0αδ0), where
α+δ=Tr(M) and αδ=det(M). Thus, M=Cλ(0αδ0)Cλ−1. Note that (x−α)(x−δ)=x2−Tr(M)x+det(M), so α
and δ are either rational, or they form a conjugate pair in Fq2. If they are rational, then by applying the Frobenius to all coefficients we find:
[TABLE]
which would imply that α=δ, so that M is a scalar matrix. However, we assumed that M has order ℓ>1 as an element of PGL2(Fq), so
we obtain a contradiction. We conclude that α,δ are a conjugate pair in Fq2, i.e., δ∈Fq2∖Fq and α=δq. Then
[TABLE]
As an element of PGL2(Fq), M is equivalent to δ−1M=Cλ(0ζ10)Cλ−1, where ζ=δq−1.
If E denotes the matrix on the right, then it is clear that Ei is scalar if and only if ζi=1, therefore the order of M in PGL2(Fq)
is ∘(ζ). Since the order of δ divides q2−1, ℓ=∘(ζ) divides q+1.
Now we prove the final statement of (c). Let λ,δ∈Fq2∖Fq and let M=Dδ,λ. Applying the Frobenius, we find that
[TABLE]
Thus, M is rational.
If ζq+1=1, define
[TABLE]
This is not rational as a matrix, but it is rational as an element of PGL2(Fq), and in fact if δq−1=ζ (so δq2−1=1, i.e.,
δ∈Fq2×) then
[TABLE]
In particular, Eζ,λ=Dδ,λ as elements of PGL2(Fq).
11.2 Quotient map and Artin invariant of a cyclic group.
Let G be a cyclic subgroup of PGL2(Fq) of order ℓ>1 generated by
M∈PGL2(Fq).
Because of Lemma 4.4, to understand the Artin invariant of G, we may first conjugate by any α∈PGL2(Fq). By Proposition 11.1,
there are three cases:
(a) M=(011b) where b∈Fq× and ℓ=p.
By Proposition 10.7(i), a quotient map is QG(x)=xp−bp−1x, every τ∈Fq is regular, and inv(τ)=(011w),
where w=bTrFq/Fp(τ/bp).
(b) M=(0a10) and ℓ=∘(a).
This is the Kummer case (Example 1.2).
A quotient map is Q(x)=xℓ. The irregular elements are 0 and ∞,
and for τ∈Fq×, inv(τ)=(0τ(q−1)/ℓ10).
(c) M=Dδ,λ=Eζℓ,λ, where λ,μ∈Fq2∖Fq, ζℓ=δq−1, ℓ=∘(ζℓ), and ℓ∣(q+1). Then the group generated by M is
[TABLE]
We will compute a quotient map and Artin invariant for this group.
We begin by finding the short orbits.
Lemma 11.2
If ζq+1=1 and ζ=1 then for v∈Fq∪{∞},
Eζ,λ(v)=v if and only if v∈{λ,λq}.
Proof. Since Eζ,λ=Cλ(0ζ10)Cλ−1 with Cλ=(1λ−1−λq),
[TABLE]
Lemma 11.3
The short Gℓ-orbits in Fq∪{∞} are {λ} and {λq}.
O∞ consists of ∞ together with ℓ−1 elements of Fq.
Proof.
First, λ and λq are each fixed by every element of Gℓ by Lemma 11.2, so they form singleton orbits.
The same lemma shows that λ and λq are the only elements of Fq that are fixed by a nontrivial element of Gℓ.
By Lemma 2.1 it follows that {λ} and {λq} are the only short orbits.
For the last statement, note that Eζ,λ(∞)=Dδ,λ(∞)∈Fq where δq−1=ζ, and no element of Fq is in a short orbit.
Therefore O∞⊂Fq∪{∞} and ∣O∞∣=ℓ.
Proposition 11.4
Let ℓ divide q+1 and Gℓ={Eζ,λ:ζℓ=1}.
A quotient map for Gℓ is given by
[TABLE]
where [ℓ] denotes the ℓth power map: [ℓ](x)=xℓ.
Proof. Let Qℓ=Cλ∘[ℓ]∘Cλ−1. Since [ℓ]∘Cλ−1(x)=(x−λx−λq)ℓ, (26) holds.
We need to prove that Qℓ is G-invariant, has degree ℓ, is Fq-rational, and carries ∞ to ∞.
Note that [ℓ]∘(0ζ10)(x)=(ζx)ℓ=xℓ=[ℓ](x) when ζ∈μℓ. Therefore,
[TABLE]
By Lemma 3.1, deg(Qℓ)=deg([ℓ])=ℓ.
By (26), the numerator of Qℓ
has degree ℓ and the denominator has degree <ℓ. (Alternatively, the degree of the denominator is less than the degree of the numerator
iff Qℓ(∞)=∞. We have Qℓ(∞)=Cλ[ℓ]Cλ−1(∞)=Cλ[ℓ](1)=Cλ(1)=∞.)
To complete the proof that Qℓ is a quotient map, it remains only to prove rationality.
When Frobenius is applied to the coefficients of the rational function Qℓ, λ and λq are exchanged.
Both the numerator and denominator of (26) are negated, so Qℓ remains invariant. Alternatively,
since Cλq(x)=Cλ(1/x)=Cλ∘[−1], the conjugate of Qℓ is
[TABLE]
Lemma 11.5
The only irregular elements for Qℓ are λ and λq.
In particular, every element of Fq∪{∞} is regular with respect to Qℓ.
Proof. Recall τ is irregular iff Qℓ−1(τ) is a short orbit for Gℓ, and the only short orbits are {λ} and
{λq}. Thus, the only irregular elements are Qℓ(λ) and Qℓ(λq).
By (26), Qℓ(λ)=λ and Qℓ(λq)=λq.
Lemma 11.6
If v=Cλ(u) then vq=Cλ(u−q).
Proof. By (23), vq=Cλq(uq)=Cλ(−100−1)(uq)=Cλ(u−q).
Theorem 11.7
If τ∈Fq, then
invQℓ(τ)=Eζ,λ where
ζ=(τ−λqτ−λ)(q+1)/ℓ.
Proof.
We have inv(τ)=Eζ,λ for some ζ∈μℓ, and we must show ζ=(τ−λqτ−λ)(q+1)/ℓ.
Let v∈Qℓ−1(τ) and u=Cλ−1(v), so that vq=Eζ,λ(v)=Cλ(ζu). Since vq=Cλ(u−q) by Lemma 11.6,
Cλ(ζu)=Cλ(u−q), and so ζ=u−(q+1).
Since τ=Qℓ(v)=Cλ([ℓ](u))=Cλ(uℓ), it follows that uℓ=Cλ−1(τ). Consequently,
A simple computation using (26) then shows Qℓ(x)+Qℓ∘R(x)=λ+λq.
Lemma 11.9
Let τ∈Fq. If invQℓ(τ)=γ then invQℓ(λ+λq−τ)=γ−1.
Proof. Write τ=Qℓ(v). Then Qℓ(R(v))=λ+λq−Qℓ(v)=λ+λq−τ. If invQℓ(τ)=γ then vq=γ(v),
so (R(v))q=R(vq)=R(γ(v))=γ−1∘R(v). Let w=R(v). Since Qℓ(w)=λ+λq−τ and wq=γ−1(w), it
follows that inv(λ+λq−τ)=γ−1.
11.3 Equidistribution of the Artin invariant when G is cyclic.
We show that when G is cyclic, the number of regular τ∈Fq∪{∞} with inv(τ)=γ is the same for all γ∈G.
If G is a subgroup of PGL2(Fq) and γ∈G, let
[TABLE]
i.e., the number of τ∈Fq∪{∞} such that ∣Q−1(τ)∣=∣G∣ and vq=γ(v) for some v∈Q−1(τ).
By (12), Nγ,G does not depend on the particular choice of quotient map.
Since G maps Fq∪{∞} to itself, it is a union of G-orbits, and
N(0110),G is the number of full-sized G-orbits in Fq∪{∞}.
If G is abelian then ∑γ∈GNγ,G is equal to the total number of regular elements in Fq∪{∞} wrt any quotient map.
Proposition 11.10
If G is a cyclic subgroup of PGL2(Fq) of order ℓ≥2 and M is a generator of G, then Nγ,G=(q+κ)/ℓ for all γ∈G, where κ∈{1,0,−1} and
1−κ is the number of τ∈Fq∪{∞} that are fixed by M.
Proof. By Lemma 4.4, if G′=αGα−1 where α∈PGL2(Fq) then Nγ,G=Nαγα−1,G′ for all γ∈G.
Also, the value κ is the same for both M and αMα−1. Thus, the assertion holds for G iff it holds
for αGα−1. Then Proposition 11.1 reduces to the three cases (a) M=(011b);
(b) M=(0a10); or (c) M=Eζ,λ. These three cases correspond to κ=0, −1, and 1, respectively. The short orbits are
{∞} in case (a); {∞} and {0} in case (b); and {λ} and {λq} in case (c). In particular, Fq∪{∞} contains 1−κ short elements,
so the number of full-sized orbits in Fq∪{∞} is ((q+1)−(1−κ))/ℓ=(q+κ)/ℓ. Thus, N(0110),G=(q+κ)/ℓ.
In particular, ℓ divides q+κ.
Proposition 4.3(v) implies that Nγ=(q+κ)/ℓ when o(γ)≥3.
This completes the proof when ℓ is odd.
If ℓ is even, then G contains exactly one element γ2 of order 2. The irregular elements of Fq∪{∞} (with respect to the quotient maps described in
this section) are {∞} in case (a), {0,∞}
in case (b), and {λ,λq} in case (c), so the total number of regular elements in Fq∪{∞} is q+κ.
Then ∑γ∈GNγ=q+κ. We have already shown Nγ=(q+κ)/ℓ when γ=1 or ∘(γ)≥3,
i.e., for all γ∈G, γ=γ2. Then Nγ=(q+κ)/ℓ for γ=γ2 also.
11.4 The equation vq=γ(v).
Let γ=(cadb)∈PGL2(Fq) have order t, and consider the equation vq=γ(v), where v∈Fq∪{∞}. By convention, we interpret
∞q=∞. Denote the solution set by Sγ,q. Then ∞∈Sγ,q iff c=0,
and the remaining solutions are roots of the polynomial f(x)=xq(cx+d)−(ax+b). As shown in the proof of Proposition 2.4(ii), this equation has no repeated roots.
Thus, ∣Sγ,q∣=q+1, where in the case c=0 the
“+1” accounts for v=∞. Note that Sγ,q∖{∞} is the same as the set Aγ,q that was studied in Section 2. If d≥1, let
[TABLE]
where degq(v)=[Fq(v):Fq] when v∈Fq and degq(∞)=1.
Lemma 11.11
If α,γ∈PGL2(Fq) and d≥1, then Sαγα−1,q(d)={α(v):v∈Sγ,q(d)}.
Proof. If v∈Fq∪{∞} and w=α(v), then degq(w)=degq(v), and
[TABLE]
If 1=γ∈PGL2(Fq), let
[TABLE]
Lemma 11.11 immediately implies that Zγ acts on Sγ,q(d). The next lemma is well known.
Lemma 11.12
If 1=γ∈PGL2(Fq), let 1−κ denote the number of fixed points of γ in Fq∪{∞}. Then κ∈{0,1,−1}, and
∣Zγ∣=q+κ.
Proof. Write γ∼β to denote that γ is conjugate to β. By Proposition 11.1, there are three cases: (a) γ∼(011b) for
some b∈Fq× and κ=0; (b) γ∼(0a10) for some 1=a∈Fq× and κ=−1; or (c) γ∼Dδ,λ for some δ,λ∈Fq2∖Fq and
κ=1.
In case (a), it is easy to see that (trus) commutes with (011b) (in PGL2, i.e., up to a scalar multiple) iff t=0 and r=u, therefore
Zγ≅Z(011b)={(011e):e∈Fq}, and ∣Zγ∣=q. In case (b), (trus) commutes with (0a10) in PGL2
iff s=t=0, so
Zγ≅Z(0a10)={(0e10):e∈Fq×},
and ∣Zγ∣=q−1. In case (c), Cλ(trus)Cλ−1 commutes with Dδ,λ in PGL2 iff (trus)
commutes with (0δqδ0) in PGL2 iff
s=t=0, and Cλ(0ru0)Cλ−1 is rational in PGL2 iff Cλq(0rquq0)Cλq−1=Cλ(0krku0)Cλ−1 with k=0
iff (0uqrq0)=(0krku0)
iff (u/r)q=r/u iff u−1Cλ(0ru0)Cλ−1=Eζ,λ with ζ=r/u∈μq+1. Thus, Zγ={Eζ,λ:ζq+1=1} and ∣Zγ∣=q+1. In each case, ∣Zγ∣=q+κ.
Proposition 11.13
Let 1=γ∈PGL2(Fq) have order t, and let κ be as in Lemma 11.12. Then
Sγ,q=Sγ,q(1)∪Sγ,q(t), and ∣Sγ,q(t)∣=q+κ. If v is any element of Sγ,q(t), then
Sγ,q(t)={z(v):z∈Zγ}.
Proof.
By Lemma 11.11, if the proposition holds for γ then it also holds for αγα−1, where α∈PGL2(Fq). Using Proposition 11.1,
we may therefore assume that one of the three cases holds: (a) γ=(011b), b∈Fq×, κ=0; (b) γ=(0a10), 1=a∈Fq×, κ=−1;
or (c) γ=Dδ,λ and κ=1, where δ,λ∈Fq2∖Fq.
In case (a), Sγ,q contains {∞}, together with all v∈Fq such that
vq=v+b.
Since vqi=v+ib, v has exactly p conjugates, where p is the prime dividing q, and so degq(v)=p=∘(γ).
If v0∈Fq is one solution to vq=v+b, then the others are v0+c for c∈Fq. Since Zγ={(011c):c∈Fq}, the proposition holds in this case.
In case (b), Sγ,q consists of 0,∞, and the nonzero solutions to vq=av. If v=0, then the distinct conjugates of v are
vqi=aiv for 0≤i<∘(a), so degq(v)=∘(a)=∘(γ).
If v0 is one nonzero solution, so v0q−1=a, then the others
are cv0 for c∈Fq×. Since Zγ={(0c10):c∈Fq×}, the nonzero solutions form a single Zγ-orbit. This analysis shows that Sγ,q
contains two elements of Sγ,q(1) and the remaining q−1 elements comprise a single Zγ orbit of size ∣Zγ∣=q−1.
In case (c), we may write γ=Eζ0,λ, and Zγ={Eζ,λ:ζq+1=1}. As shown in Lemma 11.2, if 1=α∈Zγ then λ and λq
are its only fixed points in Fq∪{∞}. In particular, α has no fixed points in Fq, so vq=v=α(v) has no solutions. Taking α=γ, this implies that
Sγ,q(1)=∅. If v∈{λ,λq} then γ(v)=v=vq, so v∈Sγ,q.
Now let v be any element of Sγ,q. We have shown that v∈Fq∪{∞}∪{λ,λq}. Thus, degq(v)>1 and Eζ,λ(v)=v for every Eζ,λ∈Zγ.
Then {α(v):α∈Zγ} are distinct. Calling this set S, we have ∣S∣=∣Zγ∣=q+1. Also, S⊂Sγ,q by Lemma 11.11. Since both have cardinality
q+κ, S=Sγ,q.
Since α(v) are distinct for α∈Zγ, γi(v) are distinct for 0≤i<∘(γ). Then degq(v)=∘(γ) by Lemma 2.3.
Corollary 11.14
Let 1=γ=(cadb)∈PGL2(Fq), let t=∘(γ), and let 1−κ be the number of fixed points of γ in Fq∪{∞}.
Then κ∈{0,1,−1}, and the polynomial xq(cx+d)−(ax+b)∈Fq[x]
factors into exactly (q+κ)/t irreducible polynomials of degree t. The remaining factors are linear.
If r is one irrational root of f, then the others are {z(r):z∈Zγ}.
Proof. The roots of f are the finite elements of Sγ. Each degree-t factor of f corresponds to t conjugate roots in Sγ,q(t). The result now follows from
Proposition 11.13.
12 G=PGL2(Fq).
This section considers the case G=PGL2(Fq), and we prove the statements from the introduction (Example 1.5). As shown in (7),
a quotient map is
[TABLE]
As usual, we begin by considering short orbits, i.e., orbits of size less than ∣G∣. Recall from Section 2 that ∣G∣=q3−q.
Lemma 12.1
v∈Fq* belongs to a short orbit of PGL2(Fq) if and only if v∈Fq2. The orbit of ∞ is Fq∪{∞}.*
Proof.PGL2(Fq) maps Fq2∪{∞} to itself. Since q2+1<q2+q≤q(q−1)(q+1), each element of Fq2 belongs to a short orbit.
Conversely, all elements of short orbits are in Fq2∪{∞} by Lemma 2.1.
For the last statement, we know PGL2(Fq) preserves Fq∪{∞}. It is a single orbit, because if a∈Fq then
(1a01)(∞)=a.
Lemma 12.2
The only irregular elements in Fq∪{∞} with respect to Q are 0 and ∞. Their preimages are the short G-orbits
[TABLE]
Proof. By Lemma 12.1, the union of the short orbits is Fq2∪{∞}, and O∞=Fq∪{∞}. The images of the short orbits under Q are the irregular elements. If v∈O∞ then Q(v)=∞,
and if v∈Fq2∖Fq then Q(v)=0.
Then ∞ and 0 are the only irregular elements of Fq∪{∞}, and Fq2∪{∞}
is the union of exactly two short orbits:
Q−1(∞)=Fq∪{∞} and Q−1(0)=Fq2∖Fq.
Lemma 12.3
Let τ∈Fq×. Then τ is regular, and inv(τ)=Cγ has the property that ∘(γ)≥3.
Proof. By Lemma 12.2, τ is regular.
Then Q−1(τ) is a full-sized orbit of PGL2(Fq), and inv(τ) is defined as the unique conjugacy
class C⊂PGL2(Fq) such that vq=γ(v) with γ∈C whenever v∈Q−1(τ).
Since all elements of Fq2 are in short orbits, Q−1(τ) misses Fq2, so degq(v)≥3 for each v∈Q−1(τ).
By Lemma 2.3, degq(v)=∘(γ).
Thus, inv(τ)=Cγ always has the property that ∘(γ)≥3.
Lemma 12.4
If β=(cadb)∈PGL2(K) then for any x,y,z in a field containing K,
where e1,e2 are the roots of the characteristic equation of (cadb). We noted that ι is well defined on PGL2(Fq)
and is constant on conjugacy classes. Also, recall from Proposition 5.2 (with c=1) that
[TABLE]
Theorem 12.5
The map ι induces a bijection between conjugacy classes Cγ in PGL2(Fq) such that ∘(γ)≥3 and
Fq×.
Further, ι(γ)=τ iff invQ(τ)=Cγ. That is, invQ is the inverse bijection to ι.
Proof.
Let γ∈PGL2(Fq) have order ℓ≥3. Then case (a), (b), or (c) of Proposition 11.1 holds.
In case (a),
Cγ=C(011b) where b∈Fq×, ℓ=p≥3, and ι(γ)=4.
Let v∈Fq such that vq=(011b)v=v+b. Then
[TABLE]
In case (b), Cγ=C(0a10) where a∈Fq× and ∘(a)≥3.
Let v∈Fq× such that vq=(0a10)v=av. Then
[TABLE]
In case (c), γ=Eζ,λ for some λ∈Fq2∖Fq and ζ of order ℓ. Here, ι(γ)=ι((0ζ10))=(ζ+1)2/ζ.
Let v∈Fq such that
vq=γ(v). Since γ is rational as an element of PGL2(Fq), vqi=γi(v)=Eζi,λ(v).
Let u=Cλ−1(v). Then vqi=Eζi,λ(v)=Cλ(ζiu). Using Lemma 12.4,
[TABLE]
Combining the three cases, we see that if vq=γ(v) and ∘(γ)≥3 then Q(v)=ι(γ). In each case, τ=ι(γ)∈Fq×,
so it is regular and inv(τ) is defined. Since Q(v)=τ and vq=γ(v), inv(τ)=Cγ. We have shown inv∘ι is
the identity on {Cγ:o(γ)≥3}.
To prove that ι and invQ are bijections, it remains to prove that ι is surjective
from {Cγ:∘(γ)≥3} onto Fq×. Let τ∈Fq×. By (32), τ−2=ζ+1/ζ where ζq−1=1
or ζq+1=1. If ζ=1 then τ=4=ι((0111)). In even characteristic, 4=0∈Fq×. In odd characteristic, ∘(0111)=p≥3. If ζ=−1 then τ=0∈Fq×. If ζq−1=1 and ζ∈{1,−1} then τ=ι(γ) for γ=(0ζ10), and ∘(γ)≥3. Finally, if ζq+1=1 and ζ∈{1,−1} then τ=ι(Eζ,λ) and ∘(Eζ,λ)≥3. Thus, ι is surjective and the theorem is proved.
Corollary 12.6
Let τ∈Fq. By (32), τ−2=ζ+1/ζ, where ζq−1=1 or ζq+1=1.
Let Q be the quotient map for PGL2(Fq) given in (7), and let inv=invQ.
(i)
If ζ=−1 (so τ=0) then Q−1(τ)=Fq2∖Fq, and inv(τ) is undefined since this orbit is short.
2. (ii)
If ζ=1 and 1=−1 (so τ=4 and q is odd), then inv(τ)=C(0111).
3. (iii)
If ζ∈{1,−1} and ζq−1=1, then inv(τ)=C(0ζ10).
4. (iv)
If ζ∈{1,−1} and ζq+1=1, then inv(τ)=Cγ, where γ=Eζ,λ
for any λ∈Fq2∖Fq.
(All such matrices Eζ,λ belong to the same conjugacy class in PGL2(Fq).)
Proof.(i) was shown in (29), (ii)-(iv) follow from Theorem 12.5.
Corollary 12.7
*Let 1=γ∈PGL2(Fq), where q=pe and p is any prime.
(i) ι(γ)=0 if and only if ∘(γ)=2.
(ii) ι(γ)=4 if and only if ∘(γ)=p.
(iii) Write ι(γ)=ζ+1/ζ+2, where ζ∈μq−1∪μq+1. If ζ=1 (equivalently, ι(γ)=4), then ∘(γ)=∘(ζ).*
Proof.(i) If γ=(cadb) then
[TABLE]
This matrix is scalar iff b(a+d)=c(a+d)=a2−d2=0. These equations hold iff a+d=0 or b=c=a−d=0. The latter is excluded since we assume γ=1.
(ii) and (iii) Assume first that ι(γ)=0 and write ι(γ)=ζ+1/ζ+2, where ζ=−1.
By (i), ∘(γ)≥3. By Theorem 12.5, if ι(α)=ι(γ) and ∘(α)≥3, then Cγ=Cα, so ∘(γ)=∘(α).
If ζ=1=−1, then p is odd and ι(γ)=4=ι((0111)). Since ∘((0111))=p≥3, ∘(γ)=p.
If ζ∈μq−1∖μ2 then ι(γ)=ι((0ζ10)), and ∘((0ζ10))=∘(ζ)≥3, so ∘(γ)=∘(ζ). Finally, if ζ∈μq+1∖μ2
then ι(γ)=ι(Eζ,λ) and ∘(Eζ,λ)=∘(ζ)≥3, so ∘(γ)=∘(ζ).
The proofs of (ii) and (iii) are complete when ι(γ)=0. In (ii), ι(γ)=0 iff 4=0 iff p=2. In that case
(ii) follows from (i). In (iii), ι(γ)=0 iff ζ=−1. Since the case ζ=1 is excluded, q must be odd. Then ∘(γ)=2 by (i), but also ∘(ζ)=∘(−1)=2.
Corollary 12.8
If γ,γ′∈PGL2(Fq)∖{1} and ι(γ)=ι(γ′)=0 then γ and γ′ are conjugate. In particular, if γ=1 and ι(γ)=0
then
[TABLE]
Proof. By Corollary 12.7(i), the hypothesis implies that ∘(γ)≥3 and ∘(γ′)≥3. Then ι(γ)=ι(γ′) implies Cγ=Cγ′
by Theorem 12.5.
Proposition 12.9
*Let q=pe where p is prime, and let (cadb)∈GL2(Fq) be a nonscalar matrix.
Let f(x)=xq(cx+d)−(ax+b), and write (a+d)2/(ad−bc)−2=ζ+1/ζ where ζ∈μq−1∪μq+1.
(i) If ζ=1 then f has exactly pe−1 irreducible factors of degree p, and the remaining factors are linear.
(ii) If ζ=−1 and 1=−1 (so q is odd), then f has exactly (q+κ)/2 irreducible quadratic factors and the remaining factors are linear, where
κ=−(q−(ad−bc)).
(iii) If ζ∈μq+κ∖μ2, where κ∈{1,−1}, then f has (q+κ)/t irreducible factors of degree t and the remaining factors are linear,
where t=∘(ζ).
In each case, if v is one irrational root of f, then the others are α(v) such that α∈PGL2(Fq) and α(cadb)=(cadb)α.*
Proof. Let γ=(cadb), considered as an element of PGL2(Fq), and let 1−κ denote the number of fixed points of γ in Fq∪{∞}.
Note that ι(γ)=2+ζ+1/ζ=(ζ+1)2/ζ.
By Corollary 11.14, f has (q+κ)/∘(γ) irreducible factors of degree ∘(γ), the remaining factors are linear, and the irrational
roots comprise a Zγ-orbit of full size.
So to prove the proposition, it suffices to compute ∘(γ) and κ in each of the cases (i)–(iii).
(i) Given that ζ=1, we must show ∘(γ)=p and κ=0. ι(γ)=4 and so ∘(γ)=p by Corollary 12.7(ii).
If p is odd, then γ∼(011b) by Corollary 12.8,
so γ has a unique fixed point in Fq∪{∞} and κ=0. If p=2, then ι(γ)=4=0, so γ=(ca−ab)=(caab). Note that b, c
cannot both be zero, as otherwise γ would be scalar. It is easy to see that γ has a unique fixed point (b/c)1/2 if c=0, or ∞ if c=0.
Thus, 1−κ=1 and κ=0. We have shown t=p and κ=0 for any q, even or odd, as required.
(ii) Given that ζ=−1 and p is odd, we must show ∘(γ)=2 and κ=−(q−det(γ)). Since ι(γ)=2+ζ+1/ζ=0, γ=(ca−ab), and
∘(γ)=2 by Corollary 12.7(i).
The fixed points of γ are the roots of cz2−2az−b, and the number of rational roots is 1+(q4a2+4bc)=1+(q−det(γ)). Thus, there are 1−κ fixed points
in Fq∪{∞}, where κ=−(q−det(γ)), as was to be shown.
(iii) The hypothesis is that ι(γ)=(ζ+1)2/ζ where ζ∈μq−1∪μq+1 and ζ2=1.
By Corollary 12.7(iii), ∘(γ)=∘(ζ), and by Corollary 12.8,
γ∼(0ζ10) if ζq−1=1, and γ∼Eζ,λ if ζq+1=1. In the former case, κ=−1, and in the latter case, κ=1.
(iii) now follows from Corollary 11.14.
We conclude this section by proving the second theorem from Example 1.5. Let G=PGL2(Fq), QG the quotient map given by (7), H a subgroup of G,
and QH a quotient map for H.
By Proposition 3.7, there is a unique function h∈Fq(x) such that QG=h∘QH.
Theorem 12.10
Let H⊂PGL2(Fq) and QH,h be as above. Suppose τ∈Fq is regular with respect to QH and let invQH(τ,q)=Cγ,H.
If γ=1 then h(τ)=∞. If γ=1 then h(τ)=ι(γ).
Proof. By Proposition 3.9, V=QH−1(τ) is an H-orbit, and since τ is regular with respect to QH, the orbit has full size.
Let v∈V. Since QH(vq)=τq=τ, vq∈V, and consequently vq=δ(v) for a unique δ∈H. By (8), invQH(τ)=Cδ,H, therefore
δ is conjugate to γ. In particular, δ has the same order as γ and ι(δ)=ι(γ).
Note that QG(v)=h(QH(v))=h(τ). By (29), QG−1(∞)=Fq∪{∞} and QG−1(0)=Fq2∖Fq.
First, γ=1⇒δ=1⇒v∈Fq⇒h(τ)=QG(v)=∞.
Next, suppose ∘(γ)=2. Since v,γ(v)=vq are distinct and vq2=γ2(v)=v, v belongs to Fq2∖Fq. Then h(τ)=QG(v)=0. On the other hand,
∘(γ)=2⟺ι(γ)=0. So h(τ)=ι(γ)=0 in this case.
Finally, if ∘(γ)≥3 then [Fq(v):Fq]=∘(δ)=∘(γ)≥3 by Lemma 2.3, so v∈Fq2. Then h(τ)=QG(v)∈Fq×, so that h(τ) is regular with respect to QG.
Lemma 4.5 then implies that invQG(h(τ))=Cγ,G. Finally, Theorem 12.5 implies h(τ)=ι(γ).
13 G=PSL2(Fq).
The projective special linear group is defined as SL2(Fq) modulo the scalar matrices (0aa0)∈SL2(Fq).
If α∈GL2(Fq) and det(α)=c2 with c∈Fq, then c−1α∈SL2(Fq), so (α mod scalars) represents an element of PSL2(Fq).
On the other hand, if det(α) is a nonsquare, then it has no scalar rational multiple in SL2(Fq). Thus, there is a short exact sequence
[TABLE]
where the first map is inclusion and the second map is (qdet(α)). The square-class of the determinant is well defined, because a
scalar matrix has square determinant.
It follows that [PGL2(Fq):PSL2(Fq)]=∣{±1}∣, which is 1 if q is even and 2 if q is odd. In particular, PSL2(Fq)=PGL2(Fq) when
q is even, and we already studied this group in Section 12.
For this reason, in this section we assume q is odd. Then ∣PSL2(Fq)∣=(1/2)q(q−1)(q+1).
Usually we first find short orbits and then find the quotient map. However, for this example it turns out to be easier to do these steps in reverse order.
Proposition 13.1
A quotient map for PSL2(Fq) is
[TABLE]
If γ∈PGL2(Fq) then
[TABLE]
Proof.
First we prove (33). If the equation holds for γ1 and for γ2, then it holds for γ1∘γ2 as well, because
[TABLE]
and (qdet(γ1))(qdet(γ2))=(qdet(γ1)det(γ2))=(qdet(γ1γ2)).
Thus, it suffices to prove (33) for γ=(0c10),
γ=(011b), and γ=(1001), as these generate PGL2(Fq).
If γ=(0c10) with c∈Fq× then
[TABLE]
The right side is QS(x) times
[TABLE]
Thus, QS(γ(x))=(qdet(γ))QS(x).
If γ=(011b) with b∈Fq then
[TABLE]
and det(γ)=1.
Finally, if γ=(1001) then
[TABLE]
Multiply numerator and denominator by x(q2+1)(q+1)/2 to obtain
[TABLE]
Since q2≡1(mod4), (−1)(q−q2)/2=(−1)(q−1)/2=(q−1).
Noting that det(γ)=−1, the result follows.
Since det(γ) is a square for all γ∈PSL2(Fq), eq. (33) shows
that QS∘γ=QS for all γ∈PSL2(Fq).
Note that QS2=QG, where
QG is the quotient map for PGL2(Fq) given by (7). Then
QS(∞)=∞ and deg(QS)=(1/2)deg(QG)=(1/2)∣PGL2(Fq)∣=∣PSL2(Fq)∣.
Thus, QS is a quotient map for PSL2(Fq).
Lemma 13.2
*Let S=PSL2(Fq).
(i) O∞=Fq∪{∞}, and it has multiplicity (1/2)(q2−q).
(ii) Fq2∖Fq is an S-orbit, and it has multiplicity (1/2)(q+1).
(iii) O∞ and Fq2∖Fq are the only short orbits.
(iv) The irregular elements of Fq∪{∞} with respect to QS are 0 and ∞.
(v) If τ∈Fq× and invQS(τ)=Cγ,S then ∘(γ)≥3 and ι(γ)=τ2, where ι((cadb))=(a+d)2/(ad−bc).*
Proof.(i) Certainly O∞⊂Fq∪{∞}. If b∈Fq then b=(011b)(100−1)(∞), so equality holds.
The multiplicity is ∣S∣/∣O∞∣=(1/2)(q3−q)/(q+1)=(1/2)(q2−q).
(ii) Since QS2=QG, QS−1(0)=QG−1(0), which is Fq2∖Fq by (29).
By Proposition 3.9, it is an S-orbit. The size of the orbit is q2−q,
and the multiplicity is ∣S∣/(q2−q)=(1/2)(q3−q)/(q2−q)=(q+1)/2.
(iii) Both O∞ and Fq2∖Fq are short as their multiplicities are greater than 1. There are no other short orbits
by Lemma 2.1.
(iv) holds because the images of the short orbits under QS are ∞ and 0.
(v) Write invQS(τ)=Cγ,S. Apply Theorem 12.10, with h(x)=x2. If γ were the identity, then the theorem guarantees that
h(τ)=∞, and if ∘(γ)=2 then the theorem says h(τ)=0.
However, h(τ)=τ2∈Fq×, so it must be that ∘(γ)≥3.
Theorem 13.3
Let τ∈Fq×. Then invQS(τ)=Cγ,S, where γ is as follows.
(i)
If τ=2 then γ=(0112).
2. (ii)
If τ=−2 then γ=(0112u), where u∈Fq and (qu)=−1.
3. (iii)
If τ=±(a+1/a) with a∈Fq× and a4=1 then γ=(0aa−10).
4. (iv)
If τ=±(ζ+1/ζ) with ζq+1=1 and ζ4=1 then γ=Eζ2,λ,
where λ is any element of Fq2∖Fq.
Here Eζ,λ is defined by (25), and Eζ2,λ=Eζ,λ2∈PSL2(Fq).
Proof. All elements of Fq× are regular by Lemma 13.2, so invQS(τ)=Cγ,S is defined.
(i) and (ii) Let v be a solution to vq=v+b where b∈Fq×. Then
[TABLE]
Now b(q−q2)/2=(bq)(1−q)/2=b(1−q)/2=bq−1b(1−q)/2=b(q−1)/2, so
[TABLE]
If b=2 then QS(v)=2 and if b=2u then QS(v)=−2. Since vq=v+b=(011b)(v), we conclude that invQS(2)=C(0112) and
invQS(−2)=C(0112u).
(iii) By Lemma 13.2(v), if invQS(τ)=Cγ,S then ι(γ)=τ2=(a+1/a)2=ι((0aa−10)) and ∘(γ)≥3. By Corollary 12.8,
γ and (0aa−10) are conjugate in PGL2(Fq),
say γ=α(0aa−10)α−1. Let α′=α(0d10), where d=1/det(α). Then α′∈PSL2(Fq) and
γ=α′(0aa−10)(α′)−1. Thus, invQS(τ)=Cγ,S=C(0aa−10),S.
(iv) By Lemma 13.2(v), if invQS(τ)=Cγ,S then ι(γ)=τ2=(ζ+1/ζ)2=(ζ2+1)2/ζ2=ι(Eζ2,λ) and ∘(γ)≥3. By Corollary 12.8,
γ is conjugate to Eζ2,λ in PGL2(Fq),
say γ=αEζ2,λα−1 where α∈PGL2(Fq).
Here, Eζ2,λ=Eζ,λ2∈PSL2(Fq).
If α∈PSL2(Fq) then invQS(τ)=Cγ,S=CEζ2,λ,S as required.
If α∈PSL2(Fq) then det(α) is
a nonsquare. Let δ be a primitive element of Fq2 and let Dδ,λ=Cλ(0δqδ0)Cλ−1. Then det(Dδ,λ)=δq+1 is a primitive
element of Fq, and in particular a nonsquare in Fq.
By Proposition 11.1, its entries are rational, so it belongs to PGL2(Fq). It commutes with Eζ2,λ, therefore
γ=α′Eζ2,λ(α′)−1, where α′=αDδ,λ. Since (qdet(α′))=(qdet(α))(qdet(Dδ,λ))=(−1)⋅(−1)=1, α′∈PSL2(Fq),
so that γ and Eζ2,λ are in the same conjugacy class of PSL2(Fq).
Then invQS(τ)=Cγ,S=CEζ2,λ,S as required.
14 Acknowledgements
The author thanks Xander Faber for reviewing this article and providing some very insightful comments. First, he observed that inv(τ,q) is
essentially the Artin map, as explained in the introduction. This led to a change in emphasis, and even a change in the title.
Second, he greatly simplified Section 11 by finding
a more direct way to compute the quotient map for a cyclic group of order ℓ in the case where ℓ∣q+1.
In addition, he gave many other suggestions that greatly improved the exposition.
His collegiality is immensely appreciated.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Emil Artin, Galois Theory , Notre Dame Mathematical Lectures Number 2, University of Notre Dame Press, 1942.
2[2] Antonia W. Bluher, A structure theorem for finite fields , Finite Fields and Their Applications 68 (2020), doi:10.1016/j.ffa.2020.101732.
3[3] Antonia W. Bluher, New Wilson-like theorems arising from Dickson polynomials , Finite Fields Appl. 72 (2021), doi:10.1016/j.ffa.2021.101819.
4[4] Antonia W. Bluher, Permutation properties of Dickson and Chebyshev polynomials and connections to number theory , Finite Fields Appl. 76 (2021), doi:10.1016/j.ffa.2021.101899.
5[5] B. W. Brewer, On certain character sums , Trans. Amer. Math. Soc. 99 , pp. 241–245, (1961), doi:10.1090/S 0002-9947-1961-0120202-1.
6[6] Bence Csajbók, Giuseppe Marino, Olga Polverino, and Yue Zhou, MRD codes with maximum idealizers , Discrete Mathematics 343 (9), (2020), doi:10.1016/j.disc.2020.111985.
7[7] Bence Csajbók, Giuseppe Marino, Olga Polverino, and Ferdinando Zullo, A characterization of linearized polynomials with maximum kernel , Finite Fields Appl. 56 , 109–130, (2019), doi:10.1016/j.ffa.2018.11.009
8[8] Leonard Eugene Dickson, Linear Groups with an Exposition of the Galois Theory , Dover Publications, 1958.