Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Q2: universal derivative-chain four-bound

Open
DerivativeChainPrivate.universalFourBound

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

derivative-chain-privatepolynomials

OPEN TARGET (non-strict four-bound). For every positive integer nnn and every list a1,…,ana_1,\ldots,a_na1​,…,an​ of complex numbers in the closed unit disk, let p(X)=∏j=1n(X−aj)p(X)=\prod_{j=1}^n(X-a_j)p(X)=∏j=1n​(X−aj​). The target asserts that one can choose zmz_mzm​ with 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 such that

∑m=1n−1∣zm+1−zm∣≤4.\sum_{m=1}^{n-1}|z_{m+1}-z_m|\le4.m=1∑n−1​∣zm+1​−zm​∣≤4.

Repeated source roots are counted with multiplicity. There is no real-coefficient or nonreal-root-count restriction. No proof is claimed.

Source convention. Althöfer's original announcement asks for total path length at most CCC and suggests C=4C=4C=4. The target L≤4L\le4L≤4 stated here follows that convention.

Preamble
import Definitions.Def_DerivativeChainPrivate_foundations
open scoped BigOperators
set_option autoImplicit false
open DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.universalFourBound {n : ℕ} (a : Fin n → ℂ)
    (hn : 1 ≤ n) (ha : ∀ i, ‖a i‖ ≤ 1) :
    ∃ z : Fin n → ℂ, IsChain a z ∧ chainCost z ≤ 4 := by sorry
Source
Ingo Althöfer, 15 August 2026 announcement, open question and prize (i)/(ii), path length at most C and suggested C=4: https://althofer.de/prize-money-2.jpg . Formal statement: Derivative-zero chains: public formalization reference, R07, DerivativeChainPrivate.universalFourBound. 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