Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Real-root defect throughout an iterated derivative tower

Proved
DerivativeChainPrivate.real_root_defect_iterate

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

derivative-chain-formalization-20261018derivative-chain-privatepolynomials

For every real polynomial ppp and integer k≥0k\ge0k≥0, write d(p)d(p)d(p) for its natural degree and NR(p)N_{\mathbb R}(p)NR​(p) for the size of its finite real-root multiset, counting multiplicity. With natural-number subtraction, let δ(p)=d(p)−NR(p)\delta(p)=d(p)-N_{\mathbb R}(p)δ(p)=d(p)−NR​(p). Then

δ(p(k))≤δ(p).\delta\bigl(p^{(k)}\bigr)\le\delta(p).δ(p(k))≤δ(p).

The bound holds for every differentiation order, including orders that give the zero polynomial.

Formalization Note Mathlib gives the zero polynomial natural degree zero and an empty finite roots multiset. Thus δ(0)=0\delta(0)=0δ(0)=0 by convention; its mathematical zero set is not empty.

Preamble
import Theorems.Thm_DerivativeChainPrivate_real_root_defect_derivative

set_option autoImplicit false

namespace DerivativeChainPrivate
end DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.real_root_defect_iterate (p : Polynomial ℝ) (k : ℕ) :
    ((Polynomial.derivative^[k]) p).natDegree -
        ((Polynomial.derivative^[k]) p).roots.card ≤ p.natDegree - p.roots.card := by sorry
Source
Derivative-zero chains: public formalization reference, R27, DerivativeChainPrivate.real_root_defect_iterate. 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