Cauchy's functional equation

Cauchy's functional equation is the functional equation: $${\displaystyle f(x+y)=f(x)+f(y).}$$

A function ${\displaystyle f}$ that solves this equation is called an additive function. Over the rational numbers, it can be shown using elementary algebra that there is a single family of solutions, namely ${\displaystyle f\colon x\mapsto cx}$ for any rational constant ${\displaystyle c.}$ Over the real numbers, the family of linear maps${\displaystyle f\colon x\mapsto cx,}$ now with ${\displaystyle c}$ an arbitrary real constant, is likewise a family of solutions; however there can exist other solutions not of this form that are extremely complicated. However, any of a number of regularity conditions, some of them quite weak, will preclude the existence of these pathological solutions. For example, an additive function ${\displaystyle f\colon \mathbb {R} \to \mathbb {R} }$ is linear if:

• ${\displaystyle f}$ is continuous (Cauchy, 1821). In fact, it suffices for ${\displaystyle f}$ to be continuous at one point (Darboux, 1875).
• ${\displaystyle f(x)\geq 0}$ or ${\displaystyle f(x)\leq 0}$ for all ⁠${\displaystyle x\geq 0}$⁠.
• ${\displaystyle f}$ is monotonic on any interval.
• ${\displaystyle f}$ is bounded above or below on any interval.
• ${\displaystyle f}$ is Lebesgue measurable.
• ${\displaystyle f\left(x^{n+1}\right)=x^{n}f(x)}$ for all real ${\displaystyle x}$ and some positive integer ⁠${\displaystyle n}$⁠.
• The graph of ${\displaystyle f}$ is not dense in ⁠${\displaystyle \mathbb {R} ^{2}}$⁠.

On the other hand, if no further conditions are imposed on ⁠${\displaystyle f}$⁠, then (assuming the axiom of choice) there are infinitely many other functions that satisfy the equation. This was proved in 1905 by Georg Hamel using Hamel bases. Such functions are sometimes called Hamel functions.^[1]

The fifth problem on Hilbert's list is a generalisation of this equation. Functions where there exists a real number ${\displaystyle c}$ such that ${\displaystyle f(cx)\neq cf(x)}$ are known as Cauchy–Hamel functions and are used in Dehn–Hadwiger invariants which are used in the extension of Hilbert's third problem from 3D to higher dimensions.^[2]

This equation is sometimes referred to as Cauchy's additive functional equation to distinguish it from the other functional equations introduced by Cauchy in 1821, the exponential functional equation⁠${\displaystyle f(x+y)=f(x)f(y)}$⁠, the logarithmic functional equation⁠${\displaystyle f(xy)=f(x)+f(y)}$⁠, and the multiplicative functional equation⁠${\displaystyle f(xy)=f(x)f(y)}$⁠.

A simple argument, involving only elementary algebra, demonstrates that the set of additive maps ${\displaystyle f\colon V\to W}$, where ${\displaystyle V,W}$ are vector spaces over an extension field of ${\displaystyle \mathbb {Q} }$, is a subset of the set of ${\displaystyle \mathbb {Q} }$-linear maps from ${\displaystyle V}$ to ${\displaystyle W}$.

Theorem:Let ${\displaystyle f\colon V\to W}$ be an additive function. Then ${\displaystyle f}$ is ${\displaystyle \mathbb {Q} }$-linear.

Proof: We want to prove that any solution ${\displaystyle f\colon V\to W}$ to Cauchy’s functional equation, ${\displaystyle f(x+y)=f(x)+f(y)}$, satisfies ${\displaystyle f(qv)=qf(v)}$ for any ${\displaystyle q\in \mathbb {Q} }$ and ${\displaystyle v\in V}$. Let ${\displaystyle v\in V}$.

First note ${\displaystyle f(0)=f(0+0)=f(0)+f(0)}$, hence ${\displaystyle f(0)=0}$, and therewith ${\displaystyle 0=f(0)=f(v+(-v))=f(v)+f(-v)}$ from which follows ${\displaystyle f(-v)=-f(v)}$.

Via induction, ${\displaystyle f(mv)=mf(v)}$ is proved for any ${\displaystyle m\in \mathbb {N} \cup \{0\}}$.

