Home Ultraproducts of quasirandom groups with small cosocles
Article Publicly Available

Ultraproducts of quasirandom groups with small cosocles

  • Yilong Yang EMAIL logo
Published/Copyright: March 31, 2016

Abstract

A D-quasirandom group is a group without any non-trivial unitary representation of dimension less than D. Given a sequence of groups with increasing quasirandomness, it is natural to ask if the ultraproduct will end up with no finite dimensional unitary representation at all. This is not true in general, but we answer this question in the affirmative when the groups in question have uniform small cosocles, i.e., their quotients by small kernels are direct products of finite simple groups.

Two applications of our results are given, one in triangle patterns inside quasirandom groups and one in self-bohrifying groups. Our main tools are some variations of the covering number for groups, different kinds of length functions on groups, and the classification of finite simple groups.

1 Introduction

As an indirect consequence of Kassabov, Lubotzky and Nikolov’s paper [12], the following theorem about non-abelian finite simple groups is true.

Theorem 1

An ultraproduct of non-abelian finite simple groups is either finite simple, or has no finite-dimensional unitary representation other than the trivial one.

Definitions related to ultraproducts are presented in Section 2 for those unfamiliar with them.

In this paper, we shall show that non-abelian finite simple groups are not the only kind of groups exhibiting such behavior. It turns out that such behavior has a very close link to the notion of quasirandom groups, defined by Gowers [7], and the notion of minimally almost periodic groups, defined by von Neumann and Wigner [13]. All representations considered in this paper are over . We shall informally say that a group is quasirandom when the group is D-quasirandom for some large D.

Definition 2

For a positive integer D, a group G is D-quasirandom if it has no non-trivial unitary representation of dimension less than D.

Definition 3

An infinite group is minimally almost periodic if it has no non-trivial finite dimensional unitary representation.

A group is minimally almost periodic iff it is D-quasirandom for all D. Then it is natural to wonder whether some sort of limit of increasingly quasirandom groups would give us a minimally almost periodic group. One such limit to consider is the ultraproduct.

We will prove the existence of classes of groups with similar results to Theorem 1. The main theorem is the following Theorem 5.

Definition 4

For a group G, we define its cosocleCos(G) to be the intersection of all maximal normal subgroups of G.

Let n be any positive integer. Let 𝒞n be the class of groups that are arbitrary direct products (not necessarily finite) of finite quasisimple groups and finite groups G whose cosocles contain at most n conjugacy classes of G.

Theorem 5

For any sequence of groups in Cn with quasirandom degree going to infinity, their non-principal ultraproducts will be minimally almost periodic.

Quasirandom groups were first introduced by Gowers to find groups with no large product-free subset. They can be seen as stronger versions of perfect groups.

Example 6

Example 6 (Gowers [7])

  1. A group (not necessarily finite) is 2-quasirandom iff it is perfect. The reason is that a non-perfect group has a non-trivial abelian quotient, which in turn has a non-trivial homomorphism into U1(). A perfect group, on the other hand, can only have the trivial homomorphism into the abelian group U1().

  2. A finite perfect group with no normal subgroup of index less than n is at least logn/2-quasirandom. In fact, using a form of Jordan’s theorem [6], a finite perfect group with no normal subgroup of index less than n is at least clogn-quasirandom for some constant c.

  3. In particular, a non-abelian finite simple group G is at least clogn-quasirandom if it has n elements.

  4. Conversely, any D-quasirandom group must have more than (D-1)2 elements.

  5. The alternating group An is (n-1)-quasirandom for n>5, and the special linear group SL2(Fp) is p-12-quasirandom for any prime p.

Morally, ultraproducts preserve all local properties at the scale of elements. In particular, all element-wise identities are preserved. But global properties of a group, like being finite or finitely generated, might be lost after taking ultraproducts. So one may wonder if a non-principal ultraproduct of increasingly quasirandom groups is always minimally almost periodic. In other words, we want to investigate if quasirandomness can be captured by element-wise properties. This turns out to be false. In particular, we have the following counterexample, pointed out by László Pyber.

Example 7

We recall that a group G (not necessarily finite) is 2-quasirandom iff G is perfect. We claim that there is a sequence of Di-quasirandom groups (Gi)i+ with limiDi=, whose ultraproduct by any non-principal ultrafilter is not even perfect.

Using the construction of Holt and Plesken [11, Lemma 2.1.10], one may construct a finite perfect group Gp,n for each prime p5 and positive integer n, such that an element of Gp,n cannot be written as a product of less than n commutators, and that the only simple quotient of Gp,n is PSL2(𝔽p), the projective special linear group of 2×2 matrices over the field of p elements. Then by Example 6 (ii), for any D, Gp,n is D-quasirandom for large enough p.

Let Gi be Gpi,i, where (pi)i+ is a strictly increasing sequence of primes. Then Gi is Di-quasirandom for some Di with limiDi=. Let giGi be an element which cannot be written as a product of less than i commutators. Then g=(gi)i corresponds to an element of the ultraproduct G=iωGi by any ultrafilter ω. When ω is non-principal, clearly g cannot be written as a product of finite number of commutators in G. So g is not in the commutator subgroup of G, and thus G is not perfect.

However, a recent paper by Bergelson and Tao [3] proved the following theorem, which sheds some new light on this inquiry:

Theorem 8

Theorem 8 ([3, Theorem 49 (i)])

The ultraproduct iωSL2(Fpi) by a non-principal ultrafilter ω is minimally almost periodic.

Inspired by this, we make the following definitions:

Definition 9

A class of groups is a q.u.p. (quasirandom ultraproduct property) class if for any sequence of groups in with quasirandom degree going to infinity, their non-principal ultraproducts will be minimally almost periodic.

Definition 10

A class of groups is a Q.U.P. class if there is an unbounded non-decreasing function f:++ such that any ultraproduct of any sequence of D-quasirandom groups in is f(D)-quasirandom.

Remark 11

A Q.U.P class is automatically a q.u.p. class. It is like an effective version of q.u.p. class, where we are able to keep track of the amount of quasirandomness passed down to the ultraproduct.

In this paper, the proof of Theorem 5 in fact shows that the class 𝒞n is a Q.U.P. class. And we immediately have the following corollary:

Corollary 12

The following classes are Q.U.P.

  1. The class 𝒞QS of finite quasisimple groups.

  2. The class 𝒞SS of finite semisimple groups.

  3. The class 𝒞CS(n) of finite groups with at most n conjugacy classes in their cosocles.

All Q.U.P. classes must have a uniformly bounded commutator width, i.e., every element can be written as a product of uniformly bounded number of commutators. In view of this, the following conjecture was suggested by László Pyber.

Conjecture 13

For any integer n, the class of perfect groups with commutator width n (i.e., every element of these groups can be written as a product of at most n commutators) is Q.U.P.

