Giovanni Forni Claims Proof of 1 Periodic Orbit for Every Polygonal Billiard

Q: If this new proof guarantees a repeating billiard path exists in every polygon, why can't mathematicians actually find where it starts?

Because the claimed proof is existential, not constructive. It argues that a periodic billiard path must exist in every polygon by showing that the alternative leads to a contradiction in the topology and geometry of the space of all possible trajectories. That kind of argument can establish “there is at least one” without identifying which one. In practice, the billiard dynamics in a general polygon can be extremely complicated, especially when the angles are irrational multiples of pi. For rational-angle polygons, mathematicians can often “unfold” the reflections into a more tractable geometric surface and sometimes locate periodic paths explicitly. For irrational polygons, that structure is much less rigid, and there is no general algorithm known for tracing all trajectories and isolating a repeating one. Forni’s preprint, as described, works at a higher level of abstraction. It studies global properties of the geometric object encoding billiard flow—using dynamical systems, differential geometry and algebraic topology—rather than constructing a specific orbit from a starting point and direction. A proof of that type can rule out the possibility of having no periodic orbit at all, while still leaving the actual orbit hidden. So if the proof holds up, mathematicians would know every polygon has a repeating path, but they still may not know how to compute it. Turning an existence theorem into a method for finding the orbit is usually a separate and often harder problem.

2 articles · Updated · Scientific American · Aug 14

University of Maryland mathematician Giovanni Forni posted an arXiv preprint claiming every polygonal billiard table has at least one trajectory that returns to its starting point and repeats forever.
The result targets a long-unsolved gap: periodic orbits were proved about 50 years ago for polygons whose angles are rational multiples of pi, but irrational-angle polygons had resisted proof.
Forni’s argument uses contradiction, saying a polygon with no periodic path would force the geometric object encoding billiard trajectories to have infinitely many loops and only finitely many at once.
The paper has not been peer reviewed, and even if confirmed it proves only existence—not the starting point or direction needed to produce the periodic orbit.
The problem dates back to the 18th century and was listed in 2004 among dynamical systems’ five most resistant problems, underscoring its broader importance in mathematics.