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.

Froda's countable bound is attained: a bounded nondecreasing function on R\mathbb{R} discontinuous exactly at the points 11/(k+1)1 - 1/(k+1) for kNk \in \mathbb{N}, an infinite discontinuity set inside a bounded interval

Example

Put

E  :=  {11ι(k+1)  :  kN}  =  {0, 12, 23, 34, }    [0,1)E \;:=\; \Bigl\{\, 1 - \frac{1}{\iota(k+1)} \;:\; k \in \mathbb{N} \,\Bigr\} \;=\; \Bigl\{\, 0,\ \tfrac12,\ \tfrac23,\ \tfrac34,\ \dots \Bigr\} \;\subseteq\; [0,1)

(The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Then:

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

Indexing. N\mathbb{N} contains 00, so the points are 11/ι(k+1)1 - 1/\iota(k+1) for kNk \in \mathbb{N} and never 11/ι(k)1 - 1/\iota(k), which is undefined at k=0k = 0; the first point of EE is 11/ι(1)=01 - 1/\iota(1) = 0.

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

Facts & Assumptions

Given: The set E={11/ι(k+1):kN}E = \{\, 1 - 1/\iota(k+1) : k \in \mathbb{N} \,\}.

[L1]

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

[L2]

For every at most countable ERE \subseteq \mathbb{R} there is a nondecreasing f:RRf : \mathbb{R} \to \mathbb{R} with 0f10 \le f \le 1, continuous at every point outside EE and discontinuous at every point of EE, with every discontinuity a jump (Converse to Froda: for every at most countable ERE \subseteq \mathbb{R} there is a bounded nondecreasing f:RRf : \mathbb{R} \to \mathbb{R} whose set of discontinuities is exactly EE, every one of them a jump).

Verification

technique · direct
1.1

The map s:NRs : \mathbb{N} \to \mathbb{R}, s(k):=11/ι(k+1)s(k) := 1 - 1/\iota(k+1), has image EE, and EE is nonempty since s(0)=0s(0) = 0; so EE is at most countable.

L1L4
1.2

ss is injective: j<kj < k gives ι(j+1)<ι(k+1)\iota(j+1) < \iota(k+1), hence 1/ι(k+1)<1/ι(j+1)1/\iota(k+1) < 1/\iota(j+1), hence s(j)<s(k)s(j) < s(k). Being injective with image EE, it is a bijection NE\mathbb{N} \to E, so EE is countably infinite.

L1L4
1.3

E[0,1)E \subseteq [0,1): ι(k+1)1>0\iota(k+1) \ge 1 > 0 gives 0<1/ι(k+1)10 < 1/\iota(k+1) \le 1, so 0s(k)<10 \le s(k) < 1.

L4
2.1

Claim 2: applying the prescribed-discontinuity theorem to the at most countable set EE gives a nondecreasing f:RRf : \mathbb{R} \to \mathbb{R} with values in [0,1][0,1], discontinuous exactly at the points of EE, 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

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: 119 results over 27 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