Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Archimedean lower bound on the degree of a collapsing

Proved
CollapsibleCubics.pi_div_psi_le_natDegree

by quesswho · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraalgebraic-numbersnumber-theorypolynomials

Let m(x)=x3+dx+em(x) = x^3 + dx + em(x)=x3+dx+e be irreducible over Q\mathbb{Q}Q with negative discriminant, so that it has one real root and a conjugate pair of non-real roots. Write these as

α1=−2u,α2,3=u±iv,d=v2−3u2,e=2u(u2+v2),\alpha_1 = -2u, \qquad \alpha_{2,3} = u \pm iv, \qquad d = v^2 - 3u^2, \quad e = 2u(u^2+v^2),α1​=−2u,α2,3​=u±iv,d=v2−3u2,e=2u(u2+v2),

normalising the sign of vvv so that uv>0uv > 0uv>0, and set ψ=arctan⁡(3u/v)∈(0,π/2)\psi = \arctan(3u/v) \in (0, \pi/2)ψ=arctan(3u/v)∈(0,π/2). If f∈Q[x]f \in \mathbb{Q}[x]f∈Q[x] is split and f(α)∈Qf(\alpha) \in \mathbb{Q}f(α)∈Q for a root α\alphaα of mmm, then

πψ  ≤  deg⁡f.\frac{\pi}{\psi} \;\le\; \deg f.ψπ​≤degf.

Because mmm is irreducible, f(α)=cf(\alpha) = cf(α)=c forces m∣f−cm \mid f - cm∣f−c, so fff takes the same value at all three roots; the ratios zi=(α1−ri)/(α2−ri)z_i = (\alpha_1 - r_i)/(\alpha_2 - r_i)zi​=(α1​−ri​)/(α2​−ri​) of the linear factors therefore multiply to 111. Each ziz_izi​ lies on a fixed circle through 000 and 111 determined by ψ\psiψ, and strict concavity of log⁡cos⁡\log\coslogcos turns that constraint into the stated bound.

As τ=e2/d3→0+\tau = e^2/d^3 \to 0^+τ=e2/d3→0+ one has ψ→0\psi \to 0ψ→0, so the required degree is unbounded: no uniform degree suffices, and this is the central obstruction to a general construction. For x3+6x+1x^3 + 6x + 1x3+6x+1 the bound already forces deg⁡f≥32\deg f \ge 32degf≥32.

Formalization Note The parameters u,vu, vu,v enter as real numbers satisfying the factorisation identity for all real xxx, which is equivalent to the two displayed Vieta relations. The condition uv>0uv > 0uv>0 is a normalisation, not a restriction: vvv is determined only up to sign. The conclusion compares a real number with the natural-number degree of fff, coerced into R\mathbb{R}R.

Preamble
import Definitions.Def_CollapsibleCubics_basic
Formal statement
import Definitions.Def_CollapsibleCubics_basic

namespace CollapsibleCubics
open Polynomial
theorem pi_div_psi_le_natDegree (d e : ℚ)
    (hirr : Irreducible (X ^ 3 + C d * X + C e : ℚ[X]))
    (u v : ℝ) (hsign : 0 < u * v)
    (huv : ∀ x : ℝ, x ^ 3 + (d : ℝ) * x + (e : ℝ) = (x + 2 * u) * ((x - u) ^ 2 + v ^ 2))
    (α : ℂ) (hα : α ^ 3 + (d : ℂ) * α + (e : ℂ) = 0)
    (f : ℚ[X]) (hf : IsSplit f) (c : ℚ) (hc : aeval α f = (c : ℂ)) :
    Real.pi / Real.arctan (3 * u / v) ≤ f.natDegree := by sorry
end CollapsibleCubics
Source
Miles, *Collapsible algebraic numbers*, blog post, 2026-08-20, https://quesswho.github.io/miles-blog/2026/08/20/collapsible/ (definitions of *split* polynomial and of *1-collapsible*; statement that the degree-3 case of one-step collapsibility is open). Underlying problem: Griffin Macris, list of open problems, Problem 3, https://sites.google.com/view/griffinmacris/open-problems. The archimedean obstruction. Both halves are separately machine-checked in the accompanying development (the convexity bound and the Moebius reduction, results L9-L12 and L24); the statement in terms of a collapsing polynomial, as given here, is not yet proved there.
Read-back

