Additive Functions and the Hamel Basis

See how free a function that preserves addition can be. On the rationals it is completely pinned; at irrationals its values come loose.

An additive function obeys f(x+y)=f(x)+f(y)f(x + y) = f(x) + f(y). On the rationals f(q)=qf(1)f(q) = qf(1) leaves no freedom. But viewing the reals as a vector space over the rationals, 11 and 2\sqrt{2} are independent, so f(2)f(\sqrt{2}) may be chosen as anything. That freedom is the Hamel basis.

For example, a 📐 square with side 1 has diagonal 2\sqrt{2}. Knowing only the side pins nothing about the value assigned to the diagonal, because the diagonal is a new, independent direction. Impose continuity and the freedom vanishes, leaving only a straight line.

f(x+y)=f(x)+f(y),f(q)=qf(1)  (q∈Q)f(x + y) = f(x) + f(y), \qquad f(q) = qf(1) \ \ (q \in \mathbb{Q})
f(a+b2)=a+bt,t=f(2) is freef(a + b\sqrt{2}) = a + bt, \qquad t = f(\sqrt{2}) \text{ is free}

Examples & Exercises

For a function ff satisfying f(x+y)=f(x)+f(y)f(x + y) = f(x) + f(y) for all reals, prove completely that f(qx)=qf(x)f(qx) = qf(x) for every rational qq and every real xx.

f(qx)=qf(x),q∈Qf(qx) = qf(x), \qquad q \in \mathbb{Q}
Rational scaling passes straight through the function.
Show proof
  1. Integer multiples: f(0)=f(0+0)=2f(0)f(0) = f(0 + 0) = 2f(0), so f(0)=0f(0) = 0. Induction gives f(nx)=nf(x)f(nx) = nf(x) for natural nn. Also 0=f(0)=f(x+(−x))=f(x)+f(−x)0 = f(0) = f(x + (-x)) = f(x) + f(-x), so f(−x)=−f(x)f(-x) = -f(x), covering negative integers.

  2. Reciprocals: for n≥1n \ge 1, f(x)=f ⁣(n⋅xn)=nf ⁣(xn)f(x) = f\!\left(n \cdot \frac{x}{n}\right) = n f\!\left(\frac{x}{n}\right), hence f ⁣(xn)=1nf(x)f\!\left(\frac{x}{n}\right) = \frac{1}{n} f(x).

  3. Combining with q=pnq = \frac{p}{n}: f(qx)=pf ⁣(xn)=pnf(x)=qf(x)f(qx) = p f\!\left(\frac{x}{n}\right) = \frac{p}{n} f(x) = qf(x). With x=1x = 1, f(q)=qf(1)f(q) = qf(1): on the rationals the function is completely pinned.

Prove completely that if an additive function ff is continuous at a single point x0x_0, then f(x)=cxf(x) = cx for every real xx, where c=f(1)c = f(1).

f additive +continuous at one point ⟹ f(x)=cxf \text{ additive } + \text{continuous at one point} \ \Longrightarrow \ f(x) = cx
Continuity removes the freedom and leaves only the line.
Show proof
  1. Continuity moves to 00: f(x0+h)−f(x0)=f(h)f(x_0 + h) - f(x_0) = f(h), so the left side tending to 00 as h→0h \to 0 — continuity at x0x_0 — says exactly f(h)→0=f(0)f(h) \to 0 = f(0), continuity at 00. The same identity gives continuity everywhere.

  2. Take a rational sequence qn→xq_n \to x for an arbitrary real xx. The previous problem gives f(qn)=cqnf(q_n) = cq_n, and continuity gives f(qn)→f(x)f(q_n) \to f(x). But cqn→cxcq_n \to cx. Limits are unique, so f(x)=cxf(x) = cx.

Prove completely that if an additive function ff is bounded on some interval (−δ,δ)(-\delta, \delta), then ff is continuous, and hence of the form f(x)=cxf(x) = cx.

∣f∣≤M on (−δ,δ) ⟹ f(x)=cx|f| \le M \text{ on } (-\delta, \delta) \ \Longrightarrow \ f(x) = cx
Boundedness on one small interval forces the whole graph to be a line.
Show proof
  1. Say ∣f∣≤M|f| \le M on the interval. If ∣h∣<δn|h| < \frac{\delta}{n} then nh∈(−δ,δ)nh \in (-\delta, \delta), so ∣f(nh)∣≤M|f(nh)| \le M. But f(nh)=nf(h)f(nh) = nf(h), hence ∣f(h)∣≤Mn|f(h)| \le \frac{M}{n}.

  2. Given ε>0\varepsilon > 0, choose nn with Mn<ε\frac{M}{n} < \varepsilon and set η=δn\eta = \frac{\delta}{n}. Then ∣h∣<η|h| < \eta gives ∣f(h)−f(0)∣=∣f(h)∣≤Mn<ε|f(h) - f(0)| = |f(h)| \le \frac{M}{n} < \varepsilon: ff is continuous at 00.

  3. By the previous problem, f(x)=cxf(x) = cx. Even a whisper of good behaviour rules out the monstrous additive functions.

4. Continuity