Existence and uniqueness of the Padé approximant
ProvedPade.pade_existence_uniquenessFundamental theorem of Padé approximation (Frobenius). Let be a field, let be a formal power series and let be integers. Call a Padé pair of type for when , , and . Then:
Part (E) holds for every , and , with no condition on ; part (U) is the precise sense in which "the Padé approximant is unique as a formal power series for the given and ": two solutions need not be equal as pairs — they may differ by a common polynomial factor or a scalar — but they cross-multiply, hence define the same element of the field of rational functions .
Together the two parts make the Padé table a well-defined array, which is the foundation for every identity relating its entries and for every algorithm (extended Euclid, Wynn's -algorithm) that computes them.
import Mathlib import Definitions.Def_pade_approximant_def open Polynomial
namespace Pade
theorem pade_existence_uniqueness {F : Type*} [Field F] (f : PowerSeries F) (m n : ℕ) :
(∃ P Q : Polynomial F, IsPadeApproximant f m n P Q) ∧
(∀ P₁ Q₁ P₂ Q₂ : Polynomial F, IsPadeApproximant f m n P₁ Q₁ →
IsPadeApproximant f m n P₂ Q₂ → P₁ * Q₂ = P₂ * Q₁) := 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.
Throughout, is an arbitrary type equipped with a field structure (no assumption on its characteristic, cardinality, or ordering), is an arbitrary formal power series in , and are arbitrary natural numbers — so , and are all included.
The statement uses an auxiliary predicate on a pair of polynomials , which unfolds to the conjunction of: ; ; (degrees valued in , so the zero polynomial meets every degree bound); and the vanishing of the coefficient of in for every with , the products and differences being taken in after including and into . Call such a pair admissible.
The theorem asserts a conjunction of two claims, for the given , , :
the last equation being an identity of polynomials in .
Three observations on the exact strength of the claim. Part (2) does not assert or ; it asserts only the cross-multiplication identity, which is the statement that the two formal quotients agree as elements of the field of rational functions whenever the denominators are nonzero. Part (2) is a statement about all admissible pairs, including pairs whose denominator vanishes at the origin, so no normalisation such as is available to it. Finally, (1) and (2) are asserted together but independently: (1) guarantees the hypotheses of (2) are satisfiable, so (2) is not vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.