A functional equation specifies a function through an identity involving values of that function at several arguments.
A continuous real function satisfying is either identically zero or for a real constant . If it is nonzero somewhere, and , so it never vanishes. The identity then makes it everywhere positive. Its real logarithm is a continuous additive function, hence linear by additive function continuous at one point is linear. Exponentiating proves the classification, and each listed function satisfies the equation.
Cauchy's functional equation asks for functions satisfying
The identity must hold for every pair of real numbers, and a solution is an additive function. It says that combining two inputs before applying gives the same result as combining their outputs.[ref]
For example, satisfies the identity because . At and the two sides give
For positive widths, a rectangle of height three makes this visible: cutting its width into and partitions its area into and . The same identity also holds for negative inputs, where is a signed output rather than an ordinary area.
Figure 1.
The function f(x)=3x preserves addition: partitioning a rectangle and checking exact rational grid sums
. Details.
Every function with a fixed real number solves Cauchy's functional equation. The surprising question is whether these are all the solutions. Rational homogeneity of an additive function forces for every rational number , but reaching an irrational number requires an additional argument. Continuity at just one point or being a bounded function on an interval of positive length supplies that argument; without such a condition, discontinuous additive functions exist.[ref]
This makes Cauchy's functional equation a useful test of the boundary between algebra and analysis: a rule about addition fixes all rational multiples, while a tiny amount of continuity fixes the entire real line. For example, the continuous exponential functional equation reduces to an additive function after taking a logarithm, so this result explains why its nonzero solutions are exponential functions.
An additive function on an additive semigroup satisfies whenever , , and belong to its domain.
For real numbers, an additive function is a group homomorphism from to itself. It preserves scalar multiplication by every rational number, so it is a linear map when domain and codomain are viewed as vector spaces over the rational numbers. Being a linear map over the real numbers additionally requires for every real number . On the real line this stronger condition is equivalent to . Additivity alone does not imply it.
For every additive function , every real number , and every rational number , one has . This is the scalar multiplication part of being a linear map over the rational numbers.
First gives , and gives . Repeated addition gives for each positive integer , and the negative case follows from the sign identity. If with and , then
No continuity was used. In particular fixes , , and every other rational value, even for a discontinuous additive function.
A real additive function that is continuous at one point is continuous everywhere and has form . Indeed , and as . Then for every . Additivity gives for every rational number; continuity and the density of the rational numbers extend this identity to every real argument.
The step from the rational numbers to the real numbers can be made explicit. Put . For an arbitrary real number , the density of the rational numbers supplies a sequence of rational numbers . Because continuity at the original point already implied continuity everywhere,
This is where continuity enters: knowing all the rational values alone does not justify the first equality.
For an original numerical example, use the floor function to define the rational lower approximants . They obey . When and is continuous at one point, rational homogeneity of an additive function and the preceding argument give
The error bound here follows from the resulting linear map, rather than from a quantitative bound on the initially assumed continuity.
Figure 1.
Continuity connects exact rational values to an irrational limit; either one-point continuity or boundedness on an interval forces f(x)=xf(1)
. Details.
Let be an additive function. Suppose for all in a nondegenerate interval , meaning . Then is continuous everywhere and . A finite bound on even one such interval is enough; a bound at one isolated point is not.
Here is a proof outline that turns a finite bound into arbitrarily small outputs. Set and . If , then both and lie in , so Cauchy's functional equation gives
Given , choose a positive integer with . For , the argument lies in , and rational homogeneity of an additive function gives
This proves continuity at zero. Now additive function continuous at one point is linear completes the proof. The key mechanism is that repeated addition magnifies a tiny input without escaping the bounded region, forcing the original output to be small.
Every Lebesgue-measurable additive function is continuous. Small-value preimages are measurable; one of their integer dilates has positive measure, so the Steinhaus theorem puts a neighbourhood of zero in their difference set. Additivity then makes small on that neighbourhood.
If is continuous and is an additive function, then . Additivity proves this first for nonnegative rational numbers; because is continuous, the identity extends to every nonnegative real number.
Assuming the axiom of choice, Cauchy's functional equation has solutions that are not linear maps over the real numbers. Regard as a vector space over the rational numbers. Because is an irrational number, and are linearly independent over . Zorn's lemma extends them to a Hamel basis ; assigning arbitrary real outputs to its basis vectors and extending by finite rational linear combinations gives an additive function.[ref]
For a particular choice, assign and for every . Every real number has a unique finite linear combination with finite and . Define
where the coefficient is zero if . The uniqueness of the Hamel basis representation makes this definition unambiguous, and adding the coefficients proves . On the rational two-dimensional vector subspace spanned by and , the rule is particularly simple:
For instance, and give , , and . Thus the map still preserves addition, even though rules out being a linear map over the real numbers.
The rational approximants from additive function continuous at one point is linear expose the failure of continuity: but . Moreover while . The map is continuous nowhere, since continuity at any point would imply additive function continuous at one point is linear. It is unbounded on every interval of positive length by additive function bounded on an interval is linear.
The axiom of choice is used to obtain the Hamel basis; the coefficient rule does not provide an explicit way to find the representation of an arbitrary real number. A plot sampled only at rational numbers would show exactly the same values as , so that plot cannot reveal this discontinuous additive function.

Ancestors (4)

  1. Analysis
  2. Area of mathematics
  3. Mathematics
  4. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)

A **functional equation** is an equation in which the unknowns are functions, rather than simple variables. These equations establish a relationship between the values of functions at different points. Functional equations often arise in various fields of mathematics and can be used to characterize specific functions or sets of functions.