Functional equation

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, a functional equation[1][2][3][4] is any equation that specifies a function in implicit form.[5] Often, the equation relates the value of a function (or functions) at some point with its values at other points. For instance, properties of functions can be determined by considering the types of functional equations they satisfy. The term functional equation usually refers to equations that cannot be simply reduced to algebraic equations.


  • The functional equation

f(s) = 2^s\pi^{s-1}\sin\left(\frac{\pi s}{2}\right)\Gamma(1-s)f(1-s)
is satisfied by the Riemann zeta function ζ. The capital Γ denotes the gamma function.
  • The gamma function is the unique solution of the following system of three equations:
f(x)={f(x+1) \over x}\,\!
f(z)f(1-z)={\pi \over \sin(\pi z)}\,\!\,\,\,       (Euler's reflection formula)
  • The functional equation
f\left({az+b\over cz+d}\right) = (cz+d)^k f(z)\,\!
where a, b, c, d are integers satisfying adbc = 1, i.e. 
\begin{vmatrix} a & b\\c & d\end{vmatrix}\,=1, defines f to be a modular form of order k.
  • Miscellaneous examples not necessarily involving "famous" functions:
f(x + y) = f(x)f(y), \,\! satisfied by all exponential functions
f(xy) = f(x) + f(y)\,\!, satisfied by all logarithmic functions
f(x + y) = f(x) + f(y)\,\! (Cauchy functional equation)
f(x + y) + f(x - y) = 2[f(x) + f(y)]\,\! (quadratic equation or parallelogram law)
f((x + y)/2) = (f(x) + f(y))/2\,\! (Jensen)
g(x + y) + g(x - y) = 2[g(x) g(y)]\,\! (d'Alembert)
f(h(x)) = h(x + 1)\,\! (Abel equation)
f(h(x)) = cf(x)\,\! (Schröder's equation).
f(h(x)) = (f(x))^c\,\! (Böttcher's equation).
f(x+y) = f(x)g(y)+f(y)g(x)\,\! (sine addition formula).
g(x+y) = g(x)g(y)-f(y)f(x)\,\! (cosine addition formula).
f(xy) = \sum g_l(x) h_l(y)\,\! (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
a(n) = 3a(n-1) + 4a(n-2)\,\!
  • 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:
(a*b)*c = a*(b*c).\,

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

f(f(a, b),c) = f(a, f(b, c)).\,\!

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.[6] The b-parts real functions have many interesting number theoretic explanations, analytic and algebraic properties, and satisfy the functional equation:
f(f(x) + y - f(y)) = f(x).\,\!

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 ;

f(f(xy)z)=f(xf(yz))\; ,\; f(f(xy)z)=f(xf(yz))=f(xyz)

Decomposer equations ;

f(f^*(x)f(y))=f(y)\; ,\; f(f(x)f_*(y))=f(x)

Strong decomposer equations ;

f(f^*(x)y)=f(y)\; ,\; f(xf_*(y))=f(x)

Canceler equations ;

f(f(x)y)=f(xy)\; ,\; f(xf(y))=f(xy)\; ,\; f(xf(y)z)=f(xyz)

where ƒ *(x)ƒ(x) = ƒ(x)ƒ *(x) = x. In ref [7] 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. But it is proven there 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.

Solving functional equations[edit]

Solving functional equations can be very difficult but there are some common methods of solving them. For example, in dynamic programming a variety of successive approximation methods[8][9] are used to solve Bellman's functional equation, including methods based on fixed point iterations. The main method of solving elementary functional equations is substitution. It is often useful to prove surjectivity or injectivity and prove oddness or evenness, if possible. It is also useful to guess possible solutions. Induction is a useful technique to use when the function is only defined for rational or integer values.

A discussion of involutary functions is useful. For example, consider the function

f(x) = 1-x \, .

Composing f with itself gives

f(f(x)) = 1-(1-x) = x \, .

Many other functions also satisfy the functional equation : f(f(x)) = x \,, including

 f(x) = \frac{1}{x}\, ,
 f(x) = \frac{1}{1-x} + 1 \, .

Example 1: Find all functions f that satisfy

f(x+y)^2 = f(x)^2 + f(y)^2\,

for all x,y \in \mathbb{R}, assuming ƒ is a real-valued function.

Let x = y = 0


So ƒ(0)2 = 0 and ƒ(0) = 0.

Now, let y = −x:


A square of a real number is nonnegative, and a sum of nonnegative numbers is zero iff both numbers are 0. So ƒ(x)2 = 0 for all x and ƒ(x) = 0 is the only solution.

See also[edit]


  1. ^ Rassias, Themistocles M. (2000). Functional Equations and Inequalities. 3300 AA Dordrecht, The Netherlands: Kluwer Academic Publishers. p. 335. ISBN 0- 7923-6484-8. 
  2. ^ Hyers, D. H.; Isac, G., Rassias, Th. M. (1998). Stability of Functional Equations in Several Variables. Boston: Birkhäuser Verlag. p. 313. ISBN 0-8176-4024-X. 
  3. ^ Jung, Soon-Mo (2001). Hyers-Ulam-Rassias Stability of Functional Equations in Mathematical Analysis. 35246 US 19 North # 115, Palm Harbor, FL 34684 USA: Hadronic Press, Inc. p. 256. ISBN 1-57485-051-2. 
  4. ^ Czerwik, Stephan (2002). Functional Equations and Inequalities in Several Variables. P O Box 128, Farrer Road, Singapore 912805: World Scientific Publishing Co. p. 410. ISBN 981-02-4837-7. 
  5. ^ Cheng, Sui Sun; Wendrong Li (2008). Analytic solutions of Functional equations. 5 Toh Tuck Link, Singapore 596224: World Scientific Publishing Co. ISBN 978-981-279-334-8. 
  6. ^ Hooshmand, M.H. (2005). "b-Digital sequences". Wmsci 2005: 9Th World Multi-Conference on Systemics, Cybernetics and Informatics 8: 142–146. 
  7. ^ Hooshmand, M.H., Haili, H.K.; Haili, H (2007). "Decomposer and associative functional equations". Indagationes Mathematicae 18 (4): 539–554. doi:10.1016/S0019-3577(07)80061-9. 
  8. ^ Bellman, R. (1957). Dynamic Programming, Princeton University Press.
  9. ^ Sniedovich, M. (2010). Dynamic Programming: Foundations and Principles, Taylor & Francis.


  • János Aczél, Functional Equations and Their Applications, Academic Press, 1966.
  • János Aczél & J. Dhombres, Functional Equations in Several Variables, Cambridge University Press, 1989.
  • Pl. Kannappan, Functional Equations and Inequalities with Applications, Springer, 2009.
  • Marek Kuczma, Introduction to the Theory of Functional Equations and Inequalities, second edition, Birkhäuser, 2009.
  • Henrik Stetkær, Functional Equations on Groups, first edition, World Scientific Publishing, 2013.

External links[edit]