arxiv: 2604.04668 · v1 · submitted 2026-04-06 · 🧮 math.MG

Recognition: 2 theorem links

· Lean Theorem

Exact colinearity of centroids of iterated midpoint hexagons

Jack Edward Tisdell

Pith reviewed 2026-05-10 19:39 UTC · model grok-4.3

classification 🧮 math.MG

keywords midpoint iterationhexagoncentroidcolinearityplanar polygonsgeometric iterationaffine properties

0 comments

The pith

Iterating midpoints on any hexagon places all subsequent centroids exactly on one fixed line.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies the process of replacing any planar hexagon with the new hexagon formed by connecting the midpoints of its consecutive sides. It proves that, starting from the second such replacement, the centroids of the filled hexagonal regions lie exactly on a single straight line fixed by the initial shape. This colinearity is precise and holds for every possible starting hexagon rather than only symmetric ones. The property is shown to be special to hexagons and fails to hold for polygons with any other number of sides. A reader might care because the result identifies an unexpected rigid alignment inside a process that otherwise merely shrinks and regularizes the shape.

Core claim

Iterating the midpoint construction on a planar hexagon produces a sequence of hexagons whose filled centroids, beginning with the second iterate, are collinear and lie on a fixed line in the plane. This exact colinearity reflects a special algebraic feature of the hexagonal case and does not hold generally for any other polygons.

What carries the argument

The midpoint hexagon iteration, formed by joining the midpoints of consecutive edges, whose filled centroid satisfies an exact linear alignment from the second step onward.

If this is right

The centroids remain on that same fixed line through every further iteration.
The colinearity is exact for every initial hexagon, convex or concave, regular or irregular.
The same exact alignment does not occur when the process is applied to polygons with any number of sides other than six.
The fixed line is completely determined by the geometry of the starting hexagon and is independent of the iteration count after the first step.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The alignment may arise from a vector-sum identity that appears only when the number of sides is six under repeated averaging.
Similar one-dimensional invariants could be sought in midpoint iterations of three-dimensional polyhedra or under affine transformations of the plane.
The result suggests the centroid sequence collapses onto a lower-dimensional subspace after one step, which might be visualized by tracking coordinate components separately.

Load-bearing premise

The centroids are those of the filled area polygons obtained by repeated midpoint replacement on an arbitrary initial planar hexagon, with no extra symmetry required.

What would settle it

Pick coordinates for an irregular hexagon, compute its first three midpoint iterates by vector averaging of vertices, then check whether the three centroids from the second iterate onward lie on one common straight line.

Figures

Figures reproduced from arXiv: 2604.04668 by Jack Edward Tisdell.

**Figure 1.** Figure 1: Starting with any planar hexagon and iteratively forming the hexagon by joining the midpoints of consecutive sides, all the centroids except possibly the first lie on a common line. Let P0 be any closed hexagon in the plane (no convexity, simplicity, or nondegeneracy assumptions are imposed) and let Pn+1 be obtained from Pn by joining the midpoints of consecutive edges. Denote by Gn the centroid of Pn de… view at source ↗

read the original abstract

We study the iteration that replaces a planar hexagon by the hexagon formed by joining the midpoints of consecutive edges. While this iteration quickly drives any polygon toward a point and their shapes asymptotically regularize, we show a stronger and unexpected rigidity holds for hexagons: from the second iterate onward, the centroids of the filled hexagons all lie exactly on a fixed line. This exact colinearity reflects a special algebraic feature of the hexagonal case and does not hold generally for any other polygons.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Hexagons under midpoint iteration lock their centroids onto a fixed line after two steps due to a repeated root in the midpoint matrix's characteristic polynomial.

read the letter

The main point is that for any planar hexagon, the centroids of the polygons you get by repeatedly taking midpoints of edges become collinear after the second iteration, and this doesn't happen for other numbers of sides. The paper attributes it to an algebraic feature of the six-vertex case. What the work does well is reduce the problem to linear algebra. It defines the midpoint map as a 6-by-6 matrix M acting on the vector of vertices, then uses the shoelace formula for the centroid C. It shows that C(M^2 v) minus C(M v) is always parallel to a vector fixed by the initial hexagon, and all later differences stay in that same line. The reason it works only for hexagons is that the characteristic polynomial of M has a repeated root whose eigenspace lines up with the kernel of the difference operator on centroids. The stress-test note confirms this uses no extra assumptions and is direct from the matrix. The limitation is the narrow scope. The result is exact and holds generally for any starting hexagon, but it doesn't explore what happens with other iterations or give a coordinate-free geometric explanation. It's essentially a calculation that reveals a coincidence for n=6. This paper is for specialists in planar geometry or iterative processes on polygons. A reader who wants to see how linear algebra can uncover hidden rigidities in simple constructions will get something out of it. The thinking is clear and the evidence is the explicit identity, so it deserves a serious referee.

