Pith. sign in

REVIEW 3 major objections 4 minor 22 references

A certified classification of first-order controlled coaxial telescopes

T0 review · 3 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read Three-mirror telescope designs split into exact deformation classes

desk verdict The approach is serious and novel, but the printed 'connected components' are internally disconnected, so the classification is not yet certified. read the letter →

arxiv 2412.11546 v2 pith:B5CZJFH4 submitted 2024-12-16 astro-ph.IM math-phmath.AGmath.MP

Audric Drogoul This is my paper · ORCID
classification astro-ph.IMmath-phmath.AGmath.MP MSC 14Q3014P2514P10
keywords three-mirrortelescopesfirst-orderopticssemi-algebraicsetsconnectedcomponentstopologicalinvariantsreflectiveopticaldesignclassification
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 claims that the admissible first-order configurations of three-mirror focal and afocal telescopes form a semi-algebraic set whose connected components can be counted and described exactly, not just sampled heuristically. The paper derives the first-order optical equations from a transfer-matrix formalism, then proves that for $N=3$ mirrors the solution space splits into finitely many deformation classes, with $6$ classes in the focal $f=1$ codimension-2 case, $4$ in the focal $f=-1$ case, $4$ in the afocal codimension-2 case, and further classes in codimension 3. It introduces a topological invariant $S$ recording the signs of magnifications and curvatures, shows that $S$ is constant on each connected component, and proves exactness for these cases. If correct, optical designers can explore one representative per class and know that every first-order topology has been covered, since continuous deformation cannot leave a class.

What carries the argument

The load-bearing object is the triangular quadratic system $\tilde{f}$ of Assumption A2: after a Groebner basis reduction, the first-order equations take the form $A_1x_1^2+B_1x_1+C_1$, $A_kx_k+B_k(x_1)=0$, and $x_nx_{n-1}=C_0$, with coefficients in the parameter ring. This shape produces two continuous branch solutions $\xi^{(\epsilon)}$ over the parameter domain, so the solution space $E$ is the union of two graphs homeomorphic to their projections, glued along the critical locus $\Delta=0$. Algorithm 1 combines this with exhaustive sampling and a merge step to list the connected components, and the signature $S$ labels them.

What would settle it

For the focal $f=1$ codimension-2 case, recompute the Groebner basis of $I+\langle Q_1\rangle$ for parameters satisfying $q_1=(1+d_3)^2-d_2=0$ and check whether the real fiber contains any solution with $\Omega_1\neq 1$; such a point would violate Assumption A4. More globally, run a numerical path search inside $E$ between the paper's sample points $(-10,2,-2)$ and $(-5,2,-2)$, which carry the distinct names PP010 and PP011; any continuous admissible path found between them would disprove exactness of $S$.

Watch

Extended reading notes

Core claim

The central claim is that for three-mirror systems satisfying the usual first-order conditions, the signature $S$ of Definition 3.3 is an exact topological invariant on the admissible set $E$: two configurations are connected by a continuous admissible deformation if and only if they have the same signs of magnifications and curvatures. The paper establishes this by showing that Algorithm 1 outputs exactly the connected components of $E$, giving explicit semi-algebraic descriptions and sample points for each component in the focal and afocal cases at codimensions 2 and 3. In particular, the paper argues that earlier classifications based only on curvature sign patterns are not exact invariants, while the magnification-and-curvature signature is exact.

Load-bearing premise

The whole classification collapses if Assumption A4 is false for any single curvature-exclusion condition, because the paper checks that assumption only by listing computer-algebra output rather than shipping the underlying computations; the sampling routine in Algorithm 1 is also assumed to be exhaustive without independent logs.

Editorial extensions

If this is right

  • Focal $f=1$ telescopes with two first-order constraints have exactly six connected components, named PP010, PP110, PP001, PP011, PP100, and PP101; focal $f=-1$ has four, and afocal codimension-2 systems have four.
  • No continuous first-order deformation can turn one named class into another, so the class of a starting design is an invariant through local optimization.
  • Designers can sample the explicit semi-algebraic descriptions to get a finite certified list of starting points, with one representative per deformation class.
  • The exactness proof implies that curvature-sign-only nomenclatures used in earlier classification work miss or merge genuine classes.

