Alphabeta Math
CorollaryStatement: 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.

A bounded-variation function has at most countably many discontinuities, all of the first kind

Statement

If f:[a,b]→R has bounded variation, every well-posed one-sided limit of f exists. Consequently every discontinuity is of the first kind, and the set of discontinuities is at most countable.

Facts & Assumptions

Proof

technique · direct
1.1

Apply [L2] to Pf and Nf. At every endpoint or interior point where a one-sided limit is defined, both component limits exist, and [L4] gives the corresponding one-sided limit of f=f(a)+Pf−Nf. Thus f has no discontinuity of the second kind.

L1L2L4
1.2

If both Pf and Nf are continuous at a point, [L4] makes f continuous there. Hence the discontinuity set of f is contained in the union of the two component discontinuity sets.

L1L4
2.1

Each component discontinuity set is at most countable by [L3]. Given injections of them into N, map the first set to the even naturals and the points belonging only to the second to the odd naturals; this injects their union into N. Step 1.2 therefore makes the discontinuity set of f at most countable, and step 1.1 makes every one of its discontinuities first-kind.

step 1.1step 1.2L3algebra∎

Depends on

Used by

Dependency tree · two levels

38 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