Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Complete chains for fourth powers of complex cubics

Proved
DerivativeChainPrivate.cubicFourthChainRadius

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

cubic-powersderivative-chainpolynomials

Let qqq be a monic complex cubic with all its roots in a disk centered at o∈Co\in\mathbb Co∈C of radius R≥0R\ge0R≥0. There exists a complete chain z1,…,z12z_1,\ldots,z_{12}z1​,…,z12​ for q4q^4q4 satisfying

D12−m(q4)(zm)=0(1≤m≤12),∑m=111∣zm+1−zm∣≤423R.D^{12-m}(q^4)(z_m)=0\quad(1\le m\le 12),\qquad \sum_{m=1}^{11}|z_{m+1}-z_m|\le\frac{4\sqrt2}{3}R.D12−m(q4)(zm​)=0(1≤m≤12),m=1∑11​∣zm+1​−zm​∣≤342​​R.

The first point is the centroid of the three roots of qqq, counted with multiplicity. All final 4 entries, from row 9 through row 12, coincide at one root of qqq. There are unit complex numbers a,ba,ba,b with Re⁡(ab‾)=0\operatorname{Re}(a\overline b)=0Re(ab)=0 such that both sequences Re⁡(azm)\operatorname{Re}(az_m)Re(azm​) and Re⁡(bzm)\operatorname{Re}(bz_m)Re(bzm​) are nondecreasing. They describe one common orthonormal coordinate frame, allowing reflection. Translation changes these coordinates only by constant offsets.

The statement includes repeated roots, zero radius, and degenerate centered coefficients. It assumes no supplied prefix, continuation theorem or genericity condition. The complete Lean proof has been accepted by Prove2me’s verifier. This restricted class theorem does not settle either unrestricted derivative-chain question.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open Polynomial DerivativeChainPrivate
set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.cubicFourthChainRadius (q : Polynomial ℂ) (hq : q.Monic) (hdeg : q.natDegree = 3)
    (o : ℂ) (R : ℝ) (hR : 0 ≤ R) (hbound : ∀ x : ℂ, q.eval x = 0 → ‖x - o‖ ≤ R) :
    ∃ (z : Fin 12 → ℂ) (a b : ℂ),
      (∀ i, (derivative^[12 - (i.val + 1)] (q^4)).eval (z i) = 0) ∧
      z 0 = q.roots.sum / 3 ∧
      (∀ i : Fin 12, 8 ≤ i.val → z i = z 11) ∧ q.eval (z 11) = 0 ∧
      ‖a‖ = 1 ∧ ‖b‖ = 1 ∧ (a * starRingEnd ℂ b).re = 0 ∧
      Monotone (fun i => (a * z i).re) ∧ Monotone (fun i => (b * z i).re) ∧
      chainCost z ≤ 4 * Real.sqrt 2 * R / 3 := by sorry
Source
Fourth-power cubic derivative-chain research, H4_COMPLETE_CHAIN.md, Section 1, equations (1)–(2). https://gist.github.com/Amal-David/adce933460b7501cb123f483f62775eb/f5a76eda649f3e995a8ec6b98387b23b64c6debb#file-fourth-md Complete local Lean proof archive (193 files; predates final server packaging): https://gist.github.com/Amal-David/adce933460b7501cb123f483f62775eb/848808260c49b06b5abbdf5318325e6c72a8043e#file-formal-proofs-md
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by labuka · Oct 20, 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me