Reading between the lines

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

  • If the same triangular structure persists for four mirrors, the identical pipeline would yield a finite certified list of classes for $N=4$, which the paper announces as future work.
  • The exactness of $S$ for $N=3$ suggests that for larger $N$ any exact invariant must include the signs of all magnifications, not just curvatures, since the magnification signs are what distinguish branches that touch only at degenerate singular points.
  • Publishing the Groebner bases and sampling certificates behind Assumption A4 would let the classification be re-verified by independent computation; until then, the certified status rests on the listed outputs.
  • A direct numerical search for paths between the named sample points would provide an independent check of exactness.
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

3 major / 4 minor

Summary. The paper proposes a certified classification of first-order coaxial three-mirror telescopes by studying the connected components of the semi-algebraic set of admissible solutions to the focal/afocal first-order equations. The author introduces a triangular polynomial system, proves a structural theorem (Theorem 3.4) describing the solution set as the union of graphs of continuous branches, and proposes an algorithm (Algorithm 1) to merge these branches into connected components. A signature invariant S based on signs of magnifications and curvatures is defined, and the paper claims that S is exact for N=3, yielding six components for focal codimension 2 with f=1, four for focal f=-1, four for afocal codimension 2, five for focal codimension 3 with f=1, one for f=-1, and four for afocal codimension 3. The paper includes explicit polynomial data, sample points, and figures for each claimed component.

Significance. If the classification were correct and fully certified, the paper would provide a valuable bridge between real algebraic geometry and optical design: it would give the first exact, machine-checkable description of the deformation classes of first-order coaxial telescopes and a meaningful nomenclature for practitioners. The explicit transfer-matrix derivation, the triangular form of the polynomial systems, the detailed proof of Theorem 3.4 in Appendix A, and the use of a topological invariant are genuine strengths. The result is also falsifiable: the claimed component counts and the semi-algebraic descriptions can be checked independently. However, the significance is substantially weakened by the internal inconsistency described below and by the fact that the certification relies on unshipped Groebner-basis and sampling computations.

major comments (3)
  1. [§3.3.1, focal codimension 2, f=1] The displayed component C_2^(-1) = PP010(-1) is defined as h^{-1}({d1<0, d2>0, d3≤-1, q3<0}) ∪ h^{-1}({d1<0, -1≤d3<0, (1+d3)^3 < d2 < (1+d3)}). These two parameter sets are separated: the second set is empty at d3=-1, and every sequence in the second set converging to d3=-1 has d2→0, whereas every point of the first set has d2>0. Hence no point of the first set lies in the closure of the second and no point of the second lies in the closure of the first. Since h^{-1} is a homeomorphism onto its graph, C_2^(-1) is disconnected. This directly contradicts the assertion that the outputs of Algorithm 1 are the connected components of E and that S is exact; the signature PP010 would occur on at least two distinct connected components.
  2. [§3.3.2, afocal codimension 3] The same separation pattern appears in the displayed component C_2^(-1) = NP110(-1), which is written as h^{-1}({A2>0, G<-1, q2^(a)>0}) ∪ h^{-1}({Δ≥0, -1≤G<0, q2^(a)<0}). At G=-1 the first set requires q2^(a)>0 and the second requires q2^(a)<0, so the two pieces do not meet, and a path from one to the other would have to pass through G=-1 with q2^(a)=0, a point excluded from both sets. Thus this displayed component is also disconnected as printed.
  3. [§3.2, Remark 3.4 and Algorithm 1] The verification of Assumption A4 is load-bearing for Theorem 3.5 and for the final component counts, but the paper only states that the reductions were obtained 'using Theorem 3.1 and a Groebner basis computation' and lists selected outputs. No Groebner basis scripts, computer algebra code, or computation logs are provided, and the same applies to the exhaustive CAD or Morse sampling used in Algorithm 1. Without these certificates, the claimed certification cannot be independently checked, even if the internal inconsistency above were repaired.