So far, we do not know if there is a non-Q.U.P but q.u.p. class of groups.

Some applications of our results have already been found. In a paper in preparation by Bergelson, Robertson and Zorin-Kranich [2, Theorem 1.12], it is shown that a sufficiently quasirandom group in a q.u.p. class will have many “triangles”. As another application, one may also use our method to find many examples of self-bohrifying groups. Both applications will be explained in Section 8 of this paper.

Here we shall briefly outline the sections of this article:

  1. A model case of the alternating groups to illustrate the general idea (Section 3).

  2. A group with a nice covering property is very quasirandom (Section 4).

  3. Covering properties can ignore small cosocles (Section 5).

  4. Quasirandom finite quasisimple groups have nice covering properties (Section 6).

  5. Proof of Theorem 5 (Section 7).

  6. Applications of our results (Section 8).

2 Definitions relating to ultraproducts

Definition 2.1

A filter on is a collection ω of subsets of such that:

  1. ω,

  2. if Xω and XY, then Yω,

  3. if X,Yω, then XYω.

An ultrafilter is a filter that is maximal with respect to the containment order. A non-principal ultrafilter is an ultrafilter that contains no finite subset of .

Definition 2.2

Given a sequence of groups (Gi)i, let G be their direct product. Given an ultrafilter ω on , let

N:={g=(gi)iG:{i:gi=e}ω},

which is clearly a normal subgroup of G. Then we call G/N the ultraproduct of the groups (Gi)i by ω, denoted by iωGi.

Remark 14

An ultrafilter ω is principal (i.e., not non-principal) iff we can find an element n such that for all subsets A, we have Aω iff nA. In this case, the corresponding ultraproduct of groups (Gi)i is isomorphic to Gi. Therefore, in practice, the useful ultrafilters are usually non-principal.

The particular choice of ultrafilter is not that important. As long as we fix a non-principal ultrafilter, then all the discussion in the rest of the paper will be true for the ultraproduct of this ultrafilter.

Ultraproducts have an interesting property, given by Łoś’ Theorem. Given an ultraproduct G=iωGi for an ultrafilter ω, any first-order statement ϕ in the language of groups is true for G iff it is true for most of the Gi, i.e.,

{i:ϕ is true for Gi}ω.

In particular, this implies that behaviors at the scale of elements are preserved. We shall not need Łoś’ Theorem in this paper, but it could be used as an alternative to Proposition 64.

3 The class of alternating groups

Let An denote the alternating group of rank n, and Sn the symmetry group of rank n. We shall show that the class of alternating groups is a Q.U.P. class, as a simple illustration of the general idea to attack Theorem 5.

3.1 Quasirandom alternating groups have nice covering properties

Definition 15

  1. For any subsets A,B of a group G, we define the product set

    AB={abG:aA,bB}.

    And we define An:={a1a2an:a1,,anA}.

  2. An element g of a group G is said to have covering numberK if its conjugacy class C(g) has C(g)K=G.

  3. Let m be any positive integer or . Then an element gG has the covering property (K,m) if gi has covering number K for all 1im.

  4. A group G has the covering property (K,m) if it has an element with the covering property (K,m).

Remark 16

Note that we use An to denote the set of elements that can be expressed as products of exactlyn elements of A. For example, the cyclic group of order 2 has no covering property at all. The identity is always an even power of the generator, while the generator is always an odd power of itself. There is no uniform choice of K where every element is a product of K conjugates of the generator.

Definition 17

An even permutation σAn is exceptional if its cycles in the cycle decomposition have distinct odd lengths, or equivalently, if its conjugacy class in An is different from its conjugacy class in Sn.

Lemma 18

Lemma 18 (Brenner [4, Lemma 3.05])

If an even permutation σAn is fixed-point free and non-exceptional, then An=C(σ)4.

Proposition 19

For any mZ+, An has the covering property (4,m) for large enough n.

Proof.

Pick any odd prime p>m, and pick another prime q>p.

Since p,q are necessarily coprime, for any large enough integer n, we can find positive integers a,b such that n=ap+bq. Let σSn be a permutation composed of ap-cycles and bq-cycles, where all cycles are disjoint.

Since p,q are odd, σ is an even permutation in An. Further, for large enough n, a or b can be chosen to be larger than 1, so σ will be non-exceptional. Since σ is also fixed-point free by construction, Lemma 18 implies that An=C(σ)4.

Now clearly σi will also have a cycle decomposition of ap-cycles and bq-cycles for all 1ip-1, and this implies that An=C(σi)4 for all 1ip-1. So An has the covering property (4,p-1). Since p-1m, An has the covering property (4,m). ∎

Corollary 20

For any mZ+, any D-quasirandom alternating group has the covering property (4,m) for large enough D.

3.2 Covering properties passes to ultraproducts and implies quasirandomness

Lemma 21

Let Gi be a sequence of groups such that all but finitely many of them have the covering property (K,m). Then any ultraproduct of them by a non-principal ultrafilter will have the covering property (K,m).

Proof.

Since non-principal ultraproducts ignore finitely many exceptions in the sequence Gi, without loss of generality we may assume all Gi have the covering property (K,m).

For each Gi, let gi be the element of Gi with the covering property (K,m). Then we claim that in any ultraproduct of Gi, the element represented by the sequence (gi) would have the covering property (K,m).

Pick any 1jm. Then any element of Gi is a product of conjugates of gij by ai,1,,ai,KGi. As a result, any element of the ultraproduct is a product of conjugates of (gi)j by (ai,1),,(ai,K). Here we use a sequence of elements (ai) to represent an element in the ultraproduct. ∎

We now state a special case of Proposition 27, proven in Section 4.

Lemma 22

There is a function f:Z+Z+ such that for any m,KZ+ with m>f(D)KD2, any group G (not necessarily finite) with the covering property (K,m) is D-quasirandom.

Proposition 23

The class of alternating groups is a Q.U.P. class.

Proof.

For any D+, find m>f(D)4D2 and find D such that any D-quasirandom alternating group has the covering property (4,m). Let G be an ultraproduct of D-quasirandom alternating groups. Then G will also have the covering property (4,m). Then by Lemma 22, G is D-quasirandom. ∎

4 Covering properties imply quasirandomness

This section is devoted to obtaining some element-scale properties that guarantee the quasirandomness of a group.

Definition 24

  1. An element g of a group G is said to have symmetric covering numberK if C(g)KC(g-1)K=G.

  2. Let m be a positive integer or . Then an element gG has the symmetric covering property (K,m) if gi has symmetric covering number K for all 1im.

  3. A group G has the symmetric covering property(K,m) if it has an element gG with the symmetric covering property (K,m).

  4. A group G has the (symmetric) covering property(K,m) mod N for some normal subgroup N if G/N has the (symmetric) covering property (K,m).

