REVIEW 3 major objections 3 minor 6 references
On the structure of groups defined by Kim and Manturov
T0 review · 3 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read For every $n \ge 6$, the Kim–Manturov group $\Gamma^4_n$ is a finite nilpotent 2-group whose order is exactly $2^{\binom{n}{3}}$.
desk verdict The exact-order result is very likely right and improves on Styrt, but Lemma 4.1 is asserted rather than proved and the computer proof lacks code. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The argument runs on two interlocking devices. The first is the normal-form classification in Lemma 4.1: every generator of $\Gamma^4_n$, written in its minimal dihedral form, is one of fifteen types and equals an explicit product of elements of the minimal generating set $\Lambda_n$, possibly multiplied by the central element $c$. This converts word problems into vector arithmetic. The second is a matrix representation $r(x)$ in $GL_{N_n+2}(\mathbb{Z}/2\mathbb{Z})$ of Heisenberg type, whose entries are the abelianization vector $a(x)$, a dual vector $b(x) = {}^t D a(x)$, and a scalar $e(x)$. The bilinear form $x \circ y = b(x) a(y)$ carries the commutator information: it is non-zero exactly when the two generators' index sets intersect in three elements, and the proof of the pentagon relations is reduced to twelve explicit case tables for the assignment of $e$ and $\circ$. The matrix model realizes $\Gamma^4_n$ as the central extension $(\mathbb{Z}/2\mathbb{Z}) \times_e H_1(\Gamma^4_n)$.
What would settle it
Perform the stated coset enumeration for $\Gamma^4_6$ and check whether its order is exactly $2^{20} = 1{,}048{,}576$, or check each of the fifteen identities in Lemma 4.1 inside $\Gamma^4_6$: any discrepancy in a single identity would break the normal-form classification, and with it the matrix model and Theorem 1.2.
Extended reading notes
Core claim
On its own terms, the paper's central discovery is Theorem 1.2: for any $n \ge 6$, $\Gamma^4_n$ is a finite 2-step nilpotent 2-group of order $2^{\binom{n}{3}}$, and there is a central extension $0 \to \mathbb{Z}/2\mathbb{Z} \to \Gamma^4_n \to H_1(\Gamma^4_n) \to 1$. The proof rules out the one remaining alternative, an abelian group, by constructing a matrix representation $r : \Gamma^4_n \to GL_{N_n+2}(\mathbb{Z}/2\mathbb{Z})$ that sends the commutator $c = [(1234),(1235)]$ to a nontrivial element. In this model every element has a normal form $c^{\varepsilon_0} X_1^{\varepsilon_1} \cdots X_{N_n}^{\varepsilon_{N_n}}$ with $X_i \in \Lambda_n$ and $\varepsilon_i \in \{0,1\}$, and multiplication is governed by a $\mathbb{Z}/2\mathbb{Z}$-valued bilinear form that records whether two generators share exactly three of their four indices. The paper also gives a computer-aided proof of the same theorem beginning with a coset enumeration of $\Gamma^4_6$.
Load-bearing premise
The fifteen explicit formulas of Lemma 4.1, which rewrite every generator as a product of the minimal generating set using work from an earlier paper, are quoted rather than derived; if even one of them is wrong, the matrix representation may fail to be a homomorphism and the nontriviality of the central element $c$ is not established.
Editorial extensions
If this is right
- The structure of $\Gamma^4_n$ for $n \ge 6$ is now completely known: as a set it is $c^{\varepsilon_0} X_1^{\varepsilon_1} \cdots X_{N_n}^{\varepsilon_{N_n}}$, so the word problem reduces to normal-form computation in a vector space.
- The exact order $2^{\binom{n}{3}}$ is attained because $c \ne 1$; this improves earlier bounds and shows that the second candidate, an abelian group, is impossible.
- The natural homomorphism $\Gamma^4_n \to \Gamma^4_{n+1}$ is injective for $n \ge 6$, so the groups form a stable chain whose direct limit is described by the same central-extension rule.
- Because $\Gamma^4_5$ is infinite while $\Gamma^4_6$ is finite, the map $\Gamma^4_5 \to \Gamma^4_6$ is not injective, so the structure changes sharply at $n = 6$.
- The explicit model determines the image of the homomorphism $P_n \to \Gamma^4_n$ from the pure braid group, a question the paper flags as a next step.
Reading between the lines
- The normal-form description yields an immediate practical algorithm for the word problem in $\Gamma^4_n$: every product can be computed using the bilinear form, which is linear algebra over $\mathbb{Z}/2\mathbb{Z}$, so membership and triviality are decidable in polynomial time for fixed $n$.
- The same matrix construction may apply to the signed variant $c\Gamma^4_n$ introduced in the paper; a natural test is whether coset enumeration finds $c\Gamma^4_6$ finite and what its nilpotency class is.
- The collapse of the commutator subgroup to $\mathbb{Z}/2\mathbb{Z}$ suggests that any invariant of braids or links that factors through $\Gamma^4_n$ for $n \ge 6$ carries at most one bit of non-abelian information, shifting attention to the central extension itself.
- One can test whether the central extension is stably nontrivial in the direct limit: if the limiting group's commutator pairing is nonzero, the limit is a genuine infinite 2-step nilpotent group rather than an abelian pro-2 group.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper studies the groups Γ^4_n introduced by Kim and Manturov, defined by a presentation with generators indexed by ordered quadruples and relations of involution, commutation, pentagon, and dihedral type. Continuing the authors' previous work, the paper proves that for n ≥ 6 the group Γ^4_n is finite, 2-step nilpotent, of order 2^{binom(n,3)}, and fits into a central extension 0 → Z/2Z → Γ^4_n → H_1(Γ^4_n) → 1. The proof has two main components: Section 3 reduces all commutators of generators with three common indices to a single central involution c, and Section 4 constructs an explicit matrix representation over Z/2Z to show c ≠ 1. Section 5 outlines a computer-aided alternative proof.
Significance. If the proof is completed, the theorem gives the first complete structural description of Γ^4_n for n ≥ 6, including the exact order, an explicit matrix model realizing the central extension, and consequences such as the stability and injectivity of the natural maps Γ^4_n → Γ^4_{n+1}. The result is consistent with and refines Styrt's earlier theorem, providing a smaller upper bound and an independent method. The paper is careful to acknowledge prior work and to separate human-checkable arguments from computer-assisted ones. The explicit representation and the stable normal form are potentially valuable tools for further study. However, the current manuscript contains a load-bearing gap in the proof of the normal-form classification, so the central claim is not yet fully verified in written form.
major comments (3)
- [Section 4, Lemma 4.1] The fifteen formulas expressing each type of generator in Gd_n in terms of the minimal generating set Λn and c are asserted without proof. The sentence before the lemma says they follow from 'our computation in [4, Section 2]' together with Proposition 3.1 and Lemma 3.4, but no derivation or specific location in [4] is given. These formulas are load-bearing: they are used in Lemmas 4.4–4.6 to compute the bilinear pairing X∘Y, to verify the matrix representation r on the defining relations, and ultimately to prove r(c) = (1,0) in Proposition 4.3. Without a proof of Lemma 4.1, the nontriviality of c, and hence the exact order in Theorem 1.2, is not established. The authors should supply a full proof of Lemma 4.1 or provide a complete, reproducible computation that verifies all fifteen identities.
- [Section 4, Lemmas 4.4 and 4.5] The proofs repeatedly refer to 'the underlined parts' of the formulas in Lemma 4.1, for example 'After removing them, the underlined parts remain' and 'we may just look the underlined parts'. In the typeset version available to me, no underlining is visible, so the central counting arguments in these lemmas cannot be checked. This is not merely a typesetting annoyance: the assertions that X∘X = 0 and X∘Y + Y∘X = 0 for the relevant generators depend precisely on identifying these subwords. The authors must either display the underlining or describe explicitly which subwords are meant.
- [Section 5] The computer-aided proof is described only informally. The verification of Proposition 4.3 for n = 11 is said to be a 'standard task' that takes little time, and the coset enumeration for Γ^4_6 is mentioned without giving the code, the exact presentation used, or the resulting coset table. If Section 5 is intended as an independent proof of Theorem 1.2—and in particular as a substitute for the missing proof of Lemma 4.1—it must be made reproducible: the authors should include the code or a precise algorithm description, the exact computations performed, and the output, or at least a clear statement of how to reproduce them. Without this, the computer-assisted route does not close the gap left by Lemma 4.1.
minor comments (3)
- [Section 3, Lemma 3.5] In the case |{1,2,3,4} ∩ {i,j,k,l}| = 3, the notation 'c_ijk' is used for the intersection {i,j,k}, but the reader has to infer that this is the element defined in Lemma 3.3; a brief reminder such as 'where c_xyz is as in Lemma 3.3' would improve readability.
- [Section 4, Remark 4.2] The statement that 'an element in Γ^4_n is uniquely written of the form c^{ε0}X_1^{ε1}...' is made before nontriviality of c is proven; as written it could be read as assuming part of Theorem 1.2. The authors may want to phrase this as 'can be written in this form' or clarify that uniqueness of the normal form is established only after Proposition 4.3.
- [Introduction] The claim that Γ^4_4 is the free product of three copies of Z/2Z is stated without a proof or a specific citation; since it is not used later, a reference to [4] would be helpful.
Circularity Check
No significant circularity: the proof is a direct construction from the defining presentation; reliance on the authors' prior paper supplies preliminary generating-set and abelianization facts but does not encode the target order or the nontriviality of c.
full rationale
The derivation of Theorem 1.2 is self-contained in the relevant sense: Section 3 proves, using the pentagon and commutativity relations, that all overlap-3 commutators collapse to a single central element c, with no parameter fitted to force this equality; Section 4 then constructs an explicit matrix representation and verifies the defining relations of the presentation, and the nontriviality of c follows from the verified homomorphism, not from an assumed value. The use of the authors' previous paper [4] supplies the minimal generating set and the abelianization, which are preliminary facts whose stated assumptions do not include the target result (exact order or nontriviality of the commutator subgroup); these are independent support rather than circular input. Lemma 4.1 quotes a fifteen-type normal-form classification from [4] rather than reproving it, and the promised underlined parts are not visible, which is a verifiability and completeness concern but not a circularity: the normal forms do not assume the conclusion that c is nontrivial or that the order is 2^{binom(n,3)}. The matrix representation's e-values are chosen and then checked against all relation types in Lemmas 4.4-4.6; the tables are genuine verifications, not a renaming of the desired conclusion. Section 5 provides an additional computer-assisted proof using coset enumeration, again independent of the claimed order except as an output. No equation or conclusion is equivalent to its own input by construction, and no load-bearing uniqueness theorem is imported from the authors' prior work. Therefore the paper exhibits no significant circularity.
Assumptions & free parameters
free parameters (1)
- evaluation e(X) on generator types in Section 4 =
1 for types A1, A2, A4, C2, C3; 0 for all other types
assumptions (3)
- domain assumption Minimal generating set and abelianization theorem from [4]: Γ^4_n is generated by N_n = binom(n,3)-1 elements and H1(Γ^4_n) is isomorphic to (Z/2Z)^{N_n}.
- standard math Normal form for 2-step nilpotent 2-groups, as in Sims' book.
- ad hoc to paper Lemma 4.1's fifteen-type normal form classification of G^d_n is correct.
Cite this review
Pith. "Pith review of On the structure of groups defined by Kim and Manturov." pith.science (2026). https://pith.science/paper/A2EX6T3A
@misc{pith2026250608050,
author = {Pith},
title = {Pith review of: On the structure of groups defined by Kim and Manturov},
year = {2026},
howpublished = {\url{https://pith.science/paper/A2EX6T3A}},
note = {Machine review of arXiv:2506.08050}
}
abstract
We study the structure of a series of groups $\Gamma_n^4$ defined by Kim and Manturov. We show that the groups are finite for all $n \ge 6$ and in fact they are 2-step nilpotent $2$-groups.
Reference graph
Works this paper leans on
-
[4]
Minimal generating sets of groups of Kim-Manturov
T. Sakasai, Y . Tadokoro, K. Tanaka, Minimal generating sets of groups of Kim-Manturov , to appear in the proceedings of the 14th MSJ-SI, 2024, arXiv: 2506.05778 [math.GT]
work page Pith review arXiv 2024
-
[1]
D. F. Holt, B. Eick, E. A. O’Brien, Handbook of computational group theory, Discrete Math. Appl., Chapman & Hall/CRC, 2005
work page 2005
-
[2]
S. Kim, V . O. Manturov, Artin’s braids, braids for three space, and groups Γ4 n and Gk n, J. Knot Theory Ramifications 28 (2019), no. 10, 1950063, 20 pp
work page 2019
-
[3]
V . O. Manturov, D. Fedoseev, S. Kim, I. Nikonov, Invariants and pictures—low-dimensional topology and combinatorial group theory, Series on Knots and Everything, 66. World Scientific Publishing Co., 2020
work page 2020
-
[5]
C. C. Sims, Computation with finitely presented groups, Encyclopedia Math. Appl., 48, Cambridge University Press, 1994
work page 1994
-
[6]
O. G. Styrt, Groups Γ4 n: algebraic properties, preprint, 2023arXiv: 2309.17317 [math.AG]. JUNE E. H UH CENTER FOR MATHEMATICAL CHALLENGES , K OREA INSTITUTE FOR ADVANCED STUDY, 85 H OEGI -RO, D ONGDAEMUN -GU, S EOUL 02455, R EPUBLIC OF KOREA Email address: cfnb@kias.re.kr GRADUATE SCHOOL OF MATHEMATICAL SCIENCES , THE UNIVERSITY OF TOKYO , 3-8-1 K OMABA ...
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.