minor comments (4)
  1. [§3.1] There is a typo in 'Nulltstellensatz' (should be 'Nullstellensatz').
  2. [Proof of Lemma 3.6] The phrase 'GrantH− (a) of Assumption A3' is unclear; it should be 'Grant (H)-(a) of Assumption A3'.
  3. [§3.3.1] In the focal codimension-2 case, the text says 'we get that G_ϵ = Fo\∪_k W_k^{(ϵ)}' but then for f=-1 it uses W_1^(ϵ) and W_2^(ϵ) with different definitions; the notation should be aligned.
  4. [Figure 7] The quantities d⋆_p and d†_p are defined only in the caption; they should be defined in the main text before the figure is referenced.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the connected-component derivation is based on explicit triangularization and an external real-root classification algorithm, and the topological invariant is an audit label rather than an input that forces the output.

full rationale

The derivation chain starts from first-order optical equations (Section 2), rewrites them as a triangular system with explicit polynomials (Section 3.2), constructs the two branch solutions via the discriminant root formula, proves the homeomorphism between each branch graph and its parameter domain (Theorem 3.4), and then samples the parameter domains with the external algorithm of [15] and merges over EH (Algorithm 1). The classification output is therefore not assembled from the claimed invariant. Definition 3.3's signature S is defined before the component computation and is constant on components by Lemma 3.7; it is used for naming and for the final exactness audit, not to construct the branch sets or to set the qk sign conditions. No fitted parameter is later called a prediction, and no input quantity is defined in terms of the output. The only self-citation, [1] (Aymard, Delahaye, Drogoul), concerns off-axis nomenclature and is not load-bearing for the connected-component theorems, so under the hard rules it does not raise the circularity score. Per the reviewing rule, I explicitly flag two non-circularity concerns that do not affect this score: Assumption A4 is asserted via 'using Theorem 3.1 and a Groebner basis computation' (Section 3.3.1) without shipped logs, and the displayed C_2^(-1) parameter union for focal codim-2 f=1 appears separated at d3=-1, which, if correct, would be an internal correctness failure rather than circularity.

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

No numbers are fitted to data. The normalizations f=+-1 and d1=-1 are unit choices, not fitted parameters; all remaining quantities are variables of the polynomial system. No new physical entities are postulated. The signature S and nomenclature are mathematical definitions, not entities with independent falsifiable handles.

assumptions (8)
  • domain assumption First-order paraxial mirror equation 1/s + 1/s' = 2c with signed distances.
    Invoked in Section 2.1 to derive Eq (1); all classification results concern this paraxial model.
  • domain assumption Transfer matrix ray propagation model for thin spherical mirrors with vergence V_k = 2(-1)^k c_k.
    Used in Proposition 2.1 for Eqs (2)-(4); the paper deliberately restricts to first-order optics.
  • domain assumption Focal/afocal conditions, Petzval zero, and telecentricity or pupil-position equations are the target design constraints.
    Sections 2.2 and 2.3 define E through these specific equations; other constraints would give a different set.
  • ad hoc to paper Assumption A2: the system admits a triangular form with the gcd conditions in Eq (16).
    Theorem 3.4 requires A2; the author asserts it holds for all four optical cases without fully publishing the verification.
  • ad hoc to paper Assumption A3: non-degeneracy conditions (H) in Eq (22).
    Finite fibers and branch extension depend on A3; the text says 'We easily check Assumption A3' in Section 3.3 without detailed proof.
  • ad hoc to paper Assumption A4: projection of V(Q_k) reduces to V(q_k, alpha_k x1 + beta_k, f2, ..., fn+1).
    Theorem 3.5 and the component enumeration depend on A4; verification is by unshown Groebner basis computations in Remark 3.4.
  • domain assumption Exhaustiveness and correctness of CAD or Morse sampling algorithms from [15, 8, 19].
    Algorithm 1 relies on Sampling to detect all connected components of G_epsilon; no certificates or logs are shipped.
  • standard math Standard theorems: Nullstellensatz, elimination/extension/closure, implicit function theorem.
    Used throughout Section 3.1 as standard background without proof.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A certified classification of first-order controlled coaxial telescopes." pith.science (2026). https://pith.science/paper/B5CZJFH4