Definition 25

  1. A pair of elements (g1,g2) of a group G is said to have symmetric double covering number(K1,K2) if we have

    C(g1)K1C(g1-1)K1C(g2)K2C(g2-1)K2=G.
  2. Let m1,m2 be positive integers or . A pair of elements (g1,g2) in G has the symmetric double covering property [(K1,m1),(K2,m2)] if (g1i,g2j) has symmetric double covering number (K1,K2) for all 1im1,1jm2.

  3. A group G has the symmetric double covering property[(K1,m1),(K2,m2)] if it has a pair of elements (g1,g2) in G with the symmetric double covering property [(K1,m1),(K2,m2)].

  4. A group G has the symmetric double covering property[(K1,m1),(K2,m2)] mod N for some normal subgroup N if G/N has the symmetric double covering property [(K1,m1),(K2,m2)].

Remark 26

  1. Suppose K<K. Then an element with covering number K has covering number K. In general, the (symmetric) covering property (K,m) implies the (symmetric) covering property (K,m) when KK, mm. A similar statement is also true for the symmetric double covering properties.

  2. Any symmetric covering property is always weaker than the corresponding non-symmetric covering property.

  3. Any group with the symmetric covering property (K,m) has the symmetric double covering property [(1,),(K,m)]. This is easily seen by taking g1 to be the identity, and taking g2 to be the element with the symmetric covering property (K,m).

  4. In our definition of the symmetric double covering properties, since C(g1) and C(g2) are conjugate invariant subsets of G, they necessarily commute, i.e., C(g1)C(g2)=C(g2)C(g1). So the order of (K1,m1) and (K2,m2) does not matter.

  5. By imitating the definition of the symmetric double covering properties, one can in fact define the symmetric n-tuple covering properties for groups. As n grows larger and larger, the corresponding covering properties will become weaker and weaker. Note that most results throughout this paper would still hold by replacing the symmetric double covering properties by the symmetric n-tuple covering properties, though for our purpose here, the symmetric double covering properties are enough.

The proof of Proposition 27 will be the main part of this section. Let us first state the proposition and some corollaries.

Proposition 27

Proposition 27 (Local criterion for quasirandomness)

There is a function

f:++

such that, for any K1,m1,K2,m2Z+ with mi>f(D)KiD2 for i=1,2, any group G (not necessarily finite) with the symmetric double covering property [(K1,m1),(K2,m2)] is D-quasirandom.

We shall fix this function f from now on.

Corollary 28

For any K,mZ+ with m>f(D)KD2, any group G (not necessarily finite) with the symmetric double covering property (K,m) is D-quasirandom.

Corollary 29

For any K,mZ+ with m>f(D)KD2, any group G (not necessarily finite) with the covering property (K,m) is D-quasirandom.

Remark 30

We note here that a partial converse, Corollary 66, of the above result is true. That is, quasirandomness implies a nice covering property mod cosocle. The proof of this converse will be presented in Section 7.

We shall first explore some geometric structures of UD().

Definition 31

The Hilbert–Schmidt norm of an n-by-n complex matrix A is

A=Tr(A*A).
Lemma 32

The following statements hold.

  1. The Lie group UD() has a Riemannian metric d:UD()×UD() such that d(A,B)=B-A for all A,BUD(). The norm here is the Hilbert–Schmidt norm.

  2. This metric is bi-invariant in the sense that

    d(AB,AC)=d(BA,CA)=d(B,C)

    for all A,B,CUD().

  3. This metric induces a Haar measure, and the volume of UD() under this Haar measure is finite, and

    vol(UD())=(2π)D(D+1)/21!2!(D-1)!.

    We shall denote this constant by vD from now on.

  4. Under the metric d, UD() has non-negative Ricci curvature everywhere.

  5. There is a function c:++, such that a geodesic ball of radius r in UD() will have volume bounded by c(D)rD2. We shall fix this function c from now on.

Proof.

These are very standard facts. See, e.g., [14] and [5]. ∎

Definition 33

Let G be any group. A non-negative function :G is called a length function if it has the following properties:

  1. (g)=0 iff g is the identity element.

  2. is symmetric, i.e., (g)=(g-1) for all gG.

  3. is conjugate invariant, i.e., (ghg-1)=(h) for all g,hG.

  4. satisfies the triangle inequality, i.e., (gh)(g)+(h) for all g,hG.

A pseudo-length function is a non-negative function :G satisfying (ii), (iii) and (iv) above.

Lemma 34

Let G be a group, and suppose g1,g2G have symmetric double covering number (K1,K2). Let ϕ:GH be any homomorphism and let be a length function of H. Then for all gG, we have

(ϕ(g))2K1(ϕ(g1))+2K2(ϕ(g2)).

Proof.

For any gG, g can be written as the product of K1 conjugates of g1, K1 conjugates of g1-1, K2 conjugates of g2 and K2 conjugates of g2-1. So by the triangle inequality and the conjugate invariance of , we have

(ϕ(g))K1(ϕ(g1))+K1(ϕ(g1-1))+K2(ϕ(g2))+K2(ϕ(g2-1))
2K1(ϕ(g1))+2K2(ϕ(g2)).

Proposition 35

The function :UD(C)R defined by (A)=d(A,I) is a length function.

Proof.

Let A,B be any unitary matrices.

Positivity: Clearly (A)=d(A,I)0. And we have

(A)=0d(A,I)=0A=I.

Symmetry: We have

(A)=d(A,I)=d(AA-1,IA-1)=d(I,A-1)=(A-1).

Conjugate invariance: We have

(BAB-1)=d(BAB-1,I)=d(BA,B)=d(A,I)=(A).

Triangle inequality: We have

(AB)=d(AB,I)d(AB,B)+d(B,I)
=d(A,I)+d(B,I)=(A)+(B).

We shall use to denote this length function from now on.

Lemma 36

For any ϵ>0 and any integer m>vD/(c(D)ϵD2), any m points in UD(C) will have two points with distance smaller than ϵ. Here vD and c(D) are as in Lemma 32.

Proof.

This follows from a volume packing argument.

Since our metric is bi-invariant, each ball of radius ϵ2 in UD() has the same volume vol(Bϵ/2). So by our assumption on m, we have

m>vDc(D)ϵD2vol(UD())vol(Bϵ/2).

Now for any m points in UD(), suppose any two of them have distance larger than ϵ. Then the balls of radius ϵ2 centered at these m points will be disjoint and contained in UD(), which is impossible. So two of the points have distance smaller than ϵ. ∎

Lemma 37

Any non-trivial cyclic subgroup of UD(C) contains an element of length larger than 2.

Proof.

