This paper investigates the complexity of constructing involution centralisers in finite unitary groups over fields of odd characteristic, providing logarithmic bounds and improving recognition algorithms.
Contribution
It introduces new bounds on the number of random elements needed for involution centralisers, extending previous work on strong involutions and semisimple elements.
Findings
01
Logarithmic bounds on generating involution centralisers
02
Enhanced complexity bounds for recognition algorithms
03
Generalization of previous results on strong involutions
Abstract
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of a strong involution that contains the last term of its derived series. We use this to strengthen previous bounds on the complexity of recognition algorithms for unitary groups in odd characteristic. Our approach generalises and extends two previous papers by the second author and collaborators on strong involutions and regular semisimple elements of linear groups.
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.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Algebraic Geometry and Number Theory
Full text
Involution centralisers in finite
unitary groups of odd characteristic
S.P. Glasby, Cheryl E. Praeger and Colva
M. Roney-Dougal
S.P. Glasby & Cheryl E. Praeger:
Department of Mathematics and Statistics,
UWA, Perth, WA 6009, Australia
Colva M. Roney-Dougal: Mathematical Institute, Univ. St Andrews, KY16 9SS, UK
Abstract.
We analyse the complexity of constructing involution centralisers
in unitary groups over fields of odd order.
In particular, we
prove logarithmic bounds on the number of random elements
required to generate a subgroup of the centraliser of a strong
involution that contains the last
term of its derived series. We use this to strengthen previous bounds on
the complexity of recognition algorithms
for unitary groups in odd
characteristic. Our approach generalises and extends two previous
papers by the second author and collaborators on strong involutions
and regular semisimple elements of linear groups.
Parker and Wilson [ParkerWilson] showed in 2010 that
involution-centraliser methods could be used to solve several
computationally difficult problems, and gave complexity analyses for
these algorithms in simple Lie type groups in odd characteristic.
Central to these approaches are conjugate pairs (t,tg) of involutions.
If g is a uniformly distributed random element of a group G, and
y=ttg has odd order 2k+1, then z=gyk is a uniformly
distributed random element of C=CG(t). This observation is due to
Richard Parker,
see [Bray00, Theorem 3.1]. Parker and Wilson in [ParkerWilson, Theorem 2]
showed that if G is a simple classical group of dimension n, then the
proportion of elements g of G such that ttg has odd order is bounded
below by cn−1, for some constant c, so that with high probability
O(n) random elements g suffice to construct such a random element
z. Moreover, for infinitely many odd field orders, if G is linear
or unitary then the lower bound cn−1 cannot be improved
(see [ParkerWilson, p. 897] and [BGPW, Theorem 1.2]).
If y=ttg has even order 2k, then z=yk is an involution in the
centraliser C of t. However, these elements z are not uniformly
distributed in C; instead z is uniformly distributed only within its
C-conjugacy class.
In this paper
we analyse the centralisers C of strong involutions t (see
Definition 1.1) in unitary groups G in odd characteristic.
We show that there exists an absolute constant D such that given a
strong involution t,
a set of Dlogn
random elements g suffices to construct a set of involutions that
generates a group containing the last term in the derived series of
CG(t). A careful analysis of the highest power of 2 dividing ∣ttg∣
is required here.
Our methods build on the work of Praeger and Seress [gl],
and of Dixon, Praeger and Seress [DPS], but we encounter fundamental new
difficulties: the structure of regular semisimple elements in
GUn(q) that are “almost irreducible” (in a sense that we shall
make precise in Definition 2.7) and conjugate to their
inverses
is very different
from those in GLn(q). In future work, we plan to address the
symplectic and orthogonal groups. For these families of groups completely
different arguments will be
required: for example, one may readily compute that
in Sp4(3) and Sp6(3) there are no
regular semisimple elements that are inverted by involutions.
Definition 1.1**.**
For an involution t∈GLn(q2), we write E+(t) and
E−(t) to denote its eigenspaces for eigenvalues +1 and −1.
Such a t is strong if n/3⩽dim(E+(t))⩽2n/3.
For an element x of a group G, let inv(x) denote x∣x∣/2 when ∣x∣
is even, and 1G otherwise.
Definition 1.2**.**
A random variable x on a finite group G is nearly uniformly distributed if for all g∈G the probability P(x=g) that x takes the value g∈G satisfies
[TABLE]
Our first main technical theorem is as follows.
Theorem 1**.**
There exist positive constants κ,n0∈R such that the
following is true. Suppose that n⩾n0, that t is a strong involution in
GUn(q) with q odd, and that g is a nearly uniformly distributed random element of GUn(q).
Let z(g):=inv(ttg), and let z(g)ε be the
restriction of z(g) to the eigenspace Eε(t) (where
ε∈{+,−}). Then
(i)
z(g)+* is a strong involution with probability at least κ/logn; and*
2. (ii)
z(g)−* is a strong involution with probability at least κ/logn.*
Our proof shows that the values n0=250 and κ=0.0001 suffice.
The comparable values in [DPS] for the case of special linear groups with
nearly uniform random elements are
n0=700,κ=0.0001, and echoing the view expressed there, ‘we
believe that these constants are far from best possible’.
From Theorem 1, and [DPS, Theorem 1.1],
we are able to deduce the following result (see
§11).
Theorem 2**.**
There exist constants λ,n1∈R such that the following is
true.
Let n⩾n1, let G=GLn(q) or GUn(q)
with q odd, and let t∈G be a strong
involution. For ε∈{+,−},
let Sε=SL(Eε(t)) if G=GLn(q),
or SU(Eε(t)) if G=GUn(q).
Let A be a sequence of at least λlogn
random elements of G, chosen independently
and nearly uniformly, and let H=⟨inv(ttg)∣g∈A⟩. Then
[TABLE]
One of our motivations for proving the preceding two theorems was an
application to computational group theory. Two key steps in many
algorithms (for example, those in [LOB, LO, ParkerWilson])
are first to construct an involution t in a group
G of Lie type, and then to
construct a subgroup of the centraliser of t that contains
the last term, CG(t)∞, in the derived series of CG(t). For
some of these algorithms, including the constructive recognition
algorithms in [LO], the involution t is required to be strong.
Definition 1.3**.**
Let G be a group. For an involution t and an element g of G,
we let R(g,t) be inv(y) when y:=ttg has even order, and
gy⌊∣y∣/2⌋ when ∣y∣ is odd. It follows that R(g,t)∈CG(t).
Building on work of Lübeck,
Niemeyer and Praeger [LNP], we can remove the degree
restriction in Theorem 2, and include the step of finding
a strong involution, whilst only
slightly worsening the probability of success (see §11).
Theorem 3**.**
*There exists a positive constant μ such that for all n⩾3,
for all odd q, and for G=GLn(q) or GUn(q),
the following holds with probability at least
0.89(1−q−n/3−q−2n/3).
A sequence S of ⌈μlogn⌉
independent nearly uniformly distributed random elements of G contains an
element x such that t:=inv(x) is a strong involution,
and moreover CG(t)⩾⟨R(g,t)∣g∈S⟩⩾CG(t)∞.
*
Leedham-Green and O’Brien in [LO] define certain generating
sets for the quasisimple classical groups in odd characteristic,
called standard generators, and use a recursive approach, via
repeated involution centralisers, to
find these standard generators in the given group. Our improved analysis in
Theorem 3 of
the number of random elements required to
construct an involution centraliser enables us to replace a
factor of n in their complexity analysis with a factor of logn. Let ξ
denote an upper bound on the number of field operations needed to
construct an independent nearly uniformly distributed random element
of SUn(q), and let χ(q) be an upper bound on the number of field
operations equivalent to a call to a discrete logarithm oracle for
Fq.
Reasoning in the same way as [DPS, §1.1], the following
can be deduced from [LO] and
Theorem 3.
Theorem 4**.**
Let q be odd, and let S=SUn(q).
There is a Las Vegas algorithm that takes as input a set A
of generators for S of
bounded cardinality, and returns standard generators
for S as straight line programmes of length O(log3n) in A.
The algorithm has complexity O(logn(ξ+n3logn+n2lognloglognlogq+χ(q2))), measured in field operations.
To prove Theorem 1, we carry out an extensive analysis
of the products of conjugate involutions in GUn(q). Some of our
results may be of independent interest, so in the remainder of this
section we describe them.
Definition 1.4**.**
Denote the characteristic polynomial of a square matrix y by
cy(X). Such a matrix y
is regular semisimple if
cy(X) is multiplicity-free.
Let V=Fq2n, with q odd, equipped with a unitary form
having Gram matrix
the identity matrix In.
We say that an involution t∈GLn(q2) is
perfectly balanced if dim(E+(t))=⌊n/2⌋.
Following [gl], we
define C(V) to be the class of
perfectly balanced involutions in GLn(q2),
and we define CU(V) to be C(V)∩GUn(q).
We let
[TABLE]
Theorem 5**.**
For q odd, let ιU(n,q)=∣IU(V)∣/∣CU(V)∣2 be the probability
that a random element (t,t′)∈CU(V)×CU(V)
lies in IU(V). If n=3 then ιU(n,q)>0.25, and
ιU(3,q)>0.142.
Remark 1.5**.**
We prove that ιU(2,q)>0.25, that
ιU(n,q)>0.343 for n⩾4 even,
and that ιU(n,q)>0.254 for n⩾5 odd.
We shall also prove in Corollary 11.4 that the limits
as m→∞ of ιU(2m,q) and ιU(2m+1,q) exist, and
determine each limit.
The structure of this paper is as follows. In
§2 we begin our exploration of the conjugacy classes of
GUn(q), and of the characteristic polynomials of elements of
GUn(q). In
§3 we define a set of ordered pairs of
conjugate involutions (t,tg) such that inv(ttg)∣E+(t) is
guaranteed to be a strong involution. Thus to prove
Theorem 1 it suffices to show that this set is
sufficiently large. In §§4,
5 and 6
we
classify the U∗-irreducible regular semisimple elements of
GUn(q) (that is, such elements that are as close to irreducible as
possible, see Definition 2.7),
determine their centralisers, and
count the number of involutions inverting
them. In §7 we calculate various upper and lower
bounds on the number of monic polynomials that correspond to
irreducible
factors
of the
characteristic polynomials of these U∗-irreducible regular
semisimple
elements. In
§8 we define and analyse our key generating
function, RU(q,u). In §9 we
factorise RU(q,u), and prove bounds on
the coefficients of certain generating functions that refine the
information in RU(q,u). This additional information allows us
to control the powers of 2 dividing the
orders of the roots of the characteristic polynomial of ttg, and
hence to bound the
dimension of the (−1)-eigenspace of inv(ttg).
In §10 we prove
Theorem 1, and finally in §11
we prove Theorems 2, 3 and 5.
1.1. Acknowledgements
The work for this paper began whilst the third author was a Cheryl
E. Praeger Visiting Research Fellow, and the authors are grateful for
the hospitality of the Universities of St Andrews and Western
Australia, and the Hausdorff Research Institute for Mathematics,
Bonn. We are grateful for support from Australian Research Council
Discovery Project grants DP160102323 and DP190100450. We thank Eamonn
O’Brien for his extremely careful reading of several drafts of this article.
2. Preliminaries
In this section we study the conjugacy classes and
characteristic polynomials of involutions in GUn(q), and of
regular semisimple
elements of GUn(q) that are products of involutions. We
shall assume throughout the paper that q is an odd prime power.
Let V=Fq2n be the natural module for GUn(q), and unless
stated otherwise, take the sesquilinear form fixed by GUn(q) to have
the identity matrix In as its Gram matrix as in
Definition 1.4.
Determining conjugacy in GUn(q) is straightforward:
Theorem 2.1**.**
(Wall, [Wall, p. 34])*
Let g,h∈GUn(q). If g and h are conjugate in
GLn(q2) then they are conjugate in GUn(q).*
Definition 2.2**.**
An involution t∈GLn(q2) has type(a,b)
if dim(E+(t))=a and dim(E−(t))=b.
For q odd, involutions in
GLn(q2) are conjugate if and only if they have the same
type. The following corollary of Theorem 2.1 is therefore
immediate.
Corollary 2.3**.**
Each type (n+,n−) of involution in GLn(q2) forms
a unique conjugacy class in GUn(q). In particular, CU(V) is a GUn(q)-conjugacy
class.
We define three involutory operations on polynomials over Fq2.
Let
[TABLE]
and let σ be the
involutory automorphism σ:x↦xq of Fq2.
Then
we define the σ-conjugate of f(X) to be
[TABLE]
If a0=0 then we also define the ∗-conjugate of
f(X) to be
[TABLE]
and define
[TABLE]
It is clear that the operations ∗ and ∼ are involutions on the set of
monic polynomials of degree n over Fq2 with nonzero constant term.
By abuse of notation, we also write σ for the automorphism of
GLn(q2) induced by replacing each matrix entry by its image
under σ. We write AT for the transpose of a matrix A, and write
h∼=h−σT for h∈GLn(q2).
Our choice of unitary form means that h∈GLn(q2)
lies in GUn(q) if and only if hhσT=I.
In other words, we have the following.
Lemma 2.4**.**
A conjugate of h∈GLn(q2) lies in GUn(q) if and
only if h is conjugate to h∼.
Notice that the
characteristic polynomial g(X)=ch(X) of h∈GLn(q2) satisfies ch−1(X)=g∗(X), and ch∼(X)=g∼(X).
Corollary 2.5**.**
Let y∈GLn(q2) be regular semisimple, and let g(X)=cy(X).
(i)
A conjugate of y
lies in GUn(q) if and only if g(X)=g∼(X).
2. (ii)
If y∈GUn(q) then y is conjugate in GUn(q) to
y−1 if and only if
g(X)=g∗(X).
Proof.
In both parts, one direction is clear, and the other follows from the
fact that since y is regular semisimple, g(X) is equal to the
minimal polynomial my(X), and g(X) is multiplicity-free. The
fact that y and y−1 are conjugate in GUn(q) (rather than
just in GLn(q2)) follows from
Theorem 2.1.
∎
Recall that C(V) is the class of perfectly balanced
involutions (Definition 1.4). The importance of C(V)
for studying regular semisimple elements is illustrated by the
following:
Lemma 2.6** ([gl, Lemma 3.1]).**
Let t,y∈GLn(q2), such that y is regular
semisimple, and t is an involution inverting y. Let t′=ty.
(i)
If gcd(cy(X),X2−1)=1, then
all involutions
inverting y lie in C(V) and n is even.
2. (ii)
If t,t′∈GLn(q2) are conjugate in GLn(q2)
then either t,t′∈C(V) or −t,−t′∈C(V).
3. (iii)
If t,t′∈C(V) and n is even, then
gcd(cy(X),X2−1)=1.
Proof.
Part (i) follows from [gl, Lemma 3.1(a) and Table 1],
Part (ii) is [gl, Lemma 3.1(c)], and Part (iii) follows from
[gl, Lemma 3.1(b)(i)].
∎
We shall need the following three properties of polynomials.
Definition 2.7**.**
Let g(X)∈Fq2[X].
We say that g(X) is separable if it has no
repeated roots in the algebraic closure Fq2.
The polynomial g(X)
is U∗-closed if g(X)=g∼(X)=g∗(X), and is U∗-irreducible if
it is U∗-closed and no proper nontrivial divisor
of g(X) is U∗-closed.
Definition 2.8**.**
Define ΠU(n,q) to be the set of separable, degree n, monic,
U∗-closed polynomials over Fq2 with no
roots [math], 1, −1.
For n=2m, we
define the following set, recalling that CU(V)=C(V)∩GUn(q):
[TABLE]
This set is analogous to the set RI(V)
defined in [gl, Equation (3)].
We now show
the link between ΔU(V) and and ΠU(n,q).
Recall the definition of IU(n,q) from (1).
Lemma 2.9**.**
With respect to a fixed unitary form,
ΔU(n,q) is equal to
the set
[TABLE]
When n is even, ∣ΔU(n,q)∣=∣IU(n,q)∣.
Proof.
Let S denote the displayed set. We show first that S⊆ΔU(n,q). Let
(t,y)∈S. Then t inverts y, and our assumption that
cy(X)∈ΠU(n,q) implies that y is regular semisimple
and gcd(cy(X),X2−1)=1.
Hence t∈CU(V) by Lemma 2.6,
and therefore (t,y)∈ΔU(n,q).
For the reverse containment, let
(t,y)∈ΔU(n,q). Since yt=y−1, with y
regular semisimple and cy(X) coprime to X2−1, all involutions
in GUn(q) inverting y are in CU(V) by
Lemma 2.6.
Let t′=ty. Then t′
also inverts y, so
t′∈CU(V) by Lemma 2.6.
Hence, by Theorem 2.1 the involutions t and
t′ are GUn(q)-conjugate. Then y=tt′ is a product of two
conjugate involutions in GUn(q), and so y∈SUn(q). Therefore (t,y)∈S.
For the final claim, consider the map θ:(t,t′)↦(t,tt′)=(t,y) from
IU(V) to CU(V)×GU(V). It is clear that
θ is injective, and
cy(X) is coprime to X2−1 by Lemma 2.6(iii), so the image of θ is a
subset of ΔU(V). Hence ∣IU(V)∣⩽∣ΔU(V)∣. It follows from [gl, Lemma 4.1(a)] that
ΔU(V)⊆Im(θ), so these two sets have
equal sizes.
∎
3. Pairs of involutions yielding strong
involutions
In this section, we characterise a certain set of ordered pairs of involutions
(t,tg)
from GUn(q) whose product y=ttg is such that
inv(y)∣E+(t) is strong.
Recall that V=Fq2n is the natural module for GUn(q).
First we make a simple observation about subspaces of E+(t).
Lemma 3.1**.**
Let
t∈GUn(q) be an involution, and let U be a subspace of
E+(t).
Then U⊥ is t-invariant, and further if U is non-degenerate then
U⊥ is also non-degenerate and U∩U⊥=0.
Proof.
Let u∈U and w∈U⊥. Then evaluating the form on u and wt gives (u,wt)=(ut,w) since the form is t-invariant and t2=1. This is equal to zero since ut∈U. Thus (U⊥)t⊆U⊥ and we conclude that (U⊥)t=U⊥. Finally, if U is non-degenerate then U∩U⊥=0 and thus also U⊥ is non-degenerate.
∎
Recall the definition of
type (Definition 2.2), and that types naturally
parametrise the conjugacy classes of involutions in GUn(q) by
Corollary 2.3.
Definition 3.2**.**
Given 0⩽α<β⩽1,
an involution t∈GLn(q2) of type (n+,n−) is
(α,β)-balanced if α⩽n+/n⩽β.
We shall now define a key set of ordered pairs of conjugate
involutions.
Definition 3.3**.**
Let KU,s be the GUn(q)-conjugacy class of
involutions of type (s,n−s). Fix
0⩽α<β⩽1, and
let LU(n,s,q;α,β) be the set of ordered pairs
(t,t′)∈KU,s×KU,s such that:
(i)
V1:=E+(t)∩E+(t′) is a non-degenerate
subspace of V, and has
dimension h=2s−n, (so, by Lemma 3.1, V2:=V1⊥
is non-degenerate, ⟨t,t′⟩-invariant, and of dimension n−h=2(n−s));
2. (ii)
(t∣V2,tt′∣V2)∈ΔU(n−h,q) and
inv(tt′∣V2) is (α,β)-balanced.
Lemma 3.4**.**
Let (t,t′)∈LU(n,s,q;α,β), and let
V2 be as in Definition 3.3.
If W is a ⟨t,t′⟩-invariant
subspace of V2, then dimW is even, and the involutions t∣W and
t′∣W are both perfectly balanced.
Proof.
The characteristic polynomial of tt′∣V2 lies in
ΠU(2(n−s),q) by Lemma 2.9, and in particular it
is coprime to X2−1.
Thus also, by Definition 2.8, the characteristic
polynomial of tt′∣W lies in
ΠU(r,q), where r=dim(W). It then follows from
Lemma 2.6 that r is even and both t∣W and t′∣W lie in CU(W) (and hence are perfectly balanced).
∎
Lemma 3.5**.**
Let s satisfy 2n/3⩾s⩾n/2, let h=2s−n, let
α=max{0,1−3(n−s)2s} and let β=1−3(n−s)s. Then α<β. Choose (t,t′)∈LU(n,s,q;α,β), and let V1 and V2 be as in Definition 3.3.
Let z=inv(tt′), V2+:=V2∩E+(z) and V2−:=E−(z).
(i)
Each entry in the table below is the dimension of the intersection of
the subspaces labelled by their row and column of the entry, and k++k−=(n−h)/2=n−s.
[TABLE]
2. (ii)
The involution z∣E+(t) is (1/3,2/3)-balanced.
Proof.
This proof has similarities to [DPS, p. 445], but we have
modified the approach to make it more transparent and to deal with the unitary form.
It is clear from the definitions of α and β that 0⩽α⩽1/3 and 1/3⩽β⩽2/3, and that if α=1/3 then β>1/3, and so α<β.
(i). The first and last rows of the table are clear, so we need
only prove the middle two rows.
Since t is conjugate in GUn(q) to a diagonal matrix, and our
standard unitary form is the identity matrix,
the spaces E±(t) are non-degenerate,
and V=E+(t)⊥E−(t), so E−(t)=E+(t)⊥.
For the same reason E−(z)=E+(z)⊥, so V=E+(z)⊥E−(z).
By definition, the subspace V1 is fixed pointwise by t and t′ and hence also
by z,
so that E+(z) contains
both V1 and V2+. Since V2+⩽V2=V1⊥ we have
V1⊥V2+⩽E+(z).
Since V=V1⊥V2, an arbitrary vector v∈E+(z) is of the form v=v1+v2 for some vi∈Vi (i=1,2).
Thus v=vz=v1z+v2z=v1+v2z whence v2=v2z∈V2+.
This yields E+(z)=V1⊥V2+, and hence also V2−=E−(z)=E+(z)⊥⩽V1⊥=V2.
Let D=⟨t,t′⟩. By Lemma 3.1, V2 is
D-invariant, and D centralises z, so
V2+ and V2− are D-invariant subspaces
of V2. It follows from Lemma 3.4
that, for ε=±, V2ε has even dimension, say 2kε, and that
dim(E+(t)∩V2ε)=dim(E−(t)∩V2ε)=dim(V2ε)/2=kε.
(ii). The involution
z∣V2 is (α,β)-balanced by Definition 3.3, so
[TABLE]
Let z′:=z∣E+(t), and notice that
[TABLE]
which by Part (i) has dimension h+k+. Since dimE+(t)=s, the element z′ is (1/3,2/3)-balanced if and only if
1/3⩽(h+k+)/s⩽2/3.
From n/2⩽s⩽2n/3 and h=2s−n,
we deduce 0⩽h⩽n/3.
By Part (i), k++k−=n−s, so h+k++k−=s, and so
(h+k+)/s=1−k−/s.
From α⩽k+/(n−s)⩽β, we now deduce that
[TABLE]
Hence s/3⩽k−⩽2s/3,
which in turn implies that
1/3⩽1−k−/s=(h+k+)/s⩽2/3, as required.
∎
4. U∗-irreducible polynomials
Recall the three involutory operations on polynomials that we defined in
§2,
and what it means for a
polynomial to be U∗-irreducible (Definition 2.7).
In this section we classify the U∗-irreducible polynomials, and
determine the 2-part-orders of their roots (that is, the maximal
power of 2 dividing the order of their roots).
In the remainder of the paper,
we shall sometimes refer to a polynomial f(X)∈Fq2[X] as
simply f, when the meaning is clear.
Lemma 4.1**.**
Let f(X)∈Fq2[X] be monic, irreducible, and of degree degf=m.
(i)
If f∗(X)=f(X)
then either f(X) is X+1 or X−1 or m is even.
2. (ii)
If fσ(X)=f(X) then m is odd.
3. (iii)
If f(X)=X±1 then at least one of fσ(X),f∗(X) does not equal f(X).
4. (iv)
If f(X)=X±1 and f(X)=f∼(X) then m is odd.
Proof.
Parts (i) and (ii) are proved in [genfunc, Lemma 1.3.15(c) and Lemma
1.3.11(b)], respectively.
Part (iii) follows immediately, so consider
Part (iv). Suppose that f(X)=f∼(X)=X±1. By Part
(iii), at least one of
fσ,f∗ is not equal to f. Conversely, f∼=fσ∗=f, so we deduce that
fσ=f∗=f.
Let ζ∈Fq2m be a root of f, so that f is the
minimal polynomial
of ζ over Fq2. Then the set of roots of fσ is {ζq,ζq3,…,ζq2m−1} and the set of
roots of f∗ is {ζ−1,ζ−q2,…,ζ−q2m−2}.
Since these sets are equal, ζ−1=ζq2i+1 for some
i, and so ζq2i+1+1=1. Hence ζ∈Fq4i+2=F(q2)2i+1, an odd degree extension of Fq2.
Thus m=∣Fq2(ζ):Fq2∣ is odd.
∎
Definition 4.2**.**
For a monic irreducible polynomial f(X), we let ω(f) denote the
order of one (and hence all) of its roots. Similarly,
ω(g) denotes the order of one (and hence all) of the roots of a
U∗-irreducible polynomial g(X). We write n2 for the
2-part of an integer n, and let ω2(f) denote
the 2-part of ω(f).
Let y∈GUn(q) be both regular semisimple and conjugate
to its inverse. We distinguish five possibilities for
irreducible factors f(X) of the characteristic polynomial
cy(X).
Proposition 4.3**.**
Let y∈GUn(q) be regular semisimple, and let
f(X) be an irreducible factor of cy(X)∈Fq2[X] of
degree m.
If y is conjugate to y−1 in GUn(q), then cy(X) is
U∗-closed,
and f(X) satisfies precisely
one of the following:
Type A.
f=f∗=fσ.
Thus f∼=fσ=f, ff∼∣cy(X), m is even, and ω(f)∣(qm+1).
2. Type B.
f=fσ=f∗. Thus f∼=f∗=f,
ff∼∣cy(X), m is odd, and ω(f)∣(qm−1).
3. Type C.
f=f∗=fσ. Thus f∼=f,
ff∗∣cy(X), m is odd, and ω(f)∣(qm+1).
4. Type D.
∣{f,f∗,fσ,f∼}∣=4, ff∗fσf∼∣cy(X), and
ω(f)∣(q2m−1).
5. Type E.
f(X)=X±1.
Proof.
Let g(X)=cy(X).
Since y is conjugate to y−1, we have g=g∗,
and by Corollary 2.5, g=g∼. Thus
g∗=g∼, and hence
g=gσ, so g is U∗-closed.
Since g=g∗, the polynomial f∗ is a factor of g, and either
f=f∗ or ff∗ divides g.
Furthermore, since g=g∼, the polynomial f∼ is
a factor of g, and either f=f∼ or
f(X)f∼(X) divides g(X).
If f=f∗=fσ then, by
Lemma 4.1, m=1 and f(X)=X±1, and we are in Type E. Assume now that ∣{f,f∗,f∼}∣⩾2.
Then it is easy to see that equalities between the polynomials,
f,f∗,fσ,f∼, and the divisibility
concerning cy(X), satisfy the
conditions of precisely one of Types A to D.
Let ζ be a root of f. In Type A,
the degree m of f is even by Lemma 4.1(i), and since f=f∗,
the roots of f in Fq2m
are
[TABLE]
Thus ζ−1=ζq2i for some i with 0<i⩽m−1,
and so ζq2i+1=1, from which we deduce that
ζ∈Fq4i∩Fq2m=Fq4(i,m/2). If i=m/2
then 4(i,m/2)<2m, contradicting the irreducibility of
f. Hence i=m/2 and ζqm+1=1, as required.
In Type B, the degree m is odd by Lemma 4.1(ii),
and we deduce from f=fσ that ζq2i+1−1=1 for some i, and hence that 2i+1=m.
In Type C, the degree m is odd by Lemma 4.1(iv), and we use f=f∗σ to reach a similar conclusion. For Type D, we shall
see in §5 a construction of regular semisimple elements that
is independent of the parity of m.
∎
Remark 4.4**.**
We shall eventually see that almost all irreducible
polynomials are of Type D, independent of the parity of m.
Remark 4.5**.**
Observe that Type E is equivalent to f(X)=f∗(X)=fσ(X)=X.
Hence if degf>1, then the hypotheses for Types A, B, C can be
abbreviated to f=f∗, f=fσ, and
f=f∼, respectively.
Definition 4.6**.**
If one (and hence all) of the irreducible factors of
a U∗-irreducible polynomial g(X)=X±1 are of
Type A, B, C or D, then we say that g(X) has this type.
Definition 4.7**.**
Let N(q2,r) denote the number of monic irreducible polynomials f(X)∈Fq2[X] of degree r with
gcd(f(X),X)=1.
Lemma 4.8** ([DPS, Lemma 2.11]).**
Let Pr,q2 be the set of monic irreducible polynomials f(X) of
degree r over Fq2(q odd) with nonzero roots (so Pr,q2=N(q2,r)).
(i)
ω2(f)⩽(q2r−1)2*
for all f(X)∈Pr,q2.*
2. (ii)
ω2(f)=(q2r−1)2* for at
least N(q2,r)/2 of the f(X)∈Pr,q2.*
If r=2b then ω2(f)=(q2r−1)2 for exactly (q2r−1)/(2r) of the f(X)∈Pr,q2.
Definition 4.9**.**
Let D4r be the
U∗-irreducible polynomials in
Fq2[X] of type D and degree 4r
(so that each irreducible factor has degree r).
Let D4r− be the subset of D4r consisting of
those polynomials g with ω2(g)=(q2r−1)2=r2(q2−1)2.
Let NU−(q,4r) be the number of monic
U∗-irreducible polynomials g∈Fq2[X] of degree 4r
such that ω2(g)=(q2r−1)2.
We shall now show that D4r− contains all monic
U∗-irreducible polynomials g∈Fq2[X] of degree 4r
such that ω2(g)=(q2r−1)2, so that ∣D4r−∣=NU−(q,4r).
Lemma 4.10**.**
Let g(X)∈Fq2[X] be a U∗-irreducible polynomial with an
irreducible factor f(X) of degree r.
(i)
If g(X) has type A, B or C, then ω2(g)<(q2−1)2.
2. (ii)
If g(X)∈D4r then ω2(g)⩽(q2r−1)2. At
least N(q2,r)/8 of the polynomials g(X)∈D4r
satisfy ω2(g)=(q2r−1)2.
3. (iii)
NU−(q,4r)=D4r−⩾N(q2,r)/8,
with equality if r=1; and if r=2b−1⩾1 then
NU−(q,4r)=(q2r−1)/(8r).
Proof.
(i) It follows from Proposition 4.3 that ω2(g) divides
2, q−1, q+1 for Types, A, B and C, respectively. The result follows.
(ii) Let g(X)∈D4r. Then ω2(g)∣(q2r−1)2, by
Proposition 4.3.
By Lemma 4.8,
ω2(f)=(q2r−1)2 for at least N(q2,r)/2 of the monic irreducibles in Pr,q2 and
these
irreducibles have roots of greater 2-power order than those that
correspond to irreducible factors of polynomials of types A, B or C,
so the result follows.
(iii) The claim that ∣D4r−∣=NU−(q,4r) follows
from Part (i), and the bound
∣NU−(q,4r)∣⩾N(q2,r)/8 follows from Part (ii).
Let r=1.
The set D4− consists of polynomials
(X−ζ)(X−ζ−1)(X−ζ−q)(X−ζq) in Fq2[X]
such that the order of ζ is divisible by (q2−1)2.
We now count the number of such polynomials. Observe that
ζ,ζ−1,ζ−q,ζq all have the same order and
ζ∈{ζ−1,ζ−q,ζq}. It follows that
∣{ζ,ζ−1,ζ−q,ζq}∣=4. The elements of Fq2∗
with order divisible by (q2−1)2 are precisely the nonsquares, and there
are (q2−1)/2 nonsquares. We take these nonsquares four at a time
to make U∗-irreducible polynomials, and so
∣D4−∣=(q2−1)/8.
Now consider r=2b−1>1. By Lemma 4.8,
there are (q2r−1)/(2r) degree r monic irreducible polynomials
f(X) over Fq2
such that ω2(f)=(q2r−1)2. Part (i)
implies that each such f(X) corresponds to a U∗-irreducible
polynomial g(X) of type D, yielding exactly
(q2r−1)/(8r) such g(X). By Part (ii),
each such g(X) satisfies ω2(g)=(q2r−1)2,
and hence lies in D4r−. Conversely
each polynomial in D4r− is of this form. Hence
∣D4r−∣=(q2r−1)/(8r).
∎
5. Centralisers of
U∗-irreducible, regular semisimple elements
In this section we investigate the centralisers and normalisers of
cyclic subgroups of GUn(q) whose generators are regular semisimple,
U∗-irreducible, and conjugate in
GUn(q) to
their inverse. We also count the number of involutions in GUn(q) that
invert these generators.
The field Fq2m may be regarded as a vector
space Fq2m, and from this point of view the
multiplicative group of Fq2m is a subgroup of
GLm(q2) acting regularly on the nonzero vectors. There is a
single conjugacy class of such Singer subgroups of
GLm(q2), and their generators are Singer
cycles. Thus if ⟨z⟩≅Cq2m−1 is a Singer
subgroup in GLm(q2) then we may identify Fq2m with the additive group of the field
Fq2m, and ⟨z⟩ with the multiplicative group
Fq2m∗, so that the Singer cycle z corresponds to multiplication by
a primitive element ζ.
Moreover, NGLm(q2)(⟨z⟩)=⟨z,s⟩≅Cq2m−1⋊Cm≅ΓL1(Fq2m/Fq2), with s:z↦zq2
corresponding to the field automorphism ϕ:ζ↦ζq2
of Fq2m over Fq2
(see [hupp, Satz II.7.3]).
5.1. Singer subgroups and regular semisimple elements
In this subsection we change our unitary form, and
work with matrices written relative to a decomposition
[TABLE]
Choose an ordered basis
(v1,…,v2m) for V such that W0:=⟨v1,…,vm⟩ and
W0∼:=⟨vm+1,…,v2m⟩.
In this subsection our unitary form has Gram matrix
[TABLE]
where Im is the identity matrix.
We denote this unitary group by GU(J)≅GU2m(q).
Consider the monomorphism
[TABLE]
To see that α(a)∈GU(J), it is straightforward to check that α(a)Jα(aσT)=J, or
equivalently α(a)J=α(a−σT).
Thus the automorphism a↦a−σT of GLm(q2) induces
the automorphism α(a)↦α(a)J on the image of α.
5.2. Types A and B: ∣{f,fσ,f∗,f∼}∣=2, with f=f∼
To assist with our analysis of Types A and B of Proposition 4.3,
we first consider the more general situation where
y∈GU2m(q) is regular semisimple with
characteristic polynomial f(X)f∼(X), where f(X) is
irreducible. We later add the condition that y is conjugate to
its inverse.
We can then write V=W⊕W∼=Fq2m⊕Fq2m where the restrictions y∣W and y∣W∼
to W and W∼ have characteristic polynomials f(X) and
f∼(X), respectively. It follows from [npp, Definition 2.2 and Lemma 2.4]
that the subspaces W and W∼ are totally isotropic.
Before proceeding with our analysis we make a few general remarks.
Remark 5.1**.**
Let a∈GLm(q). Then a is conjugate in GLm(q) to its transpose.
In fact, by a result of Voss [v]
(see also [k, Theorem 66]),
there is a symmetric matrix
c∈GLm(q) which conjugates a to its transpose, that is
c=cT and c−1ac=aT.
Let a∈GLm(q) be irreducible, with
characteristic polynomial f(X).
If a′∈GLm(q) is also irreducible and
ζqi is a root of
its characteristic polynomial for some i, then a′ also has
characteristic polynomial f(X), and consequently a′
is conjugate to a in GLm(q).
Lemma 5.2**.**
Let V=W0⊕W0∼, with W0 totally isotropic. Let J
be the Gram matrix of the form on V, as in (5), and let
α be as in (6).
Let z∈GLm(q2) be a Singer cycle for GLm(q2), and let s∈NGLm(q2)(⟨z⟩) be such that zs=zq2.
(i)
Let H:=α(GLm(q2)). Then H is the stabiliser in
GU(V) of both W0 and W0∼. The stabiliser of the decomposition
V=W0⊕W0∼ is StabGU(J)(W0⊕W0∼)=H⋊⟨J⟩.
2. (ii)
Let Z:=α(z). Then CGU(J)(Z)=⟨Z⟩≅Cq2m−1,
and N:=NGU(J)(⟨Z⟩)=⟨Z,B⟩≅Cq2m−1.C2m,
where B=α(b)J for some b∈GLm(q2) such that b−1zb=zqσT.
Moreover,
[TABLE]
3. (iii)
Let y∈GL2m(q2) be regular semisimple with
characteristic polynomial f(X)f∼(X), for some irreducible polynomial
f(X). Then some conjugate of ⟨y⟩ lies in ⟨Z⟩⩽GU(J), and
has centraliser ⟨Z⟩ and normaliser N in GU(J).
Proof.
(i) The fact that H⩽GU(J) follows from our remark after (6).
The spaces
W0 and W0∼ are non-isomorphic irreducible Fq2H-submodules of V.
Define H to be the stabiliser in GU(J) of both W0
and W0∼. We shall show that H=H.
The restriction H∣W0=H∣W0≅GLm(q2), and the subgroup K of
H fixing W0 pointwise must fix the hyperplane
⟨w⟩⊥∩W0∼ of W0∼ for each non-zero w∈W0. Thus
K induces a subgroup of scalar matrices on W0∼.
However
(I00λI)∈GU(J)
implies λ=1, so K is trivial.
It follows that H=H.
Finally each element of StabGU(J)(W0⊕W0∼) either
fixes setwise, or interchanges, the subspaces W0 and W0∼, and
it is straightforward to check that J∈GU(J), and that J interchanges
these two subspaces. Hence StabGU(J)(W0⊕W0∼)=H⋊⟨J⟩.
(ii) The spaces W0 and W0∼ are also non-isomorphic irreducible
Fq2⟨Z⟩-modules, so that
CGU2m(q)(Z) fixes each of W0,W0∼ setwise,
and so is contained in their stabiliser H, by Part (i).
Since CGLm(q2)(z)=⟨z⟩≅Cq2m−1
(see [hupp, Satz II.7.3]), we have
CGU2m(q)(Z)=⟨Z⟩. To prove the second
assertion we note that
N must preserve the decomposition V=W0⊕W0∼,
since N normalises ⟨Z⟩.
Thus N⩽H⋊⟨J⟩, by Part (i). Also
N∩H is the image under α of
NGLm(q2)(⟨z⟩), and this is ⟨α(z),α(s)⟩,
(again see [hupp, Satz II.7.3]). Now N∩H has index at most 2 in N,
and we shall construct B∈N∖(N∩H).
Let f(X)=cz(X), and let ζ be a root of f(X).
Then the roots of f(X) are ζq2i for 0⩽i⩽m−1.
Since ∣z∣=q2m−1, the element zq is irreducible and one
of the roots of czq(X)
is ζq. Similarly zqσ is irreducible and one of the
roots of czqσ(X)
is (ζq)σ=ζq2. Hence, by Remark 5.1,
z is conjugate in GLm(q2) to zqσ which in turn is conjugate
to zqσT. Let b∈GLm(q2) be such that b−1zb=zqσT, and let B:=α(b)J. Then, using the fact noted after (6) that α(a)J=α(a−σT) for all a,
[TABLE]
In particular, B normalises ⟨Z⟩ and interchanges
W0 and W0∼. Thus N=⟨Z,α(s),B⟩. A
straightforward computation shows that B2 and α(s) both conjugate Z to Zq2,
so B2α(s)−1∈CGU(J)(Z)=⟨Z⟩. Hence
N=⟨Z,B⟩, and B2=α(zℓs) for some integer ℓ.
Another easy computation yields B2=(α(b)J)2=α(b1−σT), so
b1−σT=zℓs.
(iii) The fact that y is conjugate to an element of
GU2m(q), and hence to an element of GU(J),
is immediate from Corollary 2.5.
The primary decomposition of V with respect to y, as discussed
at the beginning of §5.2, is V=W⊕W∼
where both W and W∼ are totally isotropic, and the
restrictions of y to W and W∼ are irreducible with
characteristic polynomials f(X) and f∼(X), respectively.
Since GU(J) is transitive on ordered pairs of disjoint
totally isotropic m-dimensional subspaces, replacing y
by a conjugate, if necessary, we may assume that W=W0 and
W∼=W0∼.
Then y fixes both W0 and W0∼ setwise, and hence
y=α(y0) for some y0∈GLm(q2), by Part (ii).
From the definition of α(y0), we have y0:=y∣W0.
It follows from [hupp, Satz II.7.3] that there exists
c∈GLm(q2) such that y0c∈⟨z⟩ and
NGLm(q2)(⟨y0⟩)c=NGLm(q2)(⟨z⟩)=⟨z,s⟩. Thus,
replacing y by its conjugate yα(c), we have
CGU2m(q)(y)=CGU2m(q)(Z)=⟨Z⟩
and NGU2m(q)(⟨y⟩)∩H=⟨Z,α(s)⟩.
Since NGU2m(q)(⟨y⟩) normalises CGU2m(q)(y)=⟨Z⟩, it is contained in N, and since
B=α(b)J normalises the cyclic group
⟨Z⟩, it also normalises ⟨y⟩.
Thus NGU2m(q)(⟨y⟩)=N.
∎
As a corollary we count the number of involutions which invert
an element y as in Lemma 5.2(iii).
Corollary 5.3**.**
Let y∈GL2m(q2) be regular semisimple, with
U∗-irreducible characteristic
polynomial g(X)=f(X)f∼(X), where f(X) is irreducible and
f(X)=f∼(X).
Then up to conjugacy y∈GU2m(q), and
some element of GU2m(q) inverts this conjugate of y
if and only if one of the following holds.
(i)
f(X)* is of Type A and exactly qm+1 involutions invert y.*
2. (ii)
f(X)* is of Type B and exactly qm−1 involutions invert y.*
Proof.
Note that f(X)=X±1 since f(X)=f∼(X), and hence, in particular,
∣y∣>2. Let z, W0 and N=⟨Z,B⟩ be as in
Lemma 5.2.
By Lemma 5.2(iii), we may assume up to conjugacy
that y=α(zi) for some
i∈{1,…,q2m−2} such that zi is irreducible on W0,
and every element of GU2m(q) that inverts y, if one exists, must lie in N.
If both n and n′ invert y, then n′n−1
centralises y and hence, by Lemma 5.2(iii), n′=α(zi)n,
for some i. Moreover, if n inverts y then certainly α(zi)n
also inverts y for each i. Hence either [math] or ∣z∣=q2m−1
elements invert y. We show first that such inverting elements exist,
in both types, and then we count the number of them which are involutions.
It follows from Lemma 5.2(ii) that if an
element n of GU2m(q) inverts y, then n is of the form α(zj)Bk∈N
for some j,k such that 0⩽j⩽q2m−2 and 1⩽k⩽2m−1.
Note that k=0 since ∣y∣>2 implies that n does not centralise
y. Recall from Lemma 5.2(ii) that ZB=Z−q, so
yB=y−q.
Suppose first that k is even. Then
[TABLE]
and so ziqk=z−i, which is equivalent to zi(qk+1)=1.
This implies that zi∈Fq2k∩Fq2m=Fq2(k,m) (identifying z with an element of Fq2m).
However, zi acts irreducibly on Fq2m,
so zi lies in no proper subfield of Fq2m that contains
Fq2.
Hence k=m, and
in particular
m is even (since k is assumed to be even), and we are in Type A
by Proposition 4.3. Here ∣y∣=∣zi∣ divides qm+1,
and hence n=α(zj)Bm inverts y for each j∈{0,…,q2m−2}.
Now suppose that k is odd. Then
[TABLE]
and so zi(qk−1)=1, whence
zi∈Fqk∩Fq2m=Fq(k,m)⊂Fq2(k,m) since k is odd.
As in the previous case, zi lies in no proper
subfield of Fq2m containing Fq2.
Hence (k,m)=m, so again k=m.
Thus m is odd (since k is odd),
and we are in Type B
by Proposition 4.3. Here ∣y∣=∣zi∣ divides qm−1,
and hence n=α(zj)Bm inverts y, for each j∈{0,…,q2m−2}.
We now count the inverting involutions. Observe that, by Lemma 5.2(ii), B2=α(zℓs) for some ℓ∈{0,…,q2m−2},
where s−1zs=zq2, with zq2m−1=1 and sm=1. Hence
[TABLE]
Type A: Each inverting element is of the form n=α(zj)Bm,
for some j∈{0,…,q2m−2}, and m is even.
Such an element n is an involution if and only if
[TABLE]
Hence, by (7), n2=1 if and only if
q2m−1 divides j(qm+1)+ℓ(q2m−1)/(q2−1).
Since m is even, this holds
if and only if qm−1 divides j+ℓ(qm−1)/(q2−1). In particular
j=j′(qm−1)/(q2−1) (there are (qm+1)(q2−1)
integers j with this property in {1,…,q2m−2}),
and in addition
q2−1 divides j′+ℓ. Thus we have exactly qm+1 possibilities for j,
and hence there are exactly qm+1 involutions which invert y.
Type B: Each inverting element is of the form n=α(zj)Bm,
for some j∈{0,…,q2m−2}, and m is odd.
Such an element n is an involution if and only if
[TABLE]
Thus, by (7), n2=1 if and only if
q2m−1 divides −j(qm−1)+ℓ(q2m−1)/(q2−1).
In particular, qm−1 must divide ℓ(q2m−1)/(q2−1),
or equivalently, ℓ(qm+1)/(q2−1) must be an integer. Given this condition,
n2=1 if and only if qm+1 divides −j+ℓ(qm+1)/(q2−1). As
j runs through {0,…,q2m−2}, there are exactly qm−1 values with this property.
Thus there are either [math] or qm−1 inverting involutions.
To prove the latter holds, we construct an inverting involution.
We have m odd and f(X)=fσ(X), so all of the
coefficients of f(X) lie in Fq,
and hence all of its roots lie in Fqm. This means that some conjugate of
zi by an element of GLm(q2) lies in
GLm(q) (the subgroup of GLm(q2) of matrices
with entries in Fq). We may therefore conjugate y=α(zi)
by an element of α(GLm(q2))⊆GU2m(q)
(see (6)) and obtain an element in α(GLm(q)). Let us replace y
by this element so that y=α(zi) with zi∈GLm(q).
By Remark 5.1, there is a symmetric matrix
c∈GLm(q) which conjugates zi to its transpose, that is,
c=cT and c−1zic=(zi)T. Note that (zi)T=(zi)σT
and cσT=c, since
zi,c∈GLm(q) and c=cT. Therefore
cσT(zi)−σTc−σT=(c−1z−ic)T=z−i, and it
follows from (6) that α(c)−1yα(c) is the block diagonal matrix α(ziT) with
diagonal components ziT,z−i. Thus C:=α(c)J conjugates
y to α(z−i)=y−1.
Moreover Jα(c)J=α(c−σT)=α(c−1),
and hence C2=α(c)Jα(c)J=α(c)α(c−1)=1,
that is, C is an involution inverting y.
∎
5.3. Type C: ∣{f,fσ,f∗,f∼}∣=2, f=f∼
We now consider regular semisimple y∈GU2m(q) with
U∗-irreducible characteristic polynomial
cy(X)=f(X)f∗(X),
where f(X)=f∼(X) has degree m.
So y is in Type C of Proposition 4.3, and in particular m is odd.
The primary decomposition of V as an Fq2⟨y⟩-module is
V=U⊕U∗, where the restrictions y1:=y∣U
and y2:=y∣U∗ have characteristic
polynomials f(X) and f∗(X), respectively. Reasoning in exactly
the same way as in the proof of [npp, Lemma 2.4], we see that
U∗⩽U⊥. Since dimU∗=m=dimU, we
deduce that U∗=U⊥, and so both U and U∗ are
nondegenerate.
For the analysis in
this subsection it is convenient to work with matrices with respect to an ordered
basis (v1,…,v2m) where U=⟨v1,…,vm⟩ and
U∗=⟨vm+1,…,v2m⟩, and with Gram matrix
J=I2m, where I2m denotes the identity matrix.
The stabiliser in GU2m(q) of the subspace U (and hence also of
U∗=U⊥) is H:=StabGU2m(q)(U)=GU(U)×GU(U∗)≅GUm(q)×GUm(q). It is convenient to write elements of H
as pairs (h,h′) with h,h′∈GUm(q). The stabiliser in GU2m(q) of the
decomposition V=U⊥U∗ is H:=H⋅⟨τ⟩, where
τ:(h,h′)↦(h′,h) for (h,h′)∈H.
By [hupp, Satz II.7.3],
we may replace y by a conjugate in H such that
y1 and y2 are contained in the same Singer
subgroup ⟨z⟩≅Cqm+1 of GUm(q), and moreover, such that
y2 is equal to y1−1.
Lemma 5.4**.**
Let y∈GL2m(q2) be regular semisimple, with cy(X) a
U∗-irreducible polynomial in Type C. Then up to conjugacy, y∈GU2m(q), m is odd, and with the notation from the previous
two paragraphs
(i)
NGU2m(q)(⟨z⟩×⟨z⟩)=⟨z,ϕ⟩≀⟨τ⟩≅ΓU1(qm)≀C2*
where ϕ:zi↦ziq2;*
2. (ii)
y∈CGU2m(q)(⟨y⟩)⩽H, and CGU2m(q)(⟨y⟩)=⟨z⟩×⟨z⟩≅Cqm+12;
3. (iii)
y* is inverted by precisely qm+1 involutions in
GU2m(q).*
Proof.
First note that by Corollary 2.5, up to conjugacy y∈GU2m(q), and then by our discussion before the lemma, we can
assume that y=(y1,y1−1)∈H.
(i) Let C:=⟨z⟩×⟨z⟩. Then
the only proper non-trivial Fq2C-submodules are
U and U∗, and so C⩽H and NGU2m(q)(C)⩽H.
Now the normaliser of ⟨z⟩ in GUm(q) is N1:=⟨z,ϕ⟩, and so NGU2m(q)(C)=N1≀C2.
(ii) As observed above, U and U∗ are non-isomorphic irreducible
Fq2⟨y⟩-submodules, and we may assume that y=(y1,y1−1).
Hence CGU2m(q)(⟨y⟩)⩽H. Moreover,
since y1 is irreducible on U, its centraliser in GUm(q)
is ⟨z⟩, and hence CGU2m(q)(⟨y⟩)=C.
(iii) Since y=(y1,y1−1), the involutory map τ conjugates y to y−1.
It follows that the elements which conjugate y to y−1
are precisely the elements of the coset
Cτ. These elements are of the form (z1,z2)τ, for some
z1,z2∈⟨z⟩, and
are involutions if and only if z2=z1−1. Thus
there are precisely ∣z∣=qm+1 involutions which invert y.
∎
5.4. Type D: ∣{f,fσ,f∗,f∼}∣=4
We now consider regular semisimple y∈GU4m(q) with
U∗-irreducible
characteristic polynomial
[TABLE]
where f(X) has degree m, so that
y is in Type D of Proposition 4.3.
The primary decomposition of V as an Fq2⟨y⟩-module is
V=U⊕U∼⊕U∗⊕Uσ, where the restrictions
y∣U, y∣U∼, y∣U∗, y∣Uσ have characteristic
polynomials f(X), f∼(X), f∗(X), and fσ(X), respectively.
Hence these four m-dimensional subspaces are pairwise non-isomorphic
Fq2⟨y⟩-submodules,
and so the centraliser C:=CGU4m(q)(y) lies in the stabiliser
H in GU4m(q) of all four submodules U, U∼, U∗ and
Uσ.
Let W:=U⊕U∼ and W∗:=U∗⊕Uσ. Then the
characteristic polynomials of y∣W and y∣W∗, namely g(X):=f(X)f∼(X) and g∗(X)=gσ(X)=f∗(X)fσ(X), are both ∼-invariant. Thus both W and W∗ are non-degenerate,
and V=W⊥W∗. Moreover on considering y∣W, y∣W∗
as in §5.2, we see by Lemma 5.2 that each of the four subspaces
U,U∼,U∗,Uσ is totally isotropic.
For the analysis in
this subsection it is convenient to work with matrices with respect to an ordered
basis (v1,…,v4m) of V, where U=⟨v1,…,vm⟩,
U∼=⟨vm+1,…,v2m⟩, U∗=⟨v2m+1,…,v3m⟩, and
Uσ=⟨v3m+1,…,v4m⟩, and with the Gram matrix
[TABLE]
where Im denotes the identity matrix.
Then, by Lemma 5.2, the subgroup of GU(J) leaving each of U,U∼,U∗ and Uσ invariant is
[TABLE]
where the matrices α(a),α(b)∈GU2m(q) are as defined in (6).
We note that GU(J) contains
[TABLE]
which interchanges the subspaces W and W∗ and normalises H.
We often write elements of H
as pairs (α(a),α(b)) with a,b∈GLm(q2). Since y1:=y∣U∈GLm(q2)
is irreducible, it is contained in a Singer subgroup ⟨z⟩ of
GLm(q2), and it follows from Lemma 5.2 that y∣W=α(y1) and
CGU(W)(y∣W)=⟨Z⟩, where Z:=α(z). Also, since y∣U∗,
y∣Uσ have characteristic polynomials f∗(X), fσ(X)=(f∼(X))∗,
we may replace y by a conjugate in H so that y∣W∗=α(y1−1). Thus
we may assume that y=(α(y1),α(y1−1)).
Lemma 5.5**.**
*Let y∈GL4m(q2) be regular semisimple, with cy(X) a
U∗-irreducible polynomial in Type D.
Then, up to conjugacy, and with the previous notation, the following hold:
*
(i)
y=(α(y1),α(y1−1))∈GU4m(q),
where y1∈GLm(q2), with
characteristic polynomial f(X), y1 is contained in a Singer
subgroup ⟨z⟩, and C:=CGU4m(q)(y)=⟨Z⟩×⟨Z⟩≅Cq2m−12,
where Z=α(z);
2. (ii)
NGU4m(q)(C)=N≀C2=⟨Z,B⟩≀⟨τ⟩, with N,B, as in
Lemma 5.2;
3. (iii)
y* is inverted by precisely q2m−1 involutions in
GU4m(q)*
4. (iv)
The integer m can be even or odd.
Let m=2b−1r with b⩾1 and r odd. Then ∣y∣2⩽2b−1(q2−1)2, and equality can be attained in this bound.
Proof.
(i) The assertions about y follow from
Corollary 2.5,
and the discussion above.
The structure of C follows from Lemma 5.2
applied to y∣W=α(y1) and y∣W∗=α(y1−1).
(ii) The normaliser NGU(W)(⟨y∣W⟩))=N=⟨Z,B⟩, as in
Lemma 5.2, and NGU4m(q)(C)
is therefore equal to N≀⟨τ⟩.
(iii) The element τ is an involution which inverts y=(y1,y1−1),
and hence, if x∈GU(V) inverts y, then x lies in the
coset Cτ of the centraliser C of y, so x=(α(z1),α(z2))τ,
for some z1,z2∈⟨z⟩. The
condition x2=1 is equivalent to z2=z1−1. Thus there
are precisely q2m−1 involutions inverting y.
(iv) The order of y is equal to ∣y1∣, which is a divisor of
q2m−1. Now (q2m−1)2=(q2br−1)2=2b−1(q2−1)2. To see that equality may be attained
in the bound, notice that we may set y1=z, so that ∣y∣=q2m−1: in this case the roots of f(X)=cy1(X) are of the form
{ζ,ζq2,…,ζq2m−2}, where ζ has
multiplicative order q2m−1, so f(X)∈{f∗(X),fσ(X),f∼(X)}, as required. This also
shows that m may be even or odd.
∎
6. Involutions inverting regular semisimple elements
Having considered the regular semisimple elements whose
characteristic polynomials are U∗-irreducible,
we now consider the general case. We remind the reader that we assume
throughout this paper that q is an odd prime power.
Let y be a regular semisimple element of G=GUn(q),
and suppose that yt=y−1 for some involution t∈G. Let g(X):=cy(X). Then each of X−1 and X+1 may divide g(X) with
multiplicity at most one, so g(X)=g0(X)(X−1)δ−(X+1)δ+
where δ−,δ+∈{0,1} and g0(X) is coprime to X2−1
and multiplicity-free.
Definition 6.1**.**
We define A⊂Fq2[X] to contain one irreducible factor of each
U∗-irreducible polynomial g(X) in Type A.
Similarly, we define B,C,D⊂Fq2[X] to contain one
irreducible factor of each U∗-irreducible polynomial
from Types
B, C and D, respectively. For a U∗-closed polynomial g(X), we
shall write Ag to denote the set of irreducible factors of g
that lie in A, and similarly for the other classes.
Then g0(X) may be written as
[TABLE]
We consider the primary decomposition of V as an Fq2⟨y⟩-module, equipped with our unitary form, and combine the two
summands corresponding to {f(X),fσ(X)} in Type A,
the two summands corresponding to {f(X),f∗(X)} in Types B and C, and
the four summands corresponding to {f(X),f∼(X),f∗(X),fσ(X)} in Type D, to obtain the following uniquely determined
y-invariant direct sum decomposition of V:
[TABLE]
such that
(A)
for each f∈Ag, the restriction yf=y∣Vf∈GU(Vf) has characteristic polynomial
f(X)fσ(X), with f(X)=f∗(X)=fσ(X)=f∼(X);
2. (B)
for each f∈Bg, the restriction yf=y∣Vf∈GU(Vf) has characteristic polynomial
f(X)f∗(X), with f(X)=fσ(X)=f∗(X)=f∼(X);
3. (C)
for each f∈Cg, the restriction yf=y∣Vf∈GU(Vf) has characteristic polynomial
f(X)f∗(X), with f(X)=f∼(X)=f∗(X)=fσ(X);
4. (D)
for each f∈Dg, the restriction yf=y∣Vf∈GU(Vf) has characteristic polynomial
f(X)f∗(X)fσ(X)f∼(X), with all four polynomials
pairwise distinct;
5. (E)
dimV±∈{0,1,2}; if dimV±=1 then y∣V± has characteristic polynomial
X−1 or X+1; if dimV±=2, then V±=V+⊕V−, and y∣V+, y∣V−, y∣V± has characteristic
polynomial X−1, X+1, X2−1, respectively.
Lemma 6.2**.**
Let y∈GUn(q)=GU(V), where y
is regular semisimple
and conjugate in GUn(q) to y−1, with characteristic polynomial
g(X)=cy(X)=g0(X)(X−1)δ+(X+1)δ−
with δ+,δ−∈{0,1} and g0(X) as in
(8).
(i)
Each non-zero summand in (9) is a
non-degenerate unitary space, and distinct summands are pairwise orthogonal.
2. (ii)
The centraliser CGU(V)(y) has order
[TABLE]
3. (iii)
The number of involutions in CU(V)(see Definition 1.4) that invert y is equal to
[TABLE]
where ε(y)=2 if X2−1 divides g(X),
and ε(y)=1 otherwise.
4. (iv)
If n=2m is even, and g(X) is coprime to X2−1, then
the number of pairs (t,y′)∈ΔU(V) (as defined in (4)) such that y′
has characteristic polynomial g(X) is
[TABLE]
Proof.
(i) Each space in the primary decomposition of V as an
Fq2⟨y⟩ module is either non-degenerate or totally
singular. It follows from §5 that
the spaces corresponding to a U∗-irreducible summand always
span a non-degenerate space. Let U,W be distinct such summands,
corresponding to U∗-irreducible polynomials h(X), h′(X)
respectively. Let h(X)=∑i=0raiXi∈Fq2[X], so that
ar=1. Then h,h′ are coprime,
and so uh(y)=∑i=0raiuyi=0, for each u∈U,
while h(y)∣W is a bijection. Denote by
(u,w) the value of the unitary form on u∈U,w∈W. Then
[TABLE]
Since h is U∗-irreducible, h∼(X)=h(X), and hence
wh∼(y)y−r ranges over all of W as w does. It follows
that W⊆U⊥.
Parts (ii) and (iii) follow from the remarks above on applying
Lemmas 5.2, 5.4, 5.5 and
Corollary 5.3.
For (iv), recall that the number of these pairs
is equal to the number ∣GUn(q)∣/∣CGUn(q)(y)∣
of conjugates of y times the number of t∈CU(V)
inverting y.
By
Lemma 2.6(i) if g(X)=g0(X) then all involutions
inverting y lie in C(V), since n is even.
Thus all involutions in GUn(q) that invert y
lie in CU(V), and hence Part (iv) follows from Parts (ii) and (iii).
∎
7. Formulae for the number of U∗-irreducible
polynomials in each Type
Recall the division of U∗-irreducible polynomials into Types A
to E from Proposition 4.3. We count the
number of polynomials with irreducible factors of degree r in each
type.
First we present some standard counts of polynomials.
Let Irr(r,Fq) denote the set of monic irreducible polynomials in Fq[X]
of degree r. By Definition 4.7,
N(q,r)=∣Irr(r,Fq)∣ if r>1 and N(q,1)=q−1: we do
not count the polynomial f(X)=X as the matrices we consider are
invertible.
We define the following quantities as in [genfunc, pp. 23–26]:
[TABLE]
The Möbius μ function is defined on Z>0, and takes values as follows:
[TABLE]
The following formulae can be found in [genfunc,
Lemmas 1.3.10(a), 12(a), 16(a) and (b)].
Theorem 7.1**.**
Let r⩾1 and let q be an odd prime power. Then
[TABLE]
We now prove some bounds on these quantities.
Lemma 7.2**.**
Set ξ=q/(q−1), and let r⩾1.
If r⩾2 then let p1<p2<⋯<pt be the
prime divisors of r.
(i)
qr−2qr/2<qr−ξqr/p1<rN(q,r)⩽qr−1,
and N(q,r)>0.956(qr−1)/r for r⩾5.
2. (ii)
N(q,r+1)>N(q,r)*.
*
3. (iii)
Let r be even. If t=2 then rN∗(q,r)=qr/2−qr/(2p2), whilst if t>2 then
[TABLE]
Proof.
(i) The upper bound, and the claim for r⩾5, are [DPS, Lemma
2.9(ii)]. If r=1 then the result is trivial. If r=p1a
is a prime power then
rN(q,r)=qr−qr/p1, and the result follows since ξ>1. Hence assume that t⩾2. Then
rN(q,r)=qr−qr/p1+δ
where δ=∑d∣r,d>p1μ(d)qr/d, so
[TABLE]
(ii) This is [DPS, Lemma 2.9(iii)].
(iii) Let r=2bk where b⩾1 and k>1 is odd.
Then from Theorem 7.1 we get
[TABLE]
since k>1 implies that ∑d∣kμ(d)=0. If t=2, then the result now follows, so
assume that t⩾3. Then similarly to the proof of Part (i)
[TABLE]
Thus writing ξ=q/(q−1) gives
[TABLE]
Lemma 7.3**.**
Let r be a positive integer. Then
[TABLE]
Proof.
Suppose first that r=1. By [genfunc, Corollary 1.3.16],
[TABLE]
Since N∼(q,1)=q+1 and N(q,2)=(q2−q)/2,
the r=1 case follows. Now suppose that r>1.
Then, by [gl, Lemma 5.1],
N∗(q2,2r)+M∗(q2,r)=N(q2,r),
and it follows from [genfunc, Corollary 1.3.13] and its proof
that
(N(q2,r)−N∼(q,r))/2=N(q,2r)
(note this also holds for r even since in that case N∼(q,r)=0).
∎
Definition 7.4**.**
We define A(q,r) to be the number of U∗-irreducible
polynomials in Type A of degree 2r over Fq2 (so that the irreducible
factors have degree r). Similarly, we define B(q,r) and C(q,r)
to be the number of U∗-irreducible polynomials in Types B and C
of degree 2r, and D(q,r) to be the number of
U∗-irreducible polynomials in Type D of degree 4r. Recall Definition 4.9: it is immediate that ∣D4r∣=D(q,r).
Lemma 7.5**.**
Let r⩾1. Then
[TABLE]
Proof.
In each type, the equivalence of the two statements for r=1
follows immediately from Theorem 7.1.
In each of the following types, we first count the number of
polynomials f∈Irr(r,Fq2) satisfying the type conditions,
and then deduce the number of U∗-irreducible polynomials of the
relevant degree.
Type A. By Proposition 4.3, in this type
f=f∗=fσ, and if f exists then
r is even. Therefore
A(q,1)=0, and if r>1 and r is odd, then A(q,r)=N∗(q2,r)/2=0. Suppose that r is even. By Lemma 4.1,
r even implies that f=fσ, and hence in this case
A(q,r) is the number of pairs {f,fσ}⊆Irr(r,Fq2)
satisfying f=f∗, namely A(q,r)=N∗(q2,r)/2.
Type B. By Proposition 4.3,
in this type
f=fσ=f∗, and if f exists then r is odd.
Thus if r is even then B(q,r)=0=N∼(q,r)/2.
Suppose that r=1 so f(X)=X−ζ, for some ζ∈Fq2.
Since f=f∗, the polynomial f is not
X±1 or X, and so the root ζ∈{0,±1}.
Moreover, since f=fσ, we have
ζ=ζσ so ζ∈Fq∖{0,±1}.
Note that, for each such ζ, the polynomial f=f∗
since ζ=ζ−1.
Thus there are q−3 possibilities for ζ, so the
number of pairs {f,f∗} is B(q,1)=(q−3)/2.
Suppose now that r>1 and r is odd.
Then f=f∗ by Lemma 4.1, and hence in this case
B(q,r) is the number of pairs {f,f∗}⊂Irr(r,Fq2)
satisfying f=fσ, namely B(q,r)=N(q,r)/2=N∼(q,r)/2.
Type C. By Proposition 4.3, in this type
f=f∗=fσ (so f=f∼),
and if f exists then r is odd.
Thus if r is even then C(q,r)=0=N∼(q,r)/2.
Suppose that r=1 so f(X)=X−ζ, for some ζ∈Fq2.
Since f∗=fσ=f, the root satisfies
ζ−1=ζq=ζ, so ζq+1=1 and ζ2=1,
whence ζ=±1.
Thus there are q−1 possibilities for ζ, and the
number of pairs {f,f∗} is C(q,r)=(q−1)/2.
Suppose now that r>1 and r is odd.
Then f=f∗ by Lemma 4.1, and hence in this case
C(q,r) is the number of pairs {f,f∗}⊂Irr(r,Fq2)
satisfying f=f∼, namely C(q,r)=N∼(q,r)/2.
Type D.
In this type the irreducible polynomials f,fσ,f∗,f∼ are pairwise distinct.
First suppose that r=1, so f(X)=X−ζ, for some ζ∈Fq2.
The conditions f=f∼ and f=f∗ are equivalent to
ζq+1=1 and ζq−1=1, respectively.
These two conditions together imply that
f,fσ,f∗,f∼ are pairwise distinct, and hence
[TABLE]
Suppose now that r>1. We will
prove that B(q,r)+C(q,r)+2D(q,r)=M∗(q2,r). Solving for D(q,r) then gives
the desired result. The number of pairs {f,f∗}⊂Irr(r,Fq2)
satisfying f=f∗ is, by definition, M∗(q2,r). We enumerate these pairs
by a different argument. We showed under ‘Type B’ and ‘Type C’ above that the
numbers of such pairs for which fσ=f, or fσ=f∗, is
B(q,r) or C(q,r), respectively. For the remaining pairs the polynomials
f,f∗,fσ are pairwise distinct, giving a set
{f,fσ,f∗,f∼} of size four: there are D(q,r) such subsets
and each corresponds to two pairs, namely {f,f∗} and
{fσ,f∼}.
∎
The following is an immediate corollary of Theorem 7.1
and Lemma 7.5.
Corollary 7.6**.**
The following identities hold.
[TABLE]
We now prove bounds on these polynomial counts that will
be useful later.
Lemma 7.7**.**
(i)
If r=2b for b⩾0 then D(q,r)=(qr−1)2/(4r).
2. (ii)
If r=3, then 4rD(q,r)=q6−2q3−q2+2q<q2r−qr+qq+1qr/3.
For all other r,
[TABLE]
3. (iii)
4rD(q,r)=(q2r−1)−η(q,r)(qr−1),
where 0<1−2q−2r/3<η(q,r)<2.2.
Proof.
If r>1, then
let the prime divisors of r be p1<p2<…<pt.
(i)
The result for r=1 is immediate from
Lemma 7.5. Otherwise,
by Corollary 7.6,
D(q,r)=(N(q2,r)−N∗(q2,r))/4. Then using
Theorem 7.1 and the fact that r=2b>1, we deduce that
[TABLE]
as required.
(ii) By Part (i) we may assume that r is not a 2-power, and in particular that r⩾3.
Before commencing the main part of the proof, notice first that
if q2r−qr+qq+1qr/3⩾q2r−1 then
qr−1⩽qq+1qr/3<2qr/3, so (qr−1)3<8qr, which is impossible, since q⩾3 and r⩾3. Thus the last
inequality holds.
Suppose first that r is even, and hence is divisible by at least two primes.
Then by Corollary 7.6,
D(q,r)=(N(q2,r)−N∗(q2,r))/4.
We deduce from Lemma 7.2(i)(iii) that
[TABLE]
and (using the fact that r/p3⩽r/p2−2 if p3 exists)
[TABLE]
Suppose now that r>1 is odd, so that
D(q,r)=N(q2,r)/4−N(q,r)/2, by
Corollary 7.6.
If r is an odd prime then rN(qε,r)=qεr−qε and so
4rD(q,r)=(q2r−q2)−2(qr−q)=q2r−2qr−q2+2q. This is
less than the required upper bound for all odd primes r, is greater
than q2r−2qr−qr/(q2−1) for r>3, and is precisely the
stated value when r=3. If r is composite (so r⩾9), then
Lemma 7.2(i) gives
[TABLE]
and since 2r/3+2<r this is greater than q2r−2qr−q2−11qr.
Also (setting ξ′=q/(q+1))
[TABLE]
(iii) Set 4rD(q,r)=(q2r−1)−η(q,r)(qr−1), and let η=η(q,r). When r is a power of 2, the result follows easily
from Part (i) (in fact here η=2), so assume that r is not a power of 2. The
upper bound in Part (ii) yields that, for all such r,
[TABLE]
We must show that
[TABLE]
For all r⩾3 and q⩾3, it is clear that qr−1<qr−2, and so qr+qr−1<2qr−2. Hence (q+1)qr=qr+1+qr=q(qr+qr−1)<q(2qr−2)=2q(qr−1). Thus
((q+1)/q)⋅qr/(qr−1)<2, from which the claimed
lower bound on η follows.
For r an odd prime
[TABLE]
which gives η(q,r)=2+(q−1)2/(qr−1) so 2<η(q,r)⩽2+2/13<2.2.
Otherwise, Part (ii) yields
[TABLE]
so using r>2 and q⩾3 gives
[TABLE]
Lemma 7.8**.**
Let q⩾5 and r⩾1. Then
[TABLE]
Proof.
(i) Suppose r=2b is a power of 2. Then Lemma 7.7(i)
implies that
[TABLE]
This is an increasing function of q. Hence Part (i) holds for such r.
A straightforward calculation
shows the result when r=3, so assume that
r⩾5. Using Lemma 7.7(ii),
Since q⩾5 and r⩾5, one may verify that 2qr⩾9⋅3r+2. Hence 2q2r⩾9⋅3rqr+2, and so
2(q2r−1)⩾9⋅3rqr. Hence 1/(2⋅3r)⩾9qr/(4(q2r−1)), and so the result follows.
(ii)
The result is immediate from
Theorem 7.1 if r is odd, or if r is a
power of 2, so let r=2b⋅k, where k is odd.
If k=pa is a prime power, then rN∗(q2,r)=qr−qr/p,
and the result can be verified by direct calculation.
So let p2<p3 be the two smallest odd primes dividing r,
then Lemma 7.2(iii) states that
rN∗(q2,r)⩾qr−qr/p2−45qr/p3 and
rN∗(32,r)⩽3r−3r/p2−213r/p3.
Assume, by way of contradiction, that
[TABLE]
Then
[TABLE]
and so in particular
qr(3r/p2+213r/p3−1)−3r(qr/p2+45qr/p3−1)<0.
Dividing by (3q)r/p2 yields a contradiction. Hence the result holds for all r and q.
(iii) The arguments here are similar to the previous
two parts. By
Theorem 7.1, the result is immediate if
r is even or if r=1. Assume that r>1 is odd, so that
N∼(q,r)=N(q,r).
Let p be a prime divisor of r. We digress to prove
[TABLE]
It suffices to prove (qr/p+1)(3r+1)⩽(3r/p+1)(qr+1).
This is true if qr/p3r⩽qr3r/p and qr/p+3r⩽qr+3r/p.
The first inequality is true as 3r(1−1/p)⩽qr(1−1/p). The
second inequality is 3r−3r/p⩽qr−qr/p or x0p−x0⩽xp−x
where x0=3r/p⩽qr/p=x. However, the function xp−x is increasing
for x>1, so the second inequality holds. This proves (11).
If r=pa is a prime power, then rN(q,r)=qr−qr/p. Thus Part (iii)
is true by (11).
Suppose now that r has distinct prime divisors p1<p2.
Thus p1⩾3, p2⩾5 and so r⩾15.
Then as in (10) we see that
rN(q,r)=qr−qr/p1−δqr/p2, where
2−q/(q−1)<δ<q/(q−1). Hence
As qr+1>qr and 2⋅3r>3r+1,
it suffices to show that 3r/p2qr>(6⋅3r)qr/p2.
This is true because (q/3)r(1−1/p2)⩾(5/3)15(1−1/5)=(5/3)12>6.
This concludes the proof.
∎
8. The generating function RU(q,u)
In this section, we define a key generating function, analyse its convergence and
bound its coefficients. We continue to assume throughout that q is an odd prime
power.
and define the generating function
RU(q,u)=∑n=0∞rU(2n,q)un.
Recall Types A to D from Proposition 4.3, and
that we use these types to describe U∗-irreducible
polynomials. Recall also Definition 6.1.
Let Un denote the set of all monic U∗-closed
polynomials g(X) of degree 2n such that gcd(g,X2−1)=1.
It follows from Lemma 6.2(iv) that,
for n⩾1, rU(2n,q) is the sum over all g(X)=cy(X)∈Un
of the expression
[TABLE]
Thus the generating function RU(q,u) can be expressed as
[TABLE]
Theorem 8.2**.**
RU(q,u)* is equal as a complex function to S0(q,u)S(q,u), where
S0(q,u) equals (1+q−1u)−1(1+q+1u)−3
and
S(q,u) is the infinite product*
[TABLE]
Furthermore, RU(q,u) is absolutely and uniformly
convergent on the open disc ∣u∣<1.
Proof.
Let
[TABLE]
Then computing the coefficient of
un for each n shows that RU′(q,u) is equal to RU(q,u).
The contribution of each term of this infinite product
depends only on the degree of the corresponding
polynomial f, and so RU′(q,u) is equal, as a
complex function, to
[TABLE]
Substituting the values from Lemma 7.5 into the above
expression for RU′′(q,u), and noting from
Theorem 7.1 that N∗(q,r)=0 for r>1 odd,
whilst N∼(q,r)=0 for r even, shows that RU′′(q,u)=S0(q,u)S(q,u).
We now consider convergence of S(q,u).
By [genfunc, Corollary 1.3.2], each of
[TABLE]
is absolutely and uniformly convergent if and only if the other has these properties.
Now, by [genfunc, Lemma 1.3.16(a)], N∗(q2,r)=r−1qr+O(qr/3) when r is even, and is equal to [math] when r⩾3 is odd, so the displayed sum is absolutely and uniformly
convergent for ∣u∣<1.
Similarly, for the product
[TABLE]
By [genfunc, Lemma 1.3.12(a)], N∼(q,r)=r−1qr−O(qr/3) when r is odd, and is equal to [math] when r
is even, so as before this term is absolutely and uniformly
convergent for ∣u∣<1.
For ∏r⩾1(1+q2r−1u2r)21M∗(q2,r)−21N∼(q,r), we use the same
arguments: by Lemma 7.5 this exponent is equal to D(q,r) for r>1, and then Lemma 7.7(iii)
gives bounds on D(q,r) that
guarantee absolute and uniform convergence for ∣u∣<1.
∎
Theorem 8.3**.**
The limit limn→∞rU(2n,q) exists and is equal
to
[TABLE]
Proof.
Consider the expression RU(q,u)=S0(q,u)S(q,u) from
Theorem 8.2.
We use the fact that N∗(q2,r)=0 for r>1 odd, by
Theorem 7.1, to see that
[TABLE]
Similarly, since N∼(q,1)=N(q,1)+2 and N∼(q,r)=0 for r
even, by Theorem 7.1,
[TABLE]
Since RU(q,u) is uniformly convergent, we can rearrange the infinite
product. Substituting the above displayed expression into
RU(q,u) gives
[TABLE]
In the first infinite product, we rewrite the exponents using
Lemma 7.3, then replace 2r by r, and finally we combine the two infinite products to obtain
[TABLE]
We have shown in Theorem 8.2 that this expression
converges for ∣u∣<1.
By [genfunc, Lemma 1.3.10(b)] with u replaced with u/q, the
following equality holds for ∣u∣<1,
[TABLE]
Multiplying this by our expression for RU(q,u) gives that for
∣u∣<1
[TABLE]
Now consider the above expression for RU(q,u).
By [genfunc, Corollary 1.3.2 and Lemma 1.3.10(a)],
RU(q,u) has a simple pole
at u=1 and is of the form (1−u)−1H(u) where
[TABLE]
Using the bound N(q,r)<qr/r from
Lemma 7.2(i), and [genfunc, Corollary 1.3.2], we see
that H(u) is analytic in the disc ∣u∣<q.
Thus by [genfunc, Lemma 1.3.3],
limn→∞rU(2n,q)=H(1), and the result
follows.
∎
8.2. Upper and lower bounds on
rU(2n,q)
Notation 8.4**.**
If f(z):=∑n⩾0fnzn is a power series, we write [zn]f(z)
to denote the coefficient fn of zn, and we write ∣f∣(z)
for the power series ∑n⩾0∣fn∣zn. Let g(z):=∑n⩾0gnzn. We write
f(z)≪g(z) if fn⩽gn for all n.
Definition 8.5**.**
Recall (14), and define
RU(q,u)=AU(q,u)BU(q,u), where
[TABLE]
We let BU(q,u)=∏r⩾1BU(r,q,u), where
[TABLE]
We shall bound rU(2n,q) by first bounding the bn.
Lemma 8.6**.**
For all n, the absolute value ∣bn∣⩽βq−n/2, where
β:=q/(q−1).
In particular, BU(q,u) is absolutely convergent for all ∣u∣<q1/2.
Proof.
First we claim that for r⩾1 and n⩾0,
[TABLE]
To see this, let N:=N(q,r).
Then we calculate that when r is even
Now, from Definition 8.5, we deduce from (15) that
[TABLE]
Comparing the expression for BU(q,u) with that for B(q,u)
in [DPS, Equation (8)], we can reason just as in the proof of
Lemma 4.1 in [DPS, p. 434] that the bound in
[DPS, Equation (10)] is
valid for ∣BU∣(q,u). This is precisely the bound in the
current lemma.
The convergence claims are clear.
∎
Theorem 8.7**.**
Let α=(q2−1)/(q2+2q).
Then BU(q,1)=∑n⩾0bn converges and
limn→∞rU(2n,q) equals αBU(q,1). Furthermore
[TABLE]
Proof.
By Definition 8.5,
the coefficient
rU(2n,q)=∑k=0nan−kbk. Notice that
[TABLE]
Hence an=q2+2qq2−1+cn, where cn:=(−1)nq(q+2)(q+1)n2q+1. By Lemma 8.6,
BU(q,1) converges.
Therefore
[TABLE]
We bound the terms on the right side of (16) as follows.
Using (2q+1)/(q(q+2))<2/(q+1) gives
Substituting the previous two displayed equations into
(16), and setting β=q/(q−1), gives
[TABLE]
Therefore rU(2n,q)→αBU(q,1) as n→∞ as claimed.
∎
We next record a technical lemma.
Lemma 8.8**.**
Let a,b∈R>0 such that b>1 and ab<1. Then
(1−a)b⩾1−ab.
Proof.
It suffices to show that blog(1−a)⩾log(1−ab). We use the expansion log(1−x)=−∑n=1∞xn/n, valid for 0<x<1.
Notice that
[TABLE]
Since b>1, it follows that aibi+2/(i+2)>ai/(i+2) for all i, from which the result follows.
∎
Theorem 8.9**.**
Let
[TABLE]
let δ=1−3/(4q3), and let εn be as in
Theorem 8.7. Then
μδ−εn<rU(2n,q)<μ+εn.
In particular, rU(2,3)=0.25, and
0.3433<rU(2n,3)<0.3795 for n⩾2.
Proof.
We first bound BU(q,1).
It follows from Definition 8.5 that
[TABLE]
By Theorem 7.1, the upper bound above is
γ:=(1−2/(q(q+1)))q−1. For a lower bound,
note that 1−2/(qr(qr+1))>1−2/q2r, and N(q,r)⩽qr/r by Lemma 7.2(i). Hence
[TABLE]
Lemma 8.8 with a=2q−2r
and b=qr/r gives (1−2q−2r)qr/r⩾1−2/(rqr), and by induction
[TABLE]
However,
[TABLE]
and so BU(q,1)>γ(1−3/(4q3)).
Setting δ=1−3/(4q3) and
[TABLE]
gives μδ<αBU(q,1)<μ. The main claim follows from Theorem 8.7.
When q=3, this becomes
0.3601<αBU(3,1)<0.3704.
Finally, we estimate rU(2n,3) for n⩾3.
We compute the values of rU(2n,q) directly for n⩽20, using the expression for RU(q,u) given
in (13), and we find that rU(0,q) and
rU(2,q) are as given, and that for n⩾2 we can bound
0.3433<rU(2n,q)<0.3795.
Assume therefore that n⩾21. For q=3,
Theorem 8.7 simplifies to
[TABLE]
However, (27+193)/30<2 and 3−(n−1)/2⩽3−10, and
so
[TABLE]
The bounds for n⩾3 now follow from 0.3601<αBU(3,1)<0.3704.
∎
9. Controlling the eigenspaces of inv(y)
We wish to estimate the proportion of pairs (t,y)∈ΔU(2n,q) for which inv(y)
induces a strong involution on one of the t-eigenspaces.
A central issue underpinning this is the link between the eigenspaces of
inv(y) and the characteristic polynomial of y (acting on some
U⩽V). Suppose that there is a y-invariant decomposition U=U+⊕U− such that
(a)
the restriction y−:=y∣U− has a certain 2-part order, say 2B, and
2. (b)
the restriction y+:=y∣U+ is guaranteed to have 2-part order strictly less than 2B.
The ε-eigenspace of inv(y)∣U is Uε, and it
is possible to detect whether conditions (a,b) hold from the
characteristic polynomial of y∣U.
In Subsections 9.1 and 9.2 we introduce
functions GU,b(q,u), RU,b(q,u) and GU,b−(q,u),
each
related to RU(q,u), for certain non-negative integers b. These three
functions will help detect these properties. We will see that
GU,b−(q,u) counts pairs (t−,y−) for which the
2-part order of y− equals 2b−1(q2−1)2, while the
pairs (t+,y+) counted by RU,b(q,u) are such that the
2-part order of y+ is less than 2b−1(q2−1)2.
Thus properties (a) and (b) are determined by the
characteristic polynomials of y±.
The functions GU,b−(q,u) and RU,b(q,u) are therefore crucial.
In particular we will need lower bounds on the sizes of the
coefficients of their power series. In Subsection 9.1 we
define functions TU,b(q,u), for positive integers
b, and prove that RU,b(q,u)=RU(q,u)TU,b(q,u)−1 (Theorem 9.2). The 2-part orders of
the roots will play a critical role.
In Subsection 9.2, we introduce a truncated version
FU,b(q,u) of GU,b−(q,u) from which it is easier to
deduce lower bounds for the coefficients of GU,b−(q,u).
We also prove the fundamental
Lemma 9.5 that links the number of pairs (t,y) in
ΔU(2n,q), where y has a particular type of characteristic
polynomial, with products of certain coefficients of
RU,b(q,u) and GU,b−(q,u). In the remaining two
technical subsections (9.3 and 9.4) we obtain
the required lower bounds: for
the coefficients of TU,b(q,u)−1 (in 9.3),
then for RU,b(q,u) and
FU,b(q,u) (in 9.4). These bounds are used
in §10 to prove Theorem 1.
Our methods in this section are guided by the work of Dixon, Praeger
and Seress in [DPS], and we have used
similar notation to facilitate comparisons between the two
analyses. However, the results of [DPS] unfortunately do not
carry over without careful re-analysis.
We shall continue to assume that q is an odd prime power.
9.1. Related functions GU,b(q,u), RU,b(q,u) and TU,b(q,u)
Recall from
Theorem 8.2 that RU(q,u)=S0(q,u)S(q,u). Recall
also the relationships between the
power series given in Lemma 7.5.
For each b⩾0, we now define an infinite series GU,b(q,u)=∑n⩾0gb(2n,q)un as follows.
First define
[TABLE]
It follows from §8 that
g0(2n,q)∣GU2n(q)∣ is equal to the number of
pairs (t,y)∈ΔU(2n,q) for which each factor in the
U∗-factorisation of cy(X) is
of type A, B or C.
For the infinite product S(q,u)=RU(q,u)/S0(q,u), the terms are labelled by integers r such that r=2b−1m for some positive integers b,m with m odd. We henceforth abbreviate “all odd integers m⩾1” simply as “m odd”.
For each b⩾1, define
It follows from §8 that for b⩾1 the quantity
[un]GU,b(q,u)∣GU2n(q)∣, that is to
say,
gb(2n,q)∣GU2n(q)∣, is
equal to the number of pairs (t,y)∈ΔU(2n,q) for which
each factor in the U∗-factorization of
cy(X) is of type D, and each U∗-irreducible has four irreducible factors over
Fq2 each of degree r=2b−1m for some
odd m. In particular,
the U∗-irreducible polynomial g(X) has degree 4r=2b+1m with m
odd, and ω2(g)⩽(q2r−1)2=2b−1(q2−1)2; moreover a large fraction of these polynomials g(X) have ω2(g)=(q2r−1)2=2b−1(q2−1)2 (see Definition 4.9 and Lemma 4.10).
For b⩾1, we now define an ascending chain of subsets
ΔU,b(2n,q) of ΔU(2n,q).
Let
ΔU,b(2n,q) consist of those (t,y)∈ΔU(2n,q) such that each U∗-irreducible factor
g(X) of
cy(X)
is either of type A, B, or
C, or is of type D and has the 2-part of its degree dividing
2b. Thus in particular ΔU,1(2n,q) contains only those
(t,y) where each U∗-irreducible factor of cy(X) is of
type A, B, or C; whilst ΔU,2(2n,q) also allows
factors of type D, provided that their
degree is 4m for some odd m.
Definition 9.1**.**
For b⩾1, let
rU,b(2n,q):=∣ΔU,b(2n,q)∣/∣GU2n(q)∣ for n>0, and let
rU,b(0,q):=1. We define RU,b(q,u):=∑n=0∞rU,b(2n,q)un, and
for b⩾1, set
TU,b(q,u):=∏k⩾bGU,k(q,u).
Theorem 9.2**.**
The power series RU(q,u), and GU,b(q,u) (for
b⩾0), and RU,b(q,u) and TU,b(q,u)−1
(for b⩾1) all converge absolutely and uniformly in the open disc ∣u∣<1. In this disc,
[TABLE]
Proof.
By Theorem 8.2, RU(q,u) converges absolutely and uniformly in the disc ∣u∣<1.
A similar argument shows that the GU,b(q,u)
converge absolutely and uniformly for ∣u∣<1. Hence
TU,b(q,u) is also absolutely convergent for each b. Since convergent
products converge to nonzero limits, it follows that TU,b(q,u)−1 is also absolutely convergent.
From (12), we see that the terms of RU(q,u) are
a permutation of the terms of ∏b=0∞GU,b(q,u).
The absolute convergence for ∣u∣<1 of
each infinite expression in the first displayed equality in the statement implies that this equality holds.
Next, let b⩾1. Since 0<rU,b(2n,q)<rU(2n,q) for
all n, RU,b(q,u) converges absolutely and uniformly for
∣u∣<1.
It follows from the discussion after
(18), and Definition 9.1, that RU,b(q,u) is a product
of a permutation of the terms of ∏k=0b−1GU,k(q,u).
The absolute convergence for ∣u∣<1 of
each infinite expression in the second displayed equality in the
statement implies the equality of these functions. The final
equality is now immediate.
∎
9.2. Truncations of the power series GU,b(q,u)
For the definitions of the subset D4r− of D4r and the
quantity NU−(q,4r), see Definition 4.9.
Definition 9.3**.**
For b⩾1, we ‘truncate’ the infinite product defined by
(18) by reducing the exponent of each term, and hence
removing some of the factors.
We set
[TABLE]
Remark 9.4**.**
For b>1 the product expression for GU,b−(q,u) is
a truncation of the one for GU,b, because D4r−⊂D4r.
For b=1 notice that replacing the exponent D(q,m) in
(18) by the exponent NU−(q,2m)
either preserves or decreases exponents, even for the term m=1,
as the exponent of (1+q2−1u2) in GU,1(q,u) is
[TABLE]
since q⩾3.
Theorem 9.2 shows that each GU,b−(q,u) is absolutely convergent for ∣u∣<1.
We do not know the precise value of NU−(q,2b+1m), but we
found a lower bound for it in Lemma 4.10(iii). Hence,
rather than calculate
GU,b−(q,u) it is simpler to compute
[TABLE]
Our next result shows the important role that the coefficients of RU,b(q,u) and GU,b−(q,u) (and hence also of FU,b(q,u)) play in estimating the proportion of pairs
(t,y)∈ΔU(2k,q) with the properties (a) and (b) discussed at the beginning of this section.
Lemma 9.5**.**
Fix b>1, let k⩾ℓ⩾0 with k>0, and let akℓ:=rU,b(2k−2ℓ,q)gU,b−(2ℓ,q).
Then akℓ∣GU2k(q)∣ is equal to the number of pairs
(t,y)∈ΔU(2k,q) such that the characteristic polynomial cy(X) for y
has the form cy(X)=cy−(X)cy+(X), where:
(i)
cy−(X)* is the product of the U∗-irreducible
factors g(X)
of cy(X) which lie in the set
⋃moddD2b+1m−; so in particular each has degree with
2-part 2b+1 and satisfies ω2(g)=2b−1(q2−1)2. Furthermore, degcy−(X)=2ℓ.*
2. (ii)
cy+(X)* is a product of U∗-irreducible polynomials g(X) which are either
not of type D or have degree with 2-part dividing
2b, and satisfy ω2(g)⩽2b−2(q2−1)2.*
3. (iii)
If ℓ>0 then inv(y)* is of type
(2k−2ℓ,2ℓ).*
4. (iv)
0≪FU,b(q,u)≪GU,b−(q,u), and if fU,b(2n,q)=0 then 2b divides n.
5. (v)
[un]FU,b(q,u)∣GU2n(q)∣* is at
most the number of pairs (t,y) in ΔU(2n,q) such that each
U∗-irreducible factor g(X) of cy(X)
satisfies ω2(g)=2b−1(q2−1)2.*
Proof.
Recall that rU,b(2k−2ℓ,q)∣GU2k−2ℓ(q)∣ counts certain pairs
(t,y)∈ΔU(2k−2ℓ,q) (Definition 9.1).
By
Lemma 4.10(i)(ii), it follows from
b⩾2 that
∣y∣2⩽2b−2(q2−1)2.
By construction,
gU,b−(2ℓ,q)∣GU2ℓ(q)∣ is
the number of pairs (t,y)∈ΔU(2ℓ,q) such that each U∗-irreducible
factor of cy(X) lies in ⋃moddD2b+1m−.
Such a y satisfies ∣y∣2=2b−1(q2−1)2, and the
2-part of the degree of each U∗-irreducible factor is 2b+1.
Notice that
[TABLE]
By Lemma 6.2, to count the
pairs (t,y)∈ΔU(2k,q) with decomposition cy(X)=cy−(X)cy+(X) satisfying (i) and (ii), we can first count the number of
decompositions of V as U⊥W with U and W non-degenerate, and
dim(U)=2k−2ℓ: this is
[TABLE]
We then multiply by
the number of possible actions of t∣U and y∣U such that
all U∗-irreducible factors of y are of
type A, B or C, or of type D with 2-part of the degree at most
2b: this is exactly rU,b(2k−2ℓ)∣GU2k−2ℓ(q)∣.
Finally we multiply by gU,b−(2ℓ,q)∣GU2ℓ(q)∣ for
the number of choices of t∣W and y∣W that ensure that each
irreducible factor g(X) of cy∣W(X) lies in
D2b+1m− for some odd m.
Parts (i) and (ii) now follow immediately.
For Part (iii), notice that by Part (i), ω2(cy−(X))=2b−1(q2−1)2, whilst by Part (ii), ω2(cy+(X))⩽2b−2(q2−1)2. Hence if ℓ>0 then
inv(y) has (−1)-eigenspace of
dimension deg(cy−)=2ℓ, and inv(y) has
type (2k−2ℓ,2ℓ).
For Part (iv) it is immediate from (20) that each coefficient
fU,b(2n,q)
of FU,b(q,u) is non-negative, and from
Lemma 4.10(iii) that gU,b−(2n,q)⩾fU,b(2n,q) for all n. For the final claim, notice that if fU,b(2n,q)>0 then gU,b−(2n,q)>0, and so, as argued for Part (i)
above, there exists
(t,y)∈ΔU(2n,q) such that each U∗-irreducible
factor of cy(X) has degree divisible by 2b+1. Hence in
particular 2b+1 divides 2n, and the result follows.
Part (v) now follows from Part (iv) and the proof of Part (i).
∎
9.3. Bounding the coefficients of TU,b(q,u)−1
Recall the power series TU,b(q,u), see Definition 9.1.
We will use the bounds derived for rU(2n,q) in
Theorem 8.9, together with bounds we shall derive in
this subsection for the coefficients of
TU,b(q,u)−1, to obtain bounds for the coefficients of RU,b(q,u).
It will suffice to consider
only b⩾3.
Now
[TABLE]
where the second rearrangement is permissible in
the disc ∣u∣<1 due to Theorem 9.2.
Fix a value of b⩾3 and define d:=2b, U:=u2b and
Q:=q2b. We will now bound the coefficients tn:=[Un]TU(U) of the
power series TU(U), where
[TABLE]
However, we will need to take a somewhat indirect route to do so.
Lemma 9.6**.**
Assume that b⩾3, that is, d⩾8, and define
[TABLE]
(i)
TU(U)* and WU(U) are absolutely and uniformly
convergent in the open disc
∣U∣<1.*
2. (ii)
In this disc, 1−TU(U)=TU,b(q,u)−1.
3. (iii)
w0=0, and ∣wn∣<2d−1n−1(Q−1)−n/2
for all n⩾1.
Proof.
(i) Notice that the product in (22) converges
absolutely and uniformly
if and only if the product ∏m=1∞(1+Um/(Qm−1)))D(q,dm/2) does so too. By [genfunc, Lemma 1.3.1],
this happens if and only if ∑m=1∞D(q,dm/2)∣Um∣/(Qm−1) converges absolutely and uniformly.
By Lemma 7.7(ii),
D(q,dm/2)<(qdm−1)/2dm<Qm/2dm, so the result follows.
(iii) We follow the same strategy (but with WU(U) in
place of W(U)) as in the proof of [DPS, Lemma 4.2], to write
WU(U)=WU,1(U)+WU,2(U)
where
[TABLE]
Notice that w0=0.
In order to treat the w1,n, we use Lemma 7.7(iii) to
get
[TABLE]
where 1−2Q−m/3⩽η(q,2md)<2.2. Thus for all n⩾1,
[TABLE]
Since
D(q,dm/2)⩽(Qm−1)/2dm, we can mimic the proof of [DPS, Lemma
4.2] to deduce that
[TABLE]
Hence
∣wn∣⩽∣w1n∣+∣w2n∣<2d−1n−1(Q−1)−n/2
for all n⩾1 as required.
∎
Let WU(U) be as in Lemma 9.6, and let
E(U):=exp(−WU(U))−1=∑n=1∞enUn.
Let h(U)=∑k=1∞hkUk, say, be
the series for 1−(1−U)1/2d. Then
[TABLE]
Comparing (23) with [DPS, Equation (13)], we see that replacing
d by 2d in the discussion in [DPS], we may deduce from
[DPS, Equation (14)] that for k⩾2
[TABLE]
We use this to estimate the values of the coefficients en and tk.
Lemma 9.7**.**
Let d=2b⩾8, and let γ=(1+d−1)(Q−1)−1/2.
(i)
∣en∣⩽1+d2γn* for all n⩾1. In particular,
γ⩽0.014 and d∣e1∣<0.025.*
2. (ii)
dktk<0.5065* for
k⩾1, whenever dk⩽ed/2.*
Proof.
(i) Lemma 9.6 shows that ∣wn∣⩽2d−1(Q−1)−n/2 for all n⩾1. Let β=(Q−1)−1/2 and α=2d−1β, so that
∣wn∣⩽αβn−1 for all n⩾1, and
γ:=α/2+β=(1+d−1)(Q−1)−1/2⩽1.
Thus [DPS, Lemma 3.4] applies to −WU(U) with this α and
β,
and yields ∣en∣⩽αγn−1=1+d2γn for all n⩾1.
From qd⩾38 we see that γ⩽0.014, and
that d∣e1∣⩽1+d2dγ=2(Q−1)−1/2<0.025.
(ii) The proof is similar to that of the upper bound in [DPS, Lemma
4.4], and we only give the necessary details.
First let k=1.
From (22) we see that
t1=D(q,d/2)(qd−1)−1=0.5d−1(qd/2−1)/(qd/2+1) by Lemma 7.7(i), and so
t1⩽0.5d−1.
Suppose therefore that k⩾2.
Equations (23) and (24) show that
tk=hk−ek+∑i=1k−1ek−ihi and 0<hk<1. Thus
Part (i)
gives
[TABLE]
where
γ⩽1.125(qd−1)−1/2.
Hence
dkγ⩽1.125e4(38−1)−1/2<0.759.
Part (i) yields
(1−γ)−2<1.0295.
Hence, as in the proof of [DPS, Lemma 4.4],
[TABLE]
Since 3.577γd−1<0.0065
we have tk−hk<0.0065d−1k−1 for 2⩽k⩽ed/2d−1. It is
immediate from (24) that dkhk<0.5,
so we conclude that
dktk=dk(tk−hk)+dkhk<0.5065 for 2⩽k⩽ed/2d−1, as required.
∎
9.4. Bounding the coefficients of RU,b(q,u) and FU,b(q,u)
Recall from Definitions 8.1 and 9.1 that RU(q,u)=∑n=0∞rU(2n,q)un and RU,b(q,u)=∑n=0∞rU,b(2n,q)un. We now prove
a lower bound on the coefficients rU,b(2n,q), provided that
n is not too large.
Lemma 9.8**.**
For all b⩾1,
0≪RU(3,u)≪RU(q,u) and
0≪RU,b(3,u)≪RU,b(q,u).
Furthermore, for b⩾2,
RU,b−1(3,u)≪RU,b(3,u).
Proof.
First we claim that 0≪GU,0(3,u)≪GU,0(q,u).
Recall (17).
From Theorem 7.1 we find that
N∗(q2,1)=2 and N∼(q,1)=q+1, and so
[TABLE]
It is clear that 0≪(1+3+1u)3−2≪(1+q+1u)q−2, so consider next the rth term of the first
infinite product. Since 21N∗(q2,r)=A(q,r) counts certain polynomials
over Fq2, it is an integer, and so
it follows from Lemma 7.8(ii) and [DPS, Lemma 3.1]
(with N=21N∗(32,r), M=21N∗(q2,r), a=(qr−1)−1 and b=(3r−1)−1) that
[TABLE]
for all r>1.
Next consider the rth term of the second infinite
product.
As in the previous paragraph, from Lemma 7.8(iii) and
[DPS, Lemma 3.1]
we deduce that
[TABLE]
The claim now follows by multiplying all of these terms together.
Now we claim that 0≪GU,b(3,u)≪GU,b(q,u) for b⩾1. This follows for all m⩾1 from (18),
Lemma 7.8(i) and [DPS, Lemma 3.1]:
[TABLE]
Now we prove the lemma.
For the first two bounds on RU(3,u) and RU,b(3,u), recall that
RU(q,u)=∏b=0∞GU,b(q,u), and
RU,b(q,u)=∏k=0b−1GU,k(q,u), so the results
follow immediately from the bounds on GU,b(3,u).
The final bound follows from noting that RU,b(3,u)=RU,b−1(3,u)GU,b−1(3,u), and that GU,b−1(3,u) is a
power series with non-negative coefficients and constant term 1.
∎
Lemma 9.9**.**
Let b⩾3 and d=2b. Then rU,b(2n,q)>0.247 for all n⩽ed/2.
Proof.
The proof of this lemma is similar to that of [DPS, Lemma 4.5],
so we indicate only the relevant earlier results.
By Lemma 9.8, we may assume that q=3.
The values of rU,3(2n,3) for 1⩽n<24 may be
computed: they
are all at least 0.25.
Lemma 9.8 then shows that if b⩾3 then
rU,b(2n,3)⩾rU,3(2n,3)⩾0.25>0.247 for all n<24.
Hence, using Lemma 9.8, it suffices to show that
rU,b(2n,3)>0.247 for each consecutive b, and n in the range
3⋅2b⩽n⩽e2b−1.
Using (21) and (22), and setting k0=⌊n/d⌋⩾3,
we get
rU,b(2n,3)=rU(2n,3)−∑1⩽k⩽k0rU(2(n−kd),3)tk.
Using Theorem 8.9 in place of [DPS, Lemma 4.1], we
deduce that
rU(2n,3)>0.3433 for n⩾d;
rU(2(n−k0d),3)⩽1; and rU(2(n−kd),3)⩽0.3795 for 1⩽k⩽k0−1.
Since kdtk⩽0.5065 for all k such that dk⩽ed/2 by
Lemma 9.7,
we proceed as in the proof of [DPS, Lemma 4.5],
but with (0.3433,0.5065,0.3795) in place of (0.4346,1.02,0.4543), to deduce that
rU,b(2n,3)⩾0.3433−0.5065⋅0.3795/2>0.247.
∎
Finally, we find a lower bound for certain coefficients of FU,b(q,u).
Setting b⩾3, d:=2b⩾8, U=ud and
Q=qd,
(20) becomes
[TABLE]
Recall from Lemma 9.5(v) that
[un]FU,b(q,u)∣GU2n(q)∣ is a lower
bound on the number of pairs (t,y)∈ΔU(2n,q) such
that the 2-part of the
order of each eigenvalue of y is 2b−1(q2−1)2.
Lemma 9.10**.**
Assume b⩾3, so d=2b⩾8. Then for all k such that kd⩽ed/2
[TABLE]
The proof of this lemma is almost identical to
that of [DPS, Lemma 4.6], and so is omitted. To see why these
proofs are equivalent, notice that in [DPS] the exponent of the
mth term in the infinite product for Fb(q,u) is
⌈N(q,md)/4⌉, and
the bounds
[TABLE]
are used. Our exponent is
N(q2,md/2)/8, and Lemma 7.2(i) gives
[TABLE]
for md/2⩾5. It is not hard to find an equivalent bound when md/2=4.
Notice also that the assumption that k is odd in [DPS, Lemma
4.6] is unnecessary.
Suppose that 0⩽α<β⩽1, and let JU(2m,q;α,β) be the set of all (t,y)∈ΔU(2m,q) for which inv(y) is (α,β)-balanced. Set
[TABLE]
Definition 10.2**.**
For 0⩽α<β⩽1 and b⩾1,
let FU,b(q,u;m(1−β),m(1−α)) be the truncated power series
obtained from FU,b(q,u)=∑k=0∞fU,b(2b+1k,q)u2bk by keeping only the
terms fU,b(2b+1k,q)u2bk for which m(1−β)⩽2bk⩽m(1−α).
Lemma 10.3**.**
Fix m>0, and let 0⩽α<β⩽1. Then
[TABLE]
Proof.
If cy(X)∈ΠU(2m,q) is the characteristic polynomial for y
and cy−(X) is the polynomial as in Lemma 9.5, then
by Lemma 9.5(iii), inv(y) has (−1)-eigenspace of
dimension degcy−(X), and so inv(y) is
(α,β)-balanced if and only if 2m(1−β)⩽degcy−(X)⩽2m(1−α).
It follows from Lemma 9.5
that we may bound jU(2m,q;α,β)
by summing the coefficients of umzℓ in the power series
RU,b(q,u)FU,b(q,uz), over b>1, and over ℓ in the range
[m(1−β),m(1−α)] (and we recall that non-zero summands
in FU,b(q,uz)=∑ℓ⩾0fU,b(2ℓ,q)(uz)ℓ
occur only if 2b divides ℓ).
∎
Lemma 10.4**.**
Let a,c be real with 0<a<c. Then
[TABLE]
Proof.
The proof is similar to that of [DPS, Lemma
3.8], so we only sketch the details.
Each non-negative integer ℓ satisfies
1/ℓ⩾∫ℓℓ+1x−1dx.
Set ℓ0:=⌈a⌉ and ℓ1:=⌊c⌋. The sum in question equals
[TABLE]
From ℓo/a<1+1/a we deduce that
log(ℓ0/a)<1/a,
so the required inequality follows.
∎
Lemma 10.5**.**
Let b⩾3 and d:=2b. Then for all α and
β with 0⩽α<β<1 and positive integers m⩽ed/2,
[TABLE]
Proof.
We mimic the proof of [DPS, Lemma 5.1]. First we use Lemma 9.10 bounding fU,b(2dk,q)⩾0.2117/dk in place of their Lemma 4.6.
Next, we use Lemma 9.5(iv) to see that if
fU,b(2n,q)=0 then n=dk for some k.
We let s be the sum of the coefficients of FU,b(q,u) for
terms with degrees between
m(1−β) and
m(1−α).
We then use Lemma 10.4, Lemma 9.9 and
Lemma 10.3 to see that
jU(2m,q;α,β)⩾0.247s, so the result follows.
∎
Definition 10.6**.**
Let
[TABLE]
be the proportion of pairs in KU,s×KU,s which lie in LU(n,s,q;α,β) (as in Definition 3.3).
We define
[TABLE]
and note that ∣GUm(q)∣=qm2φU(m,q).
Lemma 10.7**.**
Let 2n/3⩾s⩾n/2⩾2, let jU(2n−2s,q;α,β) be
as in (25), and let
[TABLE]
Then
ℓU(n,s,q;α,β)=θ(n,s,q)jU(2n−2s,q;α,β),
and θ(n,s,q)>9881.
Proof.
For the main claim, we mimic the proof of [DPS, Lemma 5.3], but
modify
to count
decompositions into
non-degenerate unitary subspaces.
Let h:=2s−n, and let ΩU be the set of pairs (V1,V2) of non-degenerate subspaces of V, of dimensions h,n−h respectively, such that V1⊥=V2. Then for each (V1,V2)∈ΩU, and each
(t2,y2)∈ΔU(n−h,q) acting on V2 such that inv(y2)
is (α,β)-balanced, there is (see Lemma 2.9) a unique pair (t,t′) of involutions
in GUn(q)
such that t∣V2=t2, t∣V2′=t2y2, and t∣V1=t∣V1′=I. It follows from Definition 3.3 and [DPS, Lemma 2.2] that
(t,t′)∈LU(n,s,q;α,β).
Conversely, for each (t,t′)∈LU(n,s,q;α,β), relative to V1,V2
as in Definition 3.3, the pair (t∣V2,tt∣V2′)∈ΔU(n−h,q).
Thus by (25) and Definition 10.6, we conclude that
[TABLE]
Using the obvious expressions for ∣ΩU∣ and ∣KU,s∣, and recalling from (26) that
∣GUn(q)∣=qn2φU(n,q),
we obtain the
expression for θ(n,s,q) given in the statement.
To prove that θ(n,s,q)>81/98, we use [PS11].
For 1⩽k⩽n,1⩽r<n, define
[TABLE]
so that (noting 2s−n⩽n/3 by assumption),
θ(n,s,q)=Ω(2s−n+1,n;−q)/Δ(s,n;−q)2.
By [PS11, Lemma 3.2(b)], Δ(s,n;−q) is less than 1 if s is odd and less than 28/27 if s is even.
Since s<n, it follows from [PS11, Lemma 3.2(a)] that
Ω(2s−n+1,n;−q) is greater than 1 if n is even and greater than 1−q−2s+n−1⩾8/9
if n is odd. Hence θ(n,s,q)>(2827)2(98).
∎
We shall prove this theorem first for uniformly distributed random
elements of
GUn(q), then generalise
to nearly uniformly distributed elements.
Let t be a strong involution in GUn(q). Then t is
(1/3,2/3)-balanced and so is of type (s,n−s) with n/3⩽s⩽2n/3. We
claim that it is enough to consider the case where s⩾n/2. Indeed, if
s<n/2, then −t is a strong involution in GUn(q) of type (n−s,s) with n−s>n/2, and
since (−t)(−tg)=ttg for all g∈GUn(q) the value of z(g):=inv(ttg) is
unchanged. Thus by replacing t by −t where necessary, we assume for the
rest of this proof that n/2⩽s⩽2n/3.
(i) Let KU,s be the conjugacy class of t in
GUn(q), that is, the set of involutions of type (s,n−s), and let π+
be the probability that, for a random g∈GUn(q), the restriction of
inv(ttg) to E+(t) is (1/3,2/3)-balanced. Now π+ is independent
of the choice of t in KU,s. A straightforward counting argument shows that
π+ is equal to the proportion of (t,t′)∈KU,s×KU,s such that the restriction of
inv(tt′) to E+(t) is (1/3,2/3)-balanced.
If we choose α and β as in Lemma 3.5,
we see from Lemma 3.5(ii) that
the restriction of
inv(tt′) to E+(t) is (1/3,2/3)-balanced
whenever (t,t′)∈LU(n,s,q;α,β). It is immediate from Definition 10.6 that
π+⩾ℓU(n,s,q;α,β).
We now find κ and n0 such that
ℓU(n,s,q;α,β)⩾κ/logn for
all n⩾n0. Suppose that n>e4,
or equivalently, that n>54.
Then there exists a unique b⩾4 such that 2b−2<logn⩽2b−1,
or equivalently, setting d:=2b, n satisfies ed/4<n⩽ed/2.
Thus the conditions of Lemma 10.5 hold with m=n−s<ed/2,
and hence
[TABLE]
Using the definitions of α and β from Lemma 3.5,
we first deduce that
[TABLE]
so that 1/((n−s)(1−β))⩽6/n. We also see that
[TABLE]
which implies that log((1−α)/(1−β))⩾log3/2>0.4054. Substituting into (27) we get
[TABLE]
so let ζ1(n,d)=0.05228(0.4054/d−6/n).
Elementary calculus shows that ζ1(n,d)logn increases with n, for fixed
d>0 and n⩾3. First consider b=4 (so 54=⌊e4⌋<n⩽2980=⌊e8⌋). Since ζ1(250,16)log250>0.0003, we have
ζ1(n,16)logn>0.0003 for all n⩾250.
Conversely, when
b⩾5, d:=2b and ed/4<n⩽ed/2,
[TABLE]
Thus
[TABLE]
in this
case. Hence jU(2(n−s),q;α,β)>0.0003/(logn) holds for all
n⩾250. Finally, applying Lemma 10.7, for all n⩾150
[TABLE]
This proves (i) with n0=150 and κ=0.0002, for uniformly distributed random elements.
The proof of Part (ii) is similar. We take α=1/3 and
β=2/3 since Lemma 3.5 (ii) shows that z∣V2 is of type
(2k+,2k−) and z∣E−(t) is of type (k+,k−) so the former is
strong exactly when the latter is. We make a similar
estimate using Lemma 10.5 for
jU(2(n−s),q;1/3,2/3) (noting that now 1/((n−s)(1−β))=3/(n−s)⩽9/n). This
shows that, for all n⩾250, and d chosen as the
power of 2 such that ed/4<n⩽ed/2
[TABLE]
We calculate that ζ2(250,16)log250>0.00211 and hence
ζ2(n,16)logn>0.00211 for n⩾250. Furthermore an argument
similar to the one above shows that if b⩾5 and ed/4⩽n⩽ed/2 then
[TABLE]
Hence for all n⩾250, we get
jU(2(n−s),q;1/3,2/3)>0.00211/logn
and so
[TABLE]
This proves (ii) with n0=250 and κ=0.0017, and thus completes the proof of Theorem 1 with
n0=250 and κ=0.0002, for uniformly distributed random
elements.
For nearly uniformly distributed random elements g of G,
let π+ be the probability that
the restriction of inv(ttg) to E+(t) is (1/3,2/3)-balanced. It follows from Definition 1.2 that π+>ℓU(n,s,q;α,β)/2. The rest of the proof
follows as before, but the final value of κ is halved. The
argument for π− is similar.
∎
Before proving Theorem 2, we give a lemma which
reduces the problem to proving the result for uniform distributions.
Lemma 11.1**.**
Let X be a nearly uniform random variable on a finite group G. Let
Y be the results of three independent trials. Then
P(g∈Y)⩾1/∣G∣ for all g∈G.
Proof.
The result is trivially true if ∣G∣=1. Suppose now that ∣G∣⩾2.
By definition of nearly uniform,
P(X=g)>ρ where ρ=1/(2∣G∣). Then
[TABLE]
However, 0<ρ<(3−5)/2 as ∣G∣⩾2, so
1−3ρ+ρ2>0 and P(g∈Y)>2ρ=1/∣G∣.
∎
Definition 11.2**.**
(See [PS11]).
Let H be a group, and let H=(C1,…,Cc) be a
sequence of conjugacy classes of H. A c-tuple (h1,…,hc) is a class-random sequence from H if hi is
a uniformly distributed random element of Ci for all i, and the
hi are independent.
By Lemma 11.1, it suffices to prove the theorem for
uniform random elements. We first consider G=GUn(q), and address GLn(q) at the end.
Let Vε=Eε(t) for ε∈{+,−}.
We construct involutions inv(ttg) which have determinant 1 and hence lie in
SUn(q). However their restrictions inv(ttg)∣Vε are guaranteed to
lie only in the subgroup SU(Vε).2 of GU(Vε) consisting of
elements with determinant ±1.
We shall now choose an n1, as in the statement of the theorem, and then
show that the
result holds for all n⩾n1. Let κ and n0 be as in Theorem 1.
In [PS11, Theorem 1.1] it is shown that there exist constants c and n2 such that
for ℓ⩾n2 and for every sequence H of c conjugacy classes
of strong involutions of SUℓ(q).2, a class-random sequence from
H generates a group containing SUℓ(q) with probability at least 1−q−ℓ.
We let n1=max{3n2,n0}.
By Theorem 1, since n⩾n1⩾n0, the
probability that a sequence of N=⌈κ−1logn⌉ random elements g do not produce at least one
strong involution inv(ttg)∣V+ and at least one strong involution inv(ttg)∣V− is at most
[TABLE]
Let m∈Z. Then the
probability that mN random elements g do not produce
at least one strong involution inv(ttg)∣V+ and at least one strong involution
inv(ttg)∣V− is at most e−m⩽(3/8)m. This can be
made as small as required, by choosing m sufficiently
large. Furthermore, each such strong involution
inv(ttg)∣Vε is class-random in SU(Vε).2.
We now define the sequence A and constant λ from the
statement of the theorem. The sequence A will be thought of as the concatenation of three disjoint
subsequences, A+, A− and B, and will have total length ⌈λlogn⌉.
The constant λ>0 is chosen such that, with (combined) probability at least 0.9,
all of the following three independent events occur: (i) the subsequence A+
contains at least c elements
g such that inv(ttg)∣V+ is a
strong involution; (ii) the subsequence A− contains at
least c elements g
such that inv(ttg)∣V− is a strong involution; (iii) the
subsequence B contains at least one
g∈G such that z=inv(ttg) is an additional strong involution on
V+. Assume now that all three of these events occur.
Let s=dim(V+), so that dim(V−)=n−s.
Let K1=⟨inv(ttg)∣g∈A+⟩, and K2=⟨inv(ttg)∣g∈A−⟩. Set K=⟨K1,K2⟩ and H=⟨inv(ttg)∣g∈A⟩, so that
[TABLE]
where (SUs(q)×SUn−s(q)).2=SUn(q)∩(SUs(q).2×SUn−s(q).2).
Since t is a strong involution in GUn(q), and n⩾n1⩾3n2,
both dim(V+)=s⩾n/3⩾n2
and dim(V−)=n−s⩾n/3⩾n2.
It therefore
follows from [PS11, Theorem 1.1]
that P(K1∣V+\mboxcontainsSU(V+))⩾1−q−s,
and independently
P(K2∣V−\mboxcontainsSU(V−))⩾1−q−(n−s).
Hence the probability that both K∣V+⩾SU(V+) and K∣V−⩾SU(V−) is at least
(1−q−s)(1−q−(n−s)), and since this expression is
increasing as s goes from n/3 to n/2, this probability is at least
1−q−n/3−q−2n/3+q−n. Suppose then that both K∣V+⩾SU(V+) and K∣V−⩾SU(V−).
If s=n/2 then every subdirect subgroup of SUs(q)×SUn−s(q) is the full direct product, and therefore K, and hence also H, contains SUs(q)×SUn−s(q). Suppose now that s=n/2. We show that, with high probability, in this case also
H contains
SUn/2(q)×SUn/2(q). Suppose that K does not contain
SUn/2(q)×SUn/2(q). Then K≅K∣Vε≅SUn/2(q) or SUn/2(q).2, and K is a diagonal subgroup of K∣V+×K∣V−, with
isomorphism ϕ:K∣V+→K∣V−.
Recall the element z defined by the final subsequence B of A. Let z+=z∣V+ and
z−=z∣V−, so that z+ is a strong involution on V+,
with 1-eigenspace of dimension a and (−1)-eigenspace of dimension b, where
(1/3)(n/2)⩽a⩽(2/3)(n/2) and a+b=n/2. If H is also
a diagonal subgroup of
H∣V+×H∣V− then ϕ naturally extends to H∣V+,
and
ϕ(z+)=z−. Hence z− acting on V− also has
(±1)-eigenspaces of dimensions a,b, respectively.
As we noted in the Introduction, z is a uniformly distributed random element of its conjugacy class C in CG(t)=CGUn(q)(t),
and the members of C are elements z′ such that z′∣V+,
z′∣V− are GUn/2(q)-conjugate to z+,z− respectively. In particular, for a given z+=z∣V+, each element of the GUn/2(q)-conjugacy class of
z− would occur as z∣V− with equal probability (which we show is very small).
Using [PS11, Table 4], the GUn/2(q)-conjugacy class of z− has size
[TABLE]
Hence P(z∣V−=ϕ(z+))<(16/9)q−n2/9.
Drawing everything together, P(H contains SUn/2(q)×SUn/2(q)) is greater than
[TABLE]
where we increase n1 if necessary so that the final inequality holds.
For GLn(q), [DPS, Theorem 1.1] states a similar result to
our Theorem 1 for uniformly distributed random
elements. An argument identical to the final paragraph of our proof of
Theorem 1 upgrades [DPS, Theorem 1.1] to nearly
uniformly random elements, and then the remainder of the proof is
identical, but with linear groups in place of unitary groups.
∎
Proof of Theorem 3.
By [LNP, Theorem 1.1], there exists an absolute constant c such that
P(g powers to a strong involution)⩾c/logn, for g
a uniformly distributed random element of G. So there exists a
constant δ1 such that δ1logn independent uniform
random elements suffice to produce such a strong involution
t with probability at least
0.89/0.9. We first run this random process to produce such a t.
For n⩾n1, we now apply Theorem 2, with this
known strong involution t, to see that a further λlogn random
elements of G will suffice to produce generators for a subgroup of
CG(t) that contains the last term, CG(t)∞, in the derived
series of CG(t). This
step succeeds with probability at least 0.9(1−q−n/3−q−2n/3). Thus we set μ1=δ1+λ, to get
that the overall probability of success
in this case is at least
(0.89/0.9)⋅0.9(1−q−n/3−q−2n/3).
Assume instead therefore that n<n1. By [ParkerWilson, Theorem 2],
there is a positive constant a such that if t1 is any
involution in G, then the proportion of ordered pairs (t1,t1g) such that t1t1g has odd order is bounded below by
an−1. We set t1 to be our known strong involution t. If
ttg has odd order 2k+1, then g[t,g]k is a uniformly
distributed random element of CG(t) (see [Bray00, Theorem 3.1]). Since the probability that two random
elements of S=SLm(q) or SUm(q) generate S is greater than 1/2
(see [MQRD, Theorem 1.1]), reasoning as in the case n⩾n1,
there is a constant δ2 such that if A is a sequence of
δ2logn
uniformly distributed random
elements g∈G then the probability that ⟨R(g,t)∣g∈A⟩ contains
CG(t)∞ is
greater than 0.9(1−q−n/3−q2n/3). We therefore may set μ2=δ1+δ2 to get that the overall probability of success
in this case is at least
0.89(1−q−n/3−q2n/3).
Finally, we set μ=max{μ1,μ2}, and the result
follows. □
The proof of the following lemma is similar to that of
[gl, Lemma 4.1(b)].
We assume that the Gram matrix of the unitary form is the
identity matrix.
Recall (26). We let
φU(z)=limm→∞φU(m,z), and
define
φU(0,z)=1.
Lemma 11.3**.**
Let ΦU(m,q)=φU(m,q)4/φU(2m,q). Then
for m⩾1, ιU(2m,q) equals rU(2m,q)ΦU(m,q), and
[TABLE]
Proof.
First let n=2m be even, and let x∈CU(V) (see Definition 1.4). Then
∣CU(V)∣=∣GU2m(q)∣⋅∣GUm(q)∣−2.
Hence, by (1),
[TABLE]
Now let n=2m+1 be odd.
Then
∣CU(V)∣=∣GU2m+1(q)∣/(∣GUm(q)∣⋅∣GUm+1(q)∣).
Let (x,x′)∈IU(V), as in (1), and y=xx′.
By [gl, Lemma 3.1(b)], gcd(cy(X),X2−1)=X−1, and x and x′ both negate the 1-dimensional fixed point
space V+ of y.
The element y, and hence also the pair (x,x′), determine a
decomposition of V as in (9), which we can write as
V=V0⊥V±,
where V0 is the sum of the Vf for f of Type A, B, C and D. We
define x0:=x∣V0 and y0=y∣V0, and note that
since V0 is non-degenerate, x0,y0∈GU(V0) and so in
particular (x0,y0)∈ΔU(V0).
Conversely, the decomposition V=V0⊥V±, together with
the pair (x0,y0), uniquely determines (x,y) and hence also
(x,x′), because (i) x negates V±, so x=−IV±⊕x0; and (ii) y fixes V±, so y=IV±⊕y0.
Thus ∣IU(V)∣ is equal to ∣ΔU(V0)∣=∣ΔU(2m,q)∣ times the number of
decompositions of V as an orthogonal direct sum of a non-degenerate 2m-space
and a non-degenerate 1-space. The orbit-stabiliser theorem then yields
[TABLE]
Theorem 8.3 showed that rU(∞,q):=limm→∞rU(2m,q) exists.
Corollary 11.4**.**
The limits as m→∞ of
ιU(2m,q) and ιU(2m+1,q) satisfy
[TABLE]
Proof of Theorem 5.
By Lemma 9.8, rU(2m,q)⩾rU(2m,3).
Hence by Theorem 8.9, rU(2m,q)⩾0.3433 for m⩾2, whilst rU(2,q)⩾0.25.
We first claim that for m⩾1,
[TABLE]
To see this, first note that
[TABLE]
Similarly, for m=2,
[TABLE]
since (1+q−1)2>1+q−2 and (1−q−2)2>1−q−1+q−2 for q⩾3.
So assume that m⩾3. If m is odd then
an easy calculation shows that
[TABLE]
Thus it is sufficient to prove that ΦU(m,q)⩾ΦU(m−2,q) for even m⩾4: from this we shall conclude that,
for m⩾2, ΦU(m,q)⩾ΦU(2,q)>1.
For m⩾4 even,
[TABLE]
The largest of the four terms in the denominator is 1+q−2m+3<(1+q−m+1)(1−q−m). Thus ΦU(m,q)>ΦU(m−2,q), and the claim is proved.
Hence by Lemma 11.3
we find that ιU(2m,q)>rU(2m,q)⩾0.3433 for m⩾2, whilst ι(2,q)>rU(2,q)⩾0.25. This concludes the arguments for even dimension.
Let
[TABLE]
Then δ(1,q)>1−q−1−q−2, and
δ(1,3)=4/7. For q⩾5 our bound shows
that δ(1,q)>19/25>4/7, so δ(1,q)>4/7 for all q. If m⩾2 then performing the division
shows that δ(m,q)>1−q−1+q−2−q−3⩾20/27.
The result for ι(2m+1,q) follows from
Lemma 11.3 and our bounds for ι(2m,q). □
Bibliography17
The reference list from the paper itself. Each links out to its DOI / PubMed record.