Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02
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.

Polygonal functions with sufficiently steep nonvertex slopes are dense in C([0,1])

Statement

For every f∈C([0,1],R), every ε>0, and every M>0, there is a piecewise-affine h with finitely many vertices such that ∥f−h∥∞<ε and every slope on a nonvertex affine piece has absolute value greater than M.

Facts & Assumptions

Given: f∈C([0,1],R), ε>0, and M>0.

[L2]

Proof

technique · constructive
1.1

By [L1], choose a finite partition 0=x0<⋯<xr=1 so that ∣f(s)−f(t)∣<ε/4 whenever s,t are in one partition interval. Let g be the affine interpolant through (xi,f(xi)).

L1construct
2.1

The affine-interpolation formula makes ∣g(t)−f(t)∣<ε/4 on every partition interval. Let S be the maximum of the finitely many absolute slopes of g.

step 1.1algebra
3.1

Choose 0<η<ε/4. By [L2], subdivide every partition interval evenly enough to support a continuous triangular sawtooth w, zero at the old vertices, with ∥w∥∞≤η and every nonvertex slope of absolute value greater than S+M.

L2step 2.1construct
4.1

Put h=g+w. On each new affine piece, the reverse triangle inequality gives ∣h′∣≥∣w′∣−∣g′∣>M, while ∥h−f∥∞<ε/2<ε.

step 2.1step 3.1algebra
5.1

This h has the required finite polygonal structure, approximation, and slope bound.

step 4.1discharge-construct∎

Depends on

Used by

Dependency tree · two levels

20 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