Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compressed one-pair chains have length at most three

Proved
DerivativeChainPrivate.compressedOnePairThree

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

compressed-one-pair-three-20261019derivative-chain-privatepolynomials

For every positive degree n and complex root list a in the closed unit disk, suppose its monic polynomial is X^r Q(X^d), with d>=2, 0<=r<d, and Q a real polynomial with degree minus the number of its real root slots at most two. Multiplicities are counted. Then there exists a complete chain selecting an actual root of every ordinary derivative row, with total length at most three. The quotient degree and symmetry order are unrestricted. This is the normalized one-pair compressed class theorem; it does not establish either unrestricted prize question.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open Polynomial DerivativeChainPrivate
set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.compressedOnePairThree {n : ℕ} (a : Fin n → ℂ) (hn : 1 ≤ n)
    (ha : ∀ i, ‖a i‖ ≤ 1) (d r : ℕ) (q : Polynomial ℝ)
    (hd : 2 ≤ d) (hr : r < d) (hc : q.natDegree - q.roots.card ≤ 2)
    (hp : fromRoots a = X ^ r * (q.map Complex.ofRealHom).comp (X ^ d)) :
    ∃ z : Fin n → ℂ, IsChain a z ∧ chainCost z ≤ 3 := by sorry
Source
Derivative-zero chains: public formalization reference, R51, DerivativeChainPrivate.compressedOnePairThree. 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