Termination of the Lattice-Automorphism Tower for Direct Products of Symmetric Groups
Abstract
Let G be a finite group. Let N(G) be the lattice of normal subgroups ordered by inclusion, regarded as an abstract lattice. Define LatAut(G) := Aut(N(G)). The LatAut tower is the sequence defined by G0 = G, Gn+1 = LatAut(Gn). Let G be a tower group if G Πk ≥ 3 Skak with finitely many ak ≠ 0. We establish the following for tower groups. Product Formula. LatAut\!(Πk ≥ 3 Skak) Sa4 × SB, where B = Σk ≥ 3,\, k ≠ 4 ak. Termination Theorem. For every tower group G0, we prove that G3 = 1, and that this bound is sharp. The proof applies Goursat's lemma to classify N(G) into three families parameterised by admissible triples (J,P,H) as sub-products, sign-parity elements, and mixed elements, and uses the Krull--Schmidt theorem to identify the direct factors Sk(k,i) as precisely the nontrivial indecomposable complemented elements of N(G) (the complemented elements being exactly the full sub-products). These results do not extend to groups outside the tower-group family.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.