What the Lean code literally says, in plain math · claude-opus-5

The statement is universally quantified over: two rational numbers ddd and eee; two real numbers uuu and vvv; a complex number α\alphaα; a polynomial fff with rational coefficients; and a rational number ccc. It asserts that whenever all of the following hold simultaneously, the displayed inequality holds.

Hypotheses.

  1. (Irreducibility.) The polynomial X3+dX+eX^3 + dX + eX3+dX+e, viewed in the polynomial ring Q[X]\mathbb{Q}[X]Q[X], is irreducible: it is not a unit, and in every factorization of it into two rational polynomials one factor is a nonzero rational constant. (Since its degree is 333, this in particular rules out any rational root.)

  2. (Sign condition.) u v>0u\,v > 0uv>0 — i.e. uuu and vvv are both nonzero and have the same sign (both positive, or both negative).

  3. (Real factorization.) For every real number xxx,

x3+d x+e  =  (x+2u)((x−u)2+v2),x^3 + d\,x + e \;=\; (x + 2u)\bigl((x-u)^2 + v^2\bigr),x3+dx+e=(x+2u)((x−u)2+v2),

where ddd and eee are read as real numbers via the inclusion Q⊆R\mathbb{Q} \subseteq \mathbb{R}Q⊆R. Comparing coefficients, this identity is equivalent to the two equations

d=v2−3u2,e=2u (u2+v2).d = v^2 - 3u^2, \qquad e = 2u\,(u^2+v^2).d=v2−3u2,e=2u(u2+v2).
  1. (Root.) α\alphaα is a complex number with α3+d α+e=0\alpha^3 + d\,\alpha + e = 0α3+dα+e=0, with d,ed,ed,e read as complex numbers. Nothing else is assumed about α\alphaα: it is not required to be non-real, and it is not tied to uuu or vvv except through this equation. Combined with hypothesis 3, α\alphaα is one of the three numbers −2u-2u−2u, u+ivu + i vu+iv, u−ivu - i vu−iv; combined with hypothesis 1, α\alphaα is irrational, so X3+dX+eX^3 + dX + eX3+dX+e is its minimal polynomial over Q\mathbb{Q}Q.

  2. (Splitness of fff, unfolded.) f∈Q[X]f \in \mathbb{Q}[X]f∈Q[X] satisfies the bundle-specific predicate "fff is split", which unfolds to: the degree of fff is strictly positive, and there exist a rational number a≠0a \neq 0a=0 and a finite multiset R={r1,…,rn}R = \{r_1,\dots,r_n\}R={r1​,…,rn​} of rational numbers (repetitions allowed) such that

f  =  a∏j=1n(X−rj).f \;=\; a \prod_{j=1}^{n} (X - r_j).f=aj=1∏n​(X−rj​).

So fff is a nonzero rational polynomial that factors completely into linear factors over Q\mathbb{Q}Q; its roots are all rational but need not be distinct, and n=deg⁡f≥1n = \deg f \ge 1n=degf≥1 (the multiset cannot be empty, since an empty product would give f=af = af=a of degree 000).

  1. (Rational value at α\alphaα.) Evaluating fff at α\alphaα under the ring map Q[X]→C\mathbb{Q}[X] \to \mathbb{C}Q[X]→C sending X↦αX \mapsto \alphaX↦α gives the rational number ccc, viewed in C\mathbb{C}C:
f(α)  =  a∏j=1n(α−rj)  =  c.f(\alpha) \;=\; a\prod_{j=1}^{n}(\alpha - r_j) \;=\; c .f(α)=aj=1∏n​(α−rj​)=c.

No sign or nonvanishing condition is imposed on ccc. Because the cubic is the minimal polynomial of α\alphaα, this is equivalent to f(X)−cf(X) - cf(X)−c being divisible in Q[X]\mathbb{Q}[X]Q[X] by X3+dX+eX^3 + dX + eX3+dX+e.

