Let be a finite group. Let be the lattice of normal subgroups ordered by inclusion, regarded as an abstract lattice. Define . The \emph{LatAut tower} is the sequence defined by , . Let be a \emph{tower group} if with finitely many . We establish the following for tower groups. \emph{Product Formula.} , where . \emph{Termination Theorem.} For every tower group , we prove that , and that this bound is sharp. The proof applies Goursat’s lemma to classify into three families parameterised by admissible triples as sub-products, sign-parity elements, and mixed elements, and uses the Krull–Schmidt theorem to identify the direct factors as precisely the nontrivial indecomposable complemented elements of (the complemented elements being exactly the full sub-products). These results do not extend to groups outside the tower-group family.

生成讲解博客的中文版本

生成AI智能校验的中文版本