Functional equation

In mathematics or its applications, a functional equation is an equation expressing a relation between the value of a function (or functions) at a point with its values at other points. Properties of functions can for instance be determined by considering the types of functional equations they satisfy. The term "functional equation" is usually reserved for equations that are not in a simple sense reducible to algebraic equations, often because two or more known functions are substituted as arguments into another function.

Examples

* The functional equation

::$f(s)\; =\; 2^spi^\{s-1\}sinleft(frac\{pi\; s\}\{2\}\; ight)Gamma(1-s)f(1-s)$

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

* These functional equations are satisfied by the gamma function. Gamma function is the unique solution of the system of all the three equations:::$f(x)=\{f(x+1)\; over\; x\},!$::$f(y)fleft(y+frac\{1\}\{2\}\; ight)=frac\{sqrt\{pi\{2^\{2y-1f(2y)$::$f(z)f(1-z)=\{pi\; over\; sin(pi\; z)\},!,,,$ (Euler's reflection formula)

* The functional equation

::$fleft(\{az+bover\; cz+d\}\; ight)\; =\; (cz+d)^k\; f(z),!$

:where "a", "b", "c", "d" are integers satisfying "ad" − "bc" = 1, i.e. , which means that is a unitary matrix (i.e. having determinant 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))\; =\; cf(x),!$ (Schröder equation)

::$f(h(x))\; =\; f(x)\; +\; 1,!$ (Abel equation).

*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 $f(a,\; b)$ 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 cite journal
author=M.H.Hooshmand,
year=2005
title=b-Digital sequences
journal=
volume=8
pages=142-146
url=http://apps.isiknowledge.com/full_record.do?product=UA&search_mode=GeneralSearch&qid=1&SID=N1gDCAgALmD8dPO9IkD&page=1&doc=4&colname=ISIP ] . 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 $f^*(x)f(x)=f(x)f\_*(x)=x$. In cite journal
author=M.H.Hooshmand, H.K.Haili
year=2007
title=Decomposer and associative functional equations
journal=Indagationes Mathematicae
volume=18
issue=4
pages=539-554
doi= 10.1016/S0019-3577(07)80061-9
url=http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VJN-4T40TVP-5&_user=4187955&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_version=1&_urlVersion=0&_userid=4187955&md5=e4dd79d2ea4e66d4cb8159cb0501625f ] , 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.

olving functional equations

Solving functional equations can be very difficult but there are some common methods of solving them.

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

:$f(x)\; =\; frac\{1\}\{x\}$.

Then consider

:"f"("f"("x")) = "x",

if we continue the pattern we end up with "x" for an even number of compositions and "f"("x") for an odd number. This same idea applies to many other functions, i.e.

:$f(x)\; =\; frac\{1\}\{1-x\},\; f(x)\; =\; 1-x$ and many others.

Example 1: Solve $f(x+y)^2\; =\; f(x)^2\; +\; f(y)^2$ for all $x,y\; in\; mathbb\{R\},$ assuming "f" is a real-valued function.

Let $x=y=0$: $f(0)^2=f(0)^2+f(0)^2$. So $f(0)^2=0$ and $f(0)=0$.

Now, let $y=-x$:

:$f(x-x)^2=f(x)^2+f(-x)^2$:$f(0)^2=f(x)^2+f(-x)^2$:$0=f(x)^2+f(-x)^2$

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

ee also

*Functional equation (L-function)

External links

* [http://eqworld.ipmnet.ru/en/solutions/fe.htm Functional Equations: Exact Solutions] at EqWorld: The World of Mathematical Equations.
* [http://eqworld.ipmnet.ru/en/solutions/eqindex/eqindex-fe.htm Functional Equations: Index] at EqWorld: The World of Mathematical Equations.
* [http://www.imomath.com/tekstkut/funeqn_mr.pdf IMO Compendium] text on functional equations in problem solving.

References

*Marek Kuczma : Functional equations in a single variable (Polska Akademia Nauk. Monografie matematyczne, t. 46)
*M. Kuczma, On the functional equation φn(x) = g(x). [http://matwbn.icm.edu.pl/tresc.php?wyd=7&tom=11&jez=pl Ann. Polon. Math. 11 (1961) 161-175]