REVIEW 2 major objections 3 minor 32 references
Stability of $\mathbb{Z}^2$ configurations in 3D
T0 review · 2 major / 3 minor · reviewed 2026-08-27 · deepseek-v4-flash
Pith's one-line read For foldable and shear-resistant square-lattice patches, deformability without changing bonds or angles is exactly the axis-cut condition.
desk verdict Useful combinatorial rigidity criterion for square-lattice fragments, but the 3D angle definition and a key normalization in Proposition 5.2 need fixing before I'd trust Corollary 5.3. 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 condition (6), a combinatorial cut condition on a lattice axis: after deleting all points of the configuration that lie on an axis $A$ and have at most one neighbor off $A$, the remaining configuration is disconnected. The paper proves this condition is equivalent to being a folding, namely admitting an angle-preserving map that rotates one subconfiguration around $A$ by a small angle while fixing the rest. On the necessity side, the class $\mathcal{S}_k$ of $k$-shear-resistant configurations supplies the geometric rigidity that makes the condition exact: a cell is $k$-shear-resistant when every angle-preserving map on its $k$-neighborhood keeps the four vertices of any paraxial rectangle inside the cell coplanar, where a paraxial rectangle is a lattice rectangle with sides parallel to the axes and one side of length 1. This coplanarity constraint rules out shear deformations and leaves foldings as the only possible nontrivial angle-preserving maps.
What would settle it
Enumerate all finite connected subsets of $\mathbb{Z}^2$ with up to ten points, identify those belonging to $\mathcal{S}_0$ or $\mathcal{S}_1$, and for each one check condition (6) while separately searching numerically for nontrivial angle-preserving maps. A single shear-resistant configuration that admits such a map but does not satisfy (6) would disprove Corollary 5.3. A more targeted test is to look for a minimal non-coplanar path in an $\mathcal{S}_k$ configuration whose intermediate points cannot be placed on one axis by any choice of coordinates, which would expose the unproved normalization in Proposition 5.2.
Extended reading notes
Core claim
On the paper's own terms, the central discovery is Corollary 5.3: for a finite connected configuration $C\subset \mathbb{Z}^2$ lying in the folding class $\mathcal{F}$ or in a shear-resistant class $\mathcal{S}_k$, the configuration is not angle-rigid if and only if condition (6) holds, meaning that some axis $A$ has the property that deleting from $C$ all points on $A$ with at most one neighbor off $A$ disconnects the configuration. Since every angle-rigid configuration belongs to $\mathcal{S}_k$ for $k$ large enough, the characterization covers all rigid configurations in the limit $k\to\infty$. The paper also shows that condition (6) is equivalent to the existence of a folding: an angle-preserving map obtained by rotating one subconfiguration about an axis by a small angle while leaving the rest fixed. The shear-resistant hypothesis is what makes the condition necessary, because it forces any angle-preserving map to keep the relevant paraxial rectangles coplanar, leaving foldings as the only possible nontrivial deformations. By Proposition 3.1, angle-rigidity is equivalent to strict local minimality up to isometries of the configurational energy, so the combinatorial condition also decides stability in that sense.
Load-bearing premise
The proof that condition (6) is necessary for non-angle-rigidity in shear-resistant configurations assumes, without derivation, that the smallest chain of bonded points that becomes non-flat under a nontrivial deformation can be straightened onto a single lattice axis, with the chain's endpoints one step off the axis and all intermediate points fixed by the deformation; if this normalization is not always possible, some non-rigid configurations in $\mathcal{S}_k$ could evade the characterization.
Editorial extensions
If this is right
- For every configuration in $\mathcal{F}\cup\mathcal{S}_k$, deciding angle-rigidity reduces to checking condition (6), which requires scanning at most $2n$ axes and performing a connectivity test, so it is polynomial-time checkable.
- Because every angle-rigid configuration belongs to $\mathcal{S}_k$ for $k$ large enough, the equivalence in Corollary 5.3 gives a complete characterization of all rigid configurations in the limit as $k\to\infty$.
- Outside $\mathcal{F}\cup\mathcal{S}_k$ the condition is only sufficient: the paper exhibits configurations that are not angle-rigid, do not satisfy (6), and are not foldings, so the general problem is strictly richer.
- For simple cells, the local criterion of Proposition 6.1 identifies 0-shear-resistance with a count of edge directions on the cell boundary, giving a purely local way to certify rigidity of a single cell.
Reading between the lines
- One can infer that the axis-cut test could serve as a fast screening tool for square-lattice molecular fragments in molecular mechanics, although the paper does not implement or benchmark any algorithm.
- The proof's dichotomy between foldings and shear deformations suggests that other two-dimensional lattices, such as triangular or hexagonal ones, should admit analogous combinatorial rigidity criteria, with the lattice's preferred bond directions replacing axes and paraxial rectangles; the authors note this expectation but do not develop it.
- If the unproved normalization in the proof of Proposition 5.2 fails for some shear-resistant configuration, the correct characterization would likely involve a slightly weaker cut condition, and a targeted exact-arithmetic search over small $\mathcal{S}_1$ configurations could settle the question.
Formalized claims in Lean
-
Claim #1: On the paper's own terms, the central discovery is Corollary 5.3: for a finite connected configuration $C\subset \mathbb{Z}^2$ lying in the folding class $\mathcal{F}$ or in a shear-resistant class $\mathcal{S}_k$, the configuration is not angle-rigid if and only if condition (6) holds, meaning that some axis $A$ has the property that deleting from $C$ all points on $A$ with at most one neighbor o
/-- @claim 1 On the paper's own terms, the central discovery is Corollary 5.3: for a finite connected configuration $C\subset \mathbb{Z}^2$ lying in the folding class $\mathcal{F}$ or in a shear-resistant class $\mathcal{S}_k$, the configuration is not angle-rigid if and only if condition (6) holds, meaning that some axis $A$ has the property that deleting from $C$ all points on $A$ with at most one neighbor o -/ def central_claim : Prop :=
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies angle-rigidity for finite planar configurations in Z^2 viewed as subsets of R^3, where a configuration is angle-rigid if sufficiently small perturbations preserving all nearest-neighbor distances and all angles of adjacent bonds are necessarily isometries. The main result is Corollary 5.3: within the class F∪S_k (foldings and k-shear-resistant configurations), a configuration is not angle-rigid if and only if condition (6) holds, i.e., there exists a lattice axis A such that deleting all points on A with at most one neighbor off A disconnects the configuration. The paper also proves an equivalence between angle-rigidity and strict local minimality for a two- and three-body configurational energy, and gives a complete characterization of 0-shear-resistant cells in Section 6.
Significance. If the results are correct, the paper provides a polynomial-time checkable combinatorial criterion for non-angle-rigidity in a natural class of lattice configurations, with a clear connection to molecular mechanics and crystallization. The sufficient condition for foldings is clean, the shear-resistant hierarchy is a sensible way to isolate configurations for which the condition is necessary, and the proofs are detailed and structured. The explicit geometric construction in Lemma 6.2 is a particular strength. However, the stated characterization is only as well-defined as the notion of 'oriented clockwise angle' in R^3, which the manuscript does not specify.
major comments (2)
- [Section 2.1, equations (3)-(4)] The angle θ(x_k,x_k′,x_k′′) is defined as the angle formed by the two vectors and 'oriented clockwise', but in R^3 there is no canonical meaning of clockwise for an ordered pair of vectors. The identity θ(x_k,x_k′,x_k′′)+θ(x_k′′,x_k′,x_k)=2π confirms that an orientation is intended, but no normal or viewing direction is specified. Since equation (4) and all subsequent angle-preserving maps use exact equality of these oriented angles, the class of angle-preserving maps, and hence the characterization in Corollary 5.3, is not well-defined until a convention is supplied. Please specify the convention explicitly and verify that the proofs are valid under that convention.
- [Section 5, proof of Proposition 5.2, equation (10)] The reduction 'with no loss of generality' leading to (10) is not derived. In particular, the assertions that a minimal non-coplanar path can be normalized so that φ(x_i)=x_i for i=1,...,m−1, that the intermediate points lie on an axis, and that x_m∈{(m−3,±1)} require an argument: one must show that angle preservation forces the intermediate original points to be collinear, that the image line can be moved by an isometry onto the corresponding lattice axis, and that the endpoint is off-axis. This normalization is essential for the paraxial-rectangle contradictions in cases (a) and (b). Please provide the missing justification or a separate lemma.
minor comments (3)
- [Section 2.1] The notation N(C) is used both for sets of index pairs and for sets of point pairs; the clarifying sentence 'We use the notation N(C)=...' is easy to miss. Consider using different symbols for the two objects.
- [Section 6, proof of Proposition 6.1] The symbol n is reused for the number of vertices of the polygon although n denotes the number of configuration points elsewhere in the paper; this may confuse readers.
- [After Corollary 5.3] The sentence 'as k grows, S_k covers all angle-rigid configurations and configurations in S_k not being angle-rigid but belonging to F' is ambiguous; it should be rephrased to say that every angle-rigid configuration belongs to some S_k and that the only non-angle-rigid configurations in S_k are foldings.
Circularity Check
No circularity: the characterization is derived from definitions and combinatorial lemmas; prior self-citations are contextual only.
full rationale
The derivation is self-contained. Condition (6) is an independent combinatorial criterion, and Proposition 4.1 explicitly constructs a nontrivial angle-preserving folding map from it; Proposition 4.3 proves the equivalence with foldings directly from Definition 4.2. Proposition 5.2 proves necessity inside S_k by contradiction: from a nontrivial angle-preserving map it builds a minimal non-coplanar path and uses the shear-resistance hypothesis to force the paraxial rectangles to remain coplanar, contradicting the path's choice. None of these arguments assumes the conclusion. The cited works [23,24] appear only as background on crystallization and are not premises in the rigidity proofs. The 'without loss of generality' normalization in Proposition 5.2 is a coordinate change (composition with an isometry), not an assumption of the theorem; even if more justification were needed, that would be a proof gap, not circularity. The under-specified 3D 'oriented clockwise' angle convention is a definitional precision issue rather than a circular reduction. Therefore no circular step is present.
Assumptions & free parameters
assumptions (5)
- domain assumption Finite configurations in Z^2, embedded in R^3, with bonds at Euclidean distance 1.
- domain assumption The configurational energy E = E2 + E3 has only nearest-neighbor two-body and three-body angle terms, with v2 strictly minimized at 1 and v3 minimized exactly at π/2, π, 3π/2.
- standard math Jordan curve theorem: a simple closed loop in the plane partitions it into interior and exterior.
- standard math Intermediate value theorem for continuous functions.
- standard math Basic properties of rotations and isometries in R^3.
Cite this review
Pith. "Pith review of Stability of $\mathbb{Z}^2$ configurations in 3D." pith.science (2026). https://pith.science/paper/EFYRPKAA
@misc{pith2026200911503,
author = {Pith},
title = {Pith review of: Stability of $\mathbbZ^2$ configurations in 3D},
year = {2026},
howpublished = {\url{https://pith.science/paper/EFYRPKAA}},
note = {Machine review of arXiv:2009.11503}
}
abstract
Inspired by the issue of stability of molecular structures, we investigate the strict minimality of point sets with respect to configurational energies featuring two- and three-body contributions. Our main focus is on characterizing those configurations which cannot be deformed without changing distances between first neighbors or angles formed by pairs of first neighbors. Such configurations are called {\it angle-rigid}. We tackle this question in the class of finite configurations in $\mathbb{Z}^2$, seen as planar three-dimensional point sets. A sufficient condition preventing angle-rigidity is presented. This condition is also proved to be necessary when restricted to specific subclasses of configurations.
Figures
Figures from the paper (7 more)
Reference graph
Works this paper leans on
-
[1]
N. L. Allinger. Molecular structure: understanding steric and electronic effects from molecular mechanics, Wiley, 2010
work page 2010
-
[2]
B. D. Anderson, C. Yu, B. Fidan, J. M. Hendrickx. Rigid graph control architectures for autonomous formations, IEEE Control Systems Magazine , 29 (2008), 48–63
work page 2008
- [3]
- [4]
-
[5]
D. W. Brenner. Empirical potential for hydrocarbons for use in stimulating the chemical vapor deposition of diamond films, Phys. Rev. B , 42 (1990), 9458–9471
work page 1990
-
[6]
I. Buckley, M. Egerstedt. Infinitesimally shape-similar motions using relative angle measurements, in Intelligent Robots and Systems (IROS) , 2017 IEEE/RSJ International Conference. IEEE, 2017, pp. 1077–1082
work page 2017
-
[7]
L. Chen, M. Cao, C. Li. Bearing rigidity and formation stabilization for multiple rigid bodies in SE(3), Numer. Algebra Control Optim. , 9 (2019), 257–267
work page 2019
-
[8]
W. E, D. Li. On the crystallization of 2D hexagonal lattices. Comm. Math. Phys. , 286 (2009), 1099–1140
work page 2009
Show all 32 references
-
[9]
Farmer, S
B. Farmer, S. Eseduglu, P. Smereka. Crystallization for a Brenner-like Potential. Comm. Math. Phys., 349 (2017), 1029–1061
2017
-
[10]
L. C. Flatley, F. Theil. Face-centered cubic crystallization of atomistic configurations,Arch. Ration. Mech. Anal., 218 (2015), 363–416
2015
-
[11]
Friesecke, F
G. Friesecke, F. Theil. Molecular geometry optimization, models, in Encyclopedia of Applied and Computational Mathematics, B. Engquist (ed.), Springer, Berlin, Heidelberg, 2015
2015
-
[12]
G. Jing, G. Zhang, H. W. J. Lee, L. Wang. Weak rigidity theory and its application to formation stabilization. SIAM J. Control Optim. , 56 (2018), 2248–2273
2018
-
[13]
G. Jing, G. Zhang, H. W. J. Lee, L. Wang. Angle-based shape determination theory of planar graphs with application to formation stabilization. Automatica J. IFAC, 105 (2019), 117–129
2019
-
[14]
Garamv¨ olgyi, T
D. Garamv¨ olgyi, T. Jord´ an. Global rigidity of unit ball graphs,SIAM J. Discrete Math., 34 (2020), 212–229
2020
-
[15]
Jackson, T
B. Jackson, T. Jordan. Rigid components in molecular graphs. Algorithmica, 48 (2007), 399–412
2007
-
[16]
Jackson, J
B. Jackson, J. C. Owen. A characterisation of the generic rigidity of 2-dimensional point-line frame- works. J. Combin. Theory Ser. B , 119 (2016), 96–121
2016
-
[17]
D. J. Jacobs, L. A. Kuhn, M. F. Thorpe. Flexible and rigid regions in proteins. In: Thorpe M.F., Duxbury P.M. (eds) Rigidity Theory and Applications. Fundamental Materials Research. Springer, Boston, 2002
2002
-
[18]
Katoh, S
N. Katoh, S. Tanigawa. A proof of the molecular conjecture. Discrete Comput. Geom. , 45 (2011), 647–700. 24 L. B ´ETERMIN, M. FRIEDRICH, AND U. STEFANELLI
2011
-
[19]
G. Laman. On graphs and the rigidity of plane skeletal structures, J. Engng. Math. , 2 (1970), 331–340
1970
-
[20]
E. G. Lewars. Computational Chemistry, 2nd edition, Springer, 2011
2011
-
[21]
S. Liu. Origin and nature of bond rotation barriers: a unified view. J. Phys. Chem. A , 117 (2013), 962–965
2013
-
[22]
Lov´ asz.Graphs and geometry
L. Lov´ asz.Graphs and geometry . American Mathematical Society Colloquium Publications, 65. American Mathematical Society, Providence, RI, 2019
2019
-
[23]
Mainini, P
E. Mainini, P. Piovano, U. Stefanelli. Finite crystallization in the square lattice, Nonlinearity, 27 (2014), 717–737
2014
-
[24]
Mainini, U
E. Mainini, U. Stefanelli. Crystallization in carbon nanostructures, Comm. Math. Phys., 328 (2014), 545–571
2014
-
[25]
Oh, M.-C
K.-K. Oh, M.-C. Park, H.-S. Ahn. A survey of multi-agent formation control, Automatica, 53 (2015), 424–440
2015
-
[26]
Park, H.-K
M.-C. Park, H.-K. Kim, H.-S. Ahn. Rigidity of distance-based formations with additional subtended-angle constraints, in Proceedings of the 17th International Conference on Control, Au- tomation and Systems (ICCAS) , 2017, pp. 111–116
2017
-
[27]
B. Roth. Rigid and flexible frameworks, Amer. Math. Monthly , 88 (1981), 6–21
1981
-
[28]
Saliola, W
F. Saliola, W. Whiteley. Constraining plane configurations in CAD: circles, lines, and angles in the plane, SIAM J. Discrete Math. , 18 (2004), 246–271
2004
-
[29]
F. H. Stillinger, T. A. Weber. Computer simulation of local order in condensed phases of silicon, Phys. Rev. B , 8 (1985), 5262–5271
1985
-
[30]
T.-S. Tay, W. Whiteley. Recent advances in the generic rigidity of structures. Structural Topology, 9 (1984), 31–38
1984
-
[31]
J. Tersoff. New empirical approach for the structure and energy of covalent systems. Phys. Rev. B, 37 (1988), 6991–7000
1988
-
[32]
Whiteley
W. Whiteley. Counting out to the flexibility of molecules, Phys. Biol., 2 (2005), S116. (Laurent B´ etermin)Institut Camille Jordan, Universit ´e Claude Bernard Lyon 1, 21 av- enue Claude Bernard, 69622 Villeurbanne Cedex, France Email address: betermin@math.univ-lyon1.fr URL: ...
2005
Reviewed August 27, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.