Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonreal complex roots equal the real-root defect

Proved
DerivativeChainPrivate.nonreal_roots_of_real_polynomial

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

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

Let ppp be a real polynomial. For p≠0p\ne0p=0, let NR(p)N_{\mathbb R}(p)NR​(p) count its real roots with multiplicity and let Nnr(p)N_{\mathrm{nr}}(p)Nnr​(p) count the nonreal roots of its complexification, also with multiplicity. Then

Nnr(p)=deg⁡p−NR(p).N_{\mathrm{nr}}(p)=\deg p-N_{\mathbb R}(p).Nnr​(p)=degp−NR​(p).

This identity relates the real-root deficit to the number of nonreal root slots.

Formalization Note The formal statement also includes p=0p=0p=0. Mathlib defines the finite roots multiset of the zero polynomial to be empty and its natural degree to be zero; under those conventions both sides are zero. This is not a claim that the zero polynomial's mathematical zero set is empty. Subtraction is natural-number subtraction. Nonzero constants have no root slots and degree zero.

Preamble
import Mathlib.Analysis.Complex.Polynomial.Basic

set_option autoImplicit false

namespace DerivativeChainPrivate
end DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.nonreal_roots_of_real_polynomial (p : Polynomial ℝ) :
    ((p.map Complex.ofRealHom).roots.filter (fun z => z.im ≠ 0)).card =
      p.natDegree - p.roots.card := by sorry
Source
Derivative-zero chains: public formalization reference, R29, DerivativeChainPrivate.nonreal_roots_of_real_polynomial. 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