MathLabs
TheoremProved

Solution of the Additive Cauchy Equation

Statement

If f:Q→Qf:\mathbb{Q}\to\mathbb{Q} satisfies f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y) for all x,y∈Qx,y\in\mathbb{Q}, then f(q)=cqf(q) = cq for all q∈Qq\in\mathbb{Q}, where c=f(1)c=f(1). If additionally f:R→Rf:\mathbb{R}\to\mathbb{R} is continuous (or monotonic, or bounded on some interval), the same conclusion f(x)=cxf(x)=cx holds for all x∈Rx\in\mathbb{R}.

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 Q\mathbb{Q}, already pins down ff completely — and that on R\mathbb{R}, 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 f(0)f(0).** Set x=y=0x=y=0 in f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y): f(0)=f(0)+f(0)f(0)=f(0)+f(0), so f(0)=0f(0)=0.

Step 2: Extend to positive integers. For a positive integer nn, set x=(n−1)x=(n-1) (or induct): f(n⋅1)=f((n−1)⋅1+1)=f((n−1)⋅1)+f(1)f(n\cdot 1) = f((n-1)\cdot 1 + 1) = f((n-1)\cdot 1) + f(1). By induction on nn, f(n)=nf(1)f(n) = n f(1) for every positive integer nn (base case n=1n=1 trivial, inductive step just applied).

Step 3: Extend to negative integers. Set y=−xy=-x in f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y): f(0)=f(x)+f(−x)f(0) = f(x) + f(-x), and since f(0)=0f(0)=0, f(−x)=−f(x)f(-x) = -f(x). Combined with Step 2, f(n)=nf(1)f(n) = n f(1) for every integer nn (positive, negative, or zero), writing c=f(1)c = f(1).

Step 4: Extend to rationals. Let q=p/rq = p/r with p∈Zp\in\mathbb{Z}, r∈Z>0r\in\mathbb{Z}_{>0}. Since r⋅q=pr \cdot q = p (as integers under repeated addition, i.e. q+q+⋯+qq + q + \dots + q (rr times) =p= p), applying the integer case of Step 2/3 to the function evaluated rr times gives f(rq)=rf(q)f(rq) = r f(q) (by the same induction argument used for Step 2, now with x=qx=q). But rq=prq = p, so f(p)=rf(q)f(p) = r f(q), i.e. cp=rf(q)cp = r f(q), i.e. f(q)=c⋅pr=cqf(q) = c \cdot \frac{p}{r} = cq.

Step 5: Conclude the rational case. This shows f(q)=cqf(q) = cq for every q∈Qq \in \mathbb{Q}, with c=f(1)c = f(1) — the entire function on Q\mathbb{Q} is determined by its value at a single point.

**Step 6: Extend to R\mathbb{R} under continuity.** Suppose now f:R→Rf:\mathbb{R}\to\mathbb{R} is additive and continuous at even one point (continuity everywhere then follows from additivity: f(x+h)−f(x)=f(h)→0f(x+h)-f(x) = f(h) \to 0 as h→0h\to 0 if continuous at 00). For any real xx, take a sequence of rationals qn→xq_n \to x. By Steps 1–5, f(qn)=cqnf(q_n) = c q_n. Continuity gives f(x)=lim⁡nf(qn)=lim⁡ncqn=cxf(x) = \lim_n f(q_n) = \lim_n c q_n = cx.

**Step 7: Extend to R\mathbb{R} under monotonicity or local boundedness (sketch).** If ff is monotonic, then for rationals q1<x<q2q_1 < x < q_2 squeezing any real xx, monotonicity forces cq1≤f(x)≤cq2cq_1 \le f(x) \le cq_2 (if c>0c>0; reverse if c<0c<0), and letting q1,q2→xq_1,q_2\to x pins f(x)=cxf(x)=cx by the same squeeze. If instead ff is bounded on some interval II, one shows ff is bounded near 00 (using additivity to shift the interval), then f(x/n)→0f(x/n)\to 0 as n→∞n\to\infty for fixed xx forces continuity at 00, reducing to Step 6. In all three regularity cases (continuous, monotonic, bounded on an interval), the conclusion is the same: f(x)=cxf(x)=cx for all x∈Rx\in\mathbb{R}.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Christopher G. Small (2007). Functional Equations and How to Solve Them
  2. Thomas M. Cover, Joy A. Thomas (2006). Elements of Information Theory
  3. D. H. Hyers (1941). On the Stability of the Linear Functional Equation