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 being built from one fixed enumeration of the rationals by least index, so no choice principle is used
Statement
Let be order-convex (Intervals of : the nine order-convex forms, nondegeneracy, and length) and let be monotone (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences). Then the set
(Discontinuity of 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 (Injection, surjection, bijection) built from one fixed enumeration of the rationals: at a discontinuity interior to the value is read off the least index of a rational lying in the gap , 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 is a discontinuity exactly when . The map is therefore determined by 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 and a monotone ; and denotes the canonical copy of the rationals inside .
is order-convex: and imply (Intervals of : the nine order-convex forms, nondegeneracy, and length).
A nondecreasing on an order-convex has, at every , each well-posed one-sided limit; and if both and are nonempty then and (One-sided limits of a monotone function always exist: for nondecreasing on an interval and , whenever has points below , whenever it has points above , and these satisfy ).
For a nondecreasing on an order-convex and a point with both and nonempty, is discontinuous at if and only if (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 is a discontinuity exactly when ).
( is countably infinite) and the map embeds in injectively (The rationals embed densely in the reals), so composing a bijection with that embedding gives a bijection onto the canonical copy of the rationals inside ; and strictly between any two distinct reals there lies a point of (The rationals embed densely in the reals, Equinumerous sets, and , Injection, surjection, bijection).
Every nonempty subset of has a least element (The well-ordering principle).
Every subset of is at most countable, and a set in bijection with an at most countable set is at most countable (Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable, Equinumerous sets, and , Injection, surjection, bijection).
is discontinuous at exactly when it is not continuous there, and , so and have exactly the same points of discontinuity (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences).
Proof
It is enough to treat a nondecreasing : if is nonincreasing then is nondecreasing and has the same discontinuity set, so the conclusion for is the conclusion for . Assume from here on that is nondecreasing.
Fix once and for all a bijection ; everything below is defined in terms of , and this one function.
Call interior when both and are nonempty, and write for the set of interior points of at which is discontinuous. A point of that is not interior has , and is then a least element of , or , and is then a greatest element of ; a subset of has at most one least and at most one greatest element, so has at most two elements.
For put and , both of which exist, and note .
Let with . Take for the least with , which exists because a point of lies strictly between and ; then , since and is order-convex.
For the set is nonempty, since a point of lies strictly between the two distinct reals and and is onto ; so is a well-defined natural number, determined by , and alone.
With as in step 2.2: because is one of the points in that set, and for the same reason on the other side. Hence .
The two open intervals and are therefore disjoint, so no point of lies in both, so and hence . Since was an arbitrary pair of distinct elements of , the map is injective.
Define by for ; if is a least element of ; and if is a greatest element of and not a least one. Then is injective: it is injective on by step 4.1, it separates the at most two points of from each other, and its values on are odd while its values off are even.
Consequently is a bijection from onto the subset , which is at most countable; countability transfers along that bijection, so is at most countable.
Remarks
-
The bound is attained. Froda's theorem gives no better bound than at most countable, and none is available: for every at most countable there is a bounded nondecreasing function on whose discontinuity set is exactly (Converse to Froda: for every at most countable there is a bounded nondecreasing whose set of discontinuities is exactly , every one of them a jump). Taking gives a nondecreasing function discontinuous at every rational and continuous at every irrational.
-
What the choice-freedom rests on. Two canonical selections, and nothing else: one fixed bijection , produced by is countably infinite, whose own proof spends no choice principle; and the least element of a nonempty set of naturals (The well-ordering principle). Replacing "least index" by "some index" would turn step 3.1 into an application of a choice principle over the possibly uncountable index set .
-
Monotonicity is doing all the work, not continuity of anything. The only property of used after step 1.1 is the inequality of step 3.2, which says that the gaps opened by distinct discontinuities are laid out in the same order as the discontinuities themselves and therefore do not overlap. A function that is not monotone can be discontinuous everywhere (The Dirichlet function is continuous at no point of , 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 equals ).
Depends on
- Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of $\mathbb{R}$, with the dictionary to monotone sequences
- 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 $c$ is a discontinuity exactly when $\lim_{x \to c^{-}} f(x) < \lim_{x \to c^{+}} f(x)$
- One-sided limits of a monotone function always exist: for $f$ nondecreasing on an interval $I$ and $c \in I$, $\lim_{x \to c^{-}} f(x) = \sup\{f(x) : x \in I,\ x < c\}$ whenever $I$ has points below $c$, $\lim_{x \to c^{+}} f(x) = \inf\{f(x) : x \in I,\ x > c\}$ whenever it has points above $c$, and these satisfy $\lim_{x \to c^{-}} f(x) \le f(c) \le \lim_{x \to c^{+}} f(x)$
- 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
- Finite, countably infinite, countable, uncountable
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- Every subset of an at most countable set is at most countable
- The well-ordering principle
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Injection, surjection, bijection
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
Used by
- A bounded-variation function has at most countably many discontinuities, all of the first kind Corollary
- A bounded nondecreasing f : ℝ → ℝ whose set of discontinuities is exactly ℚ, obtained from the prescribed-jump construction applied to one fixed enumeration of the rationals Example
- Froda's countable bound is attained: a bounded nondecreasing function on ℝ discontinuous exactly at the points 1 - 1/(k+1) for k ∈ ℕ, an infinite discontinuity set inside a bounded interval Example
- A convex function on an open interval is differentiable except at at most countably many points Theorem
- Converse to Froda: for every at most countable E ⊆ ℝ there is a bounded nondecreasing f : ℝ → ℝ whose set of discontinuities is exactly E, every one of them a jump Theorem
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
- Froda's theorem (Wikipedia) (standard reference, not scraped)
- Classification of discontinuities (Wikipedia) (standard reference, not scraped)
- Discontinuities of monotone functions (Wikipedia) (standard reference, not scraped)