Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

FALSE: a bounded function on [a,b] is Riemann integrable exactly when its set of discontinuities is nowhere dense

Statement

False claim: a bounded function f:[a,b]→R is Riemann integrable on [a,b] (The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abf) if and only if its set of discontinuities is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R, Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).

The claim replaces the correct smallness condition, measure zero (Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero), by the smallness condition of category. The two are independent, and the implication that fails below is the one from "nowhere dense" to "integrable": the indicator of the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals) is discontinuous exactly on a closed nowhere dense set and is not integrable, because that set cannot be covered by intervals of small total length.

The other implication fails too, and more cheaply: Thomae's function is integrable and its discontinuity set is Q∩[0,1], which is dense in [0,1] and therefore not nowhere dense. One failing direction refutes the biconditional, and the harder one is worked out below.

Facts & Assumptions

Given: The Smith-Volterra-Cantor set S⊆[0,1] (The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals) and its indicator g:[0,1]→R, with g(x)=1 for x∈S and g(x)=0 for x∈[0,1]∖S.

[A1]

The false claim, in the direction used here: if a bounded f on [a,b] has a nowhere dense set of discontinuities, then f is Riemann integrable.

[L1]

S is closed and bounded and nowhere dense, and if (ak), (bk) are sequences of reals with ak≤bk, S⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤M for every i∈N, then M≥2−1; in particular S does not have measure zero (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals, Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L3]

A set is closed exactly when its complement is open, that is, when every point outside it has a neighbourhood missing it (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]
[L5]

L(g,P)=∑i<nmiΔi, U(g,P)=∑i<nMiΔi with mi=inf⁡g[Ii] and Mi=sup⁡g[Ii]; ∫01‾g is the supremum of the lower sums and ∫01‾g the infimum of the upper sums; g is integrable exactly when they agree (For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔi, The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abf).

[L6]

A set with a least element has it as its infimum and one with a greatest element has it as its supremum (Greatest lower bound (infimum), Maximum and minimum of a set, Complete ordered field (least-upper-bound property)).

[L7]

Finite sums: scaling, splitting, monotonicity in the terms, and ∑i<n0=0; a finite list may be extended to a sequence by degenerate intervals of length 0 without changing any partial total (Finite sums and finite products, by recursion, Laws of finite sums and finite products, Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L8]

Ordered-field arithmetic: the order is total, so any two reals have a maximum and a minimum; adding a constant preserves an inequality. For 0≤x≤1 and a real ρ>0, the reals u:=max⁡{0,x−ρ} and v:=min⁡{1,x+ρ} satisfy u<v, by checking the four cases of which member each of the two attains, and (u,v)⊆Nρ(x)∩[0,1], since z∈(u,v) gives x−ρ≤u<z<v≤x+ρ and 0≤u<z<v≤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 ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of 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.

Refutation

technique · direct
1.1

g is bounded, taking only the values 0 and 1, so its Darboux sums and integrals are defined by [L5].

givenL5
1.2

g is discontinuous at every point of S. Let x∈S, so g(x)=1, and let a real ρ>0 be given. Put u:=max⁡{0, x−ρ} and v:=min⁡{1, x+ρ}; then u<v because 0≤x≤1 and ρ>0, and (u,v)⊆Nρ(x)∩[0,1] by [L8]. Since S is closed and nowhere dense it contains no nonempty open set by [L1] and [L2], so there is y∈(u,v) with y∉S. Then y∈[0,1], ∣y−x∣<ρ and ∣g(x)−g(y)∣=1, so the continuity condition fails at x for ε:=1.

givenL1L2L6L8
1.3

g is continuous at every point of [0,1]∖S. Let x∈[0,1] with x∉S. Since S is closed, [L3] gives a real ρ>0 with Nρ(x)∩S=∅, so g vanishes identically on Nρ(x)∩[0,1] and ∣g(y)−g(x)∣=0<ε there, for every ε>0.

givenL1L3
2.1

So the set of discontinuities of g in [0,1] is exactly S, which is nowhere dense by [L1].

step 1.2step 1.3L1
2.2

Every upper Darboux sum of g is at least 2−1. Let P=(n,t) be a partition of [0,1] and let B:={ i<n:Ii∩S≠∅ }. For i∈B the set g[Ii] contains 1, so Mi=1 by [L6] and g≤1; for i∉B one has g[Ii]={0} and Mi=0. Hence U(g,P)=∑i<nMiΔi is the sum of the Δi with i∈B, by [L5] and [L7].

step 1.1L5L6L7
2.3

Every lower Darboux sum of g is 0. With P as above and i<n: ti<ti+1 by [L4], so (ti,ti+1) is a nonempty open subset of [0,1], and by [L1] and [L2] it is not contained in S; a point of it outside S lies in Ii∩[0,1] and has g-value 0, so g[Ii] contains 0 and mi=0 by [L6], g being nonnegative. Hence L(g,P)=0 by [L5] and [L7].

step 1.1L1L2L4L5L6L7
3.1

The intervals Ii with i∈B cover S: a point of S lies in [0,1]=⋃i<nIi by [L4], hence in some Ii, and that i is in B. Extending this finite list of closed intervals to a sequence by degenerate intervals [0,0] ([L7]) gives a cover of S all of whose partial total lengths are at most U(g,P), so [L1] gives U(g,P)≥2−1.

step 2.2L1L4L7
4.1

Therefore ∫01‾g=0 by [L6] and step 2.3, while ∫01‾g≥2−1 by step 3.1, since every upper sum is at least 2−1 and the infimum of such a set is at least 2−1. The two differ, so g is not Riemann integrable by [L5].

step 3.1step 2.3L5L6
5.1

So g is a bounded function on [0,1] whose set of discontinuities is nowhere dense and which is not Riemann integrable; [A1] fails at g, and with it the claimed equivalence.

step 2.1step 4.1A1∎

Remarks

Depends on

Used by

Dependency tree · two levels

68 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