Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Taylor's Lagrange remainder follows from repeated Rolle steps

Statement

Let n≥0, let f have continuous derivatives through order n+1 on an open interval containing the closed interval between c and x, and define Pn(t)=∑j=0nf(j)(c)(t−c)j/j!. If x≠c, there is a point ξ strictly between c and x such that

f(x)−Pn(x)=f(n+1)(ξ)(n+1)!(x−c)n+1.

For x=c, the remainder is zero.

Facts & Assumptions

Given: n≥0, points c,x in an open interval on which f is Cn+1 as defined in Continuity and derivative on a real interval, the power rule in Sum, product, quotient, and chain rules from difference quotients, and the closed-interval mean value theorem Mean value theorem on a closed real interval.

[L1]

Mean value theorem on a closed real interval: a continuous function on [u,v] differentiable on (u,v) has a point w∈(u,v) with g(v)−g(u)=g′(w)(v−u).

[L2]

Sum, product, quotient, and chain rules from difference quotients: the chain rule holds and tm has derivative mtm−1 for each integer m≥1, hence (t−c)m has derivative m(t−c)m−1.

Proof

1.1givenL2constructalgebra

Fix x≠c and set A=(f(x)−Pn(x))/(x−c)n+1 and g(t)=f(t)−Pn(t)−A(t−c)n+1 on the interval between c and x. Then g(c)=g(x)=0 and g(j)(c)=0 for each 1≤j≤n, because the Taylor polynomial matches those derivatives at c by [L2] and the last term has a zero of order n+1.

2.1step 1.1L1induction

By [L1] applied to g on the interval with endpoints c,x, there is a point z1 strictly between them with g′(z1)=0. If n≥1, also g′(c)=0, so [L1] applied to g′ between c and z1 gives z2 between them with g′′(z2)=0. Inductively, for each j≤n the zeros g(j)(c)=0 and g(j)(zj)=0 give a point zj+1 between them with g(j+1)(zj+1)=0. The last point is the required ξ; when n=0, take ξ=z1.

3.1step 1.1step 2.1L2algebra∎

Since Pn(n+1)=0 and the (n+1)st derivative of A(t−c)n+1 is A(n+1)!, the equation g(n+1)(ξ)=0 gives A=f(n+1)(ξ)/(n+1)! by [L2]. Substituting the definition of A proves the formula. At x=c, Pn(c)=f(c) directly.

Depends on

Used by

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources