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

✓ 11 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 11 also cleared it.

Monotone Functions, Discontinuities, and Continuity Sets: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Thomae's function computed: t(1/2)=1/2, t(2/3)=1/3, t(m)=1 at every integer m, t(x)=0 at every irrational, and ωt(c)=t(c) at every real c

Example

Let t be Thomae's function (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), so that t(x)=1/ι(q(x)) at a rational x with least denominator q(x) and t(x)=0 at an irrational x. Then:

  1. t(0)=1 and t(m)=1 for every integer m;
  2. t(1/2)=1/2, and more generally t(1/ι(q))=1/ι(q) for every natural q≥1;
  3. t(2/3)=1/3;
  4. t(x)=0 at every irrational x;
  5. ωt(c)=t(c) at every real c (The oscillation ωf(S)=sup⁡{ ∣f(x)−f(y)∣:x,y∈S } of f on a set and the oscillation ωf(c)=inf⁡δ>0ωf(A∩Nδ(c)) at a point, both taken in the extended reals), so ωt is 1 at every integer, 1/2 at every half-integer that is not an integer, and 0 at every irrational.

Claim 5 is claim 2 of 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) evaluated at the points computed here; nothing new is proved about the oscillation, and the point of the example is to see the numbers.

Facts & Assumptions

Given: Thomae's function t, with q(x)=min⁡{ q∈N:q≥1 and ι(q)x∈Z } for rational x; N⊆Z⊆Q⊆R are the canonical copies and ι(q) is the canonical natural (The rationals embed densely in the reals, The canonical natural ι(n)=n⋅1F of a field).

[L2]

No integer lies strictly between m and m+1; equivalently a real of the form k/ι(q) with 0<k<q naturals is not an integer, lying strictly between 0 and 1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1, Canonical naturals are positive and strictly increasing).

[L3]

There exist irrational reals, the irrationals being dense in R (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

Verification

technique · direct
1.1

Claim 1: for an integer m one has ι(1) m=m∈Z, so 1∈Q(m) and q(m)=1, the least element of a set of naturals ≥1 containing 1; hence t(m)=1/ι(1)=1. The case m=0 is included.

A1L2
1.2

Claim 2: let q≥1 be a natural and put x:=1/ι(q). Then ι(q)x=1∈Z, so q∈Q(x) and q(x)≤q. Conversely, if 1≤k≤q is a natural with ι(k)x=ι(k)/ι(q)∈Z, then k<q would put ι(k)/ι(q) strictly between 0 and 1, which no integer is; so k=q. Hence q(x)=q and t(1/ι(q))=1/ι(q). Taking q=2 gives t(1/2)=1/2.

A1L2
1.3

Claim 3: put x:=2/3. Then ι(3)x=2∈Z, so q(x)≤3. Also ι(1)x=2/3 lies strictly between 0 and 1 and so is not an integer, and ι(2)x=4/3 lies strictly between 1 and 2 and so is not an integer. Hence q(x)=3 and t(2/3)=1/3.

A1L2
1.4

Claim 4 is the second clause of the definition of t, and irrational reals exist.

A1L3
2.1

Claim 5: ωt(c)=t(c) at every real c. At an integer m this is 1 by step 1.1; at a real of the form m+1/2 with m an integer, the least denominator is 2, by the same computation as in step 1.2 applied to ι(2)(m+1/2)=2m+1∈Z together with ι(1)(m+1/2)=m+1/2 lying strictly between m and m+1, so the value is 1/2; and at an irrational it is 0.

step 1.1step 1.2step 1.4A1L1L2
3.1

In particular t is continuous at every irrational, where ωt=0, and discontinuous at every rational, where ωt=t>0; the numbers above are the sizes of those failures.

step 2.1A1L1∎

Remarks

  • The least denominator is what the values record. t is large exactly at the rationals with small denominators, and those are sparse: every point with least denominator q is a multiple of 1/ι(q), and consecutive multiples of 1/ι(q) are 1/ι(q) apart. The graph is the familiar picture of tall spikes at the integers, half as tall at the half-integers, and so on down.

  • Every value 1/ι(q) is attained, by step 1.2, so the range of t is exactly {0}∪{ 1/ι(q):q∈N, q≥1 }; the value 0 is attained at every irrational.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

A bounded nondecreasing f:R→R whose set of discontinuities is exactly Q, obtained from the prescribed-jump construction applied to one fixed enumeration of the rationals

Example

Write Q for the canonical copy of the rationals inside R (The rationals embed densely in the reals). There is a function f:R→R with all of the following properties:

  1. f is nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences) and 0≤f(x)≤1 for every real x;
  2. f is discontinuous at every rational and continuous at every irrational, so its discontinuity set is exactly Q;
  3. every discontinuity of f is a jump (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).

Explicitly, fixing a bijection e:N→Q (Q is countably infinite), one may take

