Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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.

A uniform derivative bound gives a uniform Taylor remainder bound

Statement

Let nNn\in\mathbb N, and suppose ff has derivatives through order n+1n+1 on the closed interval between aa and xx, with the usual endpoint continuity. If f(n+1)(t)M|f^{(n+1)}(t)|\le M throughout that interval, then Rn,af(x)Mι((n+1)!)xan+1.|R_{n,a}f(x)|\le \frac{M}{\iota((n+1)!)}|x-a|^{n+1}.

Proof

technique · direct
1.1

If x=ax=a, then Rn,af(a)=0R_{n,a}f(a)=0, so the estimate is immediate. If xax\ne a, [L1] gives Rn,af(x)=f(n+1)(ξ)ι((n+1)!)(xa)n+1R_{n,a}f(x)=\frac{f^{(n+1)}(\xi)}{\iota((n+1)!)}(x-a)^{n+1} for some point ξ\xi strictly between aa and xx.

L1
2.1

In the case xax\ne a, take absolute values in step 1.1, use f(n+1)(ξ)M|f^{(n+1)}(\xi)|\le M, and divide by the positive factorial. Together with the case x=ax=a, this proves the estimate.

step 1.1L2algebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 60 results over 18 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources