Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

An original classification of obscuration-free telescopes designs unfolded in two dimensions

T0 review · 4 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For two-dimensional unfolded telescopes, the paper's GOFF A nomenclature is exhaustive: every unobscured design with up to four mirrors falls into one of 6, 32, or 288 connected families.

desk verdict Solid math-meets-optics classification with a real reproducibility gap: the necessary invariants are proven, but the sufficiency of the nomenclature and the exact counts 32 and 288 lean on undocumented CAD enumeration and a path-heuristic that needs code, data, or certificates before the claims can be trusted. read the letter →

arxiv 2501.04748 v1 pith:4TR2VIQX submitted 2025-01-08 astro-ph.IM math-phmath.AGmath.MP

Benjamin Aymard , Andrea Delahaye , Audric Drogoul This is my paper · ORCID
classification astro-ph.IMmath-phmath.AGmath.MP MSC 14Q3014P2514P10
keywords PathconnectedcomponentsTopologicalinvariantsSemi-algebraicsetsClassificationReflectiveopticsOpticaldesignCylindricalalgebraicdecompositionObscuration-freetelescopes
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper attempts to convert the search for unobscured two-dimensional telescope designs into a finite, provably complete classification. The central assertion is that every unobscured system with two, three, or four mirrors belongs to exactly one of a small list of topological families: 6, 32, and 288 respectively. The families are separated by topological invariants of the optical path, and each receives a name in a new GOFF A nomenclature that encodes geometry and manufacturability information. If the classification holds, a designer can take one explicit representative per family, run parallel optimizations, and know that no qualitatively distinct unobscured layout was missed.

What carries the argument

The load-bearing object is a semialgebraic model of an unfolded telescope: a configuration is a list of points $(a_0,\dots,a_{n+1})\in(\mathbb{R}^2)^{n+2}$, and the cost function $J(a)$ counts forbidden incidences such as a mirror lying on a ray segment or an aligned grazing triplet. The unobscured set $\widetilde A_n=\{J=0\}$ is open and semialgebraic, so its path-connected components are exactly the design families. Four invariants--rotation sense of consecutive triplets, intersection or non-intersection of non-adjacent ray segments, the sign of their crossing orientation, and a winding number around non-adjacent mirrors--are constant on each component and are recorded in the GOFF A name. Cylindrical algebraic decomposition on the product polynomial $Q_n$ defining $\widetilde B_n$ supplies sample points, and the linear path heuristic tests whether two samples lie in the same component.

What would settle it

Run the enumeration with a different certified implementation of cylindrical algebraic decomposition on $Q_4$, attempt to join every same-name sample pair by a numerically certified path inside $\widetilde A_4$, and compare the invariant signatures of all returned points; a single new signature or unconnectable same-name pair would break the counts.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is Theorem 1: for three-mirror systems in $\widetilde A_3$ and four-mirror systems in $\widetilde A_4$, two unobscured telescopes lie in the same path-connected component if and only if their GOFF A names coincide. The proof bounds the number of components from above by enumerating sample points in the Zariski-open superset $\widetilde B_n$ with cylindrical algebraic decomposition and then joining same-name points by straight-line paths (plus a listed set of intermediate points for four mirrors); it bounds from below by the four invariants encoded in the name. The two bounds are asserted to meet, giving the exhaustive counts 6, 32, and 288, with each class represented by an explicit starting design.

Load-bearing premise

The exhaustive counts 32 and 288 hold only if the computer-algebra routine really returns at least one point per connected component of $\widetilde B_4$, and only if the straight-line and listed intermediate paths between same-name sample points stay inside the unobscured set.

Editorial extensions

If this is right

  • Optimizing one representative from every GOFF A class in parallel yields a comprehensive search: no qualitatively different unobscured layout is left unexplored.
  • For three mirrors, only the $VAVAX_{A,0}$ family and its mirror-symmetric partner can approach zero total tilt, so near-planar three-mirror searches can be restricted to that family.
  • Reading a GOFF A name reveals crossings, rotation directions, and whether a surface sits in a bounded region, so a designer can judge a layout without tracing rays.
  • The method stops at four mirrors because cylindrical algebraic decomposition is doubly exponential in dimension; extending the exhaustive classification to five mirrors requires new algorithmic ideas.
  • If planar symmetry is dropped and systems unfold in three dimensions, a dimension argument leaves a single connected component, so the 6, 32, and 288 counts are specific to two-dimensional unfolding.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A clean next step is to replace the straight-line path heuristic with a certified connectivity algorithm on the CAD adjacency graph, which would promote the counts 32 and 288 from computational-plus-invariant evidence to a fully machine-checked theorem.
  • The same four invariants may classify other planar line-segment arrangement problems beyond optics, such as obstacle-free linkages or multi-joint routing.
  • Since three-dimensional unfolding admits only one connected component, the 2D classes are best understood as manufacturability-motivated subdivisions of a single optical layout space, not as fundamental optical distinctions.
  • One could test the nomenclature's practical promise by counting how often the best optimized performance across 288 four-mirror seeds improves on the best three-mirror seed for a fixed specification.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes an exhaustive classification of two-dimensional unfolded unobscured reflective telescope systems with up to four mirrors. The authors model a telescope by the positions of its mirrors and image plane, define a semialgebraic set fAn of admissible (non-obscured, non-grazing) configurations, and introduce four topological invariants (sense of rotation of consecutive triplets, intersection/non-intersection of flux segments, relative orientation of crossing fluxes, and winding numbers around mirror points). These invariants are assembled into the GOFF A nomenclature. Theorem 1 claims that for three- and four-mirror systems two configurations lie in the same path-connected component of fAn if and only if they have the same GOFF A name, and the paper reports the counts |CC(fA2)|=6, |CC(fA3)|=32, and |CC(fA4)|=288. The counts are obtained by combining Mathematica's SemialgebraicComponentInstances on the Zariski-open set fBn with a linear-path joining heuristic and a list of explicitly chosen intermediate points. The paper also provides one representative configuration per class and argues that these can serve as starting points for parallel optical optimization.

Significance. If the classification is correct, this is a genuinely useful contribution: it replaces brute-force searches of unobscured telescope configurations with a finite, topologically certified list of classes, and each GOFF A name would carry intrinsic geometric and manufacturability information. The necessity direction of the classification is well structured: Propositions 3-6 give clean topological invariants, and the semialgebraic formulation in Proposition 7 is appropriate. The nomenclature being defined directly in terms of the invariants means that matching GOFF A names is equivalent to matching invariants by construction, so the necessity half does not involve circular reasoning. The principal weakness is that the sufficiency half of Theorem 1—the direction that makes the classification exhaustive—rests entirely on undocumented computational steps: the correctness of the CAD component enumeration, the completeness of the linear-path and intermediate-point joining, and the reduction from the CAD upper bound to the invariant count.

major comments (4)
  1. [Theorem 1 and Section 2.3] The sufficiency half of Theorem 1 is not established in the manuscript. The equality |CC(fA4)|=288 depends on the assertions that SemialgebraicComponentInstances returns at least one point in every connected component of fB4, that the linear-path heuristic of Section 3.2 successfully connects all pairs of sample points within each GOFF A class, and that the intermediate points of Section 3.3 close the remaining gaps. None of these steps is accompanied by code, data files, a list of successfully joined pairs, or certificates verifying that the proposed paths stay inside fAn. As written, the claim that the upper bound of 320 is reduced to the invariant count of 144 is an unverifiable assertion. Please provide a reproducible script and machine-checkable verification for the component enumeration and path joining, or state precisely which of these steps are being asserted as computational lemmas rather than proven facts.
  2. [Section 2.3 and Proposition 7] The displayed polynomials Q3 and Q4 do not match the definition of fBn. For fB3, the correct product should include the factor P(1,3,4) in addition to x2x3x4, P(1,2,3), P(1,2,4), and P(2,3,4); the displayed Q3 omits P(1,3,4). For fB4, the correct product should include P(1,3,4) and P(1,4,5) in addition to the factors listed; the displayed Q4 omits both. This is confirmed by the stated degrees deg Q3=11 and deg Q4=22, which are only obtained when the missing factors are included, and by the Mathematica command in Section 3.1, which does include the missing factors. As printed, the polynomials do not define fB3 and fB4, so a reader implementing the CAD step from Section 2.3 would compute on a different set. Please correct the displayed factors and verify that the counts in the text were obtained with the complete product.
  3. [Sections 3.2 and 3.3] The linear-path heuristic is described only in principle. The manuscript does not state how many pairs of the 25,920 CAD sample points were tested, how many straight-line connections failed, which failures were repaired with the intermediate points listed in Section 3.3, or how the intermediate-point paths themselves were verified to remain in fA4. The sentence in Section 2.3 saying 'The proof of the previous results being constructive' is not supported: no construction algorithm is given that would allow a reader to recover the grouping into 144 classes. This is not a minor omission, because the reduction from the CAD upper bound to the claimed count is exactly where the sufficiency of the GOFF A nomenclature is established.
  4. [Section 2.1 and Theorem 1] The statement 'In hindsight, it will be seen that the four invariants ... are sufficient' and the phrase 'From the foregoing' in Theorem 1 suggest that the sufficiency direction is a mathematical consequence of the preceding propositions, but the paper only proves necessity for Propositions 3-6. The sufficiency is supplied by the computational enumeration and path joining, not by an analytic argument. The theorem should be stated as a computational theorem whose validity depends on the reliability of the CAD and path-joining computations, or an analytic proof of sufficiency should be supplied. As it stands, the wording overstates what has been demonstrated.
