Solution of the Additive Cauchy Equation
Statement
If satisfies for all , then for all , where . If additionally is continuous (or monotonic, or bounded on some interval), the same conclusion holds for all .
Why is it true?
This theorem is the foundation of the entire functional-equations toolkit: it shows that a purely algebraic relation, with no continuity assumed on , already pins down completely — and that on , without some regularity assumption, wildly pathological non-linear solutions exist (built via a Hamel basis using the Axiom of Choice), so the regularity hypothesis is not a technicality but essential.
Proof sketch
**Step 1: Determine .** Set in : , so .
Step 2: Extend to positive integers. For a positive integer , set (or induct): . By induction on , for every positive integer (base case trivial, inductive step just applied).
Step 3: Extend to negative integers. Set in : , and since , . Combined with Step 2, for every integer (positive, negative, or zero), writing .
Step 4: Extend to rationals. Let with , . Since (as integers under repeated addition, i.e. ( times) ), applying the integer case of Step 2/3 to the function evaluated times gives (by the same induction argument used for Step 2, now with ). But , so , i.e. , i.e. .
Step 5: Conclude the rational case. This shows for every , with — the entire function on is determined by its value at a single point.
**Step 6: Extend to under continuity.** Suppose now is additive and continuous at even one point (continuity everywhere then follows from additivity: as if continuous at ). For any real , take a sequence of rationals . By Steps 1–5, . Continuity gives .
**Step 7: Extend to under monotonicity or local boundedness (sketch).** If is monotonic, then for rationals squeezing any real , monotonicity forces (if ; reverse if ), and letting pins by the same squeeze. If instead is bounded on some interval , one shows is bounded near (using additivity to shift the interval), then as for fixed forces continuity at , reducing to Step 6. In all three regularity cases (continuous, monotonic, bounded on an interval), the conclusion is the same: for all .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Christopher G. Small (2007). Functional Equations and How to Solve Them
- Thomas M. Cover, Joy A. Thomas (2006). Elements of Information Theory
- D. H. Hyers (1941). On the Stability of the Linear Functional Equation