Bézout form
ProvedPade.pade_bezout_formBézout form of the Padé condition (extended Euclidean algorithm). Let be a field, , , and let
be the truncation of at order , where is the coefficient of in . For arbitrary polynomials ,
This is the identity the source records as the starting point of the extended-Euclid computation of a Padé approximant: the relation "is equivalent to the existence of some factor such that ", which is read as one Bézout identity in the extended greatest-common-divisor computation for and .
No hypotheses are imposed on or 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.
import Mathlib import Definitions.Def_pade_approximant_def open Polynomial
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 PadeRead-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 be an arbitrary type with a field structure, an arbitrary formal power series, arbitrary natural numbers (either may be ), and arbitrary polynomials. No hypotheses at all are assumed: in particular may be zero, may vanish, and neither nor is required.
Write for the truncation of at order , that is, the polynomial
obtained by discarding all terms of of degree and higher (in the source's notation, ).
The conclusion is the equivalence
On the left, and are included into and the arithmetic is that of formal power series; the condition says that the coefficients of of all vanish, i.e. that divides .
On the right, the equation is an identity of polynomials in , and is existentially quantified over all polynomials with no degree restriction; the sign of is immaterial since ranges over the same set. Nothing forces to be nonzero, and nothing forces to be unique in the statement (although the displayed equation determines it once , , are fixed, since is a domain and ).
Both directions of the equivalence are asserted. The statement makes no existence claim about or themselves, and no claim about coefficients of index above .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.