A residually finite, locally finite group containing S5 with a full {2,3,5}-Sylow basis
Kourovka3.12
Problem
Must a locally finite group with a full Sylow basis be locally soluble?
G locally finite,G=⟨Pp:p∈π(G)⟩⟹?G locally soluble.
Here the basis has the prime-support meaning: each Pp is a maximal p-subgroup and every finite join ⟨Pp:p∈J⟩ is a J-group. Pairwise permutability is a stronger condition and is not assumed.
The prime-support formulation
For a periodic group H, write
π(H)={p:p is prime and p∣ord(h) for some h∈H}.
A Π-group is a periodic group H with π(H)⊆Π. A Sylow p-subgroup of an arbitrary group means a subgroup maximal among its p-subgroups.
We use the definition of a Sylow Π-basis given by Golberg (2, Definition 1) and reproduced by Starostin and Eidinov (3, p. 277): a family (Pp)p∈Π of Sylow p-subgroups such that
⟨Pp:p∈J⟩ is a J-group(J⊆Π finite).(2)
Fullness means
G=⟨Pp:p∈Π⟩.
A stronger convention also requires
PpPq=PqPp,⟨Pp:p∈J⟩∈SylJ(G)(J⊆Π),
where SylJ(G) denotes the maximal J-subgroups; see Amberg and Sysak (1, p. 22). We use only (2) and maximality of the individual Pp.
Theorem 1. There is a countable residually finite, locally finite group G with a full Sylow basis (Pp)p∈{2,3,5} in the sense of (2), and an embedding
Sym(5)↪G.
In particular, G is not locally soluble.
Problem 3.12 of the Kourovka Notebook asks whether every locally finite group with a full Sylow basis is locally soluble. Theorem 1 gives a negative answer with the prime-support definition above. No assertion concerning the stronger pairwise-permutable formulation is needed in the proof.
We write A∨B=⟨A,B⟩ for subgroup joins. For finite groups R,F, use the regular wreath product
R≀F=RF⋊F,xd(z)=d(x−1z).
We identify F with its pure top subgroup and RF with the base subgroup. For r∈R and z∈F, let δz(r)∈RF have value r at z and value 1 elsewhere. Then
xδz(r)x−1=δxz(r).(7)
A finite nonsoluble seed
Put
S=Sym(5),T=⟨t⟩≅C3,F0=S≀T.
Let a=(01) and b=(01234) in S. Define
A2=δ1(⟨a⟩),A3=T,A5=δt(⟨b⟩).(9)
The notation δz(U) denotes the image of a subgroup U≤S under δz.
Proof. The ambient group has order 1203⋅3, and the three selected subgroups have orders 2,3,5. Set U=⟨a⟩ and V=⟨b⟩. Since U∩V=1 and t=1, the pair joins satisfy
In the last two lines the other supported coordinate lies in U∩V. The reverse inclusions give (10d).
Finally,
t−1δt(b)t=δ1(b),
so the selected join contains both δ1(a) and δ1(b). The adjacent transposition a and the cycle b generate S: conjugating a by powers of b gives the adjacent transpositions along the cycle. Hence the injective coordinate map δ1:S→F0 has image in the selected join. ◻
Call a finite group F together with subgroups A2,A3,A5 a configuration if it satisfies (10a)–(10d). We do not require these three subgroups to generate F. An embedding of configurations is an injective homomorphism ι:F→F′ satisfying
ι−1(Ap′)=Ap(p∈{2,3,5}).(14)
A coordinate witness of another prime order
Lemma 3. For distinct primes p,q, there is a finite {p,q}-group R, two cyclic p-subgroups C,C′≤R, and elements c∈C, c′∈C′ such that
ord(c′c−1)=q.
Proof. Take R=Cq≀Cp. Let a and b generate the top Cp and the coordinate group Cq, respectively. Set
The two coordinates are distinct. The displayed element is nonidentity and has qth power 1, so its order is q. ◻
Let L≤F and let C,C′ be as in Lemma 3. Define the coordinate subgroup
D=D(L;C,C′)=z∈F∏Dz≤RF,Dz={C,C′,z∈L,z∈/L.(18)
It is a p-group. Left multiplication by L preserves both L and its complement, so L normalizes D.
Lemma 4. For x∈F∖L, the subgroup ⟨D,x⟩≤R≀F contains an element of order q.
Proof. Since 1∈L and x∈/L, we have
δ1(c),δx(c′)∈D,δx(c)=xδ1(c)x−1∈⟨D,x⟩.
Consequently,
δx(c′c−1)∈⟨D,x⟩.
The coordinate map is injective, so this element has order q. ◻
Preserving the finite configuration
Lemma 5. Let (F;A2,A3,A5) be a configuration, let p∈{2,3,5}, and let x∈F∖Ap. There is a finite configuration (F′;A2′,A3′,A5′) and an embedding ι:F→F′ satisfying (14) such that
⟨Ap′,ι(x)⟩ contains an element of order qfor some q=p.(21)
The embedding has a homomorphic retraction F′→F.
Proof. Write {p,q,r}={2,3,5}, choosing q,r so that
x∈/Ap∨Ar.
Such a choice exists because
(Ap∨Aq)∩(Ap∨Ar)=Ap.
For this ordering put
A=Ap,B=Aq,C0=Ar,L=A∨C0.
Use Lemma 3 for p,q, and form D=D(L;C,C′) from (18). In F′=R≀F, define
A′=D⋊A,B′=B,C0′=C0,(25)
where the latter two subgroups lie in the pure top copy of F. The group A′ is a p-group, and B′,C0′ retain their original prime supports. The pair joins satisfy
Thus their prime supports are contained in {p,r}, {p,q}, and {q,r}, respectively. The ambient group F′ is a {2,3,5}-group, because it is an extension of a direct power of the {p,q}-group R by F.
Let ρ:F′→F be the top projection. The image of each pair join is the corresponding old pair join. If
Hence w∈A′. Next, (26c) shows that an element of either
(A′∨B′)∩(B′∨C0′),(A′∨C0′)∩(B′∨C0′)
lies in the pure top group. Its top coordinate belongs to B or C0, respectively, by the old intersection identities. This proves all three new intersection identities.
The pure top embedding ι satisfies (14), since an element of F has trivial base coordinate, and ρι=1F. Finally, Lemma 4 supplies an element of order q in ⟨D,ι(x)⟩≤⟨A′,ι(x)⟩. ◻
The prime-support arguments used here are closed under the required extensions. Explicitly, if f:H→K is a homomorphism, K and kerf are Π-groups, and h∈H, choose positive Π-numbers m,n with
f(h)m=1,(hm)n=1.
Then hmn=1, and mn is again a Π-number. Finite direct products are handled by multiplying the finitely many annihilating exponents.
The ascending sequence and its Sylow subgroups
Lemma 6. Every finite configuration embeds in a finite configuration such that (21) holds simultaneously for every p∈{2,3,5} and every x∈F∖Ap. The embedding satisfies (14) and has a homomorphic retraction.
Proof. List the finitely many pairs (p,x). Apply Lemma 5 successively to their images. Condition (14) preserves exclusion from the selected subgroup. An existing witness remains in the required generated subgroup under every later embedding, and its order is unchanged because the embeddings are injective. Compose the embeddings and their retractions. ◻
Starting from Lemma 2, apply Lemma 6 recursively to obtain
F0↪F1↪F2↪⋯.
Identify the stages with their images in the direct limit H. For p∈{2,3,5}, put
Pp=n≥0⋃Ap,n,G=⟨P2,P3,P5⟩≤H.(32)
Lemma 7. Each Pp is a Sylow p-subgroup of H, and hence also of G.
Proof. The chain (Ap,n)n is increasing, so Pp is a p-group. Let x∈H∖Pp. Choose n with x∈Fn. Then x∈/Ap,n, and the next batch supplies
w∈⟨Ap,n+1,x⟩,ord(w)=q=p.
Thus ⟨Pp,x⟩ is not a p-group. No p-subgroup of H properly contains Pp. ◻
Lemma 8. The groups H and G are residually finite.
Proof. Let ιn:Fn→Fn+1 and rn:Fn+1→Fn be the embedding and retraction retained by the nth batch, so
rnιn=1Fn.
Fix n. For every m, define θm:Fm→Fn by
θm=⎩⎨⎧ιn−1⋯ιm,1Fn,rn⋯rm−1,m<n,m=n,m>n.
The retraction identities give
θm+1ιm=θm(m≥0).
Thus θm induces a homomorphism ρn:H→Fn whose restriction to Fn is the identity. If 1=x∈H, choose n with x∈Fn. Then ρn(x)=x=1, and Fn is finite. Restricting the same homomorphisms to G proves the assertion for G. ◻
Proof of Theorem 1. Residual finiteness follows from Lemma 8. The group H is a countable union of finite groups. Every finitely generated subgroup of H lies in one stage, so H and G are locally finite and countable. For distinct p,q,
Pp∨Pq=n≥0⋃(Ap,n∨Aq,n),
which is a {p,q}-group by (10c). For the other subfamilies, writing PJ=⟨Pp:p∈J⟩,
P∅=1,P{p}=Pp,P{2,3,5}=G,π(G)⊆{2,3,5}.
These exhaust the subsets of {2,3,5}. Lemma 7 now gives a full basis satisfying (2).
The selected join at stage zero embeds in G, because each Ap,0 lies in Pp. Lemma 2 therefore embeds Sym(5) in G. This finite subgroup is not soluble, so G is not locally soluble. ◻
B. Amberg and Y. Sysak, Products of locally cyclic groups, Arch. Math.117 (2021), 19–28. doi:10.1007/s00013-021-01593-1.
P. A. Golberg, On a criterion for conjugacy of Sylow Π-bases of an arbitrary group, Mat. Sb. (N.S.)36(78), no. 2 (1955), 335–340 (Russian). Math-Net.Ru: sm5196.
A. I. Starostin and M. I. Eidinov, On Sylow bases of infinite groups, Sibirsk. Mat. Zh.3, no. 2 (1962), 273–279 (Russian). Math-Net.Ru: smj4814.