For any negative integer ${\displaystyle m\in \mathbb {Z} }$ we know ⁠${\displaystyle -m\in \mathbb {N} }$⁠, therefore ⁠${\displaystyle f(mv)=f((-m)(-v))=(-m)f(-v)=(-m)(-f(v))=mf(v)}$⁠. Thus far we have proved

${\displaystyle f(mv)=mf(v)}$ for any ${\displaystyle m\in \mathbb {Z} }$.

Let ${\displaystyle n\in \mathbb {N} }$, then ${\displaystyle f(v)=f(nn^{-1}v)=nf(n^{-1}v)}$ and hence ⁠${\displaystyle f(n^{-1}v)=n^{-1}f(v)}$⁠.

Finally, any ${\displaystyle q\in \mathbb {Q} }$ has a representation ${\displaystyle q={\frac {m}{n}}}$ with ${\displaystyle m\in \mathbb {Z} }$ and ⁠${\displaystyle n\in \mathbb {N} }$⁠, so, putting things together,

${\displaystyle f(qv)=f\left({\frac {m}{n}}\,v\right)=f\left({\frac {1}{n}}\,(mv)\right)={\frac {1}{n}}\,f(mv)={\frac {1}{n}}\,m\,f(v)=qf(v)}$, q.e.d.

We prove below that any other solutions must be highly pathological functions. In particular, it is shown that any other solution must have the property that its graph${\displaystyle \{(x,f(x))\vert x\in \mathbb {R} \}}$ is dense in ⁠${\displaystyle \mathbb {R} ^{2}}$⁠, that is, that any disk in the plane (however small) contains a point from the graph. From this it is easy to prove the various conditions given in the introductory paragraph.

Expressed differently, nonlinearity in an additive function ${\displaystyle f:\mathbb {R} \to \mathbb {R} }$ implies there is some ${\displaystyle a\in \mathbb {R} }$ such that ${\displaystyle f(a)-af(1)\neq 0}$. Let ${\displaystyle r_{n}:\mathbb {R} \to \mathbb {Q} ,n\in \mathbb {N} }$ denote a series of rational approximation functions such that for all ${\displaystyle z\in \mathbb {R} }$, ${\displaystyle \lim _{n\to \infty }r_{n}(z)=z}$ (such as writing ${\displaystyle z}$ by its first ${\displaystyle n}$ decimals). Then, as ${\displaystyle f}$ is ${\displaystyle \mathbb {Q} }$-linear, ${\displaystyle \lim f(r_{n}(a))=af(1)\neq f(a)}$, even though ${\displaystyle \lim r_{n}(a)=a}$. From this, one can construct an orthonormal basis: defining ${\displaystyle x_{n}={\frac {r_{n}(f(a))-ar_{n}(f(1))}{r_{n}(f(a)-af(1))}}}$ and ${\displaystyle y_{n}={\frac {a-r_{n}(a)}{r_{n}(f(a)-af(1))}}}$, ${\displaystyle \lim x_{n}=\lim f(y_{n})=1,\lim y_{n}=\lim f(x_{n})=0}$. Thus, for any ${\displaystyle r_{x},r_{y}\in \mathbb {Q} }$, ${\displaystyle \lim r_{x}x_{n}+r_{y}y_{n}=r_{x}}$ and ${\displaystyle \lim f(r_{x}x_{n}+r_{y}y_{n})=r_{y}}$, meaning any point ${\displaystyle (r_{x},r_{y})\in \mathbb {Q} ^{2}}$ can be approximated.

The linearity proof given above also applies to ⁠${\displaystyle f\colon \alpha \mathbb {Q} \to \mathbb {R} }$⁠, where ${\displaystyle \alpha \mathbb {Q} }$ is a scaled copy of the rationals. This shows that only linear solutions are permitted when the domain of ${\displaystyle f}$ is restricted to such sets. Thus, in general, we have ${\displaystyle f(\alpha q)=f(\alpha )q}$ for all ${\displaystyle \alpha \in \mathbb {R} }$ and ⁠${\displaystyle q\in \mathbb {Q} }$⁠. However, as we will demonstrate below, highly pathological solutions can be found for functions ${\displaystyle f\colon \mathbb {R} \to \mathbb {R} }$ based on these linear solutions, by viewing the reals as a vector space over the field of rational numbers. Note, however, that this method is nonconstructive, relying as it does on the existence of a (Hamel) basis for any vector space, a statement proved using Zorn's lemma. (In fact, the existence of a basis for every vector space is logically equivalent to the axiom of choice.) There exist models such as the Solovay model where all sets of reals are measurable which are consistent with ZF + DC, and therein all solutions are linear.^[3]

