Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

The graph of a continuous function on a compact Euclidean set has content zero

Statement

The graph of every continuous f:CR on a compact set CRm has content zero in Rm+1.

Facts & Assumptions

Given: A compact set CRm, a continuous function f:CR, its graph G:={(u,f(u)):uC}, and a tolerance ε>0.

[F1]

A continuous map from a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F2]

Content zero means the existence, for every positive tolerance, of a finite closed-cube cover with total volume at most that tolerance (Measure zero and content zero in Rm by countable and finite cube covers).

[F3]

A continuous real function on a nonempty compact metric space has bounded image (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

Proof

technique · direct
1.1

If C=, then G= and the empty finite cover proves the conclusion. If m=0, then R0 has exactly one point, so C has at most one point and G is a single point of R1, covered for every tolerance by one closed cube of small enough side; [F2] gives content zero. Hence assume C and m1, so that the divisions by m below are defined.

givenF2cases
1.2

By [F4], compactness places C in a closed cube Q, and [F3] bounds f(C) in an interval. By [F1], for every η>0 there is δ>0 such that f(u)f(v)<η whenever u,vC and uv2<δ.

givenF1F3F4
2.1

Partition a fixed cube slightly larger than Q into coordinate cubes of side h<δ/m. Keep only the base cells meeting C, and above each such cell keep the vertical (m+1)-grid cubes that meet G. Values of f over one base cell differ by less than η, so its retained vertical stack has total height at most η+2h. If B is the volume of the enlarged base cube, the retained cubes cover G and have total volume at most B(η+2h).

step 1.2constructalgebra
3.1

Choose η and then h so that B(η+2h)<ε. Step 2.1 is then a finite closed-cube cover of G with total volume below ε; by [F2], G has content zero.

step 2.1F2choose

Depends on

Used by

Dependency tree · two levels

72 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