@misc{pith2026241211546,
  author       = {Pith},
  title        = {Pith review of: A certified classification of first-order controlled coaxial telescopes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/B5CZJFH4}},
  note         = {Machine review of arXiv:2412.11546}
}
read the original abstract

This paper is devoted to an intrinsic geometrical classification of three-mirror telescopes. The problem is formulated as the study of the connected components of a semi-algebraic set. Under first order approximation, we give the general expression of the transfer matrix of a reflexive optical system. Thanks to this representation, we express the semi-algebraic set for focal telescopes and afocal telescopes as the set of non-degenerate real solutions of first order optical conditions. Then, in order to study the topology of these sets, we address the problem of counting and describe their connected components. In a same time, we introduce a topological invariant which encodes the topological features of the solutions. For systems composed of three mirrors, we give the semi-algebraic description of the connected components of the set and show that the topological invariant is exact.

Figures

Figures reproduced from arXiv: 2412.11546 by the authors.

Figure 1
Figure 1. Geometrical illustration of (1). First order formula: [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Topological invariant features. (a) Positive and (b) Negative magnifications. (c) Convex [PITH_FULL_IMAGE:figures/full_fig_p017_2.png] view at source ↗
Figure 3
Figure 3. Focal codim 2, f = 1 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 third party without the prior written permission of Thales Alenia Space. © 2024 Thales Alenia Space all rights reserved [PITH_FULL_IMAGE:figures/full_fig_p024_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Focal codim 2, f = −1 ϵ = −1 ϵ = 1 G d2 A2 NP101 P N101 G d2 A1 P N011 NP110 [PITH_FULL_IMAGE:figures/full_fig_p025_4.png]
Figure 5
Figure 5. Figure 5: Afocal codim 2 f = 1 f = −1 • (−f, f) d1 d2 B1 q1 q2 q3 P P010 P P011 P P110 P P001 P P101 d1 d2 P N011 [PITH_FULL_IMAGE:figures/full_fig_p025_5.png]
Figure 6
Figure 6. Figure 6: Focal codim 3, f = ±1 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 third party without the prior written permission of Thales Alenia Space. © 2024 Thales Alenia Sp…
Figure 7
Figure 7. Figure 7: Afocal of codim 3, d ⋆ p = −z0+4d1 9 and d † p = −G2 z0 + Gd1 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 third party without the prior written permission of Thal…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 17 canonical work pages

  1. [1]

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

    B. Aymard, A. Delahaye, and A. Drogoul, An original classification of obscuration-free telescopes designs unfolded in two dimensions, (2025), https://arxiv.org/abs/2501.04748

    work page Pith review arXiv 2025

  2. [2]

    Basu, Algorithms in real algebraic geometry: A survey , 2014, https://arxiv.org/abs/ 1409.1534

    S. Basu, Algorithms in real algebraic geometry: A survey , 2014, https://arxiv.org/abs/ 1409.1534

    arXiv 2014

  3. [3]

    S. Basu, R. Pollack, and M.-F. Roy , Algorithms in Real Algebraic Geometry , vol. 10, 2016

    work page 2016

  4. [4]

    Bauer, E

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

    work page 2018

  5. [5]

    Bonnard, M

    B. Bonnard, M. Chyba, A. Jacquemard, and J. Marriott , Algebraic geomet- ric classification of the singular flow in the contrast imaging problem in nuclear mag- netic resonance , Mathematical Control and Related Fields, 3 (2013), pp. 397–432, https://doi.org/10.3934/mcrf.2013.3.397, https://www.aimsciences.org/article/ id/40385fc1-d904-4651-99ca-d9278cc14819

    work page doi:10.3934/mcrf.2013.3.397 2013

  6. [6]

    Capco, M

    J. Capco, M. S. E. Din, and J. Schicho , Robots, computer algebra and eight connected components, in Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, ISSAC ’20, New York, NY, USA, 2020, Association for Computing Machin- ery, p. 62–69, https://doi.org/10.1145/3373207.3404048, https://doi.org/10.1145/ 3373207.3404048

    arXiv 2020

  7. [7]

    Chauvin, M

    C. Chauvin, M. Uller, and A. Weber , An application of quantifier elimination to math- ematical biology, Computer Algebra in Science and Engineering, (1994), pp. 287–296

    work page 1994

  8. [8]

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

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

    work page 1975

Show all 22 references
  1. [9]

    D. Cox, J. Little, and D. O’Shea , Ideals, varieties, and algorithms. an introduction to computational algebraic geometry and commutative algebra, (2007), https://link.springer. com/book/10.1007/978-0-387-35651-8

    2007 doi

  2. [10]

    Faug`ere and M

    J.-C. Faug`ere and M. Safey El Din , De l’alg` ebre lin´ eaire ` a la r´ esolution des syst` emes polynomiaux, in Math´ ematiques Appliqu´ ees (L3), Pearson, 2009, pp. 331–388,https://hal. science/hal-01298887

    2009

  3. [11]

    Gaillard and M

    L. Gaillard and M. S. E. Din, Solving parameter-dependent semi-algebraic systems, 2024, https://arxiv.org/abs/2402.07782, https://arxiv.org/abs/2402.07782

    2024 arXiv

  4. [12]

    Galeani, D

    S. Galeani, D. Henrion, A. Jacquemard, and L. Zaccarian , Design of marx generators as a structured eigenvalue assignment , Automatica, 50 (2014), pp. 2709–2717, https://doi.org/https://doi.org/10.1016/j.automatica.2014.09.003, https://www. sciencedirect.com/science/article/pi...

    2014 doi

  5. [13]

    Korsch, Reflective Optics, 1991

    D. Korsch, Reflective Optics, 1991

    1991

  6. [14]

    Lairez and M

    P. Lairez and M. Safey El Din , Computing the dimension of real algebraic sets , in Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computa- tion, ISSAC ’21, ACM, July 2021, p. 257–264,https://doi.org/10.1145/3452143.3465551, http://dx.doi.org/10.1145...

    2021

  7. [15]

    H. P. Le and M. Safey El Din , Solving parametric systems of polynomial equations over the reals through hermite matrices , Journal of Symbolic Computation, 112 (2022), pp. 25–61, https://doi.org/https://doi.org/10.1016/j.jsc.2021.12.002, https:// www.sciencedirect.com/science...

    2022 doi

  8. [16]

    J. C. Papa, J. M. Howard, and J. P. Rolland, Survey of the four-mirror freeform imager solution space, Opt. Express, 29 (2021), pp. 41534–41551, https://doi.org/10.1364/OE. 442943, https://opg.optica.org/oe/abstract.cfm?URI=oe-29-25-41534

    2021 doi

  9. [17]

    Perez, Optique Fondements et Applications

    J.-P. Perez, Optique Fondements et Applications

  10. [18]

    Pr´ebet, M

    R. Pr´ebet, M. S. E. Din, and ´Eric Schost, Computing roadmaps in unbounded smooth real algebraic sets i: connectivity results , 2023, https://arxiv.org/abs/2203.03961

    2023 arXiv

  11. [19]

    Safey El Din and E

    M. Safey El Din and E. Schost, Polar varieties and computation of one point in each con- nected component of a smooth real algebraic set, in Proceedings of the 2003 International Sym- posium on Symbolic and Algebraic Computation, ISSAC ’03, New York, NY, USA, 2003, As- sociati...

    2003

  12. [20]

    Trumper, A

    I. Trumper, A. Q. Anderson, J. M. Howard, G. West, and D. W. Kim , Design form classification of two-mirror unobstructed freeform telescopes , Optical Engineering, 59 (2020), 025105, p. 025105, https://doi.org/10.1117/1.OE.59.2.025105

    2020 doi

  13. [21]

    N. N. Vorobjov, Complexity of computing the local dimension of a semialgebraic set, Journal of Symbolic Computation, 27 (1999), p. 565–579

    1999

  14. [22]

    Yang and B

    L. Yang and B. Xia , Real solution classification for parametric semi-algebraic systems , in Algorithmic Algebra and Logic, 2005, https://api.semanticscholar.org/CorpusID: 17475567. Property . This document is not to be reproduced, modified, adapted, published translated in an...

    2005

Pith tools

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