f(x)  =  ∑k=0∞ak(x),ak(x)={1/2 k+1if e(k)<x,0otherwise,

which is the construction of Converse to Froda: for every at most countable E⊆R there is a bounded nondecreasing f:R→R whose set of discontinuities is exactly E, every one of them a jump applied to E:=Q (Series, partial sums, convergence and the sum, divergence, and the tail series, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

This is the extreme case allowed by Froda's theorem. Froda's theorem: the set of discontinuities of a monotone function on an interval is at most countable, the injection into N being built from one fixed enumeration of the rationals by least index, so no choice principle is used says that a monotone function on an interval has at most countably many discontinuities; Q is countable and dense, so the bound is attained by a set that meets every interval. A monotone function can therefore be discontinuous on a dense set, and it is nevertheless continuous on a set whose complement is countable.

Facts & Assumptions

Given: The canonical copy Q⊆R of the rationals.

[L1]

Q≈N, and composing a bijection N→Q with the embedding q↦q^ gives a bijection e:N→Q onto the canonical copy; in particular that copy is nonempty and at most countable (Q is countably infinite, The rationals embed densely in the reals, Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B, A nonempty set is at most countable iff it is a surjective image of N).

Verification

technique · direct
1.1

Q, as a subset of R, is at most countable.

L1
2.1

Applying the prescribed-discontinuity theorem with E:=Q produces a nondecreasing f:R→R with values in [0,1], continuous at every irrational, discontinuous at every rational, and with every discontinuity a jump. This is exactly claims 1, 2 and 3.

step 1.1L2
3.1

The displayed formula is the function the theorem constructs, for the surjection e of [L1]: the construction there sums the masses 1/2 k+1 over the indices k with e(k)<x.

step 2.1L1L2
4.1

The example is consistent with Froda's theorem and is extremal for it: the discontinuity set Q is at most countable, as Froda requires, and no larger discontinuity set is possible for any monotone function.

step 2.1L1L3∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Froda's countable bound is attained: a bounded nondecreasing function on R discontinuous exactly at the points 1−1/(k+1) for k∈N, an infinite discontinuity set inside a bounded interval

Example

Put

E  :=  { 1−1ι(k+1)  :  k∈N }  =  { 0, 12, 23, 34, … }  ⊆  [0,1)

(The canonical natural ι(n)=n⋅1F of a field, Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then:

  1. E is countably infinite (Finite, countably infinite, countable, uncountable);
  2. there is a nondecreasing f:R→R with 0≤f≤1 whose set of discontinuities is exactly E, every one of them a jump (Converse to Froda: for every at most countable E⊆R there is a bounded nondecreasing f:R→R whose set of discontinuities is exactly E, every one of them a jump, Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences, 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);
  3. E is contained in the bounded interval [0,1), so a monotone function may have infinitely many discontinuities inside a bounded interval.

Indexing. N contains 0, so the points are 1−1/ι(k+1) for k∈N and never 1−1/ι(k), which is undefined at k=0; the first point of E is 1−1/ι(1)=0.

The point 1 is not in E and f is continuous there. E has 1 as a limit point but does not contain it, and claim 2 asserts continuity at every point outside E, so in particular at 1: a monotone function may be continuous at a limit point of its own discontinuity set.

Facts & Assumptions

Given: The set E={ 1−1/ι(k+1):k∈N }.

[L1]

A nonempty set that is the image of a map defined on N is at most countable; a set in bijection with N is countably infinite (A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection).

[L2]

For every at most countable E⊆R there is a nondecreasing f:R→R with 0≤f≤1, continuous at every point outside E and discontinuous at every point of E, with every discontinuity a jump (Converse to Froda: for every at most countable E⊆R there is a bounded nondecreasing f:R→R whose set of discontinuities is exactly E, every one of them a jump).

Verification

technique · direct
1.1

The map s:N→R, s(k):=1−1/ι(k+1), has image E, and E is nonempty since s(0)=0; so E is at most countable.

L1L4
1.2

s is injective: j<k gives ι(j+1)<ι(k+1), hence 1/ι(k+1)<1/ι(j+1), hence s(j)<s(k). Being injective with image E, it is a bijection N→E, so E is countably infinite.

L1L4
1.3

E⊆[0,1): ι(k+1)≥1>0 gives 0<1/ι(k+1)≤1, so 0≤s(k)<1.

L4
2.1

Claim 2: applying the prescribed-discontinuity theorem to the at most countable set E gives a nondecreasing f:R→R with values in [0,1], discontinuous exactly at the points of E, every discontinuity a jump.

step 1.1L2
3.1

Claims 1 and 3 are steps 1.1, 1.2 and 1.3, and the whole is consistent with Froda's theorem, which permits any at most countable discontinuity set and no larger one.

step 1.1step 1.2step 1.3step 2.1L3∎

Remarks

  • What the example is for. Froda's theorem bounds the discontinuity set of a monotone function by countability and by nothing else; in particular it does not bound it by finiteness, even inside a bounded interval. The set E above is the simplest witness: infinitely many jumps accumulating at a single point, all within [0,1).

  • The accumulation point is a point of continuity. The real 1 is not a member of E, so claim 2 gives continuity of f at 1, even though every neighbourhood of 1 contains infinitely many discontinuities of f. Being a limit of discontinuities is not itself an obstruction to continuity.

  • A denser example is available. Taking E=Q instead gives a monotone function discontinuous on a dense set (A bounded nondecreasing f:R→R whose set of discontinuities is exactly Q, obtained from the prescribed-jump construction applied to one fixed enumeration of the rationals); the present example is the smaller and more concrete one, and it is the one where the points can be listed.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The n-th root as a continuous inverse: for a natural n≥1 the map x↦xn is continuous and strictly increasing on [0,∞) with image [0,∞), so its inverse x↦x1/n is continuous and strictly increasing

Example

Facts & Assumptions

Given: A natural n≥1, the order-convex set I=[0,∞) and p:I→R with p(x)=xn.

[L2]

If 0≤a<b and n≥1 then an<bn; and a≥0 gives an≥0 (Monotonicity of x↦xn and of n↦an, claims 1 and 2).

[L3]

For every real a≥0 and every natural n≥1 there is a unique real s≥0 with sn=a, written a1/n (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a, Rational powers ar of a positive base).

Verification

technique · direct
1.1

Claim 1: p is the restriction to I of a polynomial function, hence continuous on I.

L1
1.2

Claim 2: for 0≤x<y one has xn<yn since n≥1, so p is increasing on I; an increasing function is injective.

L2
1.3

Claim 3: p[I]⊆I, since x≥0 gives xn≥0; and I⊆p[I], since for a≥0 the real s:=a1/n≥0 lies in I and satisfies p(s)=sn=a.

L2L3
2.1

Claim 4: I is order-convex and p is continuous and injective on it, so by the continuous inverse theorem p is a bijection onto the order-convex set p[I], which is I by step 1.3, and the inverse g:I→I is continuous and strictly monotone in the same sense as p, that is increasing.

step 1.1step 1.2step 1.3L4L5
3.1

The value g(a) is the unique s≥0 with sn=a, since g inverts p and p(s)=sn; so g(a)=a1/n in the notation of the root theorem.

step 2.1L3∎

Remarks

  • Why n≥1. At n=0 the map x↦x0 is constantly 1 (Integer powers am), so it is neither injective nor surjective onto [0,∞), and no inverse exists. Every claim above is stated for n≥1 and the hypothesis is used in step 1.2.

  • Why the domain is [0,∞) and not R. For even n the map x↦xn is not injective on R, since (−x)n=xn, so the continuous inverse theorem does not apply there; restricting to the nonnegative reals is what makes it injective, and it is also where Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a provides the roots.

  • What is gained over the root theorem alone. Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a produces the number a1/n for each a separately and says nothing about how it varies with a. Claim 4 is the statement that a↦a1/n is a continuous increasing function, and it comes from the structure of the situation rather than from any estimate on roots.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The Cantor set has measure zero, yet the Cantor function maps it onto all of [0,1]: a null set can have image an interval of length 1

Example

Let C be the Cantor set (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) and let c:[0,1]→R be the Cantor function (The Cantor function on [0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval). Then:

  1. C has measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover));
  2. c[C]=[0,1]: the Cantor function maps the Cantor set onto the whole of [0,1] (Injection, surjection, bijection);
  3. [0,1] does not have measure zero (A sequence of intervals covering [a,b] has total length at least b−a, so no interval of positive length has measure zero).

So a continuous function can carry a set of measure zero onto a set that is not of measure zero, and indeed onto an interval of length 1: being null is not preserved by continuous images.

Facts & Assumptions

Given: The Cantor set C and the Cantor function c:[0,1]→R.

[L2]

c is surjective onto [0,1] as a function on [0,1], that is c[ [0,1] ]=[0,1]; and c is constant on [u,v] whenever u<v lie in C with (u,v)∩C=∅, while every point of [0,1]∖C lies in the open interval (u,v) of such a pair (The Cantor function is well defined, satisfies c(x)≤c(y) whenever x≤y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set, claims 3 and 4).

[L4]

c is continuous on [0,1] (The Cantor function is continuous on [0,1]).

Verification

technique · direct
1.1

Claim 1 is claim 2 of the Cantor set theorem.

L1
1.2

Claim 3 is the nondegenerate-interval lemma applied to [0,1], whose endpoints 0 and 1 are distinct.

L3
1.3

c[C]⊆[0,1], since c[ [0,1] ]=[0,1] and C⊆[0,1].

L2
1.4

[0,1]⊆c[C]: let y∈[0,1] and take x∈[0,1] with c(x)=y. If x∈C we are done. Otherwise x∈[0,1]∖C, so x lies in the open interval (u,v) of a pair u<v of points of C with (u,v)∩C=∅, and c is constant on [u,v]; hence y=c(x)=c(u) with u∈C, so y∈c[C].

L2
2.1

Claim 2 follows from steps 1.3 and 1.4: c[C]=[0,1]. With claims 1 and 3 this says that the null set C has image the set [0,1], which is not null, under the continuous function c.

step 1.1step 1.2step 1.3step 1.4L4∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The function equal to q at a rational p/q in lowest terms and to 0 at every irrational is finite at every point and unbounded on every nondegenerate interval

Example

Let q(x) be the least denominator of a 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) and define h:R→R by

h(x):=ι(q(x))  for x∈Q,h(x):=0  for x∉Q,

where ι(q) is the canonical natural (The canonical natural ι(n)=n⋅1F of a field) and Q is the canonical copy of the rationals inside R (The rationals embed densely in the reals). Equivalently h(x)=1/t(x) at a rational x, where t is Thomae's function. Then:

  1. h(x) is a real number for every real x: h is finite at every point;
  2. h is unbounded on every nondegenerate interval (Lower bound, bounded below, bounded set, Intervals of R: the nine order-convex forms, nondegeneracy, and length): for all reals a<b and every real M there is x∈(a,b) with h(x)>M.

So a function may be finite at every single point and yet fail to be bounded on every interval, however short. In particular h is bounded on no neighbourhood of any point.

Facts & Assumptions

Given: The function h above, with q(x)=min⁡{ q∈N:q≥1 and ι(q)x∈Z } for x∈Q.

[A1]

q(x)≥1 is a natural with ι(q(x)) x∈Z, and q(x)≤q for every natural q≥1 with ι(q)x∈Z (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).

[L2]

A nonzero integer has absolute value at least 1, since no integer lies strictly between 0 and 1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1, Basic properties of the absolute value).

