Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-01
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 polynomials and their remainders

Definition

Let nNn\in\mathbb N, let ff have derivatives through order nn at aa, and let ι:NR\iota:\mathbb N\to\mathbb R be the canonical embedding. The Taylor polynomial of degree at most nn about aa is Tn,af(x):=j=0nf(j)(a)ι(j!)(xa)j.T_{n,a}f(x):=\sum_{j=0}^{n}\frac{f^{(j)}(a)}{\iota(j!)}(x-a)^j. The Taylor remainder is Rn,af(x):=f(x)Tn,af(x)R_{n,a}f(x):=f(x)-T_{n,a}f(x).

The factorials are natural numbers as in The factorial n!n! and the falling factorial nkn^{\underline{k}}, defined by recursion in N\mathbb{N} and enter real arithmetic only through ι\iota (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field); they are nonzero (Canonical naturals are positive and strictly increasing). The sum and powers are those of Finite sums and finite products, by recursion, Laws of finite sums and finite products, and Integer powers ama^m. For n=0n=0, T0,afT_{0,a}f is the constant f(a)f(a).

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 72 results over 20 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