Cauchy's functional equation

Cauchy's functional equation is the functional equation:

$f(x+y) = f(x) + f(y).\$

A function $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 $f \colon x\mapsto cx$ for any rational constant $c.$ Over the real numbers, the family of linear maps $f : x \mapsto cx,$ now with $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 $f \colon \R\to\R$ is linear if:

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

On the other hand, if no further conditions are imposed on $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.Kuczma (2009), p.130

The fifth problem on Hilbert's list is a generalisation of this equation. Functions where there exists a real number $c$ such that $f(cx) \ne 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.V.G. Boltianskii (1978) "Hilbert's third problem", Halsted Press, Washington

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 $f(x + y) = f(x) f(y),$ the logarithmic functional equation $f(xy) = f(x) + f(y),$ and the multiplicative functional equation $f(x y) = f(x) f(y).$

Solutions over the rational numbers

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

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

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

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

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

For any negative integer $m \in \Z$ we know $-m \in \N$ , therefore $f(m v) = f((-m) (-v)) = (-m) f(-v) = (-m) (-f(v)) = m f(v)$ . Thus far we have proved

: $f(m v) = m f(v)$ for any $m \in \Z$ .

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

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

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

Properties of nonlinear solutions over the real numbers

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 $\{(x, f(x)) \vert x \in \R\}$ is dense in $\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.

{{Math theorem

| name = Lemma

| note =

| math_statement = Let $t > 0$ . If $f$ satisfies the Cauchy functional equation on the interval $[0, t]$ , but is not linear, then its graph is dense on the strip $[0, t] \times \R$ .

}}

{{Math proof|proof= WLOG, scale $f$ on the x-axis and y-axis, so that $f$ satisfies the Cauchy functional equation on $[0, 1]$ , and $f(1) = 1$ .

It suffices to show that the graph of $f$ is dense in $(0, 1) \times \R$ , which is dense in $[0, 1]\times \R$ .

Since $f$ is not linear, we have $f(a) \neq a$ for some $a\in (0, 1)$ .

Claim: The lattice defined by $L:= \{(r_1 + r_2 a, r_1 + r_2 f(a)): r_1, r_2 \in \mathbb Q\}$ is dense in $\R^2$ .

Consider the linear transformation $A: \R^2 \to \R^2$ defined by

$A(x, y) =
\begin{bmatrix}
1 & a\\
1 & f(a)
\end{bmatrix}
\begin{bmatrix} x\\ y \end{bmatrix}$

With this transformation, we have $L = A(\mathbb Q^2)$ .

Since $\det A = f(a) - a \neq 0$ , the transformation is invertible, thus it is bicontinuous. Since $\mathbb Q^2$ is dense in $\R^2$ , so is $L$ . $\square$

Claim: if $r_1, r_2 \in \mathbb Q$ , and $r_1 + r_2 a \in (0, 1)$ , then $f(r_1 + r_2 a) = r_1 + r_2 f(a)$ .

If $r_1, r_2 \geq 0$ , then it is true by additivity. If $r_1, r_2 < 0$ , then $r_1 + r_2 a < 0$ , contradiction.

If $r_1 \geq 0, r_2 < 0$ , then since $r_1 + r_2 a > 0$ , we have $r_1 > 0$ . Let $k$ be a positive integer large enough such that $\frac{r_1}k, \frac{-r_2 a}{k} \in (0, 1)$ . Then we have by additivity:

$f\left(\frac{r_1}k + \frac{r_2 a}k\right) + f\left(\frac{-r_2 a}k\right) = f\left(\frac{r_1}k\right)$

That is,

$\frac{1}{k} f\left(r_1 + r_2 a\right) + \frac{-r_2}k f\left(a\right) =\frac{r_1}k$ $\square$

Thus, the graph of $f$ contains $L \cap ((0, 1) \times \R)$ , which is dense in $(0, 1) \times \R$ . }}

Existence of nonlinear solutions over the real numbers

The linearity proof given above also applies to $f \colon \alpha \Q\to\R,$ where $\alpha\Q$ is a scaled copy of the rationals. This shows that only linear solutions are permitted when the domain of $f$ is restricted to such sets. Thus, in general, we have $f(\alpha q)=f(\alpha)q$ for all $\alpha \in \R$ and $q \in \Q.$ However, as we will demonstrate below, highly pathological solutions can be found for functions $f \colon \R \to \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.{{Cite web |last=E. Caicedo |first=Andrés |date=2011-03-06 |title=Are there any non-linear solutions of Cauchy's equation $f(x+y)=f(x)+f(y)$ without assuming the Axiom of Choice? |url=https://mathoverflow.net/a/57532 |access-date=2024-02-21 |website=MathOverflow |language=en}}

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

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

$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 $f$ is a solution to Cauchy's functional equation given a definition of $f$ on the basis elements, $f \colon \mathcal{B} \to \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 $f(x_i) \over x_i$ is constant over all $x_i \in \mathcal{B}.$ Thus, in a sense, despite the inability to exhibit a nonlinear solution, "most" (in the sense of cardinalityIt can easily be shown that $\mathrm{card}(\mathcal{B})=\mathfrak{c}$ ; thus there are $\mathfrak{c}^\mathfrak{c}=2^\mathfrak{c}$ functions $f \colon \mathcal{B}\to\R,$ each of which could be extended to a unique solution of the functional equation. On the other hand, there are only $\mathfrak{c}$ solutions that are linear.) solutions to the Cauchy functional equation are actually nonlinear and pathological.

References

{{cite book|last=Kuczma|first=Marek|authorlink=Marek Kuczma|title=An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality|publisher=Birkhäuser|location=Basel|year=2009|isbn=9783764387495}}
{{cite journal|last=Hamel|first=Georg|title=Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung: f(x+y) = f(x) + f(y).|journal=Mathematische Annalen|year=1905}}

External links

Solution to the Cauchy Equation [http://www.math.rutgers.edu/~useminar/cauchy.pdf Rutgers University]
[http://www.cofault.com/2010/01/hunt-for-addictive-monster.html The Hunt for Addi(c)tive Monster]
{{cite web|url=https://math.stackexchange.com/q/423492|title=Overview of basic facts about Cauchy functional equation|website=StackExchange|date=2013|accessdate=20 December 2015|author=Martin Sleziak|display-authors=etal}}

Category:Functional equations