Functional Equation - Examples

Examples

• The functional equation

is satisfied by the Riemann zeta function ζ. The capital Γ denotes the gamma function.

• These functional equations are satisfied by the gamma function. The gamma function is the unique solution of the system of all three equations:

(Euler's reflection formula)

• The functional equation

where a, b, c, d are integers satisfying ad − bc = 1, i.e. , defines f to be a modular form of order k.

• Miscellaneous examples not necessarily involving "famous" functions:

satisfied by all exponential functions

, satisfied by all logarithmic functions

(Cauchy functional equation)

(quadratic equation or parallelogram law)

(Jensen)

(d'Alembert)

(Abel equation)

(Schröder's equation).

(Böttcher's equation).

(sine addition formula).

(cosine addition formula).

(Levi-Civita).

• A simple form of functional equation is a recurrence relation. This, formally speaking, involves an unknown function on integers, and also translation operators.

One such example of a recurrence relation is

• The commutative and associative laws are functional equations. When the associative law is expressed in its familiar form, one lets some symbol between two variables represent a binary operation, thus:

But if we write ƒ(a, b) instead of a * b then the associative law looks more like what one conventionally thinks of as a functional equation:

One thing that all of the examples listed above share in common is that in each case two or more known functions (sometimes multiplication by a constant, sometimes addition of two variables, sometimes the identity function) are substituted into the unknown function to be solved for.

• The b-integer and b-decimal parts of real numbers were introduced and studied by M.H.Hooshmand. The b-parts real functions have many interesting number theoretic explanations, analytic and algebraic properties, and satisfy the functional equation:

The following functional equations are as a generalization of the b-parts functional equation for semigroups and groups, even in a binary system (magma), that are introduced by him:

Associative equations ;

Decomposer equations ;

Strong decomposer equations ;

Canceler equations ;

where ƒ*(x)ƒ(x) = ƒ(x)ƒ*(x) = x. In, the general solution of the decomposer and strong decomposer equations are introduced in the sets with a binary operation and semigroups respectively and also associative equations in arbitrary groups. In that paper it is proven that the associative equations and the system of strong decomposer and canceler equations do not have any nontrivial solutions in the simple groups.

When it comes to asking for all solutions, it may be the case that conditions from mathematical analysis should be applied; for example, in the case of the Cauchy equation mentioned above, the solutions that are continuous functions are the 'reasonable' ones, while other solutions that are not likely to have practical application can be constructed (by using a Hamel basis for the real numbers as vector space over the rational numbers). The Bohr–Mollerup theorem is another well-known example.