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.
Six regularity conditions each force an additive to be : continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in
Statement
Let be additive (Cauchy's functional equation , and the additive functions ) and put . Write for the set of functions with the metric ( as the set of functions , and , , are metrics on it, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), and let
be the graph of . If any one of the following six conditions holds, then for every real .
- is continuous at some single point of (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
- is monotone on some nondegenerate interval (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences, Intervals of : the nine order-convex forms, nondegeneracy, and length).
- is bounded above on some nondegenerate interval (Lower bound, bounded below, bounded set).
- is bounded below on some nondegenerate interval.
- has constant sign on some nondegenerate interval : either for every , or for every .
- is not dense in (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).
Conditions 3, 4 and 5 are not independent, and the proof does not pretend they are. Condition 5 is the special case of 3 or of 4 with the bound , and condition 4 is condition 3 applied to ; they are listed separately only because each is the form in which the hypothesis usually arises. Condition 1 and condition 2 are each reduced to condition 3 in one line. Condition 6 is the only one that is not, and it is proved in the contrapositive: if is not of the form , then is dense.
Two classical clauses are absent. Boundedness on a set of positive measure and Lebesgue measurability also force linearity, and neither is stated here: both require a measure, and this library develops none as it stands. Each is an independent sufficient condition, so restoring them would change nothing else on this page.
Facts & Assumptions
Given: An additive with , and its graph .
for all reals (Cauchy's functional equation , and the additive functions ).
An additive satisfies , and for every rational and every real (An additive satisfies , and for every rational and every real ; in particular at every rational ).
If an additive is bounded above on some with , then for every real (If an additive is bounded above on some nondegenerate interval, then for every real ).
A nondegenerate interval contains a closed with , by order-convexity (Intervals of : the nine order-convex forms, nondegeneracy, and length).
continuous at means: for every real there is a real with whenever ; and gives (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, The -neighbourhood and the punctured -neighbourhood of a point of , Basic properties of the absolute value).
nondecreasing on means for in , and nonincreasing means ; monotone means one of the two (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences).
is a metric on and its open ball of centre and radius is ; a subset of a metric space is dense exactly when every open ball meets ( as the set of functions , and , , are metrics on it, Open ball, closed ball and sphere in a metric space, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, The closure of a nonempty is , equals together with its limit points, and is the smallest closed superset).
Strictly between any two distinct reals there lies a rational; is a field, so a nonzero real is invertible (The rationals embed densely in the reals, Complete ordered field (least-upper-bound property), For every in a complete ordered field there is a natural with ).
Proof
Assume at least one of the six conditions holds. The six steps below treat the six conditions in turn and are exhaustive for that assumption; in each the conclusion reached is for every real .
Condition 3. If is bounded above on a nondegenerate interval, that interval contains a closed with on which is bounded above, and the boundedness lemma gives for every real .
Condition 6, in the contrapositive: if is not then is dense in . Suppose for some real . Then , since . Put , and , and put , which is nonzero by assumption.
Condition 4. If is bounded below on a nondegenerate interval , say for , then is additive and satisfies on , so is bounded above on ; by step 2.1 applied to we get , hence .
Condition 2. Let be monotone on a nondegenerate interval, which contains with . If is nondecreasing there then for every , and if is nonincreasing there then ; either way is bounded above on and step 2.1 applies.
Condition 1. Let be continuous at a point . Taking gives a real with , hence , for every with . The set of such is the nondegenerate interval , so is bounded above on a nondegenerate interval and step 2.1 applies.
Let and let be real. Put and . Then and , as multiplying out and cancelling shows in each case.
Condition 5. If for every in a nondegenerate interval then is bounded below on by and step 3.1 applies; if for every then is bounded above on by and step 2.1 applies. So sign-constancy is a special case of the two preceding conditions and needs no separate argument.
Choose rationals with and , where is a real chosen with and ; such rationals exist because a rational lies strictly between any two distinct reals, and such an exists because for a real the inequality holds for all small enough .
Put . Then by additivity and rational homogeneity, so . Moreover and likewise .
So every open ball of meets , that is, is dense in . Reading this contrapositively: if is not dense in then for every real , which is condition 6.
Each of the six conditions has now been shown to force for every real : condition 1 at step 3.3, condition 2 at step 3.2, condition 3 at step 2.1, condition 4 at step 3.1, condition 5 at step 4.1 and condition 6 at step 6.1.
Remarks
-
Every clause reduces to one lemma. The engine is If an additive is bounded above on some nondegenerate interval, then for every real ; five of the six conditions are shown to imply its hypothesis, and the sixth is proved separately because a non-dense graph gives no bound on anywhere. The economy is deliberate: proving each clause from scratch would repeat the same translation-and-scaling argument five times.
-
The list is not a list of equivalent conditions. Each of the six implies linearity, and linearity implies all six, so over the additive functions they are indeed equivalent; but the theorem as stated is six implications in one direction, and that is what the proof establishes.
-
None of the six is dispensable in the sense that additivity alone suffices. There is an additive satisfying none of them (FALSE: every additive is of the form for a single real ), and by the theorem it is unbounded above and below on every nondegenerate interval, monotone on none, continuous at no point, of constant sign on no nondegenerate interval, and has dense graph. The construction costs the Axiom of Choice, and the companion page records what it looks like.
Depends on
- Cauchy's functional equation $f(x+y) = f(x) + f(y)$, and the additive functions $\mathbb{R} \to \mathbb{R}$
- An additive $f : \mathbb{R} \to \mathbb{R}$ satisfies $f(0) = 0$, $f(-x) = -f(x)$ and $f(qx) = q\,f(x)$ for every rational $q$ and every real $x$; in particular $f(q) = q\,f(1)$ at every rational $q$
- If an additive $f : \mathbb{R} \to \mathbb{R}$ is bounded above on some nondegenerate interval, then $f(x) = f(1)\,x$ for every real $x$
- Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of $\mathbb{R}$, with the dictionary to monotone sequences
- 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
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Lower bound, bounded below, bounded set
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- The closure of a nonempty $A$ is $\{x : d(x,A) = 0\}$, equals $A$ together with its limit points, and is the smallest closed superset
- The rationals embed densely in the reals
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Basic properties of the absolute value
- Complete ordered field (least-upper-bound property)
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
Used by
- Assuming Choice, a Hamel coefficient map is midpoint convex but discontinuous and therefore not convex Counterexample
- An additive f : ℝ → ℝ that is not x ↦ cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in ℝ², and every nonempty level set is dense in ℝ Example
- FALSE: every additive f : ℝ → ℝ is of the form x ↦ cx for a single real c False statement
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 115 results over 28 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
- Cauchy's functional equation (Wikipedia) (standard reference, not scraped)
- Hamel basis (Wikipedia) (standard reference, not scraped)
- Additive operators approximately preserving Birkhoff-James orthogonality (Aequationes mathematicae) (standard reference, not scraped)