Functional equation

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

In mathematics, a functional equation [1][2][irrelevant citation] is, in the broadest meaning, an equation in which one or several functions appear as unknowns. So, differential equations and integral equations are functional equations. However, a more restricted meaning is often used, where a functional equation is an equation that relates several values of the same function. For example, the logarithm functions are essentially characterized by the logarithmic functional equation

If the domain of the unknown function is supposed to be the natural numbers, the function is generally viewed as a sequence, and, in this case, a functional equation (in the narrower meaning) is called a recurrence relation. Thus the term functional equation is used mainly for real functions and complex functions. Moreover a smoothness condition is often assumed for the solutions, since without such a condition, most functional equations have very irregular solutions. For example, the gamma function is a function that satisfies the functional equation and the initial value There are many functions that satisfy these conditions, but the gamma function is the unique one that is meromorphic in the whole complex plane, and logarithmically convex for x real and positive (Bohr–Mollerup theorem).

Examples[edit]

  • 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, , where and
  • , which characterizes the periodic functions
  • , which characterizes the even functions, and likewise , which characterizes the odd functions
  • , which characterizes the functional square roots of the function g
  • (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
  • satisfied by all exponential functions. Like Cauchy's additive functional equation, this too may have pathological, discontinuous solutions
  • , satisfied by all logarithmic functions and, over coprime integer arguments, additive functions
  • , satisfied by all power functions and, over coprime integer arguments, multiplicative functions
  • (quadratic equation or parallelogram law)
  • (Jensen's functional equation)
  • (d'Alembert's functional equation)
  • (Abel equation)
  • (Schröder's equation).
  • (Böttcher's equation).
  • (Julia's equation).
  • (Levi-Civita),
  • (sine addition formula and hyperbolic sine addition formula),
  • (cosine addition formula),
  • (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,
    but if we write f(a, b) instead of ab then the associative law looks more like a conventional functional equation,
  • The functional equation
    is satisfied by the Riemann zeta function.[citation needed] The capital Γ denotes the gamma function.
  • The gamma function is the unique solution of the following system of three equations:[citation needed]
    •           (Euler's reflection formula)
  • The functional equation
    where a, b, c, d are integers satisfying , i.e. = 1, defines f to be a modular form of order k.

One feature that all of the examples listed above[clarification needed] 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.[citation needed]

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.

Involutions[edit]

The involutions are characterized by the functional equation . These appear in Babbage's functional equation (1820),[3]

Other involutions, and solutions of the equation, include

  • and

which includes the previous three as special cases or limits.

Solution[edit]

One method of solving elementary functional equations is substitution.[citation needed]

Some solutions to functional equations have exploited surjectivity, injectivity, oddness, and evenness.[citation needed]

Some functional equations have been solved with the use of ansatzes, mathematical induction.[citation needed]

Some classes of functional equations can be solved by computer-assisted techniques.[vague][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.

See also[edit]

Notes[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.{{cite book}}: CS1 maint: location (link)
  2. ^ 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.{{cite book}}: CS1 maint: location (link)
  3. ^ Ritt, J. F. (1916). "On Certain Real Solutions of Babbage's Functional Equation". The Annals of Mathematics. 17 (3): 113–122. doi:10.2307/2007270. JSTOR 2007270.
  4. ^ Házy, Attila (2004-03-01). "Solving linear two variable functional equations with computer". Aequationes Mathematicae. 67 (1): 47–62. doi:10.1007/s00010-003-2703-9. ISSN 1420-8903. S2CID 118563768.
  5. ^ Bellman, R. (1957). Dynamic Programming, Princeton University Press.
  6. ^ Sniedovich, M. (2010). Dynamic Programming: Foundations and Principles, Taylor & Francis.

References[edit]

External links[edit]