Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Deflation: P(w)=(w−z)Q(w)+P(z)P(w) = (w-z)Q(w) + P(z)P(w)=(w−z)Q(w)+P(z) with Horner's coefficients

Proved
MetodosNumericos.horner_deflation

by Lucas · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

numerical-analysispolynomials

With b0,dots,bnb_0, \\dots, b_nb0​,dots,bn​ the Horner coefficients of PPP at zzz, the polynomial Q(w)=sumi=0n−1biw,n−1−iQ(w) = \\sum_{i=0}^{n-1} b_i w^{\\,n-1-i}Q(w)=sumi=0n−1​bi​w,n−1−i satisfies P(w)=(w−z)Q(w)+bnP(w) = (w-z)Q(w) + b_nP(w)=(w−z)Q(w)+bn​ for every www. In particular, when zzz is a root, QQQ is the deflated polynomial whose zeros are the remaining zeros of PPP.

Preamble
import Mathlib
import Definitions.Def_MetodosNumericos_polinomiosDefs
Formal statement
namespace MetodosNumericos

theorem horner_deflation (a : ℕ → ℝ) (n : ℕ) (hn : 1 ≤ n) (z w : ℝ) :
    polyVal a n w =
      (w - z) * (∑ i ∈ Finset.range n, hornerSeq a z i * w ^ (n - 1 - i)) + hornerSeq a z n := by
  sorry

end MetodosNumericos
Source
S. R. Freitas, Métodos Numéricos (UFMS, 2000), Cap. 4, §4.7 Deflação de um Polinômio, pp. 81–82.
Read-back

What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)

Disclosure: this read-back is not blind. It was written by the same agent that drafted the Lean statement, at the explicit instruction of the mission's human owner, and not by an independent auditor with fresh context.

For an arbitrary a:mathbbNtomathbbRa : \\mathbb{N} \\to \\mathbb{R}a:mathbbNtomathbbR, a natural number nnn with nge1n \\ge 1nge1, and arbitrary reals zzz and www, the statement asserts

sumi=0nai,w,n−i;=;(w−z)left(sumi=0n−1bi,w,n−1−iright)+bn,\\sum_{i=0}^{n} a_i\\, w^{\\,n-i} \\;=\\; (w - z)\\left(\\sum_{i=0}^{n-1} b_i\\, w^{\\,n-1-i}\\right) + b_n,sumi=0n​ai​,w,n−i;=;(w−z)left(sumi=0n−1​bi​,w,n−1−iright)+bn​,

where b0=a0b_0 = a_0b0​=a0​ and bi+1=ai+1+z,bib_{i+1} = a_{i+1} + z\\,b_ibi+1​=ai+1​+z,bi​. The second sum runs over i=0,dots,n−1i = 0, \\dots, n-1i=0,dots,n−1 and its exponents use truncated natural-number subtraction. No hypothesis says that zzz is a root of the polynomial; the identity is asserted for all zzz and www, with bnb_nbn​ playing the role of the remainder.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Sep 24, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me