Let A be any non-trivial element of UD() of finite order. Let λ1,,λD be its eigenvalues, and, without loss of generality, say λ11. Then λ1 is a primitive n-th root of unity for some n. Replacing A by a proper power of itself, we may assume that λ1 is an n-th root of unity closest to -1. Then in particular, |λ1-1|>2.

Then we know

(A)2=Tr(A-I)*(A-I)=i=1D|λi-1|2|λ1-1|2>2.

Now suppose A has infinite order. Let λ1,,λD be its eigenvalues, and without loss of generality say λ11. Then λ1 is an element of infinite order on the unit circle. Replacing A by a proper power of itself, we may assume that λ1 is arbitrarily close to -1. Then in particular, |λ1-1|>2. Then we are done by the same computation. ∎

Proof of Proposition 27.

For any ϵ1,ϵ2>0, pick

m1>vDc(D)ϵ1D2andm2>vDc(D)ϵ2D2.

For any unitary representation ϕ:GUD() of a group G with the symmetric double covering property [(K1,m1),(K2,m2)], we may find elements g1,g2G for this symmetric double covering property.

Now consider the points I,ϕ(g1),ϕ(g12),,ϕ(g1m1). By Lemma 36, since m1>vD/(c(D)ϵ1D2), we can find two points with distance less than ϵ1. Say d(ϕ(g1s),ϕ(g1t))<ϵ1 for some 1s<tm1. Then

(ϕ(g1t-s))=d(ϕ(g1t-s),I)=d(ϕ(g1t),ϕ(g1s))<ϵ1.

So we have (ϕ(g1i))<ϵ1 for some 1im1. Similarly we have (ϕ(g2j))<ϵ2 for some 1jm2.

To sum up, there are elements g1i,g2jG with symmetric double covering number (K1,K2), and (ϕ(g1i))<ϵ1, (ϕ(g2j))<ϵ2. So by Lemma 34, all elements of ϕ(G) would have length smaller than 2K1ϵ1+2K2ϵ2.

Now pick ϵ1,ϵ2 small enough so that

2K1ϵ1+2K2ϵ22.

(Say ϵ12/(4K1) and ϵ22/(4K2).) Then all elements of ϕ(G) would have length at most 2. But by Lemma 37, this means ϕ(G) is trivial.

So, a group with the symmetric double covering property [(K1,m1),(K2,m2)] will be D-quasirandom if m1f(D)K1D2 and m2f(D)K2D2, where

f(D)=vDc(D)(22)D2.
Remark 38

Note that the above argument proves Proposition 27 for all groups, not necessarily finite. However, if one only needs to prove Proposition 27 for finite groups, and only for the covering property (K,m), then a group is D-quasirandom if mK the length ratio of the longest and the shortest closed geodesics of Un(). So one can interpret the optimal value of mK as a measure of the “shape” of the finite group. The smaller this optimal value is, the “more rounded” the finite group looks like.

5 Covering properties and the cosocle

In this section, we will show that a certain nice covering property mod cosocle is equivalent to a weaker covering property of the whole group.

Lemma 39

Let G be a group, and let N be a normal subgroup of G contained in its cosocle. Let C be a conjugate invariant symmetric subset of G such that CN=G. Then for any non-empty conjugate invariant subset SG, SC=S iff S=G.

Proof.

Suppose SC=S and SG. Then we have SCi=S for any positive integer i. So S must contain the subgroup generated by C. Since C is conjugate invariant, the subgroup generated by C is a normal subgroup, and it is a proper normal subgroup since it is contained in SG. In particular, C is contained in a maximal normal subgroup M of G.

But since N is in the cosocle, it is contained in M. So

CNMN=MG.

This is a contradiction. ∎

Proposition 40

Let G be a group with the symmetric double covering property [(K1,m1),(K2,m2)] mod N for a normal subgroup N contained in the cosocle, and suppose that N contains exactly n conjugacy classes of G. Then G has the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)].

Proof.

Find g1,g2G such that (g1N,g2N) has symmetric double covering number (K1,K2) in G/N. Let

C:=C(g1)K1C(g1-1)K1C(g2)K2C(g2-1)K2.

Then by assumption, C is mapped surjectively onto G/N through the quotient map. So CN=G.

Now N contains exactly n conjugacy classes of G. I claim that C3t contains at least t+1 conjugacy classes of G in N, which would imply that C3n-3N. Then C3n-2CN=G, finishing our proof.

We proceed by induction. As a convention we define C0 to be {e}. Then the claim is true when t=0.

Now assume the statement is true for some t<n. Then C3t contains t+1 conjugacy classes of G in N. Let them be C1,,Ct+1. Then we have

C3t+1C(i=1t+1Ci).

Suppose for contradiction that C3t+2 is disjoint from C(N-i=1t+1Ci). Then we observe that

C(N-i=1t+1Ci)CN-C(i=1t+1Ci)=G-C(i=1t+1Ci)G-C3t+1.

So C3t+2C3t+1. Then Lemma 39 implies that C3t+2=C3t+1=G. This contradicts the assumption that C3t+2 is disjoint from C(N-i=1t+1Ci).

So, C3t+2 intersects with C(N-i=1t+1Ci). Let g be an element in this intersection. Then gCCt+2 for some conjugacy class Ct+2 of G in N disjoint from C1,,Ct+1. Find hCt+2 such that gCh. Then since C is symmetric, we have hCgC3t+3. So C3t+3 intersects with Ct+2. Since C3t+3 is conjugate invariant, we conclude that C3t+3 contains Ct+2.

Finally, since eC, we see that C3t+3 also contains C1,C2,,Ct+1. So C3t+3 contains t+2 conjugacy classes of G in N. ∎

Proposition 41

Let G be a group with the symmetric covering property (K,m) mod N for a normal subgroup N contained in the cosocle, and suppose that N contains exactly n conjugacy classes of G. Then G has the symmetric covering property ((3n-2)K,m).

Proof.

Same strategy as Proposition 40. ∎

6 Quasirandom finite simple groups have nice covering properties

In this section we shall show that, for finite quasisimple groups, large quasirandomness will imply a nice covering property. We shall first deal with finite simple groups of bounded ranks in Section 6.1. Then we shall deal with the case of alternating groups in Section 6.2. Finally, we shall deal with finite simple groups of large ranks by embedding alternating groups into them in Section 6.3. The classification of finite simple groups is used in this section.

Definition 42

For a finite quasisimple group G, we define its rankr(G) as the following:

  1. When the only simple quotient of G is abelian or sporadic, then r(G)=1.

  2. When the only simple quotient of G is An, then r(G)=n.

  3. When the only simple quotient of G is a group of Lie type, then r(G) is the (twisted) rank of that finite simple group as an algebraic group.

6.1 Finite simple groups of bounded ranks

Lemma 43

Lemma 43 (Stolz and Thom [15, Proposition 3.8])

There is a function

