Q2: universal derivative-chain four-bound
OpenDerivativeChainPrivate.universalFourBoundderivative-chain-privatepolynomials
OPEN TARGET (non-strict four-bound). For every positive integer and every list of complex numbers in the closed unit disk, let . The target asserts that one can choose with for every such that
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 and suggests . The target 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 sorrySource
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.