Q1: degree-independent derivative-chain bound
OpenDerivativeChainPrivate.universalConstantBoundderivative-chain-privatepolynomials
OPEN TARGET. For every positive integer and every complex root list in the closed unit disk, put . A complete chain consists of points satisfying for every . The target is
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 , with one constant independent of degree. The non-strict inequality in this formal statement follows that convention. The separate four-bound target asks whether 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 sorrySource
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.