Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Q1: degree-independent derivative-chain bound

Open
DerivativeChainPrivate.universalConstantBound

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

derivative-chain-privatepolynomials

OPEN TARGET. For every positive integer nnn and every complex root list a1,…,ana_1,\ldots,a_na1​,…,an​ in the closed unit disk, put p(X)=∏j=1n(X−aj)p(X)=\prod_{j=1}^n(X-a_j)p(X)=∏j=1n​(X−aj​). A complete chain consists of points zmz_mzm​ satisfying p(n−m)(zm)=0p^{(n-m)}(z_m)=0p(n−m)(zm​)=0 for every 1≤m≤n1\le m\le n1≤m≤n. The target is

∃C≥0  ∀n≥1  ∀a1,…,an∈D‾  ∃(z1,…,zn),∑m=1n−1∣zm+1−zm∣≤C.\exists C\ge0\;\forall n\ge1\;\forall a_1,\ldots,a_n\in\overline{\mathbb D}\;\exists(z_1,\ldots,z_n),\qquad \sum_{m=1}^{n-1}|z_{m+1}-z_m|\le C.∃C≥0∀n≥1∀a1​,…,an​∈D∃(z1​,…,zn​),m=1∑n−1​∣zm+1​−zm​∣≤C.

The same constant must work for every degree and root list, with repeated roots counted with multiplicity. No proof is claimed.

Source convention. Althöfer's original announcement asks for total path length at most CCC, with one constant independent of degree. The non-strict inequality L≤CL\le CL≤C in this formal statement follows that convention. The separate four-bound target asks whether C=4C=4C=4 suffices.

Preamble
import Definitions.Def_DerivativeChainPrivate_foundations
open scoped BigOperators
set_option autoImplicit false
open DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.universalConstantBound :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ (n : ℕ) (a : Fin n → ℂ),
      1 ≤ n → (∀ i, ‖a i‖ ≤ 1) →
      ∃ z : Fin n → ℂ, IsChain a z ∧ chainCost z ≤ C := by sorry
Source
Ingo Althöfer, 15 August 2026 announcement, open question and prize (i)/(ii): https://althofer.de/prize-money-2.jpg . Exact formulation and strict/non-strict convention: Derivative-zero chains: public formalization reference, R08, DerivativeChainPrivate.universalConstantBound. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me