Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Normalized probability on actual polynomial roots

Definition
DerivativeChain_root_probability

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

derivative-chain-baseline-20261017derivative-chain-private

For a complex polynomial P, a complex point z, and an index w in the finite set of distinct roots of P, rootProbability is the Gauss--Lucas derivative-root weight at w divided by the sum of all those weights. Mathlib incorporates multiplicities and the shared-root case in derivRootWeight. No claim of normalization is made at degree zero; subsequent theorems assume positive degree. The probability, mean, and support properties are proved separately.

Definition code
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Algebra.Polynomial.Derivative
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Complex.Polynomial.GaussLucas
import Mathlib.Analysis.Real.Sqrt
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
open scoped BigOperators Polynomial
set_option autoImplicit false

noncomputable section
namespace DerivativeChain

/-- Normalized Gauss--Lucas weights, indexed only by actual roots of `P`. -/
def rootProbability (P : ℂ[X]) (z : ℂ) (w : P.roots.toFinset) : ℝ :=
  P.derivRootWeight z w / ∑ v ∈ P.roots.toFinset, P.derivRootWeight z v

end DerivativeChain
Source
Derivative-zero chains: public formalization reference, R02, DerivativeChain_root_probability. 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