Functional equation

• Recurrence relations can be seen as functional equations in functions over the integers or natural numbers, in which the differences between terms' indexes can be seen as an application of the shift operator. For example, the recurrence relation defining the Fibonacci numbers, ${\displaystyle F_{n}=F_{n-1}+F_{n-2}}$, where ${\displaystyle F_{0}=0}$ and ${\displaystyle F_{1}=1}$

• ${\displaystyle f(x+P)=f(x)}$, which characterizes the periodic functions

• ${\displaystyle f(x)=f(-x)}$, which characterizes the even functions, and likewise ${\displaystyle f(x)=-f(-x)}$, which characterizes the odd functions

• ${\displaystyle f(f(x))=g(x)}$, which characterizes the functional square roots of the function g

• ${\displaystyle f(x+y)=f(x)+f(y)\,\!}$ (Cauchy's functional equation), satisfied by linear maps. The equation may, contingent on the axiom of choice, also have other pathological nonlinear solutions, whose existence can be proven with a Hamel basis for the real numbers
• ${\displaystyle f(x+y)=f(x)f(y),\,\!}$ satisfied by all exponential functions. Like Cauchy's additive functional equation, this too may have pathological, discontinuous solutions
• ${\displaystyle f(xy)=f(x)+f(y)\,\!}$, satisfied by all logarithmic functions and, over coprime integer arguments, additive functions
• ${\displaystyle f(xy)=f(x)f(y)\,\!}$, satisfied by all power functions and, over coprime integer arguments, multiplicative functions
• ${\displaystyle f(x+y)+f(x-y)=2[f(x)+f(y)]\,\!}$ (quadratic equation or parallelogram law)
• ${\displaystyle f((x+y)/2)=(f(x)+f(y))/2\,\!}$ (Jensen's functional equation)
• ${\displaystyle g(x+y)+g(x-y)=2[g(x)g(y)]\,\!}$ (d'Alembert's functional equation)
• ${\displaystyle f(h(x))=h(x+1)\,\!}$ (Abel equation)
• ${\displaystyle f(h(x))=cf(x)\,\!}$ (Schröder's equation).
• ${\displaystyle f(h(x))=(f(x))^{c}\,\!}$ (Böttcher's equation).
• ${\displaystyle f(h(x))=h'(x)f(x)\,\!}$ (Julia's equation).
• ${\displaystyle f(xy)=\sum g_{l}(x)h_{l}(y)\,\!}$ (Levi-Civita),
• ${\displaystyle f(x+y)=f(x)g(y)+f(y)g(x)\,\!}$ (sine addition formula and hyperbolic sine addition formula),
• ${\displaystyle g(x+y)=g(x)g(y)-f(y)f(x)\,\!}$ (cosine addition formula),
• ${\displaystyle g(x+y)=g(x)g(y)+f(y)f(x)\,\!}$ (hyperbolic cosine addition formula).
• The commutative and associative laws are functional equations. In its familiar form, the associative law is expressed by writing the binary operation in infix notation,
  $${\displaystyle (a\circ b)\circ c=a\circ (b\circ c)~,}$$

  
  but if we write f(a, b) instead of a ○ b then the associative law looks more like a conventional functional equation,
  $${\displaystyle f(f(a,b),c)=f(a,f(b,c)).\,\!}$$

  

• The functional equation
  $${\displaystyle 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, as proved here. The capital Γ denotes the gamma function.

• The gamma function is the unique solution of the following system of three equations:
  • ${\displaystyle f(x)={f(x+1) \over x}}$
  • ${\displaystyle f(y)f\left(y+{\frac {1}{2}}\right)={\frac {\sqrt {\pi }}{2^{2y-1}}}f(2y)}$
  • ${\displaystyle f(z)f(1-z)={\pi \over \sin(\pi z)}}$          (Euler's reflection formula)
• The functional equation
  $${\displaystyle f\left({az+b \over cz+d}\right)=(cz+d)^{k}f(z)}$$

  
  where a, b, c, d are integers satisfying ${\displaystyle ad-bc=1}$, i.e. ${\displaystyle {\begin{vmatrix}a&b\\c&d\end{vmatrix}}}$ = 1, defines f to be a modular form of order k.

One feature 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 inside the argument of the unknown functions to be solved for.

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.

One method of solving elementary functional equations is substitution.

Some solutions to functional equations have exploited surjectivity, injectivity, oddness, and evenness.

Some functional equations have been solved with the use of ansatzes, mathematical induction.

Some classes of functional equations can be solved by computer-assisted techniques.[4]

In dynamic programming a variety of successive approximation methods[5][6] are used to solve Bellman's functional equation, including methods based on fixed point iterations.

• Functional equation (L-function)
• Bellman equation
• Dynamic programming
• Implicit function
• Functional differential equation

• János Aczél, Lectures on Functional Equations and Their Applications, Academic Press, 1966, reprinted by Dover Publications, ISBN 0486445232.
• János Aczél & J. Dhombres, Functional Equations in Several Variables, Cambridge University Press, 1989.
• C. Efthimiou, Introduction to Functional Equations, AMS, 2011, ISBN 978-0-8218-5314-6 ; online.
• 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.
• Christopher G. Small (3 April 2007). Functional Equations and How to Solve Them. Springer Science & Business Media. ISBN 978-0-387-48901-8.

• Functional Equations: Exact Solutions at EqWorld: The World of Mathematical Equations.
• Functional Equations: Index at EqWorld: The World of Mathematical Equations.
• IMO Compendium text (archived) on functional equations in problem solving.