Exact colinearity of centroids of iterated midpoint hexagons

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.

• The paper establishes that from the second midpoint iteration onward, the centroids of any hexagon lie precisely on a common line.
• It employs Fourier analysis to decompose the hexagon into modes, revealing a real scaling factor (3/8) that drives the centroid convergence.
• This unique colinearity phenomenon is specific to hexagons and contrasts with the behavior of other m-gons, offering insights for geometric algorithms.

Exact Colinearity of Centroids in Iterated Midpoint Hexagon Dynamics

Introduction and Motivation

The midpoint map, defined as the operation of replacing a planar polygon by a new polygon formed by consecutively joining the midpoints of its edges, is a classical construction with a long history in geometry, dynamics, and polygonal transformations. In general, iterated applications of this map drive the polygon toward a point, with the limiting shape exhibiting affine regularization properties. This work investigates a rigid phenomenon appearing uniquely in hexagons: for any (possibly degenerate or self-intersecting) hexagon, from the second iterate onward, the centroids of the filled iterated hexagons lie exactly on a common line. This colinearity is an algebraic property intrinsic to six-fold symmetry and does not generalize to polygons with any other number of sides.

Structure of the Midpoint Map in the Polygon Space

The iteration is naturally studied in the complex plane, representing the vertices of the hexagon as a vector in $\mathbb{C}^6$. The midpoint operator is a circulant linear map $M : \mathbb{C}^6 \to \mathbb{C}^6$, expressible as $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$, and diagonalizable by the discrete Fourier basis. Each eigenvector $e^{(j)} = (1, \omega^j, \ldots, \omega^{5j})$ corresponds to a particular regular hexagon (degeneracies included), with eigenvalue $\lambda_j = \frac{1 + \omega^j}{2}$ for $\omega = e^{2\pi i/6}$.

This Fourier-analytic perspective facilitates a decomposition of arbitrary initial hexagons into modes with distinct contraction rates under iteration:

• The $e^{(0)}$ mode (trivial translation) is invariant,
• The $e^{(3)}$ mode collapses immediately ($\lambda_3 = 0$),
• The remaining modes exhibit exponential decay, with rates determined by the modulus of their associated eigenvalues.

Therefore, polygonal regularization under midpoint iteration is classical; however, the behavior of centroids, being nonlinear in the vertex coordinates, was not previously known to display any exceptional rigid structure.

Centroid Dynamics Under Iteration

The centroid, for filled polygons (including self-intersecting and degenerate cases), is computed by the algebraic shoelace formulas involving the vertices. Key to the analysis is the fact that, although the centroid is generally not linear in $v$, its numerator $M : \mathbb{C}^6 \to \mathbb{C}^6$0 and denominator $M : \mathbb{C}^6 \to \mathbb{C}^6$1 admit tractable expansions in the Fourier basis.

The primary technical result establishes that for any $M : \mathbb{C}^6 \to \mathbb{C}^6$2 with vanishing translational and $M : \mathbb{C}^6 \to \mathbb{C}^6$3 (degenerate) modes, the centroid numerator scales by a real factor at each iteration:

$M : \mathbb{C}^6 \to \mathbb{C}^6$4

This leads to the main theorem: from the second iteration onward, the centroids $M : \mathbb{C}^6 \to \mathbb{C}^6$5 ($M : \mathbb{C}^6 \to \mathbb{C}^6$6) lie on a fixed line through the translated vertex centroid and converge monotonically along the line.

Notably, the proof is driven by combinatorics of the hexagon's Fourier modes, culminating in the cancellation that produces identical real scaling factors for all surviving triple eigenvalue products. This remarkable rigidity has no counterpart for polygons of other sizes.

Explicit Formula and Convergence

An explicit formula for the centroid at the $M : \mathbb{C}^6 \to \mathbb{C}^6$7-th iterate is derived, showing that the centroids $M : \mathbb{C}^6 \to \mathbb{C}^6$8 are always a real multiple of $M : \mathbb{C}^6 \to \mathbb{C}^6$9 (for translated, $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$0-free, initial polygons), i.e.,

$(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$1

where $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$2 is explicit and monotonic in $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$3. Thus, the sequence of centroids traces a monotone path along a static line in the complex plane (unless the degenerate $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$4 mode is present).

Uniqueness to Hexagons and Failure for Other $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$5-gons

A complete algebraic analysis is carried out for the midpoint iteration on general $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$6-gons. The cases $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$7 trivialize: centroids are constant after the first step, by direct calculation or classical results (Varignon’s theorem). However, for $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$8 and all $(Mv)_k = \frac{1}{2}(v_k + v_{k+1})$9, the colinearity phenomenon fails: for certain initial polygons, the directions of the centroid vectors change under iteration, breaking colinearity with their limiting point.

The proof invokes the same Fourier-analytic machinery but observes that the triple eigenvalue products, which are all real and equal for $e^{(j)} = (1, \omega^j, \ldots, \omega^{5j})$0, are generically distinct complex numbers for other $e^{(j)} = (1, \omega^j, \ldots, \omega^{5j})$1. Therefore, the precise algebraic cancellation required for colinearity does not arise.

Theoretical and Practical Implications

The findings spotlight a nontrivial algebraic structure in the iterated polygon dynamics restricted to hexagons, uniquely arising from the midpoint map's spectral properties and the geometry of six-fold symmetry. For shape synthesis, discrete geometric flows, and polygon-regularization algorithms, this result provides a precise geometric invariant unique to hexagonal iteration.

This rigidity can inform the study of discrete dynamical systems on moduli spaces of polygons, particularly in high-complexity, non-smooth geometric algorithms where algebraic and spectral tools are required. The analysis also reinforces the use of finite Fourier techniques as a powerful tool for classifying and understanding nonlinear geometric operators.

Conclusion

This work characterizes the unique occurrence of exact colinearity in the centroids of iterated midpoint hexagons, tracing its origins to the spectral structure of the midpoint map in six dimensions and the combinatorics of its induced flow. The result identifies a rare instance of spectrum-driven geometric rigidity in polygon dynamics, unattainable for any other polygonal cardinality. These insights motivate further investigation of algebraic-geometric invariants within discrete dynamical systems on polygons, and their applications in geometric analysis and computer-aided shape manipulation.

For further technical and historical context, see "Exact colinearity of centroids of iterated midpoint hexagons" (2604.04668).