K:++

such that, in any finite simple group of Lie type of rank r, any non-identity element will have covering number K(r).

We shall fix this function K(r) from now on.

Lemma 44

Lemma 44 (Babai, Goodman and Pyber [1, Proposition 5.4])

Let k be any positive integer. Then for any finite simple group G, if |G|kk2, then |G| has a prime divisor greater than k.

Proposition 45

Let G be a finite simple group of rank r. For any m<, G has the covering property (K(r),m) if G is D-quasirandom for large enough D.

Proof.

By choosing D to be larger than some absolute constant, a D-quasirandom group G cannot be an abelian group, a sporadic group, or an alternating group of rank r. So we only need to consider finite simple groups of Lie type.

Recall that any D-quasirandom group must have more than (D-1)2 elements. For any m+, let D be an integer >1+mm2. Then all D-quasirandom finite simple groups will have order >mm2, and thus have an element g of prime order p>m. Then gi are non-identity for all 1ip-1. Then Lemma 43 states that all these elements have covering number K(r). So G has the covering property (K(r),m). ∎

Corollary 46

Let G be a finite quasisimple group of rank r. For any m<, G has the symmetric covering property (K(r)max(3r+1,34),m) if G is D-quasirandom for large enough D.

Proof.

If a quasisimple group is D-quasirandom, then the simple group it covers is D-quasirandom. Therefore, it is enough to show that, if a finite simple group G has the covering property (K,m), then any perfect central extension G of it will have the covering property (Kmax(3r+1,34),m).

Let Z be the center of G. Then Z will be the cosocle of G, and the Schur multiplier of the simple group G would provide an upper bound for |Z|. Since G has a rank at most r, by going through the list of finite simple groups, its Schur multiplier has a size at most max(3r+1,34). So if G has the covering property (K,m), Proposition 41 implies that G has the symmetric covering property (Kmax(3r+1,34),m). ∎

6.2 Alternating groups

Proposition 47

Let G be a quasisimple group over an alternating group. Then for any m<, G has the symmetric covering property (20,m) if G is D-quasirandom for large enough D.

Proof.

If G is D-quasirandom for some large D, then the alternating group it covers must be An for some large n. Then Proposition 19 implies that An has the covering property (4,m). Now when n>7, An will have a Schur multiplier of 2. So G has the covering property (20,m). ∎

6.3 Finite simple groups of large ranks

The goal of this subsection is to prove the following proposition.

Proposition 48

There is an absolute constant K0 such that for any m<, all finite quasisimple groups of ranks r will have the symmetric covering property (K0,m) for large enough r.

By the classification of finite simple groups, a finite simple group of rank larger than some absolute constant will have to be a classical finite simple group of Lie type or an alternating group. Any classical finite simple group of Lie type is in one of the following four classes:

  1. The projective special linear groups PSLn(𝔽q). For large enough n, SLn(𝔽q) are their universal perfect central extensions.

  2. The projective symplectic groups PSpn(𝔽q). For large enough n, Spn(𝔽q) are their universal perfect central extensions.

  3. The projective special unitary groups PSUn(𝔽q). For large enough n, SUn(𝔽q) are their universal perfect central extensions.

  4. The projective Omega groups PΩ2n+(𝔽q), PΩ2n-(𝔽q), or PΩ2n+1(𝔽q). Here Ωn(𝔽q) are the commutator subgroups of the special orthogonal groups SOn(𝔽q), and

    PΩn(𝔽q)=Ωn(𝔽q)/Z(Ωn(𝔽q)).

    The plus or minus signs indicate different quadratic forms used to obtain the groups in even dimensions. For large enough n, Ωn(𝔽q) are the universal perfect central extensions of PΩn(𝔽q).

The above statements can be found in any standard textbook in classical groups (e.g., see [8]). It is enough to show Proposition 48 for SLn(𝔽q), Spn(𝔽q), SUn(𝔽q), and Ωn(𝔽q), since they are the universal perfect central extensions of the simple groups they cover, and since the order of the Schur multipliers of these groups are bounded above by a function of r.

We start by analyzing a length function for groups of Lie type over finite fields.

Definition 49

Let g be an n×n matrix over a finite field F. Let

mg:=supaF×dim(ker(a-g)).

Then the Jordan length of g is J(g):=n-mgn

Proposition 50

Let G be any subgroup of GLn(F) for some finite field F. The function J on G is a pseudo-length function.

Proof.

Non-negativity: For any gG,

mg=supaF×dim(ker(a-g))n.

So J(g)=n-mgn0.

Symmetry: For any gG, any aF×, and any vector vFn, we have

vker(a-g)av=gvg-1v=a-1vvker(a-1-g-1).

As a result,

mg=supaF×dim(ker(a-g))=supaF×dim(ker(a-1-g-1))=mg-1.

So J(g)=J(g-1).

Conjugate-invariance: For any g,hG, any aF×, and any vector vFn, we have

vker(a-g)av=gvahv=(hgh-1)hvhvker(a-hgh-1).

As a result,

mg=supaF×dim(ker(a-g))=supaF×dim(ker(a-hgh-1))=mhgh-1.

So J(g)=J(hgh-1).

Triangle inequality: For any g,hG, any a,bF×, and any vector vFn, we have

vker(a-g)ker(a-abh-1)gv=av=abh-1vvker(abh-1-g).

So we know ker(a-g)ker(a-abh-1)ker(abh-1-g). As a result, we have

mghdimker(ab-gh)
dimker(abh-1-g)
dim(ker(a-g)ker(a-abh-1))
dim(ker(a-g))+dim(ker(a-abh-1))-n
dim(ker(a-g))+dim(ker(b-h))-n.

Since this is true for all a,bF×, therefore

mg+mh-nmgh.

So J(gh)J(g)+J(h). ∎

Lemma 51

Given an n1×n1 matrix A over a finite field F, and an n2×n2 matrix B over the same finite field, then J(AB)n1n1+n2J(A)+n2n1+n2J(B).

Proof.

For any aF×, we have

ker(a-AB)=ker((a-A)(a-B))=ker(a-A)ker(a-B).

So dimker(a-AB)mA+mB. Since this is true for all aF×, therefore mABmA+mB. So we have

J(AB)=n1+n2-mABn1+n2
n1+n2-mA-mBn1+n2
n1-mAn1+n2+n2-mBn1+n2
n1n1+n2J(A)+n2n1+n2J(B).

Lemma 52

Lemma 52 (Stolz and Thom [15, Lemma 3.11])

There is an absolute constant c0 such that for any finite classical quasisimple group of Lie type G, and for any gGZ(G), where Z(G) is the center of G, then C(g)K=G for all KcJ(g).

In short, elements of large Jordan length will automatically have small covering number.

