Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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.

Thomae's function is Riemann integrable on [0,1] with integral 0: it is continuous at every irrational, so its discontinuity set is countable, and every lower Darboux sum is 0

Example

Let t:[0,1]→R be Thomae's function restricted to [0,1]: at a rational x with least denominator q(x)≥1 it takes the value 1/ι(q(x)), and at an irrational x the value 0 (The Dirichlet function 1Q, and Thomae's function t with t(x)=1/q at a rational x=p/q in lowest terms with q≥1 and t(x)=0 at every irrational x, The canonical natural ι(n)=n⋅1F of a field). Then t is Riemann integrable on [0,1] and

∫01t  =  0.

Two ingredients, and they pull in opposite directions. t is continuous at every irrational and discontinuous at every rational (The Dirichlet function is continuous at no point of R, and Thomae's function is continuous at every irrational and at no rational, so its set of continuity points is exactly the set of irrationals and its oscillation at c equals t(c)), so its discontinuity set is Q∩[0,1], which is infinite and dense — and countable, which is what A bounded function on [a,b] whose set of discontinuities is at most countable is Riemann integrable needs. The value is then read off the lower sums, every one of which is 0 because every subinterval contains an irrational (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

Every upper sum, by contrast, is strictly positive, since every subinterval contains a rational; the upper integral is nevertheless 0, an infimum of positive numbers.

Facts & Assumptions

Given: Thomae's function t:[0,1]→R as above.

[L1]

t(x)=1/ι(q(x)) with ι(q(x))≥1>0 at a rational x, and t(x)=0 at an irrational x; hence 0≤t(x)≤1 everywhere and t(x)>0 at every rational x (The Dirichlet function 1Q, and Thomae's function t with t(x)=1/q at a rational x=p/q in lowest terms with q≥1 and t(x)=0 at every irrational x, The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

[L3]

Q is countably infinite and every subset of an at most countable set is at most countable (Q is countably infinite, Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable).

[L4]

A bounded function on [a,b] with a<b whose set of discontinuities is at most countable is Riemann integrable (A bounded function on [a,b] whose set of discontinuities is at most countable is Riemann integrable, Lower bound, bounded below, bounded set).

[L6]

For a partition P=(n,s) of [0,1]: n≥1, si<si+1, Δi>0, Ii=[si,si+1]⊆[0,1], and (si,si+1) is a nonempty open interval (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L8]

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

[L10]

Ordered-field arithmetic: the order is total and transitive, and a reciprocal of a positive quantity is positive (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)). 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

t is bounded on [0,1], with 0≤t(x)≤1 for every x, by [L1].

givenL1L10
1.2

By [L2], t is continuous at every irrational point of [0,1], so its set of discontinuities in [0,1] is contained in Q∩[0,1], which is at most countable by [L3]; a subset of it is then at most countable as well.

givenL2L3
2.1

By [L4] applied on [0,1], with 0<1, t is Riemann integrable on [0,1].

step 1.1step 1.2L4
2.2

Every lower sum is 0. Let P=(n,s) be a partition of [0,1] and i<n. By [L6] the interval (si,si+1) is nonempty and open, so by [L5] it contains an irrational y, and y∈Ii⊆[0,1], so t(y)=0 by [L1]. Since t≥0 by [L1], the value 0 is the least element of t[Ii] and mi=0 by [L8]. Hence L(t,P)=0 by [L7] and [L9].

step 1.1L1L5L6L7L8L9
3.1

The set of lower sums is therefore {0} and ∫01‾t=0 by [L8]; since t is integrable by step 2.1, ∫01t=0 by [L7].

step 2.1step 2.2L7L8∎

Remarks

Depends on

Used by

Dependency tree · two levels

91 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