To show that solutions other than the ones defined by ${\displaystyle f(x)=f(1)x}$ exist, we first note that because every vector space has a basis, there is a basis for ${\displaystyle \mathbb {R} }$ over the field ⁠${\displaystyle \mathbb {Q} }$⁠, i.e. a set ${\displaystyle {\mathcal {B}}\subset \mathbb {R} }$ with the property that any ${\displaystyle x\in \mathbb {R} }$ can be expressed uniquely as ⁠${\displaystyle \textstyle x=\sum _{i\in I}{\lambda _{i}x_{i}}}$⁠, where ${\displaystyle \{x_{i}\}_{i\in I}}$ is a finite subset of ⁠${\displaystyle {\mathcal {B}}}$⁠, and each ${\displaystyle \lambda _{i}}$ is in ⁠${\displaystyle \mathbb {Q} }$⁠. We note that because no explicit basis for ${\displaystyle \mathbb {R} }$ over ${\displaystyle \mathbb {Q} }$ can be written down, the pathological solutions defined below likewise cannot be expressed explicitly.

As argued above, the restriction of ${\displaystyle f}$ to ${\displaystyle x_{i}\mathbb {Q} }$ must be a linear map for each ⁠${\displaystyle x_{i}\in {\mathcal {B}}}$⁠. Moreover, because ${\displaystyle x_{i}q\mapsto f(x_{i})q}$ for ⁠${\displaystyle q\in \mathbb {Q} }$⁠, it is clear that ${\displaystyle f(x_{i})/x_{i}}$ is the constant of proportionality. In other words, ${\displaystyle f\colon x_{i}\mathbb {Q} \to \mathbb {R} }$ is the map ⁠${\displaystyle \xi \mapsto [f(x_{i})/x_{i}]\xi }$⁠. Since any ${\displaystyle x\in \mathbb {R} }$ can be expressed as a unique (finite) linear combination of the ⁠${\displaystyle x_{i}}$⁠, and ${\displaystyle f\colon \mathbb {R} \to \mathbb {R} }$ is additive, ${\displaystyle f(x)}$ is well-defined for all ${\displaystyle x\in \mathbb {R} }$ and is given by: $${\displaystyle f(x)=f{\Big (}\sum _{i\in I}\lambda _{i}x_{i}{\Big )}=\sum _{i\in I}f(x_{i}\lambda _{i})=\sum _{i\in I}f(x_{i})\lambda _{i}.}$$

It is easy to check that ${\displaystyle f}$ is a solution to Cauchy's functional equation given a definition of ${\displaystyle f}$ on the basis elements, ⁠${\displaystyle f\colon {\mathcal {B}}\to \mathbb {R} }$⁠. Moreover, it is clear that every solution is of this form. In particular, the solutions of the functional equation are linear if and only if${\displaystyle f(x_{i})/x_{i}}$ is constant over all ⁠${\displaystyle x_{i}\in {\mathcal {B}}}$⁠. Thus, in a sense, despite the inability to exhibit a nonlinear solution, "most" (in the sense of cardinality^[4]) solutions to the Cauchy functional equation are actually nonlinear and pathological.

• Antilinear map – Conjugate homogeneous additive map
• Homogeneous function – Function with a multiplicative scaling behaviour
• Minkowski functional – Function made from a set
• Semilinear map

• Kuczma, Marek (2009). An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality. Basel: Birkhäuser. ISBN 9783764387495.
• Hamel, Georg (1905). "Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung: f(x + y) = f(x) + f(y)". Mathematische Annalen.

• Solution to the Cauchy Equation Rutgers University
• The Hunt for Addi(c)tive Monster
• Martin Sleziak; et al. (2013). "Overview of basic facts about Cauchy functional equation". StackExchange. Retrieved 20 December 2015.