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.

Every bounded-variation function is uniformly approximable by step functions

Statement

If f:[a,b]→R has bounded variation, then for every ε>0 there is a finite step function s with ∥f−s∥∞<ε. Endpoint values of s may be prescribed to equal those of f.

More precisely, if E⊆[a,b] is at most countable and f is continuous at every point of E, the interior breakpoints of s may all be chosen outside E.

Facts & Assumptions

Given: A BV function f, a tolerance ε>0, and, for the strengthened assertion, an at most countable set E of continuity points of f.

[L2]

Every nonempty subset of the reals that is bounded above has a supremum (Complete ordered field (least-upper-bound property)).

[L3]

Every nonempty open interval is uncountable (Every nondegenerate interval of R is uncountable).

Proof

technique · direct
1.1

Fix η>0. Let A be the set of x∈[a,b] for which there is a finite chain a=x0<⋯<xm=x such that the oscillation of f on every open interval (xj−1,xj) is below η. The set contains a and is bounded above by b, so c:=sup⁡A exists by [L2].

L2construct
2.1

Suppose c<b. The left limit at c and the right limit at c supplied by [L1] give one-sided intervals on which the oscillation is below η. Choose x∈A in the left interval (use x=a if c=a), append c to its chain if necessary, and then append a point y>c in the right interval. This puts y in A, contradicting that c is an upper bound. Hence c=b. The left limit at b now lets a chain ending sufficiently near b be extended to b. Thus there is a finite partition of [a,b] on each of whose open components the oscillation of f is below η. The singleton case is immediate.

step 1.1L1L2
3.1

On each open component choose one value of f, and at every partition point assign the actual value of f. The resulting finite step function differs from f by less than η everywhere. Taking η=ε/4 leaves room for the strengthened construction.

step 2.1choose
4.1

Only finitely many interior breakpoints lie in E. Around each such breakpoint c, continuity of f gives a small two-sided interval, disjoint from the corresponding intervals for the other breakpoints, on which the oscillation is below ε/4. By [L3] choose a replacement point outside E in that interval and between the neighboring breakpoints. Moving the breakpoint adds only a subinterval from this continuity neighborhood to either adjacent component; the original component oscillation is below ε/4, and a component can be enlarged at both ends, so its new oscillation is at most ε/4+ε/4+ε/4<ε, the three pieces overlapping at the old breakpoints. Sampling again and retaining the actual values at all breakpoints and endpoints gives the required approximation with every interior breakpoint outside E.

step 3.1L3∎

Depends on

Used by

Dependency tree · two levels

46 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