The next step is to identify subgroups of these quasisimple groups of Lie type isomorphic to the alternating groups. A key step is to treat elements in alternating groups as matrices, namely permutation matrices. These are the matrices with exactly one entry of value 1 in each column and in each row, and 0 for all other entries. Such an n×n matrix will act on the standard orthonormal basis of an n-dimensional vector space by permutation, and thus will provide an embedding of Sn into GLn(F) for any field F. Any such matrix is in An iff it has determinant 1.

Lemma 53

If P is an n×n permutation matrix where its cycle decomposition has k cycles, then we have J(P)n-kn.

Proof.

By cycle decomposition, after a change of basis in the vector space, P will be a direct sum of many cyclic permutation matrices. By Lemma 51, it is enough to prove the case when P is a single cycle of length n, and show that J(P)n-1n.

Since P is a single cycle of length n, its eigenvalues in the algebraic closure of F are precisely all the n-th roots of unity, with multiplicity 1 for each root of unity. So dimker(a-P)1 for all aF×. So J(P)n-1n. ∎

Proposition 54

There is an absolute constant K0 such that, for any m<, for any finite quasisimple group of Lie type of n×n matrices, if it contains An as permutation matrices, then it will have the covering property (K0,m) for large enough n.

Proof.

Let K0>3c0 for the absolute constant c0 in Lemma 52. Then any element A of Jordan length 13 will have covering number K0 in any finite quasisimple group of Lie type.

Pick any odd prime p>m, and pick another prime q>p. For any large enough n, we have n=ap+bq for some integers a>1, 0<b<p+1. Then find σAn made up of exactly ap-cycles and bq-cycles, where all cycles are disjoint. This element will be fixed-point free and non-exceptional, and it will have at most a+bnp+p cycles.

For any finite quasisimple group of Lie type of n×n matrices, suppose it contains An as permutation matrices. Let P be the matrix corresponding to σ. Then we have

J(P)n-np-pn=1-1p-pn>13.

The last inequality follows because p3 and n2p+q>3p.

So this element will have covering number K0 in G. It clearly has order pq, and all of its powers coprime to pq will also have the same covering number. So G has the covering property (K0,p-1). ∎

Corollary 55

For any m<, all finite special linear groups of rank r for large enough r will have the covering property (K0,m). Here K0 is the absolute constant in Proposition 54.

Proposition 56

There is an absolute constant K0, such that for any m<, we have the following:

  1. For any finite quasisimple group of Lie type of 2n×2n matrices, if it contains An as {PP:PAn is a permutation n×n matrix}, then it will have the covering property (K0,m) for large enough n.

  2. Let I1 be the 1×1 identity matrix. For any finite quasisimple group of Lie type of (2n+1)×(2n+1) matrices, if it contains An as {PPI1:PAn is a permutation n×n matrix}, then it will have the covering property (K0,m) for large enough n.

  3. Let I2 be the 2×2 identity matrix. For any finite quasisimple group of Lie type of (2n+2)×(2n+2) matrices, if it contains An as {PPI2:PAn is a permutation n×n matrix}, then it will have the covering property (K0,m) for large enough n.

Proof.

The strategy is identical to Proposition 54. Just take σσ, σσI1 or σσI2 instead of σ, and use Lemma 51. ∎

Definition 57

A vector space V is a non-degenerate formed space if it has a non-degenerate quadratic form Q (the orthogonal case), or a non-degenerate alternating bilinear form B (the symplectic case), or a non-degenerate Hermitian form B (the unitary case).

Lemma 58

Lemma 58 (Witt’s Decomposition Theorem)

Let V be any non-degenerate formed space over a finite field F. Then we have an orthogonal decomposition V=W(i=1nHi), where W is anisotropic of dimension at most 2, and Hi are hyperbolic planes.

Proof.

These are standard facts in the geometry of classical groups (see [8]). ∎

Proposition 59

For a non-degenerate formed space, the special isometry group, i.e., the group of isometries of determinant 1, contains an alternating group in one of the ways described by Proposition 56.

Proof.

Let V be any finite-dimensional non-degenerate formed space over any finite field F. Then we have an orthogonal decomposition V=WH with an anisotropic space W of dimension at most 2, and an orthogonal sum of hyperbolic planes H=i=1nHi.

Then let (vi,wi) be a hyperbolic pair generating Hi for each i. For any σAn, we can let σ act by permutation on the set {v1,,vn,w1,,wn} such that σ(vi)=vσ(i) and σ(wi)=wσ(i).

Now clearly {v1,,vn,w1,,wn} is a basis of H. So the above action of σ induces a linear transformation PP on H, where P is the n×n permutation matrix for σ. And this PP is clearly an isometry on H by construction. Now taking the direct sum of PP on H and the identity matrix on W, we shall obtain our desired embedding of An into the full isometry group.

Finally, since P is a permutation matrix for an even permutation, it has determinant 1. Therefore the above embedding of An is in the special isometry group. ∎

Corollary 60

For any m<, any finite symplectic or special unitary group of rank r has the covering property (K0,m) for large enough r. Here K0 is the absolute constant in Proposition 56.

Corollary 61

For any m<, any Ω2n+(Fq), Ω2n+1(Fq) or Ω2n-(Fq) has the covering property (K0,m) for large enough n. Here K0 is the absolute constant in Proposition 56.

Proof.

Embed An in SO2n+(q), SO2n-(q) and SO2n+1(q) in the ways described by Proposition 56. After taking the commutator subgroup, the groups Ω2n+(q), Ω2n-(q) and Ω2n+1(q) will still contain An through this embedding, because An is its own commutator subgroup. So we may apply Proposition 56 to Ω2n+(q), Ω2n-(q) and Ω2n+1(q) and obtain the desired result. ∎

Proposition 48 is proven by putting Corollary 55, Corollary 60 and Corollary 61 together.

7 Proof of Theorem 5

The results of Section 6 can be summarized into the following useful lemma.

Lemma 62

For any integer D and any constant c, we can find integers D, K1, K2, m1, m2 such that all D-quasirandom finite quasisimple groups have the symmetric double covering property [(K1,m1),(K2,m2)] such that m1>cK1D2, m2>cKD2.

Proof.

Let K1 be max(20,K0), where the absolute constant K0 is as in Proposition 48. Pick some integer m1>cK1D2. Find large enough r such that, according to Proposition 48 and Proposition 47, all finite quasisimple groups (including the alternating case) of ranks r will have the symmetric covering property (K1,m1).

Set K2:=K(r)max(3r+1,34) as in Corollary 46, and pick some integer m2>cK2D2. Then for large enough D, all D-quasirandom finite quasisimple groups will have the symmetric covering property (K2,m2).

In all cases, a D-quasirandom finite quasisimple group will have the symmetric double covering property [(K1,m1),(K2,m2)]. ∎

Remark 63

