Illumination problem¶

Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9983
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Computational Geometry, Mathematical Billiards → Mathematics

Core Idea¶

Illumination problem is treated here as the recurring computational geometry identity summarized by this source-grounded definition: Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.

's solution of the illumination problem using elliptical arcs (blue) and straight line segments (green), with 3 positions of the single light source (red spot). The purple crosses are the foci of the larger arcs. Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.

These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source. In 2016, Samuel Lelièvre, Thierry Monteil, and Barak Weiss showed that a light source in a polygonal room whose angles (in degrees) are all rational numbers will illuminate the entire polygon, with the possible exception of a finite number of points. In 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite.

For Illumination problem, the abstraction is narrower than the article's general subject matter: a positive case must preserve Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computational geometry, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls.
Constitutive relation — The original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room.
Operating condition — He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source.
Recognition evidence — In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately.
Admissible variation — In 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite.
Characteristic consequence — This problem was also solved for polygonal rooms by George Tokarsky in 1995 for 2 and 3 dimensions, which showed that there exists an unilluminable polygonal 26-sided room with a "dark spot" which is not illuminated from another point in the room, even allowing for repeated reflections.
Failure boundary — Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.

What It Is Not¶

Not the whole field of computational geometry. The node requires the specific identity stated by Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Not an over-broad reading. These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source.
Not an over-broad reading. In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately.
Not an over-broad reading. In 2016, Samuel Lelièvre, Thierry Monteil, and Barak Weiss showed that a light source in a polygonal room whose angles (in degrees) are all rational numbers will illuminate the entire polygon, with the possible exception of a finite number of points.
Not automatically Cauchy's Functional Equation. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Illumination problem applies literally inside computational geometry wherever the source-defined carrier and relation can be established. Its documented habitats include:

Original formulation. The original formulation was attributed to Ernst Straus in the 1950s and has been resolved.
Original formulation. Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls.
Penrose unilluminable room. The original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room.
Penrose unilluminable room. He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source.
Polygonal rooms. These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source.
Polygonal rooms. In 1995, Tokarsky found the first polygonal unilluminable room which had 4 sides and two fixed boundary points.

Outside computational geometry, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Illumination problem names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. The strongest recognition evidence in the frozen account is: In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Illumination problem compresses multiple computational geometry details into a stable diagnostic relation. The source shows both the central mechanism—the original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room.—and the practical consequence—this problem was also solved for polygonal rooms by George Tokarsky in 1995 for 2 and 3 dimensions, which showed that there exists an unilluminable polygonal 26-sided room with a "dark spot" which is not illuminated from another point in the room, even allowing for repeated reflections. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computational geometry entities to which the claim applies.
State the relation. Use the source-grounded identity: Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Check operation and conditions. He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source.
Demand recognition evidence. In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately.
Test variation. Change an implementation or setting while preserving in 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Illumination problem transfers literally when a new case preserves the same carrier type, relation, and recognition test. The original formulation was attributed to Ernst Straus in the 1950s and has been resolved. Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls.

Beyond the home domain. No canonical parent is asserted for Illumination problem. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources; recognition evidence → In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately

Applied / In Practice¶

The original formulation was attributed to Ernst Straus in the 1950s and has been resolved. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Original formulation; invariant → Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources; boundary → the case exits the class when these were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source

Structural Tensions¶

T1 — Stable identity versus admissible variation. These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. In 2016, Samuel Lelièvre, Thierry Monteil, and Barak Weiss showed that a light source in a polygonal room whose angles (in degrees) are all rational numbers will illuminate the entire polygon, with the possible exception of a finite number of points. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. In 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Illumination problem literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. The original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Illumination problem distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Illumination problem is mixed or framed-leaning. Its structural side is the repeatable organization summarized by Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. Its framed side is the computational geometry vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls. The original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room. It further constrains recognition and variation through: He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source. In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately.

What is domain-bound. computational geometry supplies the operative entities, technical vocabulary, warrants, and exceptions that make Illumination problem literal. Its documented scope includes the condition that The original formulation was attributed to Ernst Straus in the 1950s and has been resolved. Another bounded application condition is that Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—In 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite.—and future graph densification may discover a defensible relation only if it preserves that boundary.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Illumination problem. The reviewed identity is: Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Neighborhood in Abstraction Space¶

Illumination problem sits in a sparse region of the domain-specific corpus (83^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Named Physical Phenomena & Theoretical Constructs (16 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources?
Cauchy's Functional Equation. The additive functional equation f(x+y)=f(x)+f(y), whose solutions are linear under mild regularity but can be discontinuous and nonmeasurable when arbitrary real-vector-space structure is allowed. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Lumen method. A simplified lighting-design calculation that estimates average horizontal illuminance from lamp lumens, utilization and maintenance factors over an area. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Ray Tracing (Graphics). Synthesize image samples by launching geometric rays through a scene, ordering their intersections, and evaluating visibility and light transport as paths reflect, refract, scatter, or terminate. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Illumination problem remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computational geometry lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Illumination_problem (revision 1333875625).
Preserved source candidate: http://static.nsta.org/pdfs/QuantumV7N3.pdf#page=44
Preserved source candidate: https://www.youtube.com/watch?v=EBgR1FKKRkc
Preserved source candidate: https://www.youtube.com/watch?v=5ILv2YsYHkI
Preserved source candidate: https://www.youtube.com/watch?v=lEl4QNYJQsM&t=8s
Preserved source candidate: https://www.youtube.com/watch?v=xhj5er1k6GQ
Preserved source candidate: https://www.youtube.com/watch?v=x3VluzZTReE
Preserved source candidate: https://www.youtube.com/watch?v=Z_1dSkT1WxU
Preserved source candidate: https://www.youtube.com/watch?v=89ynxoRWtlM

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.