Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 6, printed pp. 42--43, physical PDF p. 4 of the retained image scan.

Statement

Let GG be a group and HH a subnormal subgroup of finite index. If

[G:H]=∏i=1rpiαi,f([G:H])=∑i=1rαi(pi−1),[G:H]=\prod_{i=1}^r p_i^{\alpha_i}, \qquad f([G:H])=\sum_{i=1}^r\alpha_i(p_i-1),

and

d(G,H)=∑j=1s([Hj:Hj−1]−1)d(G,H)=\sum_{j=1}^s([H_j:H_{j-1}]-1)

along a maximal chain H=H0◃H1◃⋯◃Hs=GH=H_0\triangleleft H_1\triangleleft\cdots\triangleleft H_s=G, then

[G:H]−1≥d(G,H)≥f([G:H])≥log⁡2[G:H].[G:H]-1\geq d(G,H)\geq f([G:H])\geq\log_2[G:H].

Proof pointer. The proof is printed with the theorem on pp. 42--43. It uses the prime factorization of the successive indices in the chain. The proof was not reconstructed or independently checked here.

Bears on. This is an input to the source's coset-partition bounds and gives qualified context for Problem 274.