In the above proof, one cannot substitute the double covering properties with the covering properties. To have a covering property (K,m), a finite simple group must either have a large enough rank to accommodate the large m, according to Proposition 48, or it must have a small enough rank to accommodate the small K, according to Proposition 46. So there might be a gap between the “large enough rank” and the “small enough rank”, where the finite simple subgroups in the gap would fail to have the covering property (K,m), no matter how quasirandom they are.

In short, the covering properties of finite quasisimple groups are not necessarily uniform. It is uniform when obtained through increasing ranks, and it is uniform when obtained through base fields of increasing sizes. At least with the techniques in this paper, we cannot combine the two uniformities into one. So we must use the double covering properties.

Proposition 64

Let G be a group with the symmetric double covering property for some parameters, and let (Gi)iI be an arbitrary family of groups with the symmetric double covering property for some uniform parameters. Then the following are true:

  1. For any normal subgroup N, G has the symmetric double covering property for the same parameters mod N.

  2. Any quotient group of G has the symmetric double covering property for the same parameters.

  3. The group iIGi has the symmetric double covering property for the same parameters.

  4. As a result of (ii) and (iii), any ultraproduct iωGi has the symmetric double covering property for the same parameters.

Proof.

Statements (i), (ii) and (iv) are straightforward.

To see (iii), let gi,1,gi,2Gi be the pairs giving Gi the symmetric double covering property. Then we claim that (gi,1)iI,(gi,2)iIiIGi is the pair giving the desired symmetric double covering property.

For any element (gi)iIiIGi, then each gi is in Gi. And by its symmetric double covering property, we know

Gi=C(gi,1)K1C(gi,1-1)K1C(gi,2)K2C(gi,2-1)K2.

So we can find ai,j,bi,jGi for iI and 1jK1, and ci,j,di,jGi for iI and 1jK2, such that

gi=(1jK1(ai,jgi,1ai,j-1)(bi,jgi,1-1bi,j-1))×(1jK2(ci,jgi,2ci,j-1)(di,j(gi,2)-1di,j-1)).

Since the above identity is true for all iI, we have

(gi)iI=(1jK1((ai,j)iI(gi,1)iI(ai,j)iI-1)
×((bi,j)iI(gi,1)iI-1(bi,j)iI-1))
×(1jK2((ci,j)iI(gi,2)iI(ci,j)iI-1)
×((di,j)iI(gi,2)iI-1(di,j)iI-1)).

So we have proven (iii). ∎

Corollary 65

Let CQS be the class of finite quasisimple groups. Then CQS is a Q.U.P. class.

Proof.

For any integer D, and for the constant c=f(D) as in Proposition 27, we can find D,K1,K2,m1,m2 as in Lemma 62.

Let Gi be a sequence of D-quasirandom groups in 𝒞QS. Then Gi all have the symmetric double covering property [(K1,m1),(K2,m2)]. Then any ultraproduct

G=iωGi

will have the symmetric double covering property [(K1,m1),(K2,m2)] by Proposition 64. Since m1>f(D)K1D2 and m2>f(D)KD2, G is D-quasirandom by Proposition 27. ∎

Corollary 66

Corollary 66 (Quasirandomness implies a nice covering property mod cosocle)

For any integer D, and any constant c, we can find integers D,K1,K2,m1,m2 such that all finite D-quasirandom groups have the symmetric double covering property [(K1,m1),(K2,m2)] mod cosocle, with m1>cK1D2, m2>cK2D2.

Proof.

Let D,K1,K2,m1,m2 be exactly as in Lemma 62. Let G be any finite D-quasirandom group.

Let N be the cosocle of G. Then G/N is a direct product of D-quasirandom finite simple groups. These simple groups all have the symmetric double covering property [(K1,m1),(K2,m2)]. So by Proposition 64, their product G/N will have this same symmetric double covering property. ∎

Corollary 67

Let CCS(n) be the class of finite groups with at most n conjugacy classes in their cosocles. Then CCS(n) is a Q.U.P. class.

Proof.

Let c=f(D)(3n-2)D2.

For any integer D, and for the constant c, we can find D,K1,K2,m1,m2 as in Corollary 66.

Let Gi be a sequence of D-quasirandom groups in 𝒞CS(n). Then Gi all have the symmetric double covering property [(K1,m1),(K2,m2)] mod cosocles. Since the cosocles contain at most n conjugacy classes, by Proposition 40, Gi all have the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)]. Then any ultraproduct G=iωGi will have the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)] by Proposition 64.

Since m1>f(D)[(3n-2)K1]D2, m2>f(D)[(3n-2)K]D2, G is D-quasirandom by Proposition 27. ∎

Proof of Theorem 5.

For any integer D, let c=f(D)(3n-2)D2. We can find D,K1,K2,m1,m2 as in Corollary 66 and Lemma 62.

Let Gi be a sequence of D-quasirandom groups in 𝒞n. So each Gi is a direct product of D-quasirandom groups in 𝒞QS𝒞CS(n). These factor groups must have the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)]. By Proposition 64, Gi must also have this symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)]. Then any ultraproduct G=iωGi will have the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)] by Proposition 64.

Since m1>f(D)[(3n-2)K1]D2 and m2>f(D)[(3n-2)K]D2, it follows from Proposition 27 that G is D-quasirandom. ∎

8 Applications

8.1 Triangles in a quasirandom group

A quasirandom group usually contains many patterns. For example, Gowers has shown the following result:

Theorem 68

Theorem 68 (Gowers [7, Theorem 5.1])

Pick any ϵ1,ϵ2>0,0<α<1. If G is a D-quasirandom group for some large enough D, then for any subset A of G such that |A|α|G|, there are more than (1-ϵ1)α2|G| elements xG such that |AxA|(1-ϵ2)α2|G|.

Morally, if we define an x-pair to be a set {y,xy} for some yG, then this theorem means that any large enough subset of a quasirandom group G will contain many x-pairs for many x.

Now given a q.u.p. class, we can obtain minimally almost periodic groups via ultraproducts of sequences of increasingly quasirandom groups. Then by applying ergodic theory on the ultraproduct, more patterns similar to that of Theorem 68 might emerge. It is proven by Bergelson, Robertson and Zorin-Kranich [2] that, for a quasirandom group G in a q.u.p class, any large enough subset of G×G will contain many x-triangle for many x.

Definition 69

Let g be an element of a group G. Then a g-triangle is the set {(x,y),(gx,y),(gx,gy)}G×G for some x,yG.

Theorem 70

Theorem 70 (Bergelson, Robertson and Zorin-Kranich [2, Theorem 1.12])

Let G be contained in a q.u.p. class. For any ϵ>0, 0<α<1, there are integers D and K such that, if G is D-quasirandom, then for any subset A of G×G with |A|α|G|2, the set TA={gG:A contains more than (α4-ϵ)|G|2 triangles} can cover G with at most K left translates of itself.

