Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-11
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.

Bounded variation and total variation on an interval

Definition

Let aba\le b and let f:[a,b]Rf:[a,b]\to\mathbb R (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). If a<ba<b and P=(n,t)P=(n,t) is a partition of [a,b][a,b] (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions), the variation of ff over PP is

V(f,P):=i<nf(ti+1)f(ti).V(f,P):=\sum_{i<n}|f(t_{i+1})-f(t_i)|.

The sum is finite (Finite sums and finite products, by recursion, Laws of finite sums and finite products) and nonnegative (Absolute value in an ordered field). The set of all such sums is nonempty, since [a,b][a,b] has the partition with point set {a,b}\{a,b\}. The function ff has bounded variation on [a,b][a,b] when this set of sums is bounded above (Lower bound, bounded below, bounded set). In that case its total variation is

Var[a,b](f):=supPV(f,P).\operatorname{Var}_{[a,b]}(f):=\sup_P V(f,P).

Completeness of R\mathbb R gives this supremum and Suprema and infima are unique makes it unique (Complete ordered field (least-upper-bound property)). On a singleton interval, by convention, Var[a,a](f):=0\operatorname{Var}_{[a,a]}(f):=0; no partition from Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, whose standing hypothesis is a<ba<b, is invoked.

Depends on

Used by

Dependency tree · next 3 levels

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