Problem
Must a rational linear group with finitely many automorphism orbits be virtually soluble?
G≤GLn(Q),ω(G)=∣Aut(G)\G∣<∞⟹?G virtually soluble.
The automorphisms are all abstract group automorphisms. The proof yields a torsion-free normal nilpotent subgroup with an explicit index bound.
Statement
Write ω(G) for the number of orbits of Aut(G) on G. Here Aut(G) consists of all abstract group automorphisms; no compatibility with a chosen linear representation is imposed. Kourovka Problem 21.40 asks whether a rational linear group with ω(G)<∞ is virtually soluble (1). We prove a stronger assertion with an explicit index bound. We use γ1(U)=U and γr+1(U)=[U,γr(U)].
Theorem 1. Let n≥1 and G≤GLn(Q), and put A=spanQG and d=dimQA. If ω(G)<∞, there is a normal subgroup U⊲G such that
U is torsion-free,γn(U)=1,[G:U]≤(2n+1)d≤(2n+1)n2.(1)
There is no finite-generation hypothesis. In particular, when n=1 the conclusion is U=1. The algebra A is unital: products of elements of G belong to G, and 1∈G.
Theorem 2. If G≤GLn(Q) has finite trace set T, there is a torsion-free normal subgroup U with γn(U)=1 and
[G:U]≤∣T∣dimQspanQG.(2)
Bounded-degree roots and automorphism orbits
Lemma 3. Let 0=α∈Q and D≥1. There are only finitely many algebraic numbers β such that [Q(β):Q]≤D and βm=α for some m≥1.
Proof. Let f∈Z[X] be the primitive irreducible polynomial of α, with positive leading coefficient a. Put
C=max(1,{∣α′∣:α′ is a conjugate of α}).If βm=α, its primitive irreducible polynomial h∈Z[X] divides f(Xm) in Z[X], by Gauss’s lemma. Its positive leading coefficient b therefore divides a. Every conjugate β′ satisfies (β′)m=α′ for some conjugate α′; hence ∣β′∣≤C. If r=degh≤D, the coefficient of Xr−j in h has absolute value at most
b(jr)Cj≤a(1+C)D.There are finitely many integral polynomials of degree at most D with this coefficient bound, and each has finitely many roots. ◻
Lemma 4. If G≤GLn(Q) and ω(G)<∞, every eigenvalue of every element of G is a root of unity.
Proof. Fix g∈G. Two terms of g,g2,g4,… lie in the same automorphism orbit. Thus, for some i<j and ϕ∈Aut(G),
b=g2i,q=2j−i>1,ϕ(b)=bq.Set bk=ϕ−k(b). Applying ϕ−k to the displayed identity and iterating gives bkqk=b.
Let α be an eigenvalue of b. For every k, some eigenvalue βk of bk satisfies βkqk=α; this follows by triangularizing bk over Q. Each βk has degree at most n. Lemma 3 makes the set of possible βk finite. Hence βr=βs for some r<s, and
βrqs−qr=1.Consequently α is a root of unity. An eigenvalue λ of g has λ2i among the eigenvalues of b, so λ is also a root of unity. ◻
Corollary 5. Under the hypotheses of Lemma 4,
tr(g)∈Z∩[−n,n](g∈G).
In particular, the trace set has at most 2n+1 elements.
Proof. The trace is a rational algebraic integer, because it is a sum of roots of unity. It is therefore an integer. The triangle inequality gives ∣tr(g)∣≤n. ◻
The trace radical of a matrix algebra
Let A⊆Mn(Q) be a unital subalgebra and define
J={a∈A:tr(ab)=0 for every b∈A}.(8)
Cyclicity of trace shows that J is a two-sided ideal: for a∈J and b,c∈A,
tr((ca)b)=tr(a(bc))=0,tr((ac)b)=tr(a(cb))=0.
Lemma 6. Every element of J is nilpotent, and Jn=0.
Proof. Take a∈J. The Fitting decomposition for the endomorphism a gives, for sufficiently large N,
Qn=keraN⊕imaN.The projection e onto imaN along keraN is a polynomial in a with zero constant term. Indeed, write the minimal polynomial as Xrq(X) with q(0)=0. When r>0, choose a polynomial congruent to 0 modulo Xr and to 1 modulo q by Bezout’s identity. When r=0, the invertibility of a expresses 1 as a times a polynomial in a. These formulas give the stated projection in both cases. Thus e∈J and tr(e)=0. An idempotent over Q has trace equal to its rank; hence e=0. The image of aN is zero, so a is nilpotent.
For every a∈J, the finite geometric series in a inverts 1−a in A. Consider Wr=JrQn. If JWr=Wr=0, choose a minimal finite generating family w1,…,ws for Wr as an A-module. Such a family exists since Wr is finite-dimensional over Q. The equality JWr=Wr gives
ws=a1w1+⋯+asws(ai∈J).Since 1−as is invertible, ws belongs to the A-span of the preceding generators, a contradiction. Thus Wr+1⊊Wr whenever Wr=0. Since dimQW0=n, we have JnQn=0. The given action of A is faithful, so Jn=0. ◻
Lemma 7. The group 1+J is torsion-free and satisfies γn(1+J)=1.
Proof. The inverse of 1+a is a finite geometric series, so 1+J is a group. If (1+a)m=1 with m≥1, then
0=a(j=1∑m(jm)aj−1).The expression in parentheses is m times 1 plus a nilpotent polynomial in a, and is invertible. Thus a=0.
For r,s≥1, multiplication modulo Jr+s is commutative between 1+Jr and 1+Js, giving
[1+Jr,1+Js]⊆1+Jr+s.Induction yields γr(1+J)⊆1+Jr. Apply Lemma 6 with r=n. ◻
Counting cosets by traces
Proof of Theorem 2. Use A=spanQG and its ideal J from (8), and set
U=G∩(1+J)=ker(G⟶(A/J)×).It is normal, torsion-free, and satisfies γn(U)=1 by Lemma 7. Choose a basis g1,…,gd of A from G. Define
Ψ:G⟶Td,Ψ(g)=(tr(gg1),…,tr(ggd)).For g,h∈G, linearity and the basis property give
Ψ(g)=Ψ(h) ⟺ tr((g−h)a)=0(a∈A) ⟺ g−h∈J ⟺ h−1g−1∈J ⟺ h−1g∈U.Thus the fibres of Ψ are exactly the cosets of U, and [G:U]≤∣T∣d. ◻
Proof of Theorem 1. Corollary 5 gives ∣T∣≤2n+1. Apply Theorem 2 and use d≤n2. ◻
Corollary 8. Let K be a number field of degree e and let G≤GLn(K) with ω(G)<∞. There is a torsion-free normal subgroup U with
γne(U)=1,[G:U]≤(2ne+1)(ne)2.
Proof. Restriction of scalars embeds GLn(K) into GLne(Q). Apply Theorem 1 to the resulting faithful representation of the same abstract group. ◻
References
Preprint · Lean (GitHub)
- E. I. Khukhro and V. D. Mazurov (eds.), Unsolved Problems in Group Theory: The Kourovka Notebook, Problem 21.40. arXiv:1401.0300.