8.2 Self-bohrifying groups

The application in this section is related to topological groups. We shall treat all groups in previous sections as discrete groups.

Definition 71

A Bohr compactification of a topological group G is a continuous homomorphism b:GbG such that any continuous homomorphism from G to a compact group factors uniquely through b.

Remark 72

  1. The Bohr compactification exists for any group by the work of Holm [10]. It is obviously unique up to a unique isomorphism.

  2. Clearly, a discrete group is minimally almost periodic iff it has trivial Bohr compactification. Note that for a discrete group, any abstract homomorphism from it to another topological group is automatically continuous.

Definition 73

A topological group G is said to be self-bohrifying if its Bohr compactification bG is the same abstract group as G, but with a compact topology.

By the results and techniques of this paper, one can find many examples of self-bohrifying groups. In particular, we have the following theorem.

Theorem 74

Let n be a positive integer. Let Gi be a sequence of increasingly quasirandom groups in Cn, the class defined as in Theorem 5. Then iNGi is self-bohrifying as a discrete group.

Corollary 75

Let Gi be a sequence of non-abelian finite simple groups of increasing order. Then iNGi is self-bohrifying as a discrete group.

We will prove Theorem 74 by first showing that iGi/iGi is minimally almost periodic, and then using a lemma by Hart and Kunen [9].

Definition 76

Let Gi be a sequence of groups.

  1. Their sum is the group iGi={giGi: only finitely many coordinates of g is non-trivial}.

  2. Their reduced product is the group iGi/iGi.

Lemma 77

Lemma 77 (Hart and Kunen [9, Lemma 3.8])

Let {Gi}iN be a sequence of finite groups. Then iNGi is self-bohrifying if all but finitely many Gi are perfect groups, and iNGi/iNGi has trivial Bohr compactification, i.e., iNGi/iNGi is minimally almost periodic.

Proof of Theorem 74.

All 2-quasirandom groups are perfect. So it is enough to show that the reduced product of Gi is minimally almost periodic, i.e., it is D-quasirandom for all D.

For any integer D, let c=f(D)(3n-2)D2. We can find D,K1,K2,m1,m2 as in Corollary 66 and Lemma 62.

Let Gi be a sequence of increasingly quasirandom groups in 𝒞n. Then all but finitely many Gi will be D-quasirandom. Since we are interested in the reduced product, which is invariant under the change of finitely many coordinates, we may without loss of generality assume that all Gi are D-quasirandom.

Since Gi𝒞n, each Gi is a direct product of D-quasirandom groups in 𝒞QS𝒞CS(n). These factor groups must have the symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)]. By Proposition 64, Gi must also have this symmetric double covering property [((3n-2)K1,m1),((3n-2)K2,m2)].

Now by Proposition 64, covering properties are preserved by arbitrary products and quotients. So iGi will have this covering property, and the reduced product iGi/iGi will also have this covering property.

Since m1>c[(3n-2)K1]D2 and m2>c[(3n-2)K]D2, the reduced product is D-quasirandom by Proposition 27. So we are done by Lemma 77. ∎


Communicated by Robert M. Guralnick


Acknowledgements

I would like to thank Professor Terence Tao for introducing me to this area and for his patient guidance. I would also like to thank Professor Richard Schwartz, Professor Vitaly Bergelson, Professor Emmanuel Breuillard and Professor Nikolay Nikolov for their helpful inputs, and thank Professor László Pyber for his helpful inputs and for pointing me to a number of very useful references.

References

[1] Babai L., Goodman A. J. and Pyber L., Groups without faithful transitive permutation: Representations of small degree, J. Algebra 195 (1997), 1–29. 10.1006/jabr.1997.7042Search in Google Scholar

[2] Bergelson V., Robertson D. and Zorin-Kranich P., Triangles in Cartesian squares of quasirandom groups, preprint 2014, http://arxiv.org/abs/1410.5385. 10.1017/S0963548316000250Search in Google Scholar

[3] Bergelson V. and Tao T., Multiple recurrence in quasirandom groups, Geom. Funct. Anal. 24 (2014), no. 1, 1–48. 10.1007/s00039-014-0252-0Search in Google Scholar

[4] Brenner J. L., Covering theorems for FINASIGs. VlII: Almost all conjugacy classes in An have exponent 4, J. Aust. Math. Soc. Ser. A 25 (1978), no. 2, 210–214. 10.1017/S1446788700038799Search in Google Scholar

[5] Cheeger J. and Ebin D. G., Comparison Theorems in Riemannian Geometry, American Mathematical Society, Providence, 1975. Search in Google Scholar

[6] Collins M., On Jordan’s theorem for complex linear groups, J. Group Theory 10 (2007), no. 4, 411–423. 10.1515/JGT.2007.032Search in Google Scholar

[7] Gowers W. T., Quasirandom groups, Combin. Probab. Comput. 17 (2008), no. 3, 363–387. 10.1017/S0963548307008826Search in Google Scholar

[8] Grove L. C., Classical Groups and Geometric Algebra, American Mathematical Society, Providence, 2002. 10.1090/gsm/039Search in Google Scholar

[9] Hart J. E. and Kunen K., Bohr compactifications of non-abelian groups, Topology Proc. 26 (2002), no. 2, 593–626. Search in Google Scholar

[10] Holm P., On the Bohr compactification, Math. Ann. 156 (1964), 34–46. 10.1007/BF01359979Search in Google Scholar

[11] Holt D. and Plesken W., Perfect Groups, Clarendon Press, Oxford, 1989. Search in Google Scholar

[12] Kassabov M., Lubotzky A. and Nikolov N., Finite simple groups as expanders, Proc. Natl. Acad. Sci. USA 103 (2006), no. 16, 6116–6119. 10.1073/pnas.0510337103Search in Google Scholar PubMed PubMed Central

[13] von Neumann J. and Wigner E. P., Minimally almost periodic groups, Ann. of Math. (2) 41 (1940), no. 4, 746–750. 10.1007/978-3-662-02781-3_23Search in Google Scholar

[14] Sepanski M. R., Compact Lie Group, Springer Sci. Bus. Media 235, Springer, New York, 2007. 10.1007/978-0-387-49158-5Search in Google Scholar

[15] Stolz A. and Thom A., On the lattice of normal subgroups in ultraproducts of compact simple groups, Proc. Lond. Math. Soc. (3) 108 (2013), no. 1, 73–102. 10.1112/plms/pdt027Search in Google Scholar

Received: 2015-5-18
Revised: 2016-2-15
Published Online: 2016-3-31
Published in Print: 2016-11-1

© 2016 by De Gruyter

Downloaded on 30.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2016-0012/html
Scroll to top button