[L3]

For every real η>0 there is a natural n≥1 with 1/ι(n)<η, and for every real x a natural n≥1 with x<ι(n); ι is positive and strictly increasing on the naturals ≥1 (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field).

Verification

technique · direct
1.1

Claim 1: for a rational x the value h(x)=ι(q(x)) is a canonical natural, hence a real number, and for an irrational x the value is 0. Every real falls under exactly one clause, so h is a function R→R.

A1
1.2

Separation of rationals by their denominators. Let x≠y be rationals. Then ∣x−y∣≥1/(ι(q(x)) ι(q(y))). Indeed, put q1:=q(x), q2:=q(y), p1:=ι(q1)x and p2:=ι(q2)y, all integers; then x−y=(p1ι(q2)−p2ι(q1))/(ι(q1)ι(q2)), the numerator is an integer, and it is nonzero because x≠y; so its absolute value is at least 1.

A1L2L4
2.1

Claim 2: let a<b be reals and let M be real. Take a rational x1 with a<x1<b and put q1:=q(x1). Take a natural N≥1 with M<ι(N), and put η:=min⁡{ 1ι(q1) ι(N), b−x1 }>0.

step 1.2L1L3L4
3.1

With x1, q1, N and η as in step 2.1, take a rational y with x1<y<x1+η. Then a<x1<y<b, so y∈(a,b); and y≠x1 with ∣y−x1∣<η≤1/(ι(q1)ι(N)).

