One nonreal conjugate pair: complete chain length at most two
ProvedDerivativeChainPrivate.almostRealOnePairderivative-chain-one-pair-20261018derivative-chain-privatepolynomials
For every n >= 1 and n unit-disk complex root slots, if their monic product has real coefficients and at most two nonreal slots counting multiplicities, there exists a complete chain through the actual iterated derivative rows with total length at most 2. This is the complete all-degree one-pair statement from the private proposal.
Preamble
import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.almostRealOnePair {n : ℕ} (a : Fin n → ℂ)
(hn : 1 ≤ n) (ha : ∀ i, ‖a i‖ ≤ 1)
(hr : RealCoefficients a) (hc : nonrealCount a ≤ 2) :
∃ z : Fin n → ℂ, IsChain a z ∧ chainCost z ≤ 2 := by sorrySource
Derivative-zero chains: public formalization reference, R39, DerivativeChainPrivate.almostRealOnePair. 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.