Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Normalizing the denominator to 1+b1x+⋯+bnxn1 + b_1x + \cdots + b_nx^n1+b1​x+⋯+bn​xn

Proved
Pade.pade_normalization

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

analysispower-series

Normalization of the denominator. 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 (P,Q)(P,Q)(P,Q) be a Padé pair of type [m/n][m/n][m/n] for fff whose denominator does not vanish at the origin, q0:=Q(0)≠0q_0 := Q(0) \ne 0q0​:=Q(0)=0. Then the rescaled pair (q0−1P,  q0−1Q)(q_0^{-1}P,\; q_0^{-1}Q)(q0−1​P,q0−1​Q) is again a Padé pair of type [m/n][m/n][m/n] for fff, and

(q0−1Q)(0)  =  1.\big(q_0^{-1}Q\big)(0) \;=\; 1 .(q0−1​Q)(0)=1.

In other words, whenever the [m/n][m/n][m/n] entry is not defective one may always arrange the denominator in the normalized shape used in the source's definition,

R(x)  =  a0+a1x+⋯+amxm1+b1x+b2x2+⋯+bnxn,R(x) \;=\; \frac{a_0 + a_1x + \cdots + a_mx^m}{1 + b_1x + b_2x^2 + \cdots + b_nx^n},R(x)=1+b1​x+b2​x2+⋯+bn​xna0​+a1​x+⋯+am​xm​,

without changing the rational function or the order of contact with fff. This records that the normalization b0=1b_0 = 1b0​=1 is a convention and not an extra constraint: the solution set of the linearized problem is stable under multiplication by a nonzero scalar, and the scalar q0−1q_0^{-1}q0−1​ is the one that produces the displayed form.

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

theorem pade_normalization {F : Type*} [Field F] (f : PowerSeries F) (m n : ℕ)
    (P Q : Polynomial F) (h : IsPadeApproximant f m n P Q) (hQ : Q.coeff 0 ≠ 0) :
    IsPadeApproximant f m n (C (Q.coeff 0)⁻¹ * P) (C (Q.coeff 0)⁻¹ * Q) ∧
      (C (Q.coeff 0)⁻¹ * Q).coeff 0 = 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 'Definition' (the displayed normalized form of R(x)R(x)R(x))
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. Two hypotheses are assumed.

The first is that the pair (P,Q)(P,Q)(P,Q) satisfies the four-part condition: Q≠0Q \neq 0Q=0; deg⁡P≤m\deg P \le mdegP≤m; deg⁡Q≤n\deg Q \le ndegQ≤n (degrees in N∪{−∞}\mathbb{N}\cup\{-\infty\}N∪{−∞}, so P=0P=0P=0 is allowed); and [xk](Qf−P)=0[x^k](Q f - P) = 0[xk](Qf−P)=0 for every k≤m+nk \le m+nk≤m+n, computed in F[[x]]F[[x]]F[[x]] after including P,QP,QP,Q into power series.

The second is that the constant coefficient q0:=[x0]Qq_0 := [x^0]Qq0​:=[x0]Q is nonzero.

Write c:=q0−1∈Fc := q_0^{-1} \in Fc:=q0−1​∈F, the inverse in the field FFF, and let c Pc\,PcP and c Qc\,QcQ denote the polynomials obtained by multiplying by the constant polynomial ccc. The conclusion is a conjunction of two claims:

  1. The rescaled pair (c P,  c Q)(c\,P,\; c\,Q)(cP,cQ) again satisfies the same four-part condition for the same fff, mmm, nnn: namely c Q≠0c\,Q \neq 0cQ=0, deg⁡(c P)≤m\deg(c\,P) \le mdeg(cP)≤m, deg⁡(c Q)≤n\deg(c\,Q) \le ndeg(cQ)≤n, and [xk]((cQ)f−cP)=0[x^k]\big((cQ) f - cP\big) = 0[xk]((cQ)f−cP)=0 for all k≤m+nk \le m+nk≤m+n.

  2. The constant coefficient of the rescaled denominator equals one:

[x0](c Q)  =  1.[x^0]\big(c\,Q\big) \;=\; 1 .[x0](cQ)=1.

So the assertion is that a Padé pair whose denominator does not vanish at the origin may be rescaled by the single field element q0−1q_0^{-1}q0−1​ so that the denominator becomes monic at the constant term, i.e. takes the form 1+b1x+⋯+bnxn1 + b_1x + \cdots + b_nx^n1+b1​x+⋯+bn​xn, without disturbing the defining conditions. The statement is about this specific rescaling only; it does not claim that the rescaled pair is the unique normalised pair, nor does it say anything about pairs whose denominator vanishes at the origin.

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