Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

[2/2][2/2][2/2] Padé approximant of ln⁡(1+x)\ln(1+x)ln(1+x)

Proved
Pade.pade_log_one_plus_two_two

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

analysisexamplespower-series

The [2/2][2/2][2/2] Padé approximant of ln⁡(1+x)\ln(1+x)ln(1+x). Let L(x)=x−x2/2+x3/3−⋯∈Q[[x]]L(x) = x - x^2/2 + x^3/3 - \cdots \in \mathbb{Q}[[x]]L(x)=x−x2/2+x3/3−⋯∈Q[[x]] be the formal logarithmic series. Then the pair

P(x)=x+12x2,Q(x)=1+x+16x2P(x) = x + \tfrac{1}{2}x^2, \qquad Q(x) = 1 + x + \tfrac{1}{6}x^2P(x)=x+21​x2,Q(x)=1+x+61​x2

is a Padé pair of type [2/2][2/2][2/2] for LLL: both degrees are at most 222, Q≠0Q \ne 0Q=0, and

Q(x)L(x)−P(x)≡0(modx5).Q(x)L(x) - P(x) \equiv 0 \pmod{x^{5}} .Q(x)L(x)−P(x)≡0(modx5).

Equivalently, since Q(0)=1Q(0) = 1Q(0)=1,

ln⁡(1+x)  ≈  x+12x21+x+16x2\ln(1+x) \;\approx\; \frac{x + \frac{1}{2}x^2}{1 + x + \frac{1}{6}x^2}ln(1+x)≈1+x+61​x2x+21​x2​

with agreement of the Maclaurin expansions through order 4=m+n4 = m+n4=m+n. This is the worked example given in the source's Examples section, and it serves as a concrete test vector for the Padé predicate: it pins down the indexing convention (agreement to order m+nm+nm+n, not m+n+1m+n+1m+n+1) on data where every coefficient can be checked by hand.

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

theorem pade_log_one_plus_two_two :
    IsPadeApproximant logOnePlus 2 2 (X + C (1 / 2 : ℚ) * X ^ 2)
      (1 + X + C (1 / 6 : ℚ) * X ^ 2) := 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 'Examples', subsection 'ln(1+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.

This is a closed statement about explicit data over the rationals; it has no variables and no hypotheses.

Let L∈Q[[x]]L \in \mathbb{Q}[[x]]L∈Q[[x]] be the formal power series whose coefficient of xkx^kxk is 000 for k=0k = 0k=0 and (−1)k+1/k(-1)^{k+1}/k(−1)k+1/k for k≥1k \ge 1k≥1, that is

L  =  x−12x2+13x3−14x4+⋯L \;=\; x - \tfrac12 x^2 + \tfrac13 x^3 - \tfrac14 x^4 + \cdotsL=x−21​x2+31​x3−41​x4+⋯

(a formal coefficient sequence; no convergence or identification with a logarithm is part of the statement). Let

P  =  x+12x2,Q  =  1+x+16x2∈Q[x],P \;=\; x + \tfrac{1}{2}x^2, \qquad Q \;=\; 1 + x + \tfrac{1}{6}x^2 \qquad \in \mathbb{Q}[x],P=x+21​x2,Q=1+x+61​x2∈Q[x],

and take m=2m = 2m=2, n=2n = 2n=2, so that m+n=4m + n = 4m+n=4.

The assertion is that the pair (P,Q)(P,Q)(P,Q) satisfies all four conditions of the Padé predicate for LLL at these indices:

  1. Q≠0Q \neq 0Q=0;
  2. deg⁡P≤2\deg P \le 2degP≤2;
  3. deg⁡Q≤2\deg Q \le 2degQ≤2;
  4. for every natural number k≤4k \le 4k≤4, the coefficient of xkx^kxk in Q⋅L−PQ \cdot L - PQ⋅L−P vanishes, the product and difference being taken in Q[[x]]\mathbb{Q}[[x]]Q[[x]] with PPP and QQQ included as power series.

Condition 4 concerns exactly the five coefficients of x0,x1,x2,x3,x4x^0, x^1, x^2, x^3, x^4x0,x1,x2,x3,x4; the statement asserts nothing about the coefficient of x5x^5x5 or beyond, and in particular does not claim that QL−PQ L - PQL−P is zero. Note also that PPP has zero constant term and that QQQ has constant term 111; these are features of the displayed data, not separately asserted facts.

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