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.
A bounded nondecreasing whose set of discontinuities is exactly , obtained from the prescribed-jump construction applied to one fixed enumeration of the rationals
Example
Write for the canonical copy of the rationals inside (The rationals embed densely in the reals). There is a function with all of the following properties:
- is nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences) and for every real ;
- is discontinuous at every rational and continuous at every irrational, so its discontinuity set is exactly ;
- every discontinuity of is a jump (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).
Explicitly, fixing a bijection ( is countably infinite), one may take
which is the construction of 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 applied to (Series, partial sums, convergence and the sum, divergence, and the tail series, For , , and for 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 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; 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 of the rationals.
, and composing a bijection with the embedding gives a bijection onto the canonical copy; in particular that copy is nonempty and at most countable ( is countably infinite, The rationals embed densely in the reals, Finite, countably infinite, countable, uncountable, Equinumerous sets, and , A nonempty set is at most countable iff it is a surjective image of ).
For every at most countable there is a bounded nondecreasing with , continuous at every point outside and discontinuous at every point of , with every discontinuity a jump (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, Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences, 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).
The set of discontinuities of a monotone function on an interval is at most countable (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).
Verification
, as a subset of , is at most countable.
Applying the prescribed-discontinuity theorem with produces a nondecreasing with values in , continuous at every irrational, discontinuous at every rational, and with every discontinuity a jump. This is exactly claims 1, 2 and 3.
The displayed formula is the function the theorem constructs, for the surjection of [L1]: the construction there sums the masses over the indices with .
The example is consistent with Froda's theorem and is extremal for it: the discontinuity set is at most countable, as Froda requires, and no larger discontinuity set is possible for any monotone function.
Remarks
-
The jump at a rational is at least , where is the index with . That lower bound is what the construction of 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 establishes, and it is what makes a discontinuity; the total mass available is , which is why stays inside . A different enumeration gives a different function with the same discontinuity set.
-
Continuity at every irrational is not an accident of this construction. The complement of a countable set is where a monotone function built this way must be continuous, and 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 says the same thing in general: the discontinuities of a monotone function can never fill an uncountable set. The companion statement in the other direction, that no function whatever is continuous exactly at the rationals (No function is continuous at every rational and discontinuous at every irrational, because is not ), shows that the roles of and its complement cannot be exchanged here.
Depends on
- Converse to Froda: for every at most countable $E \subseteq \mathbb{R}$ there is a bounded nondecreasing $f : \mathbb{R} \to \mathbb{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 $\mathbb{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
- Froda's theorem: the set of discontinuities of a monotone function on an interval is at most countable, the injection into $\mathbb{N}$ being built from one fixed enumeration of the rationals by least index, so no choice principle is used
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- Finite, countably infinite, countable, uncountable
- Series, partial sums, convergence and the sum, divergence, and the tail series
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
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: 143 results over 37 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
- Classification of discontinuities (Wikipedia) (standard reference, not scraped)
- Froda's theorem (Wikipedia) (standard reference, not scraped)
- Math 402/502 Real Analysis Homework (University of New Mexico) (standard reference, not scraped)
- Discontinuities of monotone functions (Wikipedia) (standard reference, not scraped)