Existence of a Periodic Orbit for Billiards in Polygons

This paper proves that every finite polygonal billiard table possesses at least one periodic orbit by employing a proof by contradiction that integrates dynamical systems results, the geometry of scaled Riemannian metrics on the unit tangent bundle, and the topology of cut-loci.

Original authors: Giovanni Forni

Published 2026-06-10
📖 4 min read🧠 Deep dive

Original authors: Giovanni Forni

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a billiard table, but instead of being a perfect rectangle, it's a weird, jagged polygon with sharp corners. You hit a ball, and it bounces around forever. The big question mathematicians have been asking for centuries is: Does this ball ever return to its starting spot, traveling in the exact same direction, creating a repeating loop?

For simple shapes like rectangles or acute triangles, we knew the answer was "yes." But for any random, messy polygon, no one could prove it for sure. This paper by Giovanni Forni finally says: Yes, every single finite polygon has at least one such repeating path.

Here is how the author proves it, using a story of "stretching," "skeletons," and a logical trap.

The Setup: The Infinite Bouncing Ball

First, the author imagines a scenario where the answer is NO. Let's pretend there is a polygon where the ball never repeats its path. It just bounces around forever, getting closer and closer to every corner but never settling into a loop.

If this were true, the ball's path would have to behave in a very specific, chaotic way. It would eventually get "stuck" near the corners of the table without ever hitting them directly.

The Trick: Stretching the Universe

To test this "No" scenario, the author invents a magical way to stretch the space where the ball moves. He doesn't just stretch the table; he stretches the directions the ball can point.

Imagine the ball's movement as a 3D object (position + direction). The author applies a special "squeeze" to this 3D space:

  • He stretches the direction the ball is moving forward.
  • He squishes the direction the ball is spinning or turning.
  • He keeps the volume the same.

As he keeps doing this stretch (making the "s" parameter larger and larger), something strange happens. If the ball really never loops, the entire 3D space of possible movements gets squished so tightly against the walls (the corners of the polygon) that the distance from the center of the room to the walls effectively becomes zero. The whole universe of movement collapses into the boundary.

The Skeleton: The "Cut-Locus"

Now, the author looks at the "skeleton" of this squished space. In geometry, a skeleton (or cut-locus) is the set of points that are exactly halfway between two different walls. Think of it like the center line of a hallway; if you stand on the center line, you are equidistant from the left wall and the right wall.

In a normal room, this skeleton is simple. But in our squished, "no-loop" universe, the author discovers that this skeleton becomes incredibly complex.

  • It starts looking like a bunch of flat rings (tori) glued together.
  • As the stretching continues, the number of these rings and the connections between them explode.
  • The "topological complexity" (a fancy way of saying how many holes and twists the skeleton has) grows infinitely large. It becomes a tangled mess with infinite holes.

The Trap: The Contradiction

Here is where the trap snaps shut.

The author uses a known mathematical rule (from Vainshtein, Efremovich, and Loginov) which says: The skeleton of a shape cannot be more complex than the shape itself.

Think of it like this: If you have a simple rubber ball, you can't pull a skeleton out of it that has more holes than the ball itself. The skeleton is just a shadow or a map of the original shape.

  • The Reality: The original billiard table (the flat surface with corners) is a fixed, finite object. It has a limited number of holes and corners. Its "complexity" is small and fixed.
  • The "No-Loop" Hypothesis: If there were no repeating paths, the author proved that the skeleton would have infinite complexity.

The Conclusion: You cannot have a simple, finite table produce an infinitely complex skeleton. Therefore, the starting assumption (that there are no repeating paths) must be false.

The Final Verdict

Because the "No-Loop" scenario leads to a mathematical impossibility (an infinitely complex skeleton from a simple table), the only remaining possibility is that there must be at least one repeating path.

So, no matter how weird your polygon is, if you hit a billiard ball, there is guaranteed to be at least one perfect, repeating loop hidden somewhere in the chaos. The ball will eventually find its way back to where it started, traveling in the same direction, forever.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →