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 has bounded variation, then for every there is a finite step function with . Endpoint values of may be prescribed to equal those of .
More precisely, if is at most countable and is continuous at every point of , the interior breakpoints of may all be chosen outside .
Facts & Assumptions
Given: A BV function , a tolerance , and, for the strengthened assertion, an at most countable set of continuity points of .
A BV function has finite one-sided limits at every point (A bounded-variation function has at most countably many discontinuities, all of the first kind, The left and right limits of at , as limits of the restrictions of to and ).
Every nonempty subset of the reals that is bounded above has a supremum (Complete ordered field (least-upper-bound property)).
Every nonempty open interval is uncountable (Every nondegenerate interval of is uncountable).
Proof
Fix . Let be the set of for which there is a finite chain such that the oscillation of on every open interval is below . The set contains and is bounded above by , so exists by [L2].
Suppose . The left limit at and the right limit at supplied by [L1] give one-sided intervals on which the oscillation is below . Choose in the left interval (use if ), append to its chain if necessary, and then append a point in the right interval. This puts in , contradicting that is an upper bound. Hence . The left limit at now lets a chain ending sufficiently near be extended to . Thus there is a finite partition of on each of whose open components the oscillation of is below . The singleton case is immediate.
On each open component choose one value of , and at every partition point assign the actual value of . The resulting finite step function differs from by less than everywhere. Taking leaves room for the strengthened construction.
Only finitely many interior breakpoints lie in . Around each such breakpoint , continuity of gives a small two-sided interval, disjoint from the corresponding intervals for the other breakpoints, on which the oscillation is below . By [L3] choose a replacement point outside 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 , and a component can be enlarged at both ends, so its new oscillation is at most , 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 .
Depends on
- A bounded-variation function has at most countably many discontinuities, all of the first kind
- The left and right limits of $f$ at $c$, as limits of the restrictions of $f$ to $A \cap (-\infty, c)$ and $A \cap (c, \infty)$
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Complete ordered field (least-upper-bound property)
- Partition of $[a,b]$ as a finite strictly increasing list $a = t_0 < t_1 < \dots < t_n = b$, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
- Bounded variation and total variation on an interval
- Every nondegenerate interval of $\mathbb{R}$ is uncountable
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 89 results over 19 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
- William F. Trench, Introduction to Real Analysis, Section 3.2 (standard reference, not scraped)