Conclusion. Under all of the above,

πarctan⁡ ⁣(3uv)  ≤  deg⁡f,\frac{\pi}{\arctan\!\left(\dfrac{3u}{v}\right)} \;\le\; \deg f,arctan(v3u​)π​≤degf,

a non-strict inequality between real numbers, where deg⁡f\deg fdegf is the (natural-number) degree of fff — equivalently the number of linear factors nnn counted with multiplicity — coerced into R\mathbb{R}R, and arctan⁡\arctanarctan is the principal inverse tangent with values in (−π/2,π/2)(-\pi/2,\pi/2)(−π/2,π/2).

Degenerate and edge cases. The hypotheses are not vacuous: they are jointly satisfiable. For instance d=−1d = -1d=−1, e=1e = 1e=1 gives X3−X+1X^3 - X + 1X3−X+1, which is irreducible over Q\mathbb{Q}Q; its unique real root is t≈−1.32472t \approx -1.32472t≈−1.32472, and taking u=−t/2≈0.66236u = -t/2 \approx 0.66236u=−t/2≈0.66236, v=d+3u2≈0.56228v = \sqrt{d + 3u^2} \approx 0.56228v=d+3u2​≈0.56228 satisfies uv>0uv > 0uv>0 and the factorization identity; taking α\alphaα any root of the cubic, f=X(X−1)(X+1)=X3−Xf = X(X-1)(X+1) = X^3 - Xf=X(X−1)(X+1)=X3−X (split over Q\mathbb{Q}Q, degree 333) gives f(α)=α3−α=−1=cf(\alpha) = \alpha^3 - \alpha = -1 = cf(α)=α3−α=−1=c. Here the left-hand side is π/arctan⁡(3u/v)≈2.4259≤3\pi/\arctan(3u/v) \approx 2.4259 \le 3π/arctan(3u/v)≈2.4259≤3.

The hypotheses force definite signs and root structure. Since uv>0uv > 0uv>0, neither uuu nor vvv is zero, so 3u/v>03u/v > 03u/v>0 and arctan⁡(3u/v)∈(0,π/2)\arctan(3u/v) \in (0, \pi/2)arctan(3u/v)∈(0,π/2); hence no division-by-zero junk value arises anywhere in the conclusion, and the left-hand side is a genuine real number strictly greater than π/(π/2)=2\pi/(\pi/2) = 2π/(π/2)=2. Consequently the conclusion is strictly stronger than "deg⁡f≥2\deg f \ge 2degf≥2": since deg⁡f\deg fdegf is a natural number exceeding a quantity >2> 2>2, the inequality entails deg⁡f≥3\deg f \ge 3degf≥3. Note also that v≠0v \ne 0v=0 means the quadratic factor (x−u)2+v2(x-u)^2 + v^2(x−u)2+v2 has no real root, so the cubic has exactly one real root, namely −2u-2u−2u, and two genuinely non-real complex-conjugate roots u±ivu \pm i vu±iv; its discriminant −4d3−27e2-4d^3 - 27e^2−4d3−27e2 is negative. Since −2u-2u−2u is a root of an irreducible rational cubic, uuu is an irrational (cubic) real number, and u≠0u \ne 0u=0 forces e=2u(u2+v2)≠0e = 2u(u^2+v^2) \ne 0e=2u(u2+v2)=0; also d=v2−3u2d = v^2 - 3u^2d=v2−3u2 may be of either sign. The hypotheses do not require u>0u > 0u>0: the case u<0,v<0u < 0, v < 0u<0,v<0 is equally allowed, and then −2u>0-2u > 0−2u>0 while 3u/v3u/v3u/v is still positive. Finally, fff is permitted to have repeated rational roots, and its leading coefficient aaa may be any nonzero rational; the statement says nothing about existence of such an fff — it only bounds the degree of any fff that meets the conditions.

Human review
  • Endorsed by Shuze Chen · Sep 8, 2026

  • Endorsed by quesswho · Sep 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me