Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bézout form P=Q Tm+n+K xm+n+1P = Q\,T_{m+n} + K\,x^{m+n+1}P=QTm+n​+Kxm+n+1

Proved
Pade.pade_bezout_form

by LG · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisnumerical-analysispolynomials

Bézout form of the Padé condition (extended Euclidean algorithm). Let FFF be a field, f∈F[[x]]f \in F[[x]]f∈F[[x]], m,n≥0m, n \ge 0m,n≥0, and let

Tm+n(x)  =  c0+c1x+⋯+cm+nxm+nT_{m+n}(x) \;=\; c_0 + c_1x + \cdots + c_{m+n}x^{m+n}Tm+n​(x)=c0​+c1​x+⋯+cm+n​xm+n

be the truncation of fff at order m+nm+nm+n, where cic_ici​ is the coefficient of xix^ixi in fff. For arbitrary polynomials P,Q∈F[x]P, Q \in F[x]P,Q∈F[x],

Qf−P≡0(modxm+n+1)⟺∃ K∈F[x]: P(x)=Q(x) Tm+n(x)+K(x) xm+n+1.Q f - P \equiv 0 \pmod{x^{m+n+1}} \quad \Longleftrightarrow \quad \exists\, K \in F[x] : \ P(x) = Q(x)\,T_{m+n}(x) + K(x)\,x^{m+n+1} .Qf−P≡0(modxm+n+1)⟺∃K∈F[x]: P(x)=Q(x)Tm+n​(x)+K(x)xm+n+1.

This is the identity the source records as the starting point of the extended-Euclid computation of a Padé approximant: the relation R=P/Q=Tm+n mod xm+n+1R = P/Q = T_{m+n} \bmod x^{m+n+1}R=P/Q=Tm+n​modxm+n+1 "is equivalent to the existence of some factor K(x)K(x)K(x) such that P=QTm+n+Kxm+n+1P = Q T_{m+n} + K x^{m+n+1}P=QTm+n​+Kxm+n+1", which is read as one Bézout identity in the extended greatest-common-divisor computation for xm+n+1x^{m+n+1}xm+n+1 and Tm+n(x)T_{m+n}(x)Tm+n​(x).

No hypotheses are imposed on PPP or QQQ here — in particular no degree bounds and no condition at the origin — so the lemma isolates exactly the congruence clause of the Padé predicate and converts it from a condition on power series into a polynomial identity, which is the form an algorithmic treatment needs.

Preamble
import Mathlib
import Definitions.Def_pade_approximant_def
open Polynomial
Formal statement
namespace Pade

theorem pade_bezout_form {F : Type*} [Field F] (f : PowerSeries F) (m n : ℕ)
    (P Q : Polynomial F) :
    (∀ k ≤ m + n, PowerSeries.coeff k ((Q : PowerSeries F) * f - (P : PowerSeries F)) = 0) ↔
      ∃ K : Polynomial F,
        P = Q * PowerSeries.trunc (m + n + 1) f + K * X ^ (m + n + 1) := by sorry

end Pade
Source
Padé approximant, Wikipedia, revision oldid=1374746248, https://en.wikipedia.org/w/index.php?title=Pad%C3%A9_approximant&oldid=1374746248, section 'Computation' (displays 'R(x) = P(x)/Q(x) = T_{m+n}(x) mod x^{m+n+1}' and 'P(x) = Q(x)T_{m+n}(x) + K(x)x^{m+n+1}')
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Provenance note — this read-back is NOT blind and NOT independent. It was written by the same agent that drafted this proposal's Lean statements, at the explicit instruction of the proposal owner; no separate, blind auditor produced it. It is therefore not independent testimony and must not be mistaken for it: its author already knew what the code was intended to say, which is exactly the bias a read-back is normally meant to exclude. Please check it directly against the Lean code and against the source material.

Let FFF be an arbitrary type with a field structure, f∈F[[x]]f \in F[[x]]f∈F[[x]] an arbitrary formal power series, m,nm, nm,n arbitrary natural numbers (either may be 000), and P,Q∈F[x]P, Q \in F[x]P,Q∈F[x] arbitrary polynomials. No hypotheses at all are assumed: in particular QQQ may be zero, Q(0)Q(0)Q(0) may vanish, and neither deg⁡P≤m\deg P \le mdegP≤m nor deg⁡Q≤n\deg Q \le ndegQ≤n is required.

Write TTT for the truncation of fff at order m+n+1m+n+1m+n+1, that is, the polynomial

T  =  ∑i=0m+n([xi]f) xi  ∈  F[x],T \;=\; \sum_{i=0}^{m+n} \big([x^i] f\big)\, x^i \;\in\; F[x],T=i=0∑m+n​([xi]f)xi∈F[x],

obtained by discarding all terms of fff of degree m+n+1m+n+1m+n+1 and higher (in the source's notation, Tm+nT_{m+n}Tm+n​).

The conclusion is the equivalence

(∀k∈N, k≤m+n ⇒ [xk](Q⋅f−P)=0)  ⟺  (∃ K∈F[x]: P  =  Q T  +  K xm+n+1).\Big(\forall k \in \mathbb{N},\ k \le m+n \ \Rightarrow\ [x^k]\big(Q\cdot f - P\big) = 0\Big) \iff \Big(\exists\, K \in F[x] : \ P \;=\; Q\,T \;+\; K\,x^{m+n+1}\Big).(∀k∈N, k≤m+n ⇒ [xk](Q⋅f−P)=0)⟺(∃K∈F[x]: P=QT+Kxm+n+1).

On the left, PPP and QQQ are included into F[[x]]F[[x]]F[[x]] and the arithmetic is that of formal power series; the condition says that the coefficients of x0,…,xm+nx^0, \dots, x^{m+n}x0,…,xm+n of Qf−PQ f - PQf−P all vanish, i.e. that xm+n+1x^{m+n+1}xm+n+1 divides Qf−PQf - PQf−P.

On the right, the equation is an identity of polynomials in F[x]F[x]F[x], and KKK is existentially quantified over all polynomials with no degree restriction; the sign of KKK is immaterial since −K-K−K ranges over the same set. Nothing forces KKK to be nonzero, and nothing forces KKK to be unique in the statement (although the displayed equation determines it once PPP, QQQ, TTT are fixed, since F[x]F[x]F[x] is a domain and xm+n+1≠0x^{m+n+1} \ne 0xm+n+1=0).

Both directions of the equivalence are asserted. The statement makes no existence claim about PPP or QQQ themselves, and no claim about coefficients of index above m+nm+nm+n.

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

    Confirmed by the moderator at approval.

  • Endorsed by LG · 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me