Geometric Root Calculators: Radical supports of orders five and nine and real-degree enclosures in the Pandrosion rectangle

Primarily AI-generated textHuman understanding: some partsmath.NA — Numerical Analysismath.MG — Metric Geometrycs.NA — Numerical Analysis

Contributed by Ivan BESEVIC ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

We study ruler-and-compass iterations for the positive root X1/pX^{1/p} that share one rectangle, one power stage and one readout, and differ only in a support line. Every support approximates the same target function κ∗(t)=(t−1)/(t1/p−1)\kappa_*(t)=(t-1)/(t^{1/p}-1) of the residual tt, and the contact order of the approximation fixes the order of the iteration. Besides the classical supports of orders one to four we treat three radical supports. A decentered arc gives a globally monotone fifth-order iteration. Two supports have local order exactly nine for every real p>2p>2 and converge monotonically from every positive start: a support built from two successive mean proportionals, with error constant 7/6487/648 for cube roots, and a combination of the arithmetic mean, the geometric mean and one conic mean of 11 and tt, with error constant 23/2073623/20736 for cube roots, drawn with three arcs. For integer p≥3p\ge 3 one step costs at most 10p+910p+9 elementary traces for the decentered arc, 10p+1110p+11 for the three-mean support and 10p+5910p+59 for the nested support; measured by the efficiency index, and under the stated counting conventions, the three-mean support is preferable for every p≥3p\ge3. We then separate what is a finite construction from what is only a scalar statement: the fast iterations are finite constructions for rational degrees, whereas for irrational pp a single step is not. For arbitrary real p≠0p\neq 0 a power-free subdivision with one final Padé readout encloses the root with relative width at most z5/256z^5/256 in at most 15n+6315n+63 traces after nn subdivisions (for X>1X>1, p≥1p\ge 1). Global convergence and the local orders with their constants, for the three radical supports and every real p>2p>2, are checked in Lean, as are the degree, approximation and efficiency statements; the drawing inventories are written protocols.

Author comments: Version 29, a revision of V28. New in this version: the three-mean support of Section 5, with its Lean proofs, its construction and its inventory; the comparisons of Section 6 are updated. The verifier anc/verify_v29.py recomputes the constants, identities and tables (SymPy, mpmath). LaTeX sources, verifiers and the Lean 4 / Mathlib formalization: https://github.com/ivan-fr/pandrosion

Provenance statement

Prepared with the assistance of the AI systems ChatGPT (OpenAI) and Claude (Anthropic), used for derivations, proof development, figures and manuscript preparation, as stated in the footnote on the first page. Global convergence and the local orders with their constants for the three radical supports, and the degree, approximation and efficiency statements, are checked in Lean 4 with Mathlib (repository linked in the author comments). Constants, identities and tables are recomputed by anc/verify_v29.py with SymPy and mpmath. Section 9 states, claim by claim, which results are formal proofs, written proofs, computer-algebra identities or numerical checks. The author is responsible for the claims and their attribution.

Tools used

OpenAI
ChatGPT
Anthropic
Claude Code
Lean
LeanVersion 4.33.1
Python
SymPy and mpmath

References

  1. Pappus of Alexandria. Book III of the Mathematical Collection . English translation by John B. Little, following Hultsch; College of the Holy Cross, Bookshelf 63, 2023. https://crossworks.holycross.edu/hc_books/63/.link
  2. Mickaël Launay. Pandrosion et la duplication du cube. Micmaths, video presentation, 2024. https://www.youtube.com/watch?v=7T4neM660SM. Rectangle construction and correction, approximately 16:37--19:10.link
  3. Alexei V. Sergeev and David Z. Goodson. Summation of asymptotic expansions of multiple-valued functions using algebraic approximants: application to anharmonic oscillators. J. Phys. A: Math. Gen. 31:4301--4317, 1998. https://avsergeev1.narod.ru/papers_37_iop_paper.pdf.link
  4. Euclid. Elements , Book VI, Proposition 13. Online edition by David E. Joyce, Clark University. https://mathcs.clarku.edu/~djoyce/elements/bookVI/propVI13.html. Accessed 17 October 2026.link
  5. Ivan Besevic. Real exponents: geometric subdivision. Pandrosion Geometry Workshop, companion interactive construction, 2026. https://ivan-fr.github.io/pandrosion/gallery/geometric-subdivision.html. Local source snapshot included with the V26-S supplement.link
  6. NIST Digital Library of Mathematical Functions. Section 3.11(iv): Padé approximations. https://dlmf.nist.gov/3.11#iv. Accessed 17 October 2026.link
  7. George A. Baker, Jr. and Peter Graves-Morris. Padé Approximants , 2nd ed. Encyclopedia of Mathematics and its Applications 59, Cambridge University Press, 1996. doi:10.1017/CBO9780511530074. In particular Section 1.5, Theorems 1.5.2--1.5.3, on argument and value homographic invariance.DOI
  8. J. F. Traub. On a class of iteration formulas and some historical notes. Comm. ACM 4(6):276--278, 1961. doi:10.1145/366573.366606.DOI
  9. J. F. Traub. Iterative Methods for the Solution of Equations . Prentice-Hall, 1964.
  10. A. M. Ostrowski. Solution of Equations and Systems of Equations . Academic Press, New York, 1960.
