Functional equations

This MedLibrary.org supplementary page on Functional equations is provided directly from the open source Wikipedia as a service to our readers. Please see the note below on authorship of this content, as well as the Wikipedia usage guidelines. To search for other content from our encyclopedia supplement, please use the form below:

Related Sponsors

BM Pharmacy Generic pharmaceuticals at unbeatable prices. Insomnia, men's health, hair health, pain control. bmpharmacy.com
Online Pharmacy Carisoprodol, tadalafil, sildenafil, vardenafil and more... xlpharmacy.com
MedBasket.com Discreet. Inexpensive. Fast shipping. Great selection. What more can we say? medbasket.com
Frugalmed 2000 reasons to shop with us first. frugalmed.com
Ads by Tiva

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.

Contents

Examples

  • 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.
  • 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)f\left(y+\frac{1}{2}\right)=\frac{\sqrt{\pi}}{2^{2y-1}}f(2y)
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 ad − bc = 1, i.e. \begin{vmatrix} a & b\\c & d\end{vmatrix}\,=1, which means that \begin{bmatrix} a & b\\c & d\end{bmatrix}\, 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).
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 1. 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 2, 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.

Solving 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} + 1 , 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.

See also

External links

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). Ann. Polon. Math. 11 (1961) 161-175
  1. ^ M.H.Hooshmand, (2005). "b-Digital sequences". WMSCI 2005: 9TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS 8: 142-146, http://apps.isiknowledge.com/full_record.do?product=UA&search_mode=GeneralSearch&qid=1&SID=N1gDCAgALmD8dPO9IkD&page=1&doc=4&colname=ISIP. 
  2. ^ M.H.Hooshmand, H.K.Haili (2007). "Decomposer and associative functional equations". Indagationes Mathematicae 18 (4): 539-554. doi:10.1016/S0019-3577(07)80061-9, 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. 

Wikipedia content modification information:

  • This page was last modified on 18 November 2008, at 07:07.

Wikipedia Authorship and Review

Wikipedia content provided here is not reviewed directly by MedLibrary.org. Wikipedia content is authored by an open community of volunteers and is not produced by or in any way affiliated with MedLibrary.org.

Wikipedia Usage Guidelines

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article on "Functional equations".

The URL for this specific entry is:

All Wikipedia text is available under the terms of the GNU Free Documentation License. (See Copyrights for details). Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.