Illumination problem

[mklabgr]

Illumination problem

Summary

The illumination problem is a fascinating question in mathematics that explores whether a room with mirrored walls can always be completely lit by a single point light source through repeated reflections. First posed by Ernst Straus in the 1950s, the problem can also be viewed as a variation of a mathematical billiards problem: whether a point-like ball launched from one location in a perfectly reflecting room can always reach every other point through endless reflections. The question connects geometry, dynamical systems, and the study of light paths, revealing surprising limitations hidden within seemingly simple shapes. 

A major breakthrough came in 1958 when Roger Penrose constructed a curved room, now known as the Penrose unilluminable room, proving that some spaces contain regions that remain permanently dark despite reflections. Later research extended the problem to polygonal rooms, where mathematicians such as George Tokarsky discovered examples of rooms with straight-edged walls containing unreachable dark points. 

Further studies showed that many rational polygonal rooms are almost completely illuminated, with only a finite number of exceptional points possibly remaining hidden. The illumination problem remains an important example of how geometry can challenge intuition, demonstrating that simple physical ideas about light and reflection can lead to deep mathematical discoveries about space, motion, and complexity. 

ARTICLE