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

Homogeneity and subadditivity of total variation

Statement

For bounded-variation functions f,g:[a,b]→R and c∈R,

Var⁡(cf)=∣c∣Var⁡(f),Var⁡(f+g)≤Var⁡(f)+Var⁡(g).

Thus −f, f+g, and every finite linear combination of BV functions are BV; in particular Var⁡(−f)=Var⁡(f).

Facts & Assumptions

Given: BV functions f,g:[a,b]→R and a scalar c.

[L1]

Total variation is the supremum of partition variation sums (Bounded variation and total variation on an interval).

[L2]

A partition is a finite increasing point list (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).

[L3]

Finite sums distribute over scalar multiplication and addition (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L4]

∣cu∣=∣c∣∣u∣ (Basic properties of the absolute value).

[L5]

∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

Proof

technique · direct
1.1

For every partition P, [L4] and [L3] give V(cf,P)=∣c∣V(f,P). Taking suprema gives Var⁡(cf)=∣c∣Var⁡(f), including c=0 and the singleton interval.

L1L2L3L4
1.2

For every partition, [L5] applied to each increment and then [L3] give V(f+g,P)≤V(f,P)+V(g,P)≤Var⁡(f)+Var⁡(g). Taking the supremum proves subadditivity.

L1L2L3L5
2.1

Step 1.1 with c=−1 gives Var⁡(−f)=Var⁡(f). Repeated use of steps 1.1 and 1.2 proves closure under every finite linear combination.

step 1.1step 1.2L3∎

Depends on

Used by

Dependency tree · two levels

30 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