Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-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 theorem: the set of discontinuities of a monotone function on an interval is at most countable, the injection into N\mathbb{N} being built from one fixed enumeration of the rationals by least index, so no choice principle is used

Statement

Let IRI \subseteq \mathbb{R} be order-convex (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and let f:IRf : I \to \mathbb{R} be monotone (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). Then the set

D  :=  {cI:f is discontinuous at c}D \;:=\; \{\, c \in I : f \text{ is discontinuous at } c \,\}

(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) is at most countable (Finite, countably infinite, countable, uncountable).

More precisely, the proof exhibits an injection J:DNJ : D \to \mathbb{N} (Injection, surjection, bijection) built from one fixed enumeration of the rationals: at a discontinuity cc interior to II the value J(c)J(c) is read off the least index of a rational lying in the gap (limxcf(x), limxc+f(x))\bigl(\lim_{x \to c^{-}} f(x),\ \lim_{x \to c^{+}} f(x)\bigr), which is a nonempty open interval by A monotone function on an interval has no discontinuity of the second kind: at every point both relevant one-sided limits exist, and an interior point cc is a discontinuity exactly when limxcf(x)<limxc+f(x)\lim_{x \to c^{-}} f(x) < \lim_{x \to c^{+}} f(x). The map JJ is therefore determined by ff and by the fixed enumeration, and no choice principle is used: least indices are canonical by The well-ordering principle, and nothing anywhere in the proof is selected without being determined.

Facts & Assumptions

Given: An order-convex IRI \subseteq \mathbb{R} and a monotone f:IRf : I \to \mathbb{R}; and Q\mathbb{Q} denotes the canonical copy of the rationals inside R\mathbb{R}.

[A1]

II is order-convex: x,yIx, y \in I and xzyx \le z \le y imply zIz \in I (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L1]

A nondecreasing ff on an order-convex II has, at every cIc \in I, each well-posed one-sided limit; and if both I=I(,c)I^{-} = I \cap (-\infty,c) and I+=I(c,)I^{+} = I \cap (c,\infty) are nonempty then limxcf(x)=sup{f(x):xI,x<c}\lim_{x \to c^{-}} f(x) = \sup\{f(x) : x \in I, x < c\} and limxc+f(x)=inf{f(x):xI,x>c}\lim_{x \to c^{+}} f(x) = \inf\{f(x) : x \in I, x > c\} (One-sided limits of a monotone function always exist: for ff nondecreasing on an interval II and cIc \in I, limxcf(x)=sup{f(x):xI, x<c}\lim_{x \to c^{-}} f(x) = \sup\{f(x) : x \in I,\ x < c\} whenever II has points below cc, limxc+f(x)=inf{f(x):xI, x>c}\lim_{x \to c^{+}} f(x) = \inf\{f(x) : x \in I,\ x > c\} whenever it has points above cc, and these satisfy limxcf(x)f(c)limxc+f(x)\lim_{x \to c^{-}} f(x) \le f(c) \le \lim_{x \to c^{+}} f(x)).

[L2]

For a nondecreasing ff on an order-convex II and a point cc with both II^{-} and I+I^{+} nonempty, ff is discontinuous at cc if and only if limxcf(x)<limxc+f(x)\lim_{x \to c^{-}} f(x) < \lim_{x \to c^{+}} f(x) (A monotone function on an interval has no discontinuity of the second kind: at every point both relevant one-sided limits exist, and an interior point cc is a discontinuity exactly when limxcf(x)<limxc+f(x)\lim_{x \to c^{-}} f(x) < \lim_{x \to c^{+}} f(x)).

[L3]

QN\mathbb{Q} \approx \mathbb{N} (Q\mathbb{Q} is countably infinite) and the map qq^q \mapsto \hat q embeds Q\mathbb{Q} in R\mathbb{R} injectively (The rationals embed densely in the reals), so composing a bijection NQ\mathbb{N} \to \mathbb{Q} with that embedding gives a bijection e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} onto the canonical copy of the rationals inside R\mathbb{R}; and strictly between any two distinct reals there lies a point of QR\mathbb{Q}_{\mathbb{R}} (The rationals embed densely in the reals, Equinumerous sets, ABA \approx B and ABA \preceq B, Injection, surjection, bijection).

