Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A complete twelve-row chain for strict normalized fourth powers

Proved
DerivativeChainPrivate.normalized_fourth_chain_strict

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

derivative-chainshigher-power-supportsharp-cubic-radius

For a finite complex list z0,…,zN−1z_0,\ldots,z_{N-1}z0​,…,zN−1​ write L(z)=∑i=0N−2∣zi+1−zi∣L(z)=\sum_{i=0}^{N-2}|z_{i+1}-z_i|L(z)=∑i=0N−2​∣zi+1​−zi​∣. Let Re⁡β≥0\operatorname{Re}\beta\ge0Reβ≥0, Im⁡β>0\operatorname{Im}\beta>0Imβ>0, and p(X)=(X3−(11/2)X−55β)4p(X)=(X^3-(11/2)X-55\beta)^4p(X)=(X3−(11/2)X−55β)4. There is z∈C12z\in\mathbb C^{12}z∈C12 with p(11−i)(zi)=0p^{(11-i)}(z_i)=0p(11−i)(zi​)=0, z0=0z_0=0z0​=0, a constant suffix from index eight, and z113−(11/2)z11−55β=0z_{11}^3-(11/2)z_{11}-55\beta=0z113​−(11/2)z11​−55β=0. Both coordinates are nondecreasing and L(z)≤2 ∣z11∣L(z)\le\sqrt2\,|z_{11}|L(z)≤2​∣z11​∣.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open DerivativeChainPrivate Polynomial MeasureTheory Filter Set Topology Metric Function ComplexConjugate
open scoped BigOperators ComplexOrder Topology
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option maxHeartbeats 0
set_option maxRecDepth 100000
Formal statement
theorem DerivativeChainPrivate.normalized_fourth_chain_strict (β : ℂ) (hR : 0 ≤ β.re) (hI : 0 < β.im) :
    ∃ z : Fin 12 → ℂ,
      (∀ i, (derivative^[12-(i.val+1)] ((X^3-C (11/2)*X-55*C β)^4)).eval (z i)=0) ∧
      z 0=0 ∧ (∀ i : Fin 12, 8 ≤ i.val → z i=z 11) ∧
      (z 11)^3-(11/2)*z 11-55*β=0 ∧
      Monotone (fun i => (z i).re) ∧ Monotone (fun i => (z i).im) ∧
      chainCost z ≤ Real.sqrt 2*‖z 11‖ := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/higher_powers/Source/FourthNormalizedChain.lean#L11-L106

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