Statistical shape analysis: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Helpful Pixie Bot
m ISBNs (Build KE)
 
en>Yobot
m clean up, References after punctuation per WP:REFPUNC and WP:PAIC using AWB (8748)
Line 1: Line 1:
When you work online, the world is your oyster. You are free to do, act and be as you wish, but only if you know what you're doing. If you want to turn your online work into a profitable career, use the tips you've read today and make it happen. When you are in a [http://www.comoganhardinheiro101.com/ferramentas/ como ganhar dinheiro na internet] hurry to make money, reading about the topic may seem frustrating. The fact is that the more you know, the faster and better you will be at bringing in income. This article has given you the foundation you need, so build on it with experience and more learning. <br><br><br>
In [[mathematics]], the '''multiplication theorem''' is a certain type of identity obeyed by many [[special function]]s related to the [[gamma function]]. For the explicit case of the gamma function, the identity is a product of values; thus the name. The various relations all stem from the same underlying principle; that is, the relation for one special function can be derived from that for the others, and is simply a manifestation of the same identity in different guises.


Manage your time wisely when you are trying to make money online. You may have a real-world job, which means you have to budget time wisely. Set a schedule that will allow you enough time to balance the two. Also make sure that you are being efficient in that time, so you don't run into stress [http://www.comoganhardinheiro101.com/?p=66 ganhar dinheiro pela internet] about working online. Becoming a ghost writer is a great way to earn money online. There are people who need content for their websites, but who lack good writing skills. You can write for them and earn money for what you write. Many people are earning a good income writing for others this way.<br><br>Don't buy every book about making money online. Most of the time, these books are sold by people whose claim to fame is that they are teaching people how to make money [http://www.comoganhardinheiro101.com/?p=73 como ganhar dinheiro na internet] online. Before you buy an e-book or book about making  ganhar dinheiro money, make sure that you know a little about the author, and that you have seen testimonials about the book.<br><br>To really make money online, consider setting up your own site and having all the control. You could sell things as an affiliate or [http://comoganhardinheironainternet.comoganhardinheiro101.com offer professional] services, among many other things. While working for others can earn you a nice income, there's nothing like raking in all the profits and calling [http://www.comoganhardinheiro101.com/?p=12 ganhando dinheiro na internet] all the shots yourself! As stated above, there are lots of ways to increase your online income. Use these suggestions to help you get started. You will be amazed at how quickly the money can add up. Come back to this page and others like it to continue growing your online work portfolio as you go.<br><br>As you can see from the above article, it is easy to understand how to make money online when you get the knowledge through great tips. You can join the millions of people worldwide who make money each day, if you [http://www.comoganhardinheiro101.com/?p=73 como ganhar dinheiro na internet] pay close attention to the tips that you have just read. Making money online is a skill, and if you continue to study good tips and ideas such as these, there is no reason why you cannot make lots of money online.<br><br>If you have the ability to type quickly, you may consider transcription jobs. You need to have good headphones and the ability to keep up with what is being said. Often, the companies will have their own formatting guidelines. Familiarize yourself with these prior to beginning. Once you have, you can begin transcribing. [http://www.comoganhardinheiro101.com/?p=90 como ganhar dinheiro pela internet] What do you do? Do it for pay! A number of websites offer you points when you search through them and/or make purchases of items that you were planning to buy anyway. Take the points you earn and trade them for gift cards, gifts and sometimes even cash. Sites thatprovide this opportunity include Swagbucks and Mypoints.<br><br>Take advantage of paid per post if you have extra time and need to make money online. People will need you to make posts on their site to promote a product or give a good review, which will help them in the long run. In return, they will pay you a nice sum. Do you enjoy [http://www.comoganhardinheiro101.com/slide-central/ como ganhar dinheiro pela internet] writing? If so, you can make cash by becoming a freelance writer. Just be aware that most freelance writing sites prefer writers with experience. But, there are other sites that will hire you if you pass a test. It's a bonus if you have knowledge on particular subjects.<br><br>Make extra money on the side with email marketing. This is a great way to promote a company and use the subscribers that you have to your advantage. You will simply send a message or advertise a product to your large pool of subscribers and get paid money to do so. If you plan on making serious [http://www.comoganhardinheiro101.com/?p=66 ganhar dinheiro] money online, make sure you've got the right equipment for the job. There's nothing more frustrating than trying to complete a job and your Internet times out, or is so slow that you miss a bid or other opportunity. Have the necessary equipment and make sure you're software is up to date too.<br><br>
==Finite characteristic==
The multiplication theorem takes two common forms. In the first case, a finite number of terms are added or multiplied to give the relation. In the second case, an infinite number of terms are added or multiplied. The finite form typically occurs only for the gamma and related functions, for which the identity follows from a [[p-adic]] relation over a [[finite field]]. For example, the multiplication theorem for the gamma function follows from the [[Chowla–Selberg formula]], which follows from the theory of [[complex multiplication]]. The infinite sums are much more common, and follow from [[characteristic zero]] relations on the hypergeometric series.


If you want to do something creative, consider ways to create viral videos. Brainstorm ideas that you think are rip riotously hilarious, then start putting them into action. Post them on YouTube, turn on ads and, if they work, watch the money start rolling in! Learn about marketing to see how you can get them even more popular. If you are you looking for more info regarding [http://comoconseguirdinheiro.comoganhardinheiro101.com como ficar rico] visit comoconseguirdinheiro.comoganhardinheiro101.com [http://www.comoganhardinheiro101.com/tag/opcoes-binarias/ ganhar dinheiro na internet] If you know how to prepare taxes, you can earn money online. Apply for the necessary government licenses and then begin offering your services online. Many of today's top producers work from home with only their laptop and an email address. For best results, continually advertise your services throughout the year.<br><br>Medical transcription can be a good way to make money online as a full time career. Formal training is required, and this can be costly. Additionally, it is necessary to have good computer and transcription equipment that works reliably. A great deal of work is available for people who are able and willing [http://www.comoganhardinheiro101.com/?p=10 ganhar dinheiro pela internet] to invest in training and good equipment. Pay is quite substantial. You can sell your wares on the Internet to make money. Certain sites will help you to do your selling. You can personalize the t-shirts for your client. You can advertise by putting fliers up around the neighborhood or by using Craigslist.
The following tabulates the various appearances of the multiplication theorem for finite characteristic; the characteristic zero relations are given further down. In all cases, ''n'' and ''k'' are non-negative integers. For the special case of ''n''&nbsp;=&nbsp;2, the theorem is commonly referred to as the '''duplication formula'''.
 
==Gamma function-Legendre function ==
The duplication formula and the multiplication theorem for the [[gamma function]] are the prototypical examples. The duplication formula for the gamma function is
:<math>
\Gamma(z) \; \Gamma\left(z + \frac{1}{2}\right) = 2^{1-2z} \; \sqrt{\pi} \; \Gamma(2z). \,\!
</math>
 
It is  also called the '''Legendre duplication formula'''<ref>{{mathworld|urlname=LegendreDuplicationFormula|title=Legendre Duplication Formula}}</ref> or '''Legendre relation''', in honor of [[Adrien-Marie Legendre]]. The multiplication theorem is
:<math>
\Gamma(z) \; \Gamma\left(z + \frac{1}{k}\right) \; \Gamma\left(z + \frac{2}{k}\right) \cdots
\Gamma\left(z + \frac{k-1}{k}\right) =
(2 \pi)^{ \frac{k-1}{2}} \; k^{1/2 - kz} \; \Gamma(kz) \,\!
</math>
for integer ''k'' &ge; 1, and is sometimes called '''Gauss's multiplication formula''', in honour of [[Carl Friedrich Gauss]]. The multiplication theorem for the gamma functions can be understood to be a special case, for the [[trivial character]], of the [[Chowla–Selberg formula]].
 
==Polygamma function==
The [[polygamma function]] is the [[logarithmic derivative]] of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative:
 
:<math>k^{m} \psi^{(m-1)}(kz) = \sum_{n=0}^{k-1}
\psi^{(m-1)}\left(z+\frac{n}{k}\right)</math>
 
for <math>m>1</math>, and, for <math>m=1</math>, one has the [[digamma function]]:
 
:<math>k\left[\psi(kz)-\log(k)\right] = \sum_{n=0}^{k-1}
\psi\left(z+\frac{n}{k}\right).</math>
 
==Hurwitz zeta function==
For the [[Hurwitz zeta function]] generalizes the polygamma function to non-integer orders, and thus obeys a very similar multiplication theorem:
 
:<math>k^s\zeta(s)=\sum_{n=1}^k \zeta\left(s,\frac{n}{k}\right),</math>
 
where <math>\zeta(s)</math> is the [[Riemann zeta function]]. This is a special case of
 
:<math>k^s\,\zeta(s,kz)= \sum_{n=0}^{k-1}\zeta\left(s,z+\frac{n}{k}\right)</math>
and
:<math>\zeta(s,kz)=\sum^{\infty}_{n=0} {s+n-1 \choose n} (1-k)^n z^n \zeta(s+n,z).</math>
 
Multiplication formulas for the non-principal characters may be given in the form of [[Dirichlet L-function]]s.
 
==Periodic zeta function==
The '''periodic zeta function'''<ref>Apostol, ''Introduction to analytic number theory'', Springer</ref> is sometimes defined as
 
:<math>F(s;q) = \sum_{m=1}^\infty \frac {e^{2\pi imq}}{m^s}
=\operatorname{Li}_s\left(e^{2\pi i q} \right) </math>
 
where Li<sub>''s''</sub>(''z'') is the [[polylogarithm]]. It obeys the duplication formula
 
:<math>2^{-s} F(s;q) = F\left(s,\frac{q}{2}\right)
+ F\left(s,\frac{q+1}{2}\right).</math>
 
As such, it is an eigenvector of the [[Bernoulli operator]] with eigenvalue 2<sup>&minus;''s''</sup>. The multiplication theorem is
 
:<math>k^{-s} F(s;kq) = \sum_{n=0}^{k-1} F\left(s,q+\frac{n}{k}\right).</math>
 
The periodic zeta function occurs in the reflection formula for the Hurwitz zeta function, which is why the relation that it obeys, and the Hurwitz zeta relation, differ by the interchange of&nbsp;''s''&nbsp;&rarr;&nbsp;&minus;''s''.
 
The [[Bernoulli polynomials]] may be obtained as a limiting case of the periodic zeta function, taking ''s'' to be an integer, and thus the multiplication theorem there can be derived from the above. Similarly, substituting&nbsp;''q''&nbsp;=&nbsp;log&nbsp;''z'' leads to the multiplication theorem for the polylogarithm.
 
==Polylogarithm==
The duplication formula takes the form
 
:<math>2^{1-s}\operatorname{Li}_s(z^2) = \operatorname{Li}_s(z)+\operatorname{Li}_s(-z).</math>
 
The general multiplication formula is in the form of a [[Gauss sum]] or [[discrete Fourier transform]]:
 
:<math>k^{1-s} \operatorname{Li}_s(z^k) =
\sum_{n=0}^{k-1}\operatorname{Li}_s\left(ze^{i2\pi n/k}\right).</math>
 
These identities follow from that on the periodic zeta function, taking&nbsp;''z''&nbsp;=&nbsp;log&nbsp;''q''.
 
==Kummer's function==
The duplication formula for [[Kummer's function]] is
 
:<math>2^{1-n}\Lambda_n(-z^2) = \Lambda_n(z)+\Lambda_n(-z)\ </math>
 
and thus resembles that for the polylogarithm, but twisted by&nbsp;''i''.
 
==Bernoulli polynomials==
For the [[Bernoulli polynomials]], the multiplication theorems were given by [[Joseph Ludwig Raabe]] in 1851:
 
:<math>k^{1-m} B_m(kx)=\sum_{n=0}^{k-1} B_m \left(x+\frac{n}{k}\right)</math>
 
and for the [[Euler polynomials]],
 
:<math>k^{-m} E_m(kx)= \sum_{n=0}^{k-1}
(-1)^n E_m \left(x+\frac{n}{k}\right)
\quad \mbox{ for } k=1,3,\dots</math>
 
and
 
:<math>k^{-m} E_m(kx)= \frac{-2}{m+1} \sum_{n=0}^{k-1}
(-1)^n B_{m+1} \left(x+\frac{n}{k}\right)
\quad \mbox{ for } k=2,4,\dots.</math>
 
The Bernoulli polynomials may be obtained as a special case of the Hurwitz zeta function, and thus the identities follow from there.
 
==Bernoulli map==
The [[Bernoulli map]] is a certain simple model of a [[dissipative]] [[dynamical system]], describing the effect of a [[shift operator]] on an infinite string of coin-flips (the [[Cantor set]]). The Bernoulli map is a one-sided version of the closely related [[Baker's map]]. The Bernoulli map generalizes to a [[p-adic|k-adic]] version, which acts on infinite strings of ''k'' symbols: this is the [[Bernoulli scheme]]. The [[transfer operator]] <math>\mathcal{L}_k</math> corresponding to the shift operator on the Bernoulli scheme is given by
 
:<math>[\mathcal{L}_k f](x) = \frac{1}{k}\sum_{n=0}^{k-1}f\left(\frac{x+n}{k}\right)</math>
 
Perhaps not surprisingly, the [[eigenvector]]s of this operator are given by the Bernoulli polynomials. That is, one has that
:<math>\mathcal{L}_k B_m = \frac{1}{k^m}B_m</math>
 
It is the fact that the eigenvalues <math>k^{-m}<1</math> that marks this as a dissipative system: for a non-dissipative [[measure-preserving dynamical system]], the eigenvalues of the transfer operator lie on the unit circle.
 
More generally, this operator also has a continuous spectrum: the Hurwitz zeta function <math>\zeta(s,x)</math> is also an eigenvector, with eigenvalue <math>k^s</math>. Note that the Bernoulli polynomials arise as limiting cases of the Hurwitz zeta for integer values of ''-s''.
 
==Characteristic zero==
The multiplication theorem over a field of [[characteristic zero]] does not close after a finite number of terms, but requires an [[infinite series]] to be expressed. Examples include that for the [[Bessel function]]  <math>J_\nu(z)</math>:
 
:<math>\lambda^{-\nu} J_\nu (\lambda z) =
\sum_{n=0}^\infty \frac{1}{n!}
\left(\frac{(1-\lambda^2)z}{2}\right)^n
J_{\nu+n}(z),
</math>
 
where <math>\lambda</math> and <math>\nu</math> may be taken as arbitrary complex numbers. Such characteristic-zero identities follow generally from one of many possible identities on the hypergeometric series.
 
==Notes==
<references/>
 
==References==
* Milton Abramowitz and Irene A. Stegun, eds. ''[[Abramowitz and Stegun|Handbook of Mathematical Functions]] with Formulas, Graphs, and Mathematical Tables'', (1972) Dover, New York. ''(Multiplication theorems are individually listed chapter by chapter)''
* C. Truesdell, "[http://www.pnas.org/cgi/reprint/36/12/752.pdf On the Addition and Multiplication Theorems for the Special Functions]", ''Proceedings of the National Academy of Sciences, Mathematics'',  (1950) pp.752–757.
 
[[Category:Special functions]]
[[Category:Zeta and L-functions]]
[[Category:Gamma and related functions]]
[[Category:Mathematical theorems]]

Revision as of 15:37, 5 December 2012

In mathematics, the multiplication theorem is a certain type of identity obeyed by many special functions related to the gamma function. For the explicit case of the gamma function, the identity is a product of values; thus the name. The various relations all stem from the same underlying principle; that is, the relation for one special function can be derived from that for the others, and is simply a manifestation of the same identity in different guises.

Finite characteristic

The multiplication theorem takes two common forms. In the first case, a finite number of terms are added or multiplied to give the relation. In the second case, an infinite number of terms are added or multiplied. The finite form typically occurs only for the gamma and related functions, for which the identity follows from a p-adic relation over a finite field. For example, the multiplication theorem for the gamma function follows from the Chowla–Selberg formula, which follows from the theory of complex multiplication. The infinite sums are much more common, and follow from characteristic zero relations on the hypergeometric series.

The following tabulates the various appearances of the multiplication theorem for finite characteristic; the characteristic zero relations are given further down. In all cases, n and k are non-negative integers. For the special case of n = 2, the theorem is commonly referred to as the duplication formula.

Gamma function-Legendre function

The duplication formula and the multiplication theorem for the gamma function are the prototypical examples. The duplication formula for the gamma function is

Γ(z)Γ(z+12)=212zπΓ(2z).

It is also called the Legendre duplication formula[1] or Legendre relation, in honor of Adrien-Marie Legendre. The multiplication theorem is

Γ(z)Γ(z+1k)Γ(z+2k)Γ(z+k1k)=(2π)k12k1/2kzΓ(kz)

for integer k ≥ 1, and is sometimes called Gauss's multiplication formula, in honour of Carl Friedrich Gauss. The multiplication theorem for the gamma functions can be understood to be a special case, for the trivial character, of the Chowla–Selberg formula.

Polygamma function

The polygamma function is the logarithmic derivative of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative:

kmψ(m1)(kz)=n=0k1ψ(m1)(z+nk)

for m>1, and, for m=1, one has the digamma function:

k[ψ(kz)log(k)]=n=0k1ψ(z+nk).

Hurwitz zeta function

For the Hurwitz zeta function generalizes the polygamma function to non-integer orders, and thus obeys a very similar multiplication theorem:

ksζ(s)=n=1kζ(s,nk),

where ζ(s) is the Riemann zeta function. This is a special case of

ksζ(s,kz)=n=0k1ζ(s,z+nk)

and

ζ(s,kz)=n=0(s+n1n)(1k)nznζ(s+n,z).

Multiplication formulas for the non-principal characters may be given in the form of Dirichlet L-functions.

Periodic zeta function

The periodic zeta function[2] is sometimes defined as

F(s;q)=m=1e2πimqms=Lis(e2πiq)

where Lis(z) is the polylogarithm. It obeys the duplication formula

2sF(s;q)=F(s,q2)+F(s,q+12).

As such, it is an eigenvector of the Bernoulli operator with eigenvalue 2s. The multiplication theorem is

ksF(s;kq)=n=0k1F(s,q+nk).

The periodic zeta function occurs in the reflection formula for the Hurwitz zeta function, which is why the relation that it obeys, and the Hurwitz zeta relation, differ by the interchange of s → −s.

The Bernoulli polynomials may be obtained as a limiting case of the periodic zeta function, taking s to be an integer, and thus the multiplication theorem there can be derived from the above. Similarly, substituting q = log z leads to the multiplication theorem for the polylogarithm.

Polylogarithm

The duplication formula takes the form

21sLis(z2)=Lis(z)+Lis(z).

The general multiplication formula is in the form of a Gauss sum or discrete Fourier transform:

k1sLis(zk)=n=0k1Lis(zei2πn/k).

These identities follow from that on the periodic zeta function, taking z = log q.

Kummer's function

The duplication formula for Kummer's function is

21nΛn(z2)=Λn(z)+Λn(z)

and thus resembles that for the polylogarithm, but twisted by i.

Bernoulli polynomials

For the Bernoulli polynomials, the multiplication theorems were given by Joseph Ludwig Raabe in 1851:

k1mBm(kx)=n=0k1Bm(x+nk)

and for the Euler polynomials,

kmEm(kx)=n=0k1(1)nEm(x+nk) for k=1,3,

and

kmEm(kx)=2m+1n=0k1(1)nBm+1(x+nk) for k=2,4,.

The Bernoulli polynomials may be obtained as a special case of the Hurwitz zeta function, and thus the identities follow from there.

Bernoulli map

The Bernoulli map is a certain simple model of a dissipative dynamical system, describing the effect of a shift operator on an infinite string of coin-flips (the Cantor set). The Bernoulli map is a one-sided version of the closely related Baker's map. The Bernoulli map generalizes to a k-adic version, which acts on infinite strings of k symbols: this is the Bernoulli scheme. The transfer operator k corresponding to the shift operator on the Bernoulli scheme is given by

[kf](x)=1kn=0k1f(x+nk)

Perhaps not surprisingly, the eigenvectors of this operator are given by the Bernoulli polynomials. That is, one has that

kBm=1kmBm

It is the fact that the eigenvalues km<1 that marks this as a dissipative system: for a non-dissipative measure-preserving dynamical system, the eigenvalues of the transfer operator lie on the unit circle.

More generally, this operator also has a continuous spectrum: the Hurwitz zeta function ζ(s,x) is also an eigenvector, with eigenvalue ks. Note that the Bernoulli polynomials arise as limiting cases of the Hurwitz zeta for integer values of -s.

Characteristic zero

The multiplication theorem over a field of characteristic zero does not close after a finite number of terms, but requires an infinite series to be expressed. Examples include that for the Bessel function Jν(z):

λνJν(λz)=n=01n!((1λ2)z2)nJν+n(z),

where λ and ν may be taken as arbitrary complex numbers. Such characteristic-zero identities follow generally from one of many possible identities on the hypergeometric series.

Notes

  1. 22 year-old Systems Analyst Rave from Merrickville-Wolford, has lots of hobbies and interests including quick cars, property developers in singapore and baking. Always loves visiting spots like Historic Monuments Zone of Querétaro.

    Here is my web site - cottagehillchurch.com
  2. Apostol, Introduction to analytic number theory, Springer

References