Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-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.

For every FσF_\sigma subset EE of [0,1][0,1] of measure zero there is a bounded Riemann integrable function on [0,1][0,1] whose set of discontinuities is exactly EE

Example

Let E[0,1]E \subseteq [0,1] be an FσF_\sigma subset of R\mathbb{R} (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}) of measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)). Then there is a bounded function h:[0,1]Rh : [0,1] \to \mathbb{R}, with values in [0,1][0,1], that is Riemann integrable on [0,1][0,1] and whose set of discontinuities is exactly EE (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).

The construction. Fix closed sets F0,F1,F2,F_0, F_1, F_2, \dots with E=nNFnE = \bigcup_{n \in \mathbb{N}} F_n and put

h(x)  :=  2n(x)  for xE,h(x)  :=  0  for x[0,1]E,h(x) \;:=\; 2^{-n(x)} \ \text{ for } x \in E, \qquad h(x) \;:=\; 0 \ \text{ for } x \in [0,1]\setminus E,

where n(x):=min{nN:xFn}n(x) := \min\{\, n \in \mathbb{N} : x \in F_n \,\} is the least index of a closed set containing xx (The well-ordering principle). Nothing is selected: n(x)n(x) is the least element of a set determined by xx and the fixed sequence (Fn)(F_n).

Why this is worth stating. Together with For f:ARf : A \to \mathbb{R} the set of points of AA at which ff is discontinuous is the intersection with AA of an FσF_\sigma subset of R\mathbb{R}, and the set of points at which ff is continuous is the intersection with AA of a GδG_\delta subset; for A=RA = \mathbb{R} the two sets are FσF_\sigma and GδG_\delta outright, which shows that a discontinuity set is always the trace of an FσF_\sigma set, and with 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, which shows that an integrable function has a null discontinuity set, the example says that the two necessary conditions are also jointly sufficient: null and FσF_\sigma is exactly what a discontinuity set of a Riemann integrable function on [0,1][0,1] can be. The Cantor set and any at most countable subset of [0,1][0,1] are instances.

Choice. The construction uses none; the only choice principle in the statement comes from the direction 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 used at the end, and that direction, "null \Rightarrow integrable", is a theorem of ZF.

Facts & Assumptions

Given: An FσF_\sigma set E[0,1]E \subseteq [0,1] of measure zero, and a sequence (Fn)nN(F_n)_{n \in \mathbb{N}} of closed subsets of R\mathbb{R} with E=nFnE = \bigcup_n F_n.

[L2]

Every nonempty subset of N\mathbb{N} has a least element (The well-ordering principle).

[L5]

Powers: 2n>02^{-n} > 0 for every nNn \in \mathbb{N}, 20=12^{0} = 1, 2n12^{-n} \le 1, and m<nm < n implies 2n<2m2^{-n} < 2^{-m} (Integer powers ama^m, Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n).

[L7]

For every real η>0\eta > 0 there is a natural N1N \ge 1 with 1/ι(N)<η1/\iota(N) < \eta, and 2N1/ι(N)2^{-N} \le 1/\iota(N) for N1N \ge 1, since ι(N)2N\iota(N) \le 2^{N} by induction (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing, Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n).

[L9]

Ordered-field arithmetic and the absolute value: the order is total and transitive; 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]; a nonempty open interval is a nondegenerate interval (Basic properties of the absolute value, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Maximum and minimum of a set, Ordered field, Complete ordered field (least-upper-bound property), Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Interior, closure, boundary and exterior of a subset of R\mathbb{R}, The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points). 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 · constructive
1.1

Fix the sequence (Fn)(F_n) of [L1] and define n(x):=min{nN:xFn}n(x) := \min\{\, n \in \mathbb{N} : x \in F_n \,\} for xEx \in E, which exists by [L2] since the set is a nonempty subset of N\mathbb{N}; define h:[0,1]Rh : [0,1] \to \mathbb{R} by h(x):=2n(x)h(x) := 2^{-n(x)} for xEx \in E and h(x):=0h(x) := 0 otherwise.

givenL1L2L5construct
2.1

hh is bounded with values in [0,1][0,1]: 0<2n(x)20=10 < 2^{-n(x)} \le 2^{0} = 1 for xEx \in E by [L5], and h=0h = 0 off EE.

step 1.1L5
2.2

hh is discontinuous at every point of EE. Let xEx \in E, so h(x)=2n(x)>0h(x) = 2^{-n(x)} > 0 by [L5], and let a real ρ>0\rho > 0 be given. By [L9] the interval (u,v)Nρ(x)[0,1](u,v) \subseteq N_\rho(x)\cap[0,1] is nonempty with u<vu < v, hence is a nondegenerate interval, so by [L4] it is not contained in EE: there is y(u,v)y \in (u,v) with yEy \notin E, and then h(y)=0h(y) = 0 and h(x)h(y)=2n(x)|h(x)-h(y)| = 2^{-n(x)}. So the continuity condition fails at xx for ε:=2n(x)\varepsilon := 2^{-n(x)}.

step 1.1L4L5L9
2.3

hh is continuous at every point of [0,1]E[0,1]\setminus E. Let x[0,1]x \in [0,1] with xEx \notin E, so h(x)=0h(x) = 0, and let a real ε>0\varepsilon > 0 be given. By [L7] fix a natural N1N \ge 1 with 2N1/ι(N)<ε2^{-N} \le 1/\iota(N) < \varepsilon. For each nNn \le N one has xFnx \notin F_n, since FnEF_n \subseteq E, so [L3] supplies a real ρn>0\rho_n > 0 with Nρn(x)Fn=N_{\rho_n}(x) \cap F_n = \varnothing; put ρ:=min{ρ0,,ρN}>0\rho := \min\{\rho_0,\dots,\rho_N\} > 0, which exists by [L6].

step 1.1L3L6L7L9choose
3.1

For y[0,1]y \in [0,1] with yx<ρ|y - x| < \rho: if yEy \notin E then h(y)=0h(y) = 0; and if yEy \in E then yFny \notin F_n for every nNn \le N by step 2.3, so n(y)>Nn(y) > N and h(y)=2n(y)<2N<εh(y) = 2^{-n(y)} < 2^{-N} < \varepsilon by [L5] and step 2.3. In both cases h(y)h(x)=h(y)<ε|h(y) - h(x)| = h(y) < \varepsilon, so hh is continuous at xx.

step 1.1step 2.3L5L9
4.1

By steps 2.2 and 3.1 the set of discontinuities of hh in [0,1][0,1] is exactly EE, which has measure zero by hypothesis; hh is bounded by step 2.1 and 0<10 < 1, so [L8] gives that hh is Riemann integrable on [0,1][0,1]. The function hh constructed in step 1.1 therefore has all the stated properties.

step 2.1step 2.2step 3.1givenL8discharge-construct

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: 145 results over 32 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