minor comments (5)
  1. [General] There are numerous typographical errors, including 'componants' (Section 2.1), 'coresponding' (Section 2.3), 'miurrors' (Introduction), 'litterature' (Introduction), 'univoque' (Introduction), 'propostion' (Appendix), 'pratical' (Conclusion), and 'sucessfully' (Introduction). A careful proofreading pass is needed.
  2. [Definitions 1 and 4] The notation '(a0; a1]' is used without a formal definition. Earlier '(a; b)' denotes the entire line through a and b, while '[a; b]' denotes the segment, so the half-open notation is ambiguous, especially because the text describes the incoming ray as an 'infinite half straight line'. Please define this ray explicitly, for example as {a1 + t(a1-a0), t ≥ 0} or an equivalent parameterization.
  3. [Figure 5] The names in Figure 5, such as 'VAXA,0XA,01', are difficult to parse without a legend explaining the subscripts and superscripts. Consider adding a small legend or a table that decodes the notation for the three-mirror case before presenting the four-mirror atlas.
  4. [Section 2.3] The sentence 'The proof of the previous results being constructive, we not only obtain the number of families but also a representative for each connected component' is grammatically incomplete and, as noted above, the constructive nature is not demonstrated. Please rephrase and support it with the promised data or an explicit algorithm.
  5. [Conclusion] The conclusion states that the nomenclature is 'mathematically proved' and describes the classification as exhaustive. Given that the sufficiency direction depends on computational steps that are not documented, the wording should be softened to reflect the actual status of the proof unless the computational evidence is supplied.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: GOFF A names encode independently proven invariants, and counts are obtained by comparing CAD upper bounds with invariant-based lower bounds, not by fitting or self-citation.

full rationale

The classification chain is self-contained. The topological invariants in Propositions 3-6 are proven directly from the definition of fAn using continuity and the intermediate value theorem, with detailed proofs in the appendices. The GOFF A nomenclature is explicitly constructed from those invariants (Section 2.2), so matching names is equivalent to matching the invariant tuple by construction. Theorem 1 has two parts: necessity is supplied by the invariants; sufficiency is established computationally via CAD sample points, straight-line path tests, and listed intermediate points that reduce the CAD upper bound to the invariant lower bound. This is a genuine upper/lower bound comparison, not a circular reduction: the path tests independently check that sample points sharing a GOFF A name are actually path-connected in fAn. No parameter is fitted to a subset of data and then renamed a prediction, and no load-bearing claim rests on a self-citation — the only author self-citation, [21], is a complementary classification, not used to prove Theorem 1 or the counts 6, 32, and 288. The paper's real weakness is that the sufficiency half and the counts 32 and 288 depend on unverified, unreleased CAD and path-joining computations; that is a reproducibility and verification gap, not circularity. A self-contained derivation with a computational verification gap therefore receives a circularity score of 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters are fitted; the model is purely geometric. The central claim depends on the zero-pupil modeling idealization and on the correctness and completeness of computer algebra computations (Mathematica CAD) and of a partially documented path-joining procedure.

