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 discontinuous exactly at the points for , an infinite discontinuity set inside a bounded interval
Example
Put
(The canonical natural of a field, Intervals of : the nine order-convex forms, nondegeneracy, and length). Then:
- is countably infinite (Finite, countably infinite, countable, uncountable);
- there is a nondecreasing with whose set of discontinuities is exactly , every one of them 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);
- is contained in the bounded interval , so a monotone function may have infinitely many discontinuities inside a bounded interval.
Indexing. contains , so the points are for and never , which is undefined at ; the first point of is .
The point is not in and is continuous there. has as a limit point but does not contain it, and claim 2 asserts continuity at every point outside , so in particular at : a monotone function may be continuous at a limit point of its own discontinuity set.
Facts & Assumptions
Given: The set .
A nonempty set that is the image of a map defined on is at most countable; a set in bijection with is countably infinite (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable, Equinumerous sets, and , Injection, surjection, bijection).
For every at most countable there is a 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).
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).
is positive and strictly increasing on the naturals , and for every real there is a natural with (Canonical naturals are positive and strictly increasing, The canonical natural of a field, For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean).
Verification
The map , , has image , and is nonempty since ; so is at most countable.
is injective: gives , hence , hence . Being injective with image , it is a bijection , so is countably infinite.
: gives , so .
Claim 2: applying the prescribed-discontinuity theorem to the at most countable set gives a nondecreasing with values in , discontinuous exactly at the points of , every discontinuity a jump.
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.
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 above is the simplest witness: infinitely many jumps accumulating at a single point, all within .
-
The accumulation point is a point of continuity. The real is not a member of , so claim 2 gives continuity of at , even though every neighbourhood of contains infinitely many discontinuities of . Being a limit of discontinuities is not itself an obstruction to continuity.
-
A denser example is available. Taking instead gives a monotone function discontinuous on a dense set (A bounded nondecreasing whose set of discontinuities is exactly , 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
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- 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
- 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
- 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
- Finite, countably infinite, countable, uncountable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Canonical naturals are positive and strictly increasing
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
- Froda's theorem (Wikipedia) (standard reference, not scraped)
- Discontinuities of monotone functions (Wikipedia) (standard reference, not scraped)