Cauchy's functional equation

From Wikipedia, the free encyclopedia

Cauchy's functional equation is one of the simplest functional equations to represent, however its solution over the real numbers is extremely complicated. The equation is

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

Over the rational numbers, it can be shown using elementary algebra that there is a single family of solutions f(x) = cx \ for any arbitrary constant c. This family of solutions applies over the reals also. Further constraints on f(\cdot) may preclude other solutions, for example:

  • f(\cdot) is continuous (proven by Cauchy in 1821). This conditon was weakened in 1875 by Darboux who showed that it was only necessary for the function to be continuous at one point.
  • f(\cdot) is monotonic on any interval.
  • f(\cdot) is bounded on any interval.

If, on the other hand, there are no further conditions imposed, 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. The fifth problem on Hilbert's list is a generalisation of this equation.

Contents

[edit] Proof of solution over rationals

First put y = 0:

f(x+0) = f(x) + f(0) \
f(0) = 0 \

Then put y = − x:

f(x-x) = f(x) + f(-x) \
f(-x) = -f(x) \

Then by repeated application of the function equation to f(n x) = f(x + x + \cdots + x) we get:

f(nx) = n f(x) \

And by putting y = nx:

f \left( \frac{x}{n} \right) = \frac{1}{n} f(x) \

Putting this all together, we get:

f \left( \alpha q \right) = q f(\alpha) \qquad \forall q \in \mathbb{Q}, \alpha \in \mathbb{R} \

Putting α = 1 we get the unique family of solutions over \mathbb{Q}.

[edit] Properties of other solutions

We prove below that any other solutions must be highly pathological functions. In particular, we show that any other solution must have the property that its graph y = f(x) is dense in \mathbb{R}^2, i.e. that any circle 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.

Suppose without loss of generality that f(q) = q \  \forall q \in \mathbb{Q}, and f(\alpha) \neq \alpha for some \alpha \in \mathbb{R}.

Then put f(\alpha) = \alpha + \delta, \delta \neq 0.

We now show how to find a point in an arbitrary circle, centre (x,y), radius r where x,y,r \in \mathbb{Q}, r > 0, x \neq y.

Put \beta = \frac{y - x}{\delta} and choose a rational number b\neq 0 close to β with:

\left|  \beta - b  \right| < \frac{r}{2 \left|\delta\right|}

Then choose a rational number a close to α with:

\left|  \alpha - a  \right| < \frac{r}{2\left|b\right|}

Now put:

X = x + b (\alpha - a) \
Y = f(X)  \

Then using the functional equation, we get:

Y = f(x + b (\alpha - a)) \
= x + b f(\alpha) - b f(a) \
= y - \delta \beta + b f(\alpha) - b f(a) \
= y - \delta \beta + b (\alpha + \delta) - b a \
= y + b (\alpha - a) - \delta (\beta - b) \

Because of our choices above, the point (X,Y) is inside the circle.

[edit] Proof of the existence of other solutions

The linearity proof given above also applies to any set \alpha \mathbb{Q}, a scaled copy of the rationals. We can use this to find all solutions to the equation. Note that this method is highly non-constructive, relying as it does on the axiom of choice.

Assuming the axiom of choice, there is a basis for the reals over \mathbb{Q} i.e. a set A \sub \mathbb{R} such that for every real number z there is a unique finite set X = \left\{ x_1,\dots x_n \right\} \sub A and sequence \left( \lambda_i \right) in \mathbb{Q} such that:

z= \sum_{i=1}^n { \lambda_i x_i }

Now suppose that the functional equation holds on each copy of the rationals, x \mathbb{Q}, x \in A with constant of proportionality g(x). Then by use of the decomposition above and repeated application of the functional equation, we can obtain the value of the function for any real number:

f(z) = \sum_{i=1}^n { \lambda_i g(x_i) }

This function is linear only if g( \cdot ) is constant.

[edit] External links

In other languages