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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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