Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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 indicator of the Cantor set is discontinuous exactly on the Cantor set, which is null, so it is Riemann integrable with integral 00 even though it is discontinuous at uncountably many points

Example

Let C[0,1]C \subseteq [0,1] be the Cantor middle-thirds set (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) and let 1C:[0,1]R\mathbf{1}_C : [0,1] \to \mathbb{R} be its indicator, 1C(x)=1\mathbf{1}_C(x) = 1 for xCx \in C and 1C(x)=0\mathbf{1}_C(x) = 0 otherwise. Then:

  1. 1C\mathbf{1}_C is discontinuous at every point of CC and continuous at every point of [0,1]C[0,1] \setminus C, so its set of discontinuities is exactly CC (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point, Discontinuity of ff at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind);
  2. 1C\mathbf{1}_C is Riemann integrable on [0,1][0,1], because CC has measure zero (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero);
  3. 011C=0\int_0^1 \mathbf{1}_C = 0.

The point of the example is claim 2 against claim 1. The discontinuity set is uncountable (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, Finite, countably infinite, countable, uncountable), so no cardinality argument such as A bounded function on [a,b][a,b] whose set of discontinuities is at most countable is Riemann integrable applies; what makes the function integrable is that CC can be covered by intervals of arbitrarily small total length, and nothing else.

Only the implication "measure zero \Rightarrow integrable" of Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero is used, so no choice principle is involved.

Facts & Assumptions

Given: The Cantor set C[0,1]C \subseteq [0,1] and its indicator 1C:[0,1]R\mathbf{1}_C : [0,1] \to \mathbb{R}.

[L3]

A bounded ff on [a,b][a,b] with a<ba < b is Riemann integrable if and only if its set of discontinuities has measure zero; the implication from "measure zero" to "integrable" uses no choice principle (Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero, Lower bound, bounded below, bounded set).

[L4]

For a partition P=(n,t)P = (n,t) of [0,1][0,1]: n1n \ge 1, ti<ti+1t_i < t_{i+1}, Δi>0\Delta_i > 0, Ii=[ti,ti+1][0,1]I_i = [t_i,t_{i+1}] \subseteq [0,1], and (ti,ti+1)(t_i,t_{i+1}) is a nonempty open subset of [0,1][0,1] (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

[L6]

A set with a least element has it as its infimum; the supremum of {0}\{0\} is 00 (Greatest lower bound (infimum), Maximum and minimum of a set, Complete ordered field (least-upper-bound property)).

[L7]
[L8]

Ordered-field arithmetic: for 0x10 \le x \le 1 and a real ρ>0\rho > 0 the reals u:=max{0,xρ}u := \max\{0,x-\rho\} and v:=min{1,x+ρ}v := \min\{1,x+\rho\} satisfy u<vu < v and (u,v)Nρ(x)[0,1](u,v) \subseteq N_\rho(x)\cap[0,1] (Maximum and minimum of a set, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property), The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Verification

technique · direct
1.1

1C\mathbf{1}_C takes only the values 00 and 11, so it is bounded on [0,1][0,1] and its Darboux sums and integrals are defined by [L5].

givenL5
1.2

Discontinuity on CC. Let xCx \in C, so 1C(x)=1\mathbf{1}_C(x) = 1, and let a real ρ>0\rho > 0 be given. By [L8] the set (u,v)Nρ(x)[0,1](u,v) \subseteq N_\rho(x)\cap[0,1] is a nonempty open interval, so by [L1] it contains a point yCy \notin C; then y[0,1]y \in [0,1], yx<ρ|y-x| < \rho and 1C(x)1C(y)=1|\mathbf{1}_C(x) - \mathbf{1}_C(y)| = 1. So the continuity condition fails at xx for ε:=1\varepsilon := 1.

givenL1L8
1.3

Continuity off CC. Let x[0,1]x \in [0,1] with xCx \notin C. Since CC is closed, [L2] gives a real ρ>0\rho > 0 with Nρ(x)C=N_\rho(x) \cap C = \varnothing, so 1C\mathbf{1}_C vanishes on Nρ(x)[0,1]N_\rho(x)\cap[0,1] and 1C(y)1C(x)=0<ε|\mathbf{1}_C(y) - \mathbf{1}_C(x)| = 0 < \varepsilon there for every ε>0\varepsilon > 0.

givenL1L2
2.1

So the set of discontinuities of 1C\mathbf{1}_C in [0,1][0,1] is exactly CC, which has measure zero by [L1]; by [L3] and 0<10 < 1, 1C\mathbf{1}_C is Riemann integrable on [0,1][0,1].

step 1.1step 1.2step 1.3L1L3
2.2

Every lower sum is 00. Let P=(n,t)P = (n,t) be a partition of [0,1][0,1] and i<ni < n. By [L4] the interval (ti,ti+1)(t_i,t_{i+1}) is a nonempty open subset of [0,1][0,1], so by [L1] it contains a point outside CC, at which 1C\mathbf{1}_C takes the value 00; since 1C0\mathbf{1}_C \ge 0, the value 00 is the least element of 1C[Ii]\mathbf{1}_C[I_i] and mi=0m_i = 0 by [L6]. Hence L(1C,P)=0L(\mathbf{1}_C,P) = 0 by [L5] and [L7].

step 1.1L1L4L5L6L7
3.1

The set of lower sums is {0}\{0\}, so 011C=0\underline{\int_0^1}\mathbf{1}_C = 0 by [L6]; and 1C\mathbf{1}_C is integrable by step 2.1, so 011C=0\int_0^1 \mathbf{1}_C = 0 by [L5].

step 2.1step 2.2L5L6

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 155 results over 26 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