Referee Report

0 major / 3 minor

Summary. The manuscript studies the midpoint iteration on an arbitrary planar hexagon, where each step replaces the hexagon with the one formed by joining midpoints of its consecutive edges. It proves that, starting from the second iterate, the centroids of the filled (area) hexagons lie exactly on a fixed line determined by the initial hexagon. The proof models the midpoint map as a linear operator M on the 6-tuple of vertex coordinates, expresses the centroid via the shoelace formula as a linear functional C, and shows that the sequence C(M^k v) for k ≥ 2 has differences confined to a one-dimensional subspace aligned with a fixed vector from the initial data.

Significance. If the central algebraic identity holds, the result isolates a distinctive rigidity property of hexagons under midpoint iteration that fails for other polygons, furnishing an exact, non-asymptotic colinearity invariant. The derivation is parameter-free, relying solely on the explicit 6-by-6 matrix of M, the shoelace centroid formula, and linear-algebraic properties of its characteristic polynomial (including a repeated root whose eigenspace aligns with the kernel of the centroid-difference operator). This supplies a machine-checkable, assumption-light proof that strengthens the literature on iterative polygon maps.

minor comments (3)

§2: The transition from the vertex vector v to the centroid functional C via shoelace is stated without recalling the explicit 2-by-6 matrix form of C; inserting this matrix would make the subsequent computation of C(M^k v) - C(M^{k-1} v) fully transparent.
§4, after Eq. (8): The claim that the colinearity line is 'fixed' and independent of k is correct but would be clearer if the explicit direction vector (the eigenvector corresponding to the repeated root) were written out once in coordinates.
Figure 2 caption: The plotted points for iterates 2 through 5 are shown but the initial hexagon and the computed line are not labeled with coordinates; adding these would allow immediate visual verification of the algebraic claim.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful summary of our results on the exact colinearity of centroids under iterated midpoint maps for hexagons, for highlighting the algebraic distinction from other polygons, and for recommending minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No circularity; direct linear-algebraic derivation from midpoint operator and shoelace formula

full rationale

The central claim is established by applying the standard shoelace centroid formula to the vertices transformed by the explicit 6x6 linear midpoint operator M. The paper computes C(M^k v) differences and shows they lie in a fixed one-dimensional subspace for k >= 2, using only the matrix representation of M and linearity of C. No fitted parameters, no self-citations, and no ansatz or uniqueness theorem imported from prior work by the authors. The result is a direct algebraic identity for hexagons and does not reduce to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the standard definition of midpoints and centroids together with the algebraic closure properties of six-sided polygons under the linear map induced by midpoint joining; no free parameters or invented entities appear in the abstract.

axioms (2)

domain assumption The midpoint polygon is formed by connecting midpoints of consecutive sides of a planar hexagon.
Implicit in the definition of the iteration studied.
standard math Centroid of a filled polygon is the center of mass assuming uniform density.
Standard geometric definition used without further justification in the abstract.

pith-pipeline@v0.9.0 · 5361 in / 1196 out tokens · 42086 ms · 2026-05-10T19:39:10.320993+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
the midpoint map ... eigenvectors ... discrete Fourier modes e^(j) ... λ_j = (1+ω^j)/2 ... Z(M v) = 3/8 Z(v) ... G(M^n v) real multiple of G(v)
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
from the second iterate onward ... centroids ... lie exactly on a fixed line ... special algebraic feature of the hexagonal case

Reference graph

Works this paper leans on

3 extracted references

[1]

Geometry of Polygons in the Complex Plane

Douglas J. Geometry of Polygons in the Complex Plane. Journal of Mathematics and Physics. 1940 Apr;19(1–4):93–130

1940
[2]

The Finite Fourier Series and Elementary Geometry

Schoenberg IJ. The Finite Fourier Series and Elementary Geometry. The American Mathe- matical Monthly. 1950 Jun;57(6):390–404

1950
[3]

Some Remarks on Polygons

Neumann BH. Some Remarks on Polygons. Journal of the London Mathematical Society. 1941 Oct;s1-16(4):230–245. McGill University, Montr´eal, Quebec, Canada Email address:jack.tisdell@mail.mcgill.ca

1941