REVIEW 3 major objections 6 minor 12 references
Coset geometries acting on their elements: The $j$-diagonals twisting
T0 review · 3 major / 6 minor · reviewed 2026-08-28 · deepseek-v4-flash
Pith's one-line read The $j$-diagonals twisting turns any regular hypertope into a regular hypertope, with a controlled Coxeter diagram.
desk verdict A clean new construction and a useful existence theorem, but the central claim leans on an unpublished companion result and a few small gaps need patching. 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 load-bearing object is the $j$-diagonal Coxeter graph $D = D(\beta,j,\lambda)$, built from the diagonal classes of $\beta$. A $j$-diagonal is an unordered pair of distinct $j$-elements, and two diagonals lie in the same class when the group $B$ of $\beta$ moves one pair onto the other; a label function $\lambda$ assigns each class an integer $\ge 2$ or $\infty$, and $D$ has the $j$-elements as vertices with an edge of label $\lambda([F_1,F_2])$ precisely when that label is not $2$. The action of $B$ on $X_j$ is label-preserving, so it induces an action $\eta$ of $B$ on the Coxeter group $W(D)$; because $B$ is flag-transitive, this action satisfies the orbit-intersection condition $O(M)\cap O(N)=O(M\cap N)$, which is exactly what makes $\alpha$ admissible. The twisting $T(\alpha,\beta)$ is then the coset incidence system built from the semi-direct product $W(D)\rtimes_\eta B$ with the parabolic subgroups specified by formula (2); Theorem 2.3 turns admissibility plus regularity of both factors into regularity of the twisted product. The diagram computation in Corollary 3.8 runs through the relations of this semi-direct product, showing the new generator commutes with all $b_i$ for $i\ne j$ and has combined order $2m$ with $b_j$.
What would settle it
Take $\beta$ to be a regular pentagon ($B = D_{10}$, $j=0$) and let $D$ be the edgeless Coxeter graph on the five $0$-elements, so every diagonal class has label $2$. The paper predicts a finite regular hypertope of order $2^5\cdot 10$ whose diagram is the pentagon diagram with an extra vertex joined to the $0$-node by an edge labelled $4$. Build the semi-direct product $W(D)\rtimes_\eta B$ with the parabolic subgroups of formula (2) and check whether it is flag-transitive and residually connected, and whether the new generator and $b_0$ have product of order $4$; a failure at any of these checks would falsify the central claim.
Extended reading notes
Core claim
The central claim is that the twisting construction for coset incidence systems, applied to the natural action of a regular hypertope $\beta$ on its own $j$-elements, is always regular. The input for the twist is a Coxeter graph $D = D(\beta,j,\lambda)$ whose vertices are the $j$-elements of $\beta$ and whose edges record the chosen labels $\lambda$ of the $j$-diagonal classes (orbits of $B$ on pairs of distinct $j$-elements). Because $B$ acts transitively on the $j$-elements and preserves diagonal classes, it acts by label-preserving automorphisms on $D$ and hence on the Coxeter group $W(D)$; Theorem 3.5 shows the required orbit-intersection condition follows from flag-transitivity, so the standard coset geometry $\alpha$ of $W(D)$ is $(\beta,\eta)$-admissible. Theorem 3.6 then applies the twisting theorem: $T(\alpha,\beta)$ is a regular hypertope, finite exactly when $\beta$ is finite. Corollary 3.8 identifies its Coxeter diagram as the diagram of $\beta$ with a new generator attached to the $j$-node by an edge labelled $2\lambda([B_j, b_jB_j])$\, an even label twice the diagonal-class label. An induction on the rank of this construction proves Theorem 3.9: for every tree Coxeter diagram with all labels $4$ except possibly one label $k\ge 3$, a finite regular hypertope with that diagram exists. The extension operation $\mathrm{Ext}(G,D)$ generalizes the same mechanism, and for abstract regular polytopes the constructions specialize to the classical twisting extensions.
Load-bearing premise
The load-bearing premise is Theorem 2.3, quoted without proof from the unpublished preprint [8]: an admissible twisting of two regular hypertopes is itself a regular hypertope; if that theorem is false or demands extra hypotheses, the regularity of the $j$-diagonals twisting and the existence theorem 3.9 collapse.
Editorial extensions
If this is right
- For every Coxeter diagram that is a tree with all edge labels equal to $4$ except possibly one label $k\ge 3$, some finite regular hypertope realizes that diagram; this is Theorem 3.9, proved by recursion on the number of vertices.
- Given any finite regular hypertope $\beta$ and any chosen type $j$, taking $\lambda\equiv 2$ on all $j$-diagonal classes yields a new finite regular hypertope whose diagram is the diagram of $\beta$ plus a new vertex joined to the $j$-node by an edge labelled $4$.
- The same operation with arbitrary diagonal labels lets one attach a new vertex with an even label $2\lambda([B_j, b_jB_j])$, so the construction allows a controlled change of diagram while preserving regularity.
- The twisting is finite exactly when both $\alpha$ and $\beta$ are finite, so every step of the induction produces a genuinely finite object and the whole existence argument stays inside the finite category.
- In the polytope case the construction recovers the classical twisting extensions $2^{\beta,D}$ and $\delta_{\beta,G}$, showing the incidence-geometric construction is a faithful generalization rather than a parallel theory.
Reading between the lines
- The entire regularity conclusion is inherited from the unpublished Theorem 2.3; if that theorem is later supplied with a full proof, the $j$-diagonal method becomes a self-contained existence machine, and if the theorem needs extra hypotheses, every existence statement in this paper shrinks to conditional form.
- The same orbit-on-diagonals recipe could be iterated or combined with non-constant label functions $\lambda$ to attack Coxeter diagrams that are trees with several non-$4$ labels, or graphs that are not trees; the paper stops at the one exceptional label.
- One could apply the construction to the wider class of highly symmetric hypertopes mentioned in the introduction and compute the diagonal-class labels concretely, producing a census of new finite regular hypertopes whose diagrams are not otherwise known to occur.
- The extension operation $\mathrm{Ext}(G,D)$ suggests a general two-graph twisting product; whether it preserves regularity for arbitrary pairs of regular hypertopes, not just those arising from the $j$-diagonal construction, is a natural test of how far the method reaches.
Formalized claims in Lean
-
Claim #1: The central claim is that the twisting construction for coset incidence systems, applied to the natural action of a regular hypertope $\beta$ on its own $j$-elements, is always regular. The input for the twist is a Coxeter graph $D = D(\beta,j,\lambda)$ whose vertices are the $j$-elements of $\beta$ and whose edges record the chosen labels $\lambda$ of the $j$-diagonal classes (orbits of $B$ on pa
/-- @claim 1 The central claim is that the twisting construction for coset incidence systems, applied to the natural action of a regular hypertope $\beta$ on its own $j$-elements, is always regular. The input for the twist is a Coxeter graph $D = D(\beta,j,\lambda)$ whose vertices are the $j$-elements of $\beta$ and whose edges record the chosen labels $\lambda$ of the $j$-diagonal classes (orbits of $B$ on pa -/ def central_claim : Prop :=
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a construction called the j-diagonals twisting for coset incidence systems. For a coset incidence system β and a type j, the authors define a Coxeter graph D whose vertices are the j-elements of β and whose edge labels come from a function λ on the B-orbits of pairs of distinct j-elements. The natural action of B on the j-elements yields an action by label-preserving automorphisms of D, hence an action on the Coxeter group W(D). Applying the twisting construction of coset incidence systems gives a new coset geometry T(α,β). The main results assert that if β is a regular hypertope, then T(α,β) is again a regular hypertope (Theorem 3.6), with Coxeter diagram obtained from that of β by adding a new vertex joined to the j-node by an edge labelled 2λ([B_j, b_j B_j]) (Corollary 3.8). As an application, the paper proves existence of finite regular hypertopes with Coxeter diagram any tree all whose labels are 4 except possibly one label k≥3 (Theorem 3.9). A second construction, the extension Ext(G,D), combines a given Coxeter graph with the j-diagonal graph and yields analogous regularity and diagram statements (Theorem 3.13, Corollary 3.15). The paper claims to recover the twisting extensions of McMullen and Schulte for regular polytopes.
Significance. If the results are correct, this is a valuable contribution to the theory of regular hypertopes. The construction is elegant and natural: it turns the action of a flag-transitive group on its j-elements into a Coxeter-group action, and the admissibility condition reduces to the standard flag-transitivity condition. This is a clean way to produce new regular hypertopes from old ones while controlling the Coxeter diagram. The resulting existence theorem for tree diagrams with labels 4 except one is a concrete, falsifiable statement that goes beyond previously known constructions. The paper is also honest about the limits of the approach. However, the central regularity theorem (Theorem 2.3) is imported from the authors' own unpublished preprint [8], and the diagram computation in Corollary 3.8 has a gap in establishing exact edge labels. These issues materially affect the main claims.
major comments (3)
- [§2.3, Theorem 2.3] Theorem 2.3, quoted from the unpublished preprint [8], is the single load-bearing external input: Theorems 3.6(a), 3.9, and 3.13(a) all invoke it directly, and the admissibility condition checked in Theorem 3.5 is the only hypothesis verified in this paper. No proof of Theorem 2.3 is supplied, nor is there an independent derivation for the special cases used here. If Theorem 2.3 is false or requires additional hypotheses, the main existence result collapses. The authors should either include a self-contained proof of Theorem 2.3, give a published reference, or prove the special case of the twisting theorem needed for the j-diagonal construction.
- [§3.2, Corollary 3.8] The proof derives the relation (a_{B_j} b_j)^{2m}=1 from (a_{B_j} a_{b_j B_j})^m=1 and a_{b_j B_j}=b_j a_{B_j} b_j, and then concludes that the edge label is 2m. This only establishes that the order divides 2m; minimality is not shown. The exact order can be proved by noting that (b_j a_{B_j})^2 = a_{b_j B_j} a_{B_j}, an element of order m in A, so the order of b_j a_{B_j} is exactly 2m (odd powers lie in a nontrivial coset of B). This argument, or an equivalent one, must be included for the diagram claim to be valid.
- [§3.2, Corollary 3.8] The computation of the Coxeter diagram of T(α,β) assumes without proof that the generators g_0 := a_{B_j} and g_i := b_i are the distinguished generators of the regular hypertope, and that the presentation with these generators captures all relations of A ⋊ B. In particular, after eliminating the generators a_F for F ≠ B_j, one must verify that the Coxeter relations among the a_F are consequences of the relations g_0 g_i, which is not done. A rigorous argument is needed to justify that the diagram is the one described; this is especially important because Corollary 3.8 is used in the proof of Theorem 3.9.
minor comments (6)
- [§3.1, Theorem 3.5] In the displayed equation preceding 'By the flag-transitivity of B in β', the right-hand side has B_{Iβ\M}·F_L in both products; the second factor should be B_{Iβ\N}·F_L.
- [§3.2, Corollary 3.7] Corollary 3.7 claims an isomorphism with McMullen-Schulte's 2_{β,D} in a two-sentence proof; since this is not used in the main existence theorem, either expand the proof or state it as a remark.
- [§3.3, Corollary 3.14] Corollary 3.14 similarly asserts an isomorphism δ_{β,G} ≅ T(α,β) with minimal justification; please provide more detail or relegate to a remark.
- [§3.3, before Theorem 3.13] The admissibility for the orbit V(D) is asserted in prose; it would be cleaner to state a lemma that the conditions of Theorem 3.5 apply to the orbit V(D) and that singleton orbits are automatic.
- [Abstract] The abstract states 'there exists a finite regular hypertope' where the plural 'hypertopes' is intended; please fix the phrasing.
- [References] Reference [8] is cited as an unpublished preprint with no arXiv identifier or public repository link; given that Theorem 2.3 is central, a publicly accessible version or a published reference is necessary.
Circularity Check
No circularity: the claimed diagram labels are computed from the chosen label function λ and the regularity results are applications of a general twisting theorem, not reductions to the paper's own conclusions.
full rationale
The derivation chain is not circular. In Construction 3.3, the j-diagonal Coxeter graph D is defined from β, j, and an arbitrary label function λ, and the diagram of T(α,β) in Corollary 3.8 computes the new edge label as 2λ([B_j,b_jB_j]) from the group presentation. Theorem 3.9 then chooses λ ≡ 2, so the new edge label is forced to be 4; this is a construction, not a fit to a desired output. The regularity of T(α,β) is imported from Theorem 2.3, quoted from the same authors' preprint [8], but that theorem is a general statement about twisting of admissible regular hypertopes, and the present paper verifies admissibility (Theorem 3.5) independently. Thus the reliance on [8] is a verifiability/dependency concern because the cited preprint is unpublished, but it is not a circular equivalence. The one real gap is the exact-order claim in Corollary 3.8: the relation (a_{B_j}b_j)^{2m}=1 only proves divisibility, not that the order is exactly 2m; for the m=2 case used in Theorem 3.9 an additional short argument recovers order 4, so the main existence theorem is not endangered. This is a correctness gap, not circularity.
Assumptions & free parameters
assumptions (4)
- domain assumption Twisting theorem (Theorem 2.3 from [8]): if α and β are regular hypertopes and α is (β,η)-admissible, then T(α,β) is a regular hypertope, and finiteness is equivalent to finiteness of both factors.
- domain assumption Flag-transitivity characterization (Theorem 2.1 from [7]): B is flag-transitive on β iff B_H B_J ∩ B_K B_J = (B_H ∩ B_K) B_J for all H,J,K ⊆ Iβ.
- standard math Standard coset incidence systems of Coxeter groups are regular hypertopes.
- domain assumption Closure and quotient lemmas (Lemmas 2.4, 2.5 from [7]): normal closures of η-invariant subgroups remain invariant, and quotients preserve admissibility.
Cite this review
Pith. "Pith review of Coset geometries acting on their elements: The $j$-diagonals twisting." pith.science (2026). https://pith.science/paper/64UZU5LC
@misc{pith2026260823223,
author = {Pith},
title = {Pith review of: Coset geometries acting on their elements: The $j$-diagonals twisting},
year = {2026},
howpublished = {\url{https://pith.science/paper/64UZU5LC}},
note = {Machine review of arXiv:2608.23223}
}
abstract
Let $\beta$ be a coset incidence system and fix a type $j$. We use the orbits of the group of $\beta$ on pairs of distinct $j$-elements to define a Coxeter graph. The action on the $j$-elements induces an action on the corresponding Coxeter group, so the twisting construction for coset incidence systems can be applied. The resulting coset geometry, called the $j$-diagonals twisting, is always a regular hypertope if $\beta$ is a regular hypertope. Using this, we show that finite regular hypertope whose diagram is a tree with all but one of the labels equal to four always exist. We also define an extension operation that combines this Coxeter graph with another given Coxeter graph. For regular polytopes, these constructions recover the twisting extensions of McMullen and Schulte.
Reference graph
Works this paper leans on
-
[8]
The geometry of wreath and semi-direct products,
C. A. Piedade and P. Tranchida, “The geometry of wreath and semi-direct products,”Preprint, 2026
work page 2026
-
[1]
Sur les analogues algébriques des groupes semi-simples complexes,
J. Tits, “Sur les analogues algébriques des groupes semi-simples complexes,” inColloque d’algèbre supérieure, tenu à Bruxelles du 19 au 22 décembre 1956, Centre Belge de Recherches Mathématiques, pp. 261–289, Établissements Ceuterick, Louvain, 1957
work page 1956
-
[2]
Géométries polyédriques et groupes simples,
J. Tits, “Géométries polyédriques et groupes simples,” inAtti della II Riunione del Groupement des Mathématiciens d’Expression Latine, pp. 66–88, Edizioni Cremonese, 1963
work page 1963
-
[3]
Buekenhout and A
F. Buekenhout and A. M. Cohen,Diagram geometry: related to classical groups and buildings, vol. 57. Springer Science & Business Media, 2013
2013
-
[4]
McMullen and E
P. McMullen and E. Schulte,Abstract regular polytopes, vol. 92. Cambridge University Press, 2002
2002
-
[5]
Buekenhout, ed.,Handbook of incidence geometry
F. Buekenhout, ed.,Handbook of incidence geometry. Oxford, England: North-Holland Publishing, 1995
1995
-
[6]
Tits,Buildings of spherical type and finite BN-pairs
J. Tits,Buildings of spherical type and finite BN-pairs. Lecture Notes in Mathematics, Vol. 386, Springer- Verlag, Berlin-New York, 1974
1974
-
[7]
C. A. Piedade and P. Tranchida, “From group operations to geometric structures: Amalgamations, hnn- extensions, and twisting in coset geometries,”Journal of Algebra, vol. 707, p. 83–144, Dec. 2026
work page 2026
Show all 12 references
-
[9]
Constructing new geometries: a generalized approach to halving for hypertopes,
C. A. Piedade and P. Tranchida, “Constructing new geometries: a generalized approach to halving for hypertopes,”Combinatorica, vol. 45, no. 1, pp. Paper No. 10, 39, 2025
2025
-
[10]
Highly symmetric hypertopes,
M. E. Fernandes, D. Leemans, and A. I. Weiss, “Highly symmetric hypertopes,”Aequationes Math., vol. 90, no. 5, pp. 1045–1067, 2016
2016
-
[11]
Bourbaki,Groupes et algèbres de Lie - Chapitres 4, 5 et 6
N. Bourbaki,Groupes et algèbres de Lie - Chapitres 4, 5 et 6. Berlin, Germany: Springer, Dec. 2006. 12 CLAUDIO ALEXANDRE PIEDADE AND PHILIPPE TRANCHIDA
2006
-
[12]
Regular Incidence-Complexes and Dimensionally Unbounded Sequences of Such, I,
L. Danzer, “Regular Incidence-Complexes and Dimensionally Unbounded Sequences of Such, I,” inNorth- Holland Mathematics Studies, vol. 87, pp. 115–127, Elsevier, 1984. (Claudio Alexandre Piedade)Université Libre de Bruxelles, Brussels, Belgium Email address:claudio.piedade@ulb....
1984
Reviewed August 28, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.