Show all 28 referencesShow fewer references
  1. Walter Gander. On Halley's iteration method. Amer. Math. Monthly 92(2):131--134, 1985. doi:10.2307/2322644.DOI
  2. T. R. Scavo and J. B. Thoo. On the geometry of Halley's method. Amer. Math. Monthly 102(5):417--426, 1995. doi:10.2307/2975033.DOI
  3. A. Melman. Geometry and convergence of Euler's and Halley's methods. SIAM Review 39(4):728--735, 1997. doi:10.1137/S0036144595301140.DOI
  4. S. Amat, S. Busquier and J. M. Gutiérrez. Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 157(1):197--205, 2003. doi:10.1016/S0377-0427(03)00420-5.DOI
  5. R. E. Shafer. On quadratic approximation. SIAM J. Numer. Anal. 11(2):447--460, 1974. doi:10.1137/0711037.DOI
  6. Émile Lemoine. Géométrographie ou Art des constructions géométriques . Scientia 18, C. Naud, Paris, 1902. https://catalogue.bnf.fr/ark:/12148/cb36049032t.link
  7. Maurice d'Ocagne. Esquisse d'ensemble de la nomographie . Mémorial des sciences mathématiques 4, Gauthier-Villars, 1925. https://www.numdam.org/item/MSM_1925__4__1_0/.link
  8. Leonardo de Moura and Sebastian Ullrich. The Lean 4 theorem prover and programming language. In CADE 28 , LNCS 12699, pages 625--635. Springer, 2021. doi:10.1007/978-3-030-79876-5_37.DOI
  9. The mathlib Community. The Lean mathematical library. In CPP 2020 , pages 367--381. ACM, 2020. doi:10.1145/3372885.3373824. https://leanprover-community.github.io/papers/mathlib-paper.pdf.DOI
  10. Ivan Besevic. Nested-radical Pandrosion support: derivation, geometric example and Lean convergence certificates. Source bundle accompanying Geometric Root Calculators , V27-NR, 18 October 2026. Includes NestedRadicalCubic , NestedRadicalRealCertificate , NestedRadicalReal , NestedRadicalAllDegrees , audit scripts, source hashes and numerical checks.
  11. Ivan Besevic. Geometric subdivision and Padé readout: supplementary source and verification records. Source bundle accompanying Geometric Root Calculators , V26-S, 2026. Includes GeometricSubdivision.lean , its retained axiom audit and the independent subdivision verifier.
  12. Ivan Besevic. Reciprocal root geometry, version 20. Research preprint, 2026. https://github.com/ivan-fr/pandrosion/tree/main/paper/reciprocal_geometry_v20.link
  13. Stan Cabay and George Labahn. A fast, reliable algorithm for calculating Padé--Hermite forms. Technical Report CS-89-09, University of Waterloo, 1989. https://cs.uwaterloo.ca/research/tr/1989/CS-89-09.pdf. Equations (1.4)--(1.6), printed page 1, PDF page 5.link
  14. Xavier Buff, Adam L. Epstein and Sarah Koch. Böttcher coordinates, 2011. https://arxiv.org/abs/1104.2981. Introduction: the classical one-variable theorem.link
  15. B. C. Carlson. The logarithmic mean. Amer. Math. Monthly 79:615--618, 1972.
  16. Kenneth B. Stolarsky. Generalizations of the logarithmic mean. Math. Mag. 48(2):87--92, 1975. doi:10.2307/2689825.DOI
  17. François Dubeau. Newton's method and high-order algorithms for the nnth root computation. J. Comput. Appl. Math. 224:66--76, 2009. doi:10.1016/j.cam.2008.04.014.DOI
  18. Ivan Besevic. Complex geometric root calculators, version C3. Research preprint, companion to this paper, 13 November 2026.

Version history

  1. v1 · 31 pagesSubmitted by Ivan BESEVICVersion 29, a revision of V28. New in this version: the three-mean support of Section 5, with its Lean proofs, its construction and its inventory; the comparisons of Section 6 are updated. The verifier anc/verify_v29.py recomputes the constants, identities and tables (SymPy, mpmath). LaTeX sources, verifiers and the Lean 4 / Mathlib formalization: https://github.com/ivan-fr/pandrosionCurrentNov 15, 2026