assumptions (3)
  • domain assumption The zero-pupil-diameter point-ray model captures the topological classification of obscuration-free systems relevant for real telescopes.
    The entire definition of An/fAn treats mirrors as points and rays as line segments; obscuration occurs only when a point lies on a segment. The paper states 'by reducing the diameters of the entrance pupils to zero' without proof that small but finite pupils preserve the connected-component structure.
  • domain assumption Mathematica's SemialgebraicComponentInstances returns at least one point per connected component of the semialgebraic set {Q_n > 0} and is correct.
    Used in Sec. 3.1 to obtain the upper bounds; the paper does not verify the implementation or provide an independent CAD certificate.
  • domain assumption The 'linear path heuristic' checks path membership exactly (i.e., that P∘T does not vanish on [0,1]) using exact arithmetic, and the listed intermediate points suffice to connect all relevant components.
    The paper does not describe the exact verification algorithm or provide the full set of successful paths.

how reviews work

0 comments
Cite this review

Pith. "Pith review of An original classification of obscuration-free telescopes designs unfolded in two dimensions." pith.science (2026). https://pith.science/paper/4TR2VIQX

@misc{pith2026250104748,
  author       = {Pith},
  title        = {Pith review of: An original classification of obscuration-free telescopes designs unfolded in two dimensions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4TR2VIQX}},
  note         = {Machine review of arXiv:2501.04748}
}
read the original abstract

In this article we propose an original classification method for unobscured imaging systems unfolded in two dimensions. This classification is based on a study of off-axis properties, and relies on topology and algorithm of real algebraic geometry to find at least one instance by connected component of a semialgebraic set. Our corresponding nomenclature provides intrinsic information about the system, in terms of geometry and manufacturability. The proposed systems for each name of the nomenclature, can be used as starting points for parallel optimizations, allowing for a much more comprehensive search of an unobscured solution, given a set of specifications. We exemplify our method on three and four mirrors imaging systems.

Figures

Figures reproduced from arXiv: 2501.04748 by the authors.

