A computer-free construction of \(J_4\) (Q1306831): Difference between revisions

A finite simple group \(J\) is called of \(J_4\)-type if it contains an involution \(z\) such that \(C_J(z)\cong 2^{1+ 12}3\Aut(M_{22})\). In 1976 \textit{Z. Janko} [J. Algebra 42, 564-596 (1976; Zbl 0344.20010)] determined the order, the conjugacy classes and much of the \(p\)-local structure of a group of \(J_4\)-type. Later on it was proved by J. Conway, S. Norton, J. Thompson and D. Hunt that a group of \(J_4\)-type possesses a 1333-dimensional complex representation. Reducing this modulo 2 gives a 112-dimensional one. Using this \textit{S. Norton} [Proc. Symp. Pure Math. 37, 271-277 (1980; Zbl 0448.20018)] gave a computer construction of \(J_4\). \textit{W. Lempken} [Commun. Algebra 21, No. 12, 4311-4351 (1993; Zbl 0790.20027)] gave matrices in \(\text{GL}(1333,11)\) which generate \(J_4\). For the proof of this he used a parallel computer. In the paper under review the first computer-free existence proof for \(J_4\) is given. As a by-product also a uniqueness proof is established. The authors consider an amalgam of three \(2\)-local subgroups \(M_1=2^{11}M_{24}\), \(M_2=2^{10}L_5(2)\), \(M_3=2^{15}(\Sigma_5\times L_3(2))\), \(|M_2:M_2\cap M_1|=31\), \(|M_3:M_3\cap M_1|=5\), \(|M_3:M_3\cap M_2|=10\), \(|M_3\cap M_2:M_2\cap M_3\cap M_1|=3\). They show that such an amalgam exists in particular there is a faithful completion which can be embedded into \(\text{GL}(1333,\mathbb{C})\). Then they show that any faithful completion of such an amalgam is a group of \(J_4\)-type. This will be done by very carefully counting paths in the amalgam-graph. At the end it yields that the completion is finite and has order \(2^{21}\cdot 3^3\cdot 5\cdot 7\cdot 11^3\cdot 23\cdot 29\cdot 31\cdot 37\cdot 43\).