Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every monic complex cubic admits a bounded actual forward law

Proved
CubicTurning.every_monic_cubic_uniform_forward_law

by labuka · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

cubic-turningderivative-chainsfinite-balanced-lawssigned-turning

For complex e,d0,d1e,d_0,d_1e,d0​,d1​, set h(e,d)=Im⁡(ed)/(∣d∣+Re⁡(ed))h(e,d)=\operatorname{Im}(ed)/(|d|+\operatorname{Re}(ed))h(e,d)=Im(ed)/(∣d∣+Re(ed)), using the total real division convention that division by zero is 000. Let T(e,d0,d1)T(e,d_0,d_1)T(e,d0​,d1​) mean [h(e,d0)≥1/7 and h(e,d1)≤−1/7][h(e,d_0)\ge 1/7\text{ and }h(e,d_1)\le-1/7][h(e,d0​)≥1/7 and h(e,d1​)≤−1/7] or the same two inequalities with d0,d1d_0,d_1d0​,d1​ exchanged. Define E(e,d0,d1)=2(∣d0∣∣d1∣−Re⁡(d0d1‾))E(e,d_0,d_1)=2(|d_0||d_1|-\operatorname{Re}(d_0\overline{d_1}))E(e,d0​,d1​)=2(∣d0​∣∣d1​∣−Re(d0​d1​​)) when TTT holds, and E=0E=0E=0 otherwise. All threshold inequalities are non-strict, and all complex moduli are Euclidean. For every polynomial p∈C[X]p\in\mathbb C[X]p∈C[X] that is monic and has natural degree exactly 333, there exist complex numbers a,b,ca,b,ca,b,c such that p(X)=(X−a)(X−b)(X−c)p(X)=(X-a)(X-b)(X-c)p(X)=(X−a)(X−b)(X−c). Put u=(a+b+c)/3u=(a+b+c)/3u=(a+b+c)/3, V=(∣a−u∣2+∣b−u∣2+∣c−u∣2)/3V=(|a-u|^2+|b-u|^2+|c-u|^2)/3V=(∣a−u∣2+∣b−u∣2+∣c−u∣2)/3, and H=∣((a−u)2+(b−u)2+(c−u)2)/3∣H=|((a-u)^2+(b-u)^2+(c-u)^2)/3|H=∣((a−u)2+(b−u)2+(c−u)2)/3∣. For a labelled triple a,b,c∈Ca,b,c\in\mathbb Ca,b,c∈C and u∈Cu\in\mathbb Cu∈C, put P(X)=(X−a)(X−b)(X−c)P(X)=(X-a)(X-b)(X-c)P(X)=(X−a)(X−b)(X−c). A law consists of three labelled paths z(i)=(z0(i),z1(i),z2(i))∈C3z^{(i)}=(z^{(i)}_0,z^{(i)}_1,z^{(i)}_2)\in\mathbb C^3z(i)=(z0(i)​,z1(i)​,z2(i)​)∈C3 and three complex axes eie_iei​, indexed by i=0,1,2i=0,1,2i=0,1,2, with P′′(z0(i))=0P^{\prime\prime}(z^{(i)}_0)=0P′′(z0(i)​)=0, P′(z1(i))=0P^{\prime}(z^{(i)}_1)=0P′(z1(i)​)=0, P(z2(i))=0P(z^{(i)}_2)=0P(z2(i)​)=0, z2(0)=az^{(0)}_2=az2(0)​=a, z2(1)=bz^{(1)}_2=bz2(1)​=b, z2(2)=cz^{(2)}_2=cz2(2)​=c, z0(i)=uz^{(i)}_0=uz0(i)​=u, ∣ei∣=1|e_i|=1∣ei​∣=1, and Re⁡(ei(z1(i)−z0(i)))≥0\operatorname{Re}(e_i(z^{(i)}_1-z^{(i)}_0))\ge0Re(ei​(z1(i)​−z0(i)​))≥0, Re⁡(ei(z2(i)−z1(i)))≥0\operatorname{Re}(e_i(z^{(i)}_2-z^{(i)}_1))\ge0Re(ei​(z2(i)​−z1(i)​))≥0. Its mean energy is E‾=13∑i=02E(ei,z1(i)−z0(i),z2(i)−z1(i))\overline E=\frac13\sum_{i=0}^2E(e_i,z^{(i)}_1-z^{(i)}_0,z^{(i)}_2-z^{(i)}_1)E=31​∑i=02​E(ei​,z1(i)​−z0(i)​,z2(i)​−z1(i)​). This is finite labelled averaging with weights 1/31/31/3; repeated endpoint values retain separate labels and may have identical paths. For these same a,b,ca,b,ca,b,c, there exists such a law with common start u=(a+b+c)/3u=(a+b+c)/3u=(a+b+c)/3 satisfying, additionally and explicitly, p(3−(j+1))(zj(i))=0p^{(3-(j+1))}(z^{(i)}_j)=0p(3−(j+1))(zj(i)​)=0 for every i,j∈{0,1,2}i,j\in\{0,1,2\}i,j∈{0,1,2}, where the derivative orders are respectively 2,1,02,1,02,1,0, and satisfying E‾≤[H+H(2V−H)]/3\overline E\le[H+\sqrt{H(2V-H)}]/3E≤[H+H(2V−H)​]/3 and E‾≤(2/3)V\overline E\le(2/3)VE≤(2/3)V. Both inequalities are non-strict. The root enumeration and law are existential and need not be unique; repeated roots, a triple root, zero variance, and zero displacements are included. The zero polynomial and lower-degree polynomials are excluded by the hypotheses. No assumption that roots are real, no squarefree condition, and no greedy requirement is made. The terminal distribution is the equal-weight distribution on the three root slots with multiplicity.

Preamble
import Mathlib
import Definitions.Def_CubicTurning_foundations
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
set_option maxHeartbeats 1200000
open scoped BigOperators
open ComplexConjugate
Formal statement
theorem CubicTurning.every_monic_cubic_uniform_forward_law (p : Polynomial ℂ)
    (hp : p.Monic) (hd : p.natDegree=3) :
    ∃ a b c : ℂ, p=DerivativeChainPrivate.fromRoots (![a,b,c] : Fin 3 → ℂ) ∧
      ∃ L : AffineUniformForwardLaw a b c (centroid a b c),
        (∀ i j : Fin 3, ((Polynomial.derivative^[3-(j.val+1)]) p).eval (L.paths i j)=0) ∧
        L.meanEnergy ≤ (anisotropy a b c +
          Real.sqrt (anisotropy a b c*(2*centeredVariance a b c-anisotropy a b c)))/3 ∧
        L.meanEnergy ≤ (2/3)*centeredVariance a b c := by sorry
Source
Private analytic checkpoint d69f598e254dee1915468fa93b3e33b8e1b5b7d6: research-results/unified-20261025/continuation/CUBIC_TURNING.md (SHA-256 700f272e9074fa24f04f5fbdc8402cabc1521b4f114ad4cf29f05fc31e11b5b8), with signed-energy definitions in research-results/unified-20261025/proofs/SIGNED_TURNING.md (SHA-256 f092149c0133465022966bc4ecfc5f8227dd5219b0929ed5ac7bbef6d7a5c4c9). New formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/cubic_turning/CubicTurning.lean, lines 535-553, SHA-256 777a708fb09a3fa79468bea20924defade96d607f8974be374e179ef1fadc45b. The new Lean file is not present in the analytic source commit.

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me