Figure 1
Figure 1. Non admissible cases according to J (1). With (a) for obscuration and (b) for grazing. Let us denote CC(An) these path connected componants, thus An = F C∈CC(An) C. Let us comment the expression of the obscuration cost J (1). Its first term is not null if there exists a mirror obscuring the i-th flux (see [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Three systems composed of the source S = a0 = b0 = c0 = (0, 0) , a mirror at a1 (resp. b1, c1) and the image at a2 (resp. b2, c2). The third system is the mean of the first and second system ie. (c0, c1, c2) = 1 2 (a0, a1, a2) + 1 2 (b0, b1, b2) Yet it does not share the same connected component (as shown by the sense of rotation, cf. Proposition 3.) To investigate the connected components of An, we first study thos… view at source ↗
Figure 3
Figure 3. figure 3a (resp. figure 3b) represents parts of two systems that are, by Proposition 4 [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Two systems with 4 mirrors that are, by Proposition 6. not in the same path connected [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Off axis classification: all topologies of 3 mirror telescopes [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: Off axis classification: all topologies of 4 mirrors telescopes (1 on 6) [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 7
Figure 7. Figure 7: Off axis classification: all topologies of 4 mirrors telescopes (2 on 6) [PITH_FULL_IMAGE:figures/full_fig_p013_7.png]
Figure 8
Figure 8. Figure 8: Off axis classification: all topologies of 4 mirrors telescopes (3 on 6) [PITH_FULL_IMAGE:figures/full_fig_p014_8.png]
Figure 9
Figure 9. Figure 9: Off axis classification: all topologies of 4 mirrors telescopes (4 on 6) [PITH_FULL_IMAGE:figures/full_fig_p015_9.png]
Figure 10
Figure 10. Figure 10: Off axis classification: all topologies of 4 mirrors telescopes (5 on 6) [PITH_FULL_IMAGE:figures/full_fig_p016_10.png]
Figure 11
Figure 11. Figure 11: Off axis classification: all topologies of 4 mirrors telescopes (6 on 6) [PITH_FULL_IMAGE:figures/full_fig_p017_11.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A certified classification of first-order controlled coaxial telescopes

    astro-ph.IM 2024-12 conditional novelty 7.0 of 10

    For three-mirror coaxial telescopes, the first-order admissible solution set splits into finitely many connected components, each named uniquely by a signature of magnification and curvature signs.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · cited by 1 Pith paper

  1. [1]

    Moebius, A. F. Theorie der elementaren verwandtschaften, Ber. Verh. Sachs. , 15, (1863)

    work page

  2. [2]

    Real and Complex Analysis , Mc-Graw-Hill, Inc

    Rudin, W. Real and Complex Analysis , Mc-Graw-Hill, Inc. , (1987)

    work page 1987

  3. [3]

    Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition, Springer LNCS , 33, (1975)

    Collins, G.E. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition, Springer LNCS , 33, (1975)

    work page 1975

  4. [4]

    & Thistlethwaite, M.B., Classification of knot projections, Topology Appl., 16, 19-31 (1983)

    Dowker, C.H. & Thistlethwaite, M.B., Classification of knot projections, Topology Appl., 16, 19-31 (1983)

    work page 1983

  5. [5]

    Reflective Optics, Academic Press, (1991)

    Korsch, D. Reflective Optics, Academic Press, (1991)

    work page 1991

  6. [6]

    J. M. Howard, B. D. Stone, Three-mirrors freeform imagers, Applied Optics, 153, (2000)

    work page 2000

  7. [7]

    Uller, M

    Chauvin, C. Uller, M. and Weber, A., An Application of Quantifier Elimination to Mathematical Biology, Computer Algebra in Science and Engineering. , 287-296, (1994)

    work page 1994

  8. [8]

    & Conner, G.R

    Cannon, J.W. & Conner, G.R. On the fondamental groups of one-dimensional spaces, Topology Appl., 153, 2648-2672 (2006)

    work page 2006

Show all 21 references
  1. [9]

    Algorithms in Real Algebraic Geometry, Algorithms and Computations in Mathematics , 10, (2006)

    Basu, S., Pollack, R., Roy, M-F. Algorithms in Real Algebraic Geometry, Algorithms and Computations in Mathematics , 10, (2006)

    2006

  2. [10]

    Ideals, Varieties, and Algorithms, Springer, (2015)

    Cox, D.A., Little, J., & O’Shea, D. Ideals, Varieties, and Algorithms, Springer, (2015)

    2015

  3. [11]

    Chrisp, M., Primeau, B. & M. Echter, Imaging freeform optical systems designed with NURBS, Optical Engineering, 55, (2016). Property .This document is not to be reproduced, modified, adapted, published translated in any material form in whole or in part nor disclosed to any th...

    2016

  4. [12]

    & Rolland, J

    Bauer, A., Schiesser, E. & Rolland, J. Starting geometry creation and design method for freeform optics, Nature Communications, 9, (2018)

    2018

  5. [13]

    Papa, J.C., Howard, J. M. & Rolland, J. Imaging with three spherical mirrors, Optical Design and Engineering (2018)

    2018

  6. [14]

    & Gross, H

    Cai, D. & Gross, H. Obscuration elimination in three-dimensional nonsymmetrical optical systems , J. Phys. Photonics , 1, (2019)

    2019

  7. [15]

    & Saefy El Din, M

    Lairez, P., Mezzarobba, M. & Saefy El Din, M. Computing the volume of compact semi-algebraic sets, International Symposium on Symbolic and Algebraic Computation , (2019)

    2019

  8. [16]

    & Schicho, J

    Capco, J., Safey Eld Din, M. & Schicho, J. Robots, computer algebra and eight connected components Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 62–69, (2020)

    2020

  9. [17]

    & Zhu, J

    Zhang, B., Jin, G. & Zhu, J. Towards automatic freeform optics design: coarse and fine search of the three-mirror solution space , Light:Science and Applications , 56, (2021)

    2021

  10. [18]

    & Rolland, J

    Papa, J., Howard, J. & Rolland, J. Survey of the four-mirror freeform imager solution space, Optics Express, 29, (2021)

    2021

  11. [19]

    Optical imaging systems with freeform surfaces : optimization algorithms study and freeform surfaces metrology, PhD thesis, Universit´ e de Lyon, (2021)

    2021

  12. [20]

    Wolfram Research, Inc., Mathematica, Version 13.2, (2022)

    2022

  13. [21]

    org/ abs/ 2412

    Drogoul, A., A certified classification of coaxial first-order controlled telescopes, https: // arxiv. org/ abs/ 2412. 11546, (2024) Property .This document is not to be reproduced, modified, adapted, published translated in any material form in whole or in part nor disclosed ...

    2024

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.