The $D_5$ problem: where we are

The question (Kourovka notebook, Problem 20.84). Let $\Delta$ be the augmentation ideal of $\mathbb Z[G]$, $D_n(G)=G\cap(1+\Delta^n)$ the dimension subgroups and $\gamma_n(G)$ the lower central series. Always $\gamma_n\subseteq D_n$, and $D_n=\gamma_n$ for $n\le3$; for $n=4$ this fails (Rips). Is $D_5(G)\subseteq\gamma_4(G)$ for every group?

For Lie rings the answer is yes (Ionin, Mikhailov, Petrov, 2026, formalized in Lean). For groups it is open, and we have not solved it. This site shows what is proved, what is computed, and what is left.

$2$-torsion: $D_5\subseteq\gamma_4$

up to $2^{10}$

True for every finite group whose Sylow $2$-subgroup has order $\le2^{10}$, in particular for all groups of order $<2048$.

Order $2^{11}$: ranks $2$–$4$ and $\ge8$ closed, $5$–$7$ open.

$3$-torsion: $D_5=\gamma_5$

up to $3^9$

No $3$-torsion in $D_5/\gamma_5$ when the Sylow $3$-subgroup has order $\le3^9$.

On paper for all groups whose $G/\gamma_2$ has at most one invariant larger than $3$ (e.g. exponent $3$, or $C_9\times C_3^{s-1}$), of any order.

Lie rings and Lean

proved

$D_5(L)\subseteq\gamma_4(L)$ for Lie rings; the formalization audited. The group question and the reduction to $2$-groups of class $3$ are stated in Lean.

Counterexamples

0

No computed group has $D_5\ne\gamma_5$; in all of them $D_n=\gamma_n$ for every $n$. Over a hundred thousand candidates, all computations exact.

Coverage map: $2$-groups of class $3$

A cell stands for all $2$-groups of class $3$ of the given order and rank; it is closed when all of them have $D_5=1$. 33 cells are closed and 3 open. More on the coverage map page.

rank dorder23456789242⁴, d = 2: computer (Prop. 5.1)C252⁵, d = 2: computer (Prop. 5.1)C2⁵, d = 3: computer (Prop. 5.1)C262⁶, d = 2: computer (Prop. 5.1)C2⁶, d = 3: computer (Prop. 5.1)C2⁶, d = 4: computer (Prop. 5.1)C272⁷, d = 2: computer (Prop. 5.1)C2⁷, d = 3: computer (Prop. 5.1)C2⁷, d = 4: computer (Prop. 5.1)C2⁷, d = 5: computer (Prop. 5.1)C282⁸, d = 2: computer (Prop. 5.1)C2⁸, d = 3: computer (Prop. 5.1)C2⁸, d = 4: computer (Prop. 5.1)C2⁸, d = 5: computer (Prop. 5.1)C2⁸, d = 6: computer (Prop. 5.1)C292⁹, d = 2: computer (Prop. 5.1)C2⁹, d = 3: computer (Prop. 5.1)C2⁹, d = 4: computer (Prop. 5.1)C2⁹, d = 5: computer (Prop. 5.1)C2⁹, d = 6: computer (Prop. 5.1)C2⁹, d = 7: computer (Prop. 5.1)C2102¹⁰, d = 2: computer + paper (Prop. 5.3)C+P2¹⁰, d = 3: computer + paper (Prop. 5.3)C+P2¹⁰, d = 4: computer + paper (Prop. 5.3)C+P2¹⁰, d = 5: computer + paper (Prop. 5.3)C+P2¹⁰, d = 6: computer + paper (Prop. 5.3)C+P2¹⁰, d = 7: computer + paper (Prop. 5.3)C+P2¹⁰, d = 8: computer + paper (Prop. 5.3)C+P2112¹¹, d = 2: computer + paper (§5)C+P2¹¹, d = 3: computer + paper (§5)C+P2¹¹, d = 4: computer + paper (§5)C+P2¹¹, d = 5: open?2¹¹, d = 6: open?2¹¹, d = 7: open?2¹¹, d = 8: computer + paper (Prop. 5.7)C+P2¹¹, d = 9: paper (Prop. 5.7)P

C computer C+P computer + paper P paper ? open. Empty cells: no such groups.

Latest

The paper draft (of 18 October 2026): English, Russian (PDF: EN, RU); the whole story is in the timeline.