Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Rolle bound for a divided difference

Statement

Let a≤b, q∈N, let f∈Cq([a,b]), and let t0,…,tq be distinct points of [a,b]. Then

∣f[t0,…,tq]∣≤∥f(q)∥∞,[a,b]q!,

where 0!:=1, f(0):=f, and ∥g∥∞,[a,b]:=sup⁡x∈[a,b]∣g(x)∣.

Facts & Assumptions

Given: a≤b, q∈N, f∈Cq([a,b]), and distinct nodes t0,…,tq∈[a,b].

[F1]

Divided differences on distinct nodes and Divided differences are symmetric leading coefficients: the divided difference is the leading coefficient of the degree-at-most-q Lagrange interpolant through the node data.

[F2]

Higher derivatives and the classes Ck and C∞: f∈Cq([a,b]) means f(j) exists and is continuous on [a,b] for every 0≤j≤q, with one-sided endpoint derivatives.

[F3]

Rolle's theorem: if a<b, f is continuous on [a,b], differentiable at every point of (a,b), and f(a)=f(b), then f′(c)=0 for some c∈(a,b): a function continuous on a closed interval, differentiable on its interior, and equal at the endpoints has an interior point where its derivative is zero.

[F4]

The natural numbers N (von Neumann): 0∈N, so the order-zero case is part of the stated range.

[F5]

Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value: a continuous real function on a nonempty compact subset of R has a finite attained maximum and minimum.

Proof

1.1givenF1F4F5

If q=0, which is allowed by [F4], then f[t0]=f(t0), so the claim is ∣f(t0)∣≤∥f∥∞,[a,b]. The norm is finite by [F5].

2.1givenF1F2F3F5algebra∎

Suppose q≥1, and let P be the Lagrange interpolant in [F1], with leading coefficient c=f[t0,…,tq]. The function g=f−P has a zero at each of the q+1 distinct ordered nodes. Order those nodes increasingly and apply [F3] on each consecutive interval to obtain q distinct zeros of g′. Applying [F3] between consecutive zeros of g′ gives q−1 distinct zeros of g′′; continuing, after r rounds g(r) has q+1−r distinct zeros. Because f∈Cq by [F2] and P is a polynomial, each derivative through order q is continuous and its predecessor is differentiable, so every application satisfies [F3]. After q rounds one zero ξ of g(q) remains. Since P has degree at most q and leading coefficient c, its qth derivative is the constant q!c. Hence f(q)(ξ)=q!c, and the claimed bound follows by taking absolute values. The derivative norm is finite by [F5].

Depends on

Used by

Dependency tree · two levels

36 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