step 2.1L1
4.1

Hence q(y)>N. If instead q(y)≤N then ι(q(y))≤ι(N), and step 1.2 would give ∣y−x1∣≥1/(ι(q1)ι(q(y)))≥1/(ι(q1)ι(N)), contradicting step 3.1.

step 1.2step 3.1L3
5.1

Therefore h(y)=ι(q(y))>ι(N)>M, and y∈(a,b): the values of h on (a,b) exceed every real, so h is unbounded on (a,b), and hence on every set containing it.

step 2.1step 3.1step 4.1L3∎

Remarks

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The Dirichlet function is the pointwise limit of a sequence of Baire class one functions and is itself not Baire class one, so the Baire hierarchy on [0,1] is already strict at the first level

Example

Let D:[0,1]→R be the restriction to [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) of the Dirichlet function (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), so D(x)=1 at a rational x and D(x)=0 at an irrational x. Then:

  1. D is the pointwise limit on [0,1] of a sequence (gm)m∈N of functions each of which is of Baire class one on [0,1] (Pointwise convergence of a sequence of real functions, and the Baire class one functions as the pointwise limits of sequences of continuous functions), namely the indicators of the finite sets {s(0),…,s(m)} for a fixed surjection s:N→Q∩[0,1];
  2. D is not of Baire class one on [0,1].

So the class of pointwise limits of sequences of Baire class one functions is strictly larger than the class of Baire class one functions. That larger class is classically called Baire class two; no definition of it is given in this library and none is used, the statement above being phrased entirely in terms of pointwise limits (Pointwise convergence of a sequence of real functions, and the Baire class one functions as the pointwise limits of sequences of continuous functions).

Facts & Assumptions

Given: The Dirichlet function restricted to [0,1], written D, and Q for the canonical copy of the rationals inside R (The rationals embed densely in the reals).

[L1]

Q∩[0,1] is nonempty and at most countable, so it is the image of a surjection s:N→Q∩[0,1] (Q is countably infinite, Finite, countably infinite, countable, uncountable, A nonempty set is at most countable iff it is a surjective image of N, The rationals embed densely in the reals).

[L5]

A nonempty finite set of reals presented as {a0,…,am} has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L7]

∣u−w∣≤∣u−v∣+∣v−w∣ and ∣u∣≥0 (Basic properties of the absolute value); a sequence of reals converges to L when it is eventually within every positive ε of L (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Verification

technique · contradiction
1.1

Fix a surjection s:N→Q∩[0,1] and, for m∈N, let gm:[0,1]→R be the indicator of {s(0),…,s(m)}: gm(x)=1 if x=s(j) for some j≤m, and gm(x)=0 otherwise.

L1construct
1.2

Suppose, for contradiction, that D is of Baire class one on [0,1].

assume-contra
1.3

But D is continuous at no point of [0,1]. Let c∈[0,1] and let δ>0 be real; put u:=max⁡{0, c−δ/2} and v:=min⁡{1, c+δ/2}, so that u<v and [u,v]⊆[0,1]∩Nδ(c), the strict inequality holding because c∈[0,1], 0<1 and δ>0. The nondegenerate interval (u,v) contains a rational y1 and an irrational y2, with D(y1)−D(y2)=1, so one of ∣D(y1)−D(c)∣ and ∣D(y2)−D(c)∣ equals 1; hence no δ witnesses continuity at c for ε=1. This is the argument of the Dirichlet claim, restricted to the domain [0,1].

A1L2L7L8
2.1

For m∈N define ρm:[0,1]→R by ρm(x):=min⁡{ ∣x−s(j)∣:j≤m }, the minimum of a nonempty finite set of reals. Then ρm(x)≥0, and ρm(x)=0 exactly when x=s(j) for some j≤m, the minimum being attained.

step 1.1L5L7
2.2

Then the set of points of [0,1] at which D is continuous is dense in [0,1], since 0<1; in particular it is nonempty.

step 1.2L3
3.1

ρm is 1-Lipschitz, hence continuous: choosing j0≤m with ρm(x)=∣x−s(j0)∣ gives ρm(y)≤∣y−s(j0)∣≤∣y−x∣+ρm(x), and exchanging x and y gives ∣ρm(x)−ρm(y)∣≤∣x−y∣; so δ:=ε witnesses continuity at every point.

step 2.1L4L5L7
4.1

For m,n∈N define hm,n:[0,1]→R by hm,n(x):=max⁡{ 0, 1−ι(n) ρm(x) }; the index runs over the whole of N, the term at n=0 being the constant 1 since ι(0)=0, so that n↦hm,n is a sequence in the sense of Sequences of reals: bounded, eventually, frequently, tails, subsequences. Each hm,n is continuous on [0,1], being the pointwise maximum of the constant 0 and the continuous function x↦1−ι(n)ρm(x).

step 3.1L4L6
5.1

For each fixed m the sequence n↦hm,n converges pointwise on [0,1] to gm. If ρm(x)=0 then hm,n(x)=max⁡{0,1}=1=gm(x) for every n. If ρm(x)>0 then, taking a natural n0≥1 with ι(n0)>1/ρm(x), every n≥n0 has ι(n)ρm(x)≥ι(n0)ρm(x)>1, so hm,n(x)=0=gm(x).

step 2.1step 4.1L6L7
6.1

Hence each gm is of Baire class one on [0,1], being the pointwise limit of a sequence of continuous functions.

step 4.1step 5.1
7.1

The sequence (gm)m∈N converges pointwise on [0,1] to D. If x∈Q∩[0,1] then x=s(k) for some k, since s is onto, and gm(x)=1=D(x) for every m≥k. If x∈[0,1] is irrational then x≠s(j) for every j, so gm(x)=0=D(x) for every m. Claim 1 is proved.

step 1.1step 6.1A1L1L7
8.1

Steps 2.2 and 1.3 contradict one another, so the assumption of step 1.2 is false and D is not of Baire class one on [0,1]: claim 2 holds, and with step 7.1 the example is complete.

step 7.1step 1.2step 2.2step 1.3discharge-contradiction∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

An additive f:R→R that is not x↦cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in R2, and every nonempty level set is dense in R

Example

Assume the Axiom of Choice (The Axiom of Choice), which enters through Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map and hence through Zorn's lemma. Fix a Hamel basis B of R over the canonical copy Q⊆R of the rationals (The rationals embed densely in the reals, A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, Vector space over a field), fix b⋆∈B, and let

f  :=  Λb⋆:R→R

be the coefficient map of b⋆ (Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map, claim 4). Write W:=Wb⋆=span⁡(B∖{b⋆}) (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S). Then:

  1. f is additive (Cauchy's functional equation f(x+y)=f(x)+f(y), and the additive functions R→R) and is not of the form x↦cx for any real c (FALSE: every additive f:R→R is of the form x↦cx for a single real c);
  2. f is bounded neither above nor below on any nondegenerate interval (Lower bound, bounded below, bounded set, Intervals of R: the nine order-convex forms, nondegeneracy, and length), is monotone on no nondegenerate interval (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences), is of constant sign on none, and is continuous at no point 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);
  3. the graph {(x,f(x)):x∈R} is dense in R2 for the metric d∞ (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space);
  4. the values of f are exactly the rationals, and for every rational r the level set f−1({r})={ x∈R:f(x)=r } is dense in R; for an irrational v the level set f−1({v}) is empty.

Claim 2 is the contrapositive of Six regularity conditions each force an additive f:R→R to be x↦f(1)x: continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in R2 applied to claim 1, clause by clause, and claim 3 is the contrapositive of its sixth clause.

Facts & Assumptions

Given: The Axiom of Choice; a Hamel basis B of R over Q; a fixed b⋆∈B; the coefficient map f=Λb⋆ and W=span⁡(B∖{b⋆}).

[A1]

The Axiom of Choice (The Axiom of Choice, Zorn's lemma).

[L1]

Assume the Axiom of Choice. Then a Hamel basis B exists; for b⋆∈B the coefficient map Λb⋆:R→Q is well defined, additive, Q-homogeneous, has range all of Q, has {x:Λb⋆(x)=0}=W, and W≠{0} (Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map, claims 1, 4 and 5, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, Linear subspace of a vector space).

[L2]

There is an additive R→R that is not of the form x↦cx, namely a coefficient map Λb⋆: it takes only rational values while c≠0 would force irrational values (FALSE: every additive f:R→R is of the form x↦cx for a single real c, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[L3]

If an additive g:R→R is bounded above on a nondegenerate interval, or bounded below on one, or monotone on one, or of constant sign on one, or continuous at a single point, or has non-dense graph in R2, then g(x)=g(1)x for every real x (Six regularity conditions each force an additive f:R→R to be x↦f(1)x: continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in R2).

[L5]

W is a linear subspace of R over Q, so w∈W and q∈Q give qw∈W, and W is closed under addition (Linear subspace of a vector space, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S).

[L6]

Strictly between any two distinct reals there lies a rational, and R is an ordered field (The rationals embed densely in the reals, Complete ordered field (least-upper-bound property)).

Verification

technique · constructive
1.1

Assume the Axiom of Choice, fix B and b⋆∈B, and put f:=Λb⋆ and W:=Wb⋆.

A1L1construct
2.1

Claim 1: f is additive, and it is not of the form x↦cx for any real c.

step 1.1L1L2
2.2

Claim 4, the range: the range of f is exactly Q, so f−1({v})=∅ for every irrational v and f−1({r})≠∅ for every rational r.

step 1.1L1
2.3

W is dense in R: by [L1] there is w0∈W with w0≠0, and qw0∈W for every rational q; given reals u<v, the two reals u/w0 and v/w0 are distinct, so a rational q lies strictly between them, and then qw0 lies strictly between u and v if w0>0, and strictly between v and u if w0<0. Either way W meets (u,v).

step 1.1L1L5L6
3.1

Claim 2, clause by clause. Were f bounded above on a nondegenerate interval, or bounded below on one, or monotone on one, or of constant sign on one, or continuous at a single point, the regularity theorem would give f(x)=f(1)x for every real x, contradicting step 2.1. So none of the five holds.

step 2.1L3
3.2

Claim 3: were the graph of f not dense in R2, the sixth clause of the regularity theorem would give the same contradiction. So the graph is dense.

step 2.1L3L4
3.3

For a rational r the level set f−1({r}) is xr+W for any xr with f(xr)=r: indeed f(y)=r holds exactly when f(y−xr)=f(y)−f(xr)=0, that is exactly when y−xr∈W. Here f(−x)=−f(x) follows from additivity.

step 1.1step 2.2L1L7
4.1

Each such level set is dense in R: given reals u<v, the interval (u−xr, v−xr) meets W by step 2.3, say in w, and then xr+w∈f−1({r}) lies in (u,v). Claim 4 is proved, and with steps 2.1, 3.1 and 3.2 so are claims 1, 2 and 3.

step 2.1step 3.1step 3.2step 2.2step 2.3step 3.3discharge-construct∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

A bounded function on R with no local maximum and no local minimum at any point, upper semicontinuous at no point and lower semicontinuous at no point: compose the Hamel coefficient with a strictly increasing injection of R into (0,1)

Example

Assume the Axiom of Choice (The Axiom of Choice, Zorn's lemma), which enters through Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map. Let f=Λb⋆:R→R be the Hamel coefficient map of An additive f:R→R that is not x↦cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in R2, and every nonempty level set is dense in R, whose values are exactly the rationals and each of whose nonempty level sets is dense in R. Define

φ:R→R,φ(u)  :=  12+u2 (1+∣u∣),g:=φ∘f.

Say that x is a local maximum point of g when there is a real δ>0 with g(y)≤g(x) for every y∈Nδ(x) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R), and a local minimum point when there is a real δ>0 with g(y)≥g(x) for every y∈Nδ(x). Then:

  1. 0<g(x)<1 for every real x, so g is bounded (Lower bound, bounded below, bounded set);
  2. g has no local maximum point and no local minimum point;
  3. g is upper semicontinuous at no point of R and lower semicontinuous at no point (Upper and lower semicontinuity of f:A→R at a point of A and on A); in particular it is continuous at no point (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).

Why φ and not a bijection onto Q∩(0,1). All that is needed of φ is that it be strictly increasing, take values in (0,1), and send rationals to rationals; the explicit formula above does all three and costs no countability argument.

Facts & Assumptions

Given: The Axiom of Choice; the Hamel coefficient map f; the map φ above; and g=φ∘f.

[A1]

The Axiom of Choice (The Axiom of Choice, Zorn's lemma).

[L2]

A set S⊆R is dense exactly when S∩Nδ(x)≠∅ for every real x and every real δ>0 (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

R is an ordered field, and ∣u∣≥0 with ∣u∣=u for u≥0 and ∣u∣=−u for u≤0 (Complete ordered field (least-upper-bound property), Basic properties of the absolute value).

[L5]

m is a maximum of a set when it belongs to it and dominates it, and dually for a minimum (Maximum and minimum of a set); Nδ(x)=(x−δ,x+δ) is a nondegenerate interval (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · constructive
1.1

Assume the Axiom of Choice and fix f as in [L1]; define φ(u):=1/2+u/(2(1+∣u∣)) and g:=φ∘f.

A1L1construct
2.1

φ is strictly increasing. For 0≤u1<u2: u1(1+u2)<u2(1+u1) reduces to u1<u2, and dividing by the positive (1+u1)(1+u2) gives u1/(1+u1)<u2/(1+u2). For u1<u2≤0: u1(1−u2)<u2(1−u1) reduces to u1<u2, and dividing by the positive (1−u1)(1−u2) gives u1/(1−u1)<u2/(1−u2). For u1<0≤u2 the first quantity is negative and the second is nonnegative. In every case u1/(1+∣u1∣)<u2/(1+∣u2∣), and φ is an increasing function of that quantity.

step 1.1L4
3.1

0<φ(u)<1 for every real u, since ∣u∣/(1+∣u∣)<1 gives −1<u/(1+∣u∣)<1; and φ takes rationals to rationals, since ∣u∣ and 1+∣u∣≠0 are rational when u is. Claim 1 follows: 0<g(x)<1 for every real x.

step 1.1step 2.1L4
3.2

Let x be real and put r:=f(x), a rational, and v:=g(x)=φ(r). The reals r−1 and r+1 are rational, and φ(r−1)<v<φ(r+1) by step 2.1.

step 1.1step 2.1L1
4.1

With r and v as in step 3.2, every real δ>0 gives points y−,y+∈Nδ(x) with g(y−)=φ(r−1)<v and g(y+)=φ(r+1)>v: the level sets f−1({r−1}) and f−1({r+1}) are dense in R, hence meet Nδ(x).

step 3.2L1L2
5.1

Claim 2: x is not a local maximum point, since every Nδ(x) contains y+ with g(y+)>g(x); and x is not a local minimum point, since every Nδ(x) contains y− with g(y−)<g(x). As x was arbitrary, g has no local maximum point and no local minimum point.

step 4.1L5
5.2

Claim 3: put ε+:=φ(r+1)−v>0. For every real δ>0 the point y+ of step 4.1 lies in Nδ(x) and satisfies g(y+)=v+ε+, so the inequality g(y+)<g(x)+ε+ fails; hence no δ witnesses upper semicontinuity at x for ε+, and g is upper semicontinuous at no point.

step 3.2step 4.1L3
6.1

Symmetrically, with ε−:=v−φ(r−1)>0 the point y− satisfies g(y−)=v−ε−, so g(y−)>g(x)−ε− fails and g is lower semicontinuous at no point; being continuous at a point would require both, so g is continuous at no point.

step 3.2step 4.1step 5.2L3
7.1

Claims 1, 2 and 3 hold for the function g constructed in step 1.1.

step 3.1step 5.1step 5.2step 6.1discharge-construct∎

Remarks

  • Boundedness is what makes the example surprising. A function with no local extremum anywhere is easy to arrange if it is allowed to be unbounded; here every value lies strictly inside (0,1) and yet no point is even a local extremum, because arbitrarily close to any point the function takes both a strictly larger and a strictly smaller value.

  • Everything comes from the level sets. The only property of f used after step 1.1 is that its nonempty level sets are dense and indexed by the rationals (An additive f:R→R that is not x↦cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in R2, and every nonempty level set is dense in R); φ contributes only the bounding into (0,1) and the preservation of strict order. Any function with countably many dense level sets, relabelled by a strictly increasing injection into a bounded interval, would do as well.

  • The additivity of f is not used here. It was used to prove that the level sets are dense, on the companion item; once that is known, g has nothing to do with Cauchy's equation. In particular g is not additive: it takes values in (0,1) and g(0)≠0.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

An upper semicontinuous function on [0,1] that is bounded below and attains no minimum, so the semicontinuous extreme value theorem is genuinely one-sided

Statement refuted

Refuted claim: an upper semicontinuous function on a nonempty compact subset of R that is bounded below attains a minimum (Upper and lower semicontinuity of f:A→R at a point of A and on A, Maximum and minimum of a set).

What Semicontinuous extreme value theorem: an upper semicontinuous function on a nonempty compact K⊆R is bounded above and attains a maximum, and a lower semicontinuous one is bounded below and attains a minimum proves is the one-sided statement: an upper semicontinuous function on a nonempty compact set attains a maximum, and a lower semicontinuous one attains a minimum. The refuted claim mixes the two, and it is false.

Counterexample

f(0):=1,f(x):=xfor 0<x≤1.

Then f is upper semicontinuous on [0,1], bounded below by 0, with inf⁡f[ [0,1] ]=0 (Greatest lower bound (infimum)), and f(x)>0 for every x∈[0,1]: the infimum is not attained, so f has no minimum. It does attain a maximum, namely 1 at x=0, as Semicontinuous extreme value theorem: an upper semicontinuous function on a nonempty compact K⊆R is bounded above and attains a maximum, and a lower semicontinuous one is bounded below and attains a minimum requires.

Facts & Assumptions

Given: The function f:[0,1]→R with f(0)=1 and f(x)=x for 0<x≤1.

[L1]

f is upper semicontinuous at c when for every real ε>0 there is a real δ>0 with f(x)<f(c)+ε for every x∈[0,1]∩Nδ(c) (Upper and lower semicontinuity of f:A→R at a point of A and on A, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

A nonempty set of reals bounded below has a greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Lower bound, bounded below, bounded set); m is a minimum of S when m∈S and m≤s for every s∈S (Maximum and minimum of a set).

[L4]

For every real η>0 there is a natural n≥1 with 1/n<η (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Verification

technique · direct
1.1

f is upper semicontinuous at 0: f(0)=1 and f(x)≤1 for every x∈[0,1], so f(x)<f(0)+ε=1+ε for every x∈[0,1] and every real ε>0; any δ works.

L1
1.2

f is upper semicontinuous at every c∈(0,1]: taking δ:=min⁡{c,ε}>0, every x∈[0,1] with ∣x−c∣<δ satisfies x>c−δ≥0, hence x≠0 and f(x)=x<c+ε=f(c)+ε.

L1L2
1.3

f is bounded below by 0 and f(x)>0 for every x∈[0,1]: for x=0 the value is 1>0, and for 0<x≤1 the value is x>0.

L3
2.1

inf⁡f[ [0,1] ]=0: the set f[ [0,1] ] is nonempty and bounded below by 0 by step 1.3, so its infimum ℓ exists and ℓ≥0; and for every real η>0 there is a natural n≥1 with 1/n<η, and then f(1/n)=1/n<η, so no positive real is a lower bound and ℓ=0.

step 1.3L3L4
3.1

f has no minimum: a minimum would be a value f(x0) that is a lower bound of f[ [0,1] ], hence at most the infimum 0; but every value of f is strictly positive.

step 1.3step 2.1L3
4.1

So f is upper semicontinuous on the nonempty compact set [0,1], is bounded below, and attains no minimum, which refutes the claim. It does attain a maximum, f(0)=1≥f(x) for every x∈[0,1], in agreement with the semicontinuous extreme value theorem.

step 1.1step 1.2step 3.1L5∎

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

A continuous injection on [0,1]∪[2,3] that is not monotone, so the interval hypothesis cannot be dropped from the strict-monotonicity theorem

Statement refuted

Counterexample

Let A:=[0,1]∪[2,3] and define f:A→R by

f(x):=xfor x∈[0,1],f(x):=5−xfor x∈[2,3].

Then f is continuous on A and injective, and it is not monotone: f(0)=0<1=f(1) while f(2)=3>2=f(3). The set A is not order-convex, since 0,3∈A and 3/2∉A.

Facts & Assumptions

Given: The set A=[0,1]∪[2,3] and the function f above.

[L1]
[L3]

f is increasing when f(x)<f(y) for all x<y in A, decreasing when f(x)>f(y) for all x<y in A, and monotone when nondecreasing or nonincreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences).

[L4]

A is order-convex when x,y∈A and x≤z≤y imply z∈A (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

f[ [0,1] ]=[0,1] and f[ [2,3] ]=[2,3]: on [0,1] the map is the identity, and on [2,3] the map x↦5−x sends 2 to 3 and 3 to 2 and is order-reversing, so its image is [2,3].

L2
1.2

f is continuous on A. Let c∈[0,1] and let ε>0 be real; take δ:=min⁡{1,ε}. Every x∈A with ∣x−c∣<δ satisfies x<c+1≤2, so x∈[0,1] and ∣f(x)−f(c)∣=∣x−c∣<ε.

L1L2
1.3

Let c∈[2,3] and let ε>0 be real; take δ:=min⁡{1,ε}. Every x∈A with ∣x−c∣<δ satisfies x>c−1≥1, so x∈[2,3] and ∣f(x)−f(c)∣=∣(5−x)−(5−c)∣=∣x−c∣<ε.

L1L2
1.4

f is not monotone: 0<1 with f(0)=0<1=f(1) rules out nonincreasing, and 2<3 with f(2)=3>2=f(3) rules out nondecreasing.

L3
1.5

A is not order-convex: 0∈A, 3∈A and 0≤3/2≤3, but 3/2∉[0,1]∪[2,3].

L4
2.1

f is injective: it is injective on [0,1], being the identity there; it is injective on [2,3], since 5−x=5−y gives x=y; and the two images [0,1] and [2,3] are disjoint, so no point of one piece has the same value as a point of the other.

step 1.1
3.1

So f is a continuous injection on A that is not monotone, refuting the claim; and the hypothesis that fails is exactly order-convexity of the domain, which is what the theorem assumes.

step 2.1step 1.2step 1.3step 1.4step 1.5L5∎

Remarks

Sources