[L4]

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

Proof

technique · direct
1.1

It is enough to treat a nondecreasing ff: if ff is nonincreasing then f-f is nondecreasing and has the same discontinuity set, so the conclusion for f-f is the conclusion for ff. Assume from here on that ff is nondecreasing.

L6
1.2

Fix once and for all a bijection e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}}; everything below is defined in terms of ff, II and this one function.

L3choose
1.3

Call cIc \in I interior when both II^{-} and I+I^{+} are nonempty, and write D0D_{0} for the set of interior points of II at which ff is discontinuous. A point of II that is not interior has I=I^{-} = \varnothing, and is then a least element of II, or I+=I^{+} = \varnothing, and is then a greatest element of II; a subset of R\mathbb{R} has at most one least and at most one greatest element, so DD0D \setminus D_{0} has at most two elements.

A1
2.1

For cD0c \in D_{0} put L(c):=limxcf(x)L^{-}(c) := \lim_{x \to c^{-}} f(x) and L+(c):=limxc+f(x)L^{+}(c) := \lim_{x \to c^{+}} f(x), both of which exist, and note L(c)<L+(c)L^{-}(c) < L^{+}(c).

step 1.3L1L2
2.2

Let c,cD0c, c' \in D_{0} with c<cc < c'. Take t:=e(k)t := e(k) for the least kk with c<e(k)<cc < e(k) < c', which exists because a point of QR\mathbb{Q}_{\mathbb{R}} lies strictly between cc and cc'; then tIt \in I, since c,cIc, c' \in I and II is order-convex.

step 1.3A1L3L4
3.1

For cD0c \in D_{0} the set K(c):={kN:L(c)<e(k)<L+(c)}K(c) := \{\, k \in \mathbb{N} : L^{-}(c) < e(k) < L^{+}(c) \,\} is nonempty, since a point of QR\mathbb{Q}_{\mathbb{R}} lies strictly between the two distinct reals L(c)L^{-}(c) and L+(c)L^{+}(c) and ee is onto QR\mathbb{Q}_{\mathbb{R}}; so j(c):=minK(c)j(c) := \min K(c) is a well-defined natural number, determined by cc, ff and ee alone.

step 2.1L3L4
3.2

With c<t<cc < t < c' as in step 2.2: L+(c)=inf{f(x):xI,x>c}f(t)L^{+}(c) = \inf\{f(x) : x \in I, x > c\} \le f(t) because tt is one of the points in that set, and f(t)sup{f(x):xI,x<c}=L(c)f(t) \le \sup\{f(x) : x \in I, x < c'\} = L^{-}(c') for the same reason on the other side. Hence L+(c)L(c)L^{+}(c) \le L^{-}(c').

step 2.2L1
4.1

The two open intervals (L(c),L+(c))(L^{-}(c), L^{+}(c)) and (L(c),L+(c))(L^{-}(c'), L^{+}(c')) are therefore disjoint, so no point of QR\mathbb{Q}_{\mathbb{R}} lies in both, so e(j(c))e(j(c))e(j(c)) \ne e(j(c')) and hence j(c)j(c)j(c) \ne j(c'). Since c<cc < c' was an arbitrary pair of distinct elements of D0D_{0}, the map j:D0Nj : D_{0} \to \mathbb{N} is injective.

step 3.1step 3.2
5.1

Define J:DNJ : D \to \mathbb{N} by J(c):=2j(c)+1J(c) := 2\,j(c) + 1 for cD0c \in D_{0}; J(c):=0J(c) := 0 if cDD0c \in D \setminus D_{0} is a least element of II; and J(c):=2J(c) := 2 if cDD0c \in D \setminus D_{0} is a greatest element of II and not a least one. Then JJ is injective: it is injective on D0D_{0} by step 4.1, it separates the at most two points of DD0D \setminus D_{0} from each other, and its values on D0D_{0} are odd while its values off D0D_{0} are even.

step 1.3step 4.1construct
6.1

Consequently JJ is a bijection from DD onto the subset J[D]NJ[D] \subseteq \mathbb{N}, which is at most countable; countability transfers along that bijection, so DD is at most countable.

step 5.1L5

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 118 results over 38 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