A nonsoluble residually finite, locally finite group with a full prime-support Sylow basis

We construct a countable residually finite, locally finite group \(G\) containing \(\operatorname{Sym}(5)\) and Sylow subgroups \(P_2,P_3,P_5\) such that \(G=\langle P_2,P_3,P_5\rangle\) and \(\langle P_p,P_q\rangle\) is a \(\{p,q\}\)-group whenever \(p\ne q\). Thus \(G\) has a full Sylow basis in Golberg's prime-support sense, although it is not locally soluble. The construction uses finite regular wreath products. A coordinate subgroup enlarges one selected \(p\)-subgroup while preserving the prime supports and intersections of the three pair joins; an element outside the selected subgroup then produces an element of another prime order. Iteration makes the three limit subgroups maximal. The construction and its stated properties are formalised in Lean 4.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-12
DOI
https://doi.org/10.5281/zenodo.22721349
Primary Topic
Finite Group Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A nonsoluble residually finite, locally finite group with a full prime-support Sylow basis

Achyuth Jayadevan
Zenodo (CERN European Organization for Nuclear Research)
Finite Group Theory Research
preprint

A nonsoluble residually finite, locally finite group with a full prime-support Sylow basis

Achyuth Jayadevan
preprint en

Abstract

We construct a countable residually finite, locally finite group \(G\) containing \(\operatorname{Sym}(5)\) and Sylow subgroups \(P_2,P_3,P_5\) such that \(G=\langle P_2,P_3,P_5\rangle\) and \(\langle P_p,P_q\rangle\) is a \(\{p,q\}\)-group whenever \(p\ne q\). Thus \(G\) has a full Sylow basis in Golberg's prime-support sense, although it is not locally soluble. The construction uses finite regular wreath products. A coordinate subgroup enlarges one selected \(p\)-subgroup while preserving the prime supports and intersections of the three pair joins; an element outside the selected subgroup then produces an element of another prime order. Iteration makes the three limit subgroups maximal. The construction and its stated properties are formalised in Lean 4.

Zenodo (CERN European Organization for Nuclear Research)
Manipal Academy of Higher Education (IN)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.