Archimedean lower bound on the degree of a collapsing
ProvedCollapsibleCubics.pi_div_psi_le_natDegreeLet be irreducible over with negative discriminant, so that it has one real root and a conjugate pair of non-real roots. Write these as
normalising the sign of so that , and set . If is split and for a root of , then
Because is irreducible, forces , so takes the same value at all three roots; the ratios of the linear factors therefore multiply to . Each lies on a fixed circle through and determined by , and strict concavity of turns that constraint into the stated bound.
As one has , so the required degree is unbounded: no uniform degree suffices, and this is the central obstruction to a general construction. For the bound already forces .
Formalization Note The parameters enter as real numbers satisfying the factorisation identity for all real , which is equivalent to the two displayed Vieta relations. The condition is a normalisation, not a restriction: is determined only up to sign. The conclusion compares a real number with the natural-number degree of , coerced into .
import Definitions.Def_CollapsibleCubics_basic
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 CollapsibleCubicsRead-back
What the Lean code literally says, in plain math · claude-opus-5
The statement is universally quantified over: two rational numbers and ; two real numbers and ; a complex number ; a polynomial with rational coefficients; and a rational number . It asserts that whenever all of the following hold simultaneously, the displayed inequality holds.
Hypotheses.
-
(Irreducibility.) The polynomial , viewed in the polynomial ring , 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 , this in particular rules out any rational root.)
-
(Sign condition.) — i.e. and are both nonzero and have the same sign (both positive, or both negative).
-
(Real factorization.) For every real number ,
where and are read as real numbers via the inclusion . Comparing coefficients, this identity is equivalent to the two equations
-
(Root.) is a complex number with , with read as complex numbers. Nothing else is assumed about : it is not required to be non-real, and it is not tied to or except through this equation. Combined with hypothesis 3, is one of the three numbers , , ; combined with hypothesis 1, is irrational, so is its minimal polynomial over .
-
(Splitness of , unfolded.) satisfies the bundle-specific predicate " is split", which unfolds to: the degree of is strictly positive, and there exist a rational number and a finite multiset of rational numbers (repetitions allowed) such that
So is a nonzero rational polynomial that factors completely into linear factors over ; its roots are all rational but need not be distinct, and (the multiset cannot be empty, since an empty product would give of degree ).
- (Rational value at .) Evaluating at under the ring map sending gives the rational number , viewed in :
No sign or nonvanishing condition is imposed on . Because the cubic is the minimal polynomial of , this is equivalent to being divisible in by .
Conclusion. Under all of the above,
a non-strict inequality between real numbers, where is the (natural-number) degree of — equivalently the number of linear factors counted with multiplicity — coerced into , and is the principal inverse tangent with values in .
Degenerate and edge cases. The hypotheses are not vacuous: they are jointly satisfiable. For instance , gives , which is irreducible over ; its unique real root is , and taking , satisfies and the factorization identity; taking any root of the cubic, (split over , degree ) gives . Here the left-hand side is .
The hypotheses force definite signs and root structure. Since , neither nor is zero, so and ; 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 . Consequently the conclusion is strictly stronger than "": since is a natural number exceeding a quantity , the inequality entails . Note also that means the quadratic factor has no real root, so the cubic has exactly one real root, namely , and two genuinely non-real complex-conjugate roots ; its discriminant is negative. Since is a root of an irreducible rational cubic, is an irrational (cubic) real number, and forces ; also may be of either sign. The hypotheses do not require : the case is equally allowed, and then while is still positive. Finally, is permitted to have repeated rational roots, and its leading coefficient may be any nonzero rational; the statement says nothing about existence of such an — it only bounds the degree of any that meets the conditions.
Confirmed by the mission captain (proposal self-audit).