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

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

Example

Let E⊆[0,1] be an Fσ subset of R (Fσ and Gδ subsets of R) of measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)). Then there is a bounded function h:[0,1]→R, with values in [0,1], that is Riemann integrable on [0,1] and whose set of discontinuities is exactly E (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, Discontinuity of f 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,… with E=⋃n∈NFn and put

h(x)  :=  2−n(x)  for x∈E,h(x)  :=  0  for x∈[0,1]∖E,

where n(x):=min⁡{ n∈N:x∈Fn } is the least index of a closed set containing x (The well-ordering principle). Nothing is selected: n(x) is the least element of a set determined by x and the fixed sequence (Fn).

Why this is worth stating. Together with For f:A→R the set of points of A at which f is discontinuous is the intersection with A of an Fσ subset of R, and the set of points at which f is continuous is the intersection with A of a Gδ subset; for A=R the two sets are Fσ and Gδ outright, which shows that a discontinuity set is always the trace of an Fσ set, and with 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, 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σ is exactly what a discontinuity set of a Riemann integrable function on [0,1] can be. The Cantor set and any at most countable subset of [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 f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero used at the end, and that direction, "null ⇒ integrable", is a theorem of ZF.

Facts & Assumptions

Given: An Fσ set E⊆[0,1] of measure zero, and a sequence (Fn)n∈N of closed subsets of R with E=⋃nFn.

[L2]

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

[L4]
[L5]

Powers: 2−n>0 for every n∈N, 20=1, 2−n≤1, and m<n implies 2−n<2−m (Integer powers am, Monotonicity of x↦xn and of n↦an).

[L9]

Ordered-field arithmetic and the absolute value: the order is total and transitive; for 0≤x≤1 and a real ρ>0 the reals u:=max⁡{0,x−ρ} and v:=min⁡{1,x+ρ} satisfy u<v and (u,v)⊆Nρ(x)∩[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: the nine order-convex forms, nondegeneracy, and length, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Interior, closure, boundary and exterior of a subset of 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) of [L1] and define n(x):=min⁡{ n∈N:x∈Fn } for x∈E, which exists by [L2] since the set is a nonempty subset of N; define h:[0,1]→R by h(x):=2−n(x) for x∈E and h(x):=0 otherwise.

givenL1L2L5construct
2.1

h is bounded with values in [0,1]: 0<2−n(x)≤20=1 for x∈E by [L5], and h=0 off E.

step 1.1L5
2.2

h is discontinuous at every point of E. Let x∈E, so h(x)=2−n(x)>0 by [L5], and let a real ρ>0 be given. By [L9] the interval (u,v)⊆Nρ(x)∩[0,1] is nonempty with u<v, hence is a nondegenerate interval, so by [L4] it is not contained in E: there is y∈(u,v) with y∉E, and then h(y)=0 and ∣h(x)−h(y)∣=2−n(x). So the continuity condition fails at x for ε:=2−n(x).

step 1.1L4L5L9
2.3

h is continuous at every point of [0,1]∖E. Let x∈[0,1] with x∉E, so h(x)=0, and let a real ε>0 be given. By [L7] fix a natural N≥1 with 2−N≤1/ι(N)<ε. For each n≤N one has x∉Fn, since Fn⊆E, so [L3] supplies a real ρn>0 with Nρn(x)∩Fn=∅; put ρ:=min⁡{ρ0,…,ρN}>0, which exists by [L6].

step 1.1L3L6L7L9choose
3.1

For y∈[0,1] with ∣y−x∣<ρ: if y∉E then h(y)=0; and if y∈E then y∉Fn for every n≤N by step 2.3, so n(y)>N and h(y)=2−n(y)<2−N<ε by [L5] and step 2.3. In both cases ∣h(y)−h(x)∣=h(y)<ε, so h is continuous at x.

step 1.1step 2.3L5L9
4.1

By steps 2.2 and 3.1 the set of discontinuities of h in [0,1] is exactly E, which has measure zero by hypothesis; h is bounded by step 2.1 and 0<1, so [L8] gives that h is Riemann integrable on [0,1]. The function h 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 · two levels

85 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