Archimedean degree bound beyond the cubic case
ProvedCollapsibleCubics.pi_div_psi_le_natDegree_generalLet be irreducible with a real root and a non-real root , and set
with the conjugate chosen so that , hence . If is split and for some root of , then
Possessing both a real and a non-real root already forces , so no degree hypothesis is needed.
This is the archimedean obstruction stated for algebraic numbers of arbitrary degree. Irreducibility gives , so takes the same nonzero value at every root, and the ratios of the linear factors of multiply to ; each lies on the circle through and , and strict concavity of on converts that into the bound.
Specialising to a depressed cubic with , where and , gives and recovers the cubic bound exactly. The general form matters because it constrains the conjecture in every degree, including the degree range that is the open frontier of the original problem: it shows that no uniform degree of collapsing polynomial can ever suffice, whatever the degree of .
Formalization Note The normalisation is the single hypothesis . It forces and , so both divisions in the conclusion are well defined and no junk value arises. Replacing by its complex conjugate flips the sign of both factors, so the hypothesis is a choice of conjugate, not a restriction — except when , which it excludes. The root at which is rational is an independent variable, tied to only by being a root of the same .
import Definitions.Def_CollapsibleCubics_basic
import Definitions.Def_CollapsibleCubics_basic
namespace CollapsibleCubics
open Polynomial
theorem pi_div_psi_le_natDegree_general
(m : ℚ[X]) (hirr : Irreducible m)
(α₁ : ℝ) (h₁ : aeval α₁ m = 0)
(α₂ : ℂ) (h₂ : aeval α₂ m = 0)
(hsign : 0 < (α₂.re - α₁) * α₂.im)
(α : ℂ) (hα : aeval α m = 0)
(f : ℚ[X]) (hf : IsSplit f) (c : ℚ) (hc : aeval α f = (c : ℂ)) :
Real.pi / Real.arctan ((α₂.re - α₁) / α₂.im) ≤ f.natDegree := by sorry
end CollapsibleCubicsRead-back
What the Lean code literally says, in plain math · claude-opus-5
Fix the polynomial ring over the rationals.
The statement asserts the following. Let be a polynomial that is irreducible in (in the ring-theoretic sense: is neither a unit nor zero, and whenever one of is a unit). Let be a real number satisfying , where is evaluated at via the canonical embedding applied to its coefficients. Let be a complex number satisfying , evaluated via . Write and for the real and imaginary parts of . Assume the sign condition
i.e. the product of the two real numbers and is strictly positive. Let be a further complex number with ; note that is a third, independent variable, tied to and only by being a root of the same , and nothing forces to differ from, or agree with, either of them. Let be a polynomial which is split over in the following expanded sense (this is the bundle's own predicate, unfolded):
- , where is the natural-number degree (so in particular and is not a nonzero constant); and
- there exist a rational number and a finite multiset of rational numbers such that
the product being taken over with multiplicity. (Since , the multiset is necessarily nonempty and ; roots may repeat.)
Finally, let be a rational number such that evaluating at the complex number gives exactly the image of in :
Under all of these hypotheses, the conclusion asserted is the inequality
a comparison of real numbers, where is the natural-number degree of cast into , is the usual circle constant, and is the principal inverse tangent, taking values in . The inequality is non-strict (), and it is stated in the direction "the ratio is at most the degree".
On degeneracy, satisfiability, and junk values.
The hypotheses are jointly satisfiable, so the statement is not vacuous. The sign hypothesis forces both factors to be nonzero and of the same sign; in particular , so is genuinely non-real, and . Consequently has a real root and a non-real root ; together with irreducibility over this forces (an irreducible rational polynomial of degree has only a real root, and one of degree has either two real roots or two non-real ones, never one of each). So cannot be linear or quadratic, and the hypothesis block is consistent — for instance any irreducible rational cubic with one real and two complex roots, with chosen as whichever of the conjugate pair makes the product positive, satisfies the first four hypotheses.
Because is forced, the quotient is an honest division and no division-by-zero junk value arises there; moreover that quotient is strictly positive (the two factors having equal sign), so of it lies strictly in and is in particular nonzero. Hence the outer division is also an honest division: the denominator cannot be , and the left-hand side is a well-defined real number strictly greater than . Note that the sign hypothesis constrains only and and does not involve or .
There is, however, no hypothesis relating to or beyond all three being roots of , and no hypothesis asserting that , , are distinct, that and are "adjacent" in any sense, or that is nonconstant on any set other than as recorded by . Likewise, is a real number required to be a root, and , are complex numbers required to be roots; no hypothesis says is monic, primitive, or of any particular degree beyond what irreducibility plus the two root conditions force. The condition says only that takes a rational value at the specific root ; it is not required to take rational values at the other roots, and is not required to be nonzero.
Finally, appears on the right as a natural number coerced to ; the split hypothesis guarantees , so the right-hand side is at least , but the conclusion asserts the specific numerical bound above, not merely positivity.
Confirmed by the mission captain (proposal self-audit).