The Monster group is a completion of the Goldschmidt G3-amalgam
Abstract
We prove the claim in the title and complete Parker and Rowley's classification (J. Algebra 2001) of which sporadic simple groups are completions of the Goldschmidt G3-amalgam.
Disclosure
“th this property can be constructed by multiplying any such h by random elements of CM (W ) = CCM (z1 ) (z2 ), obtained by Bray’s method [1]. We used the LLM Claude Opus to significantly improve the Python implementation for the random search described above (e.g., by using multiprocessing); with the final code, a successful construction took about”
PDF page 1
- Classification
- Code generation, completion, or debugging
- Multiplier
- 2
- Verified
Structural counts
Pages 2 pdf
Theorems 1 source
Lemmas 0 source
Propositions 0 source
Corollaries 0 source
Definitions 0 source
Displayed equations 0 source
Bibliography entries 7 source
Appendix pages 0 estimated
Count notes
- Source counts use the expanded primary TeX file monsterG3amalgam.tex.
- Appendix pages include the first PDF page with an explicit Appendix heading through the final page.