Beta function: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
imported>PolyconvexPoster
 
imported>Nailujon
 
Line 5: Line 5:
In [[mathematics]], the '''beta function''', also called the [[Euler integral (disambiguation)|Euler integral]] of the first kind, is a [[special function]] that is closely related to the [[gamma function]] and to [[binomial coefficient]]s. It is defined by the [[integral]]
In [[mathematics]], the '''beta function''', also called the [[Euler integral (disambiguation)|Euler integral]] of the first kind, is a [[special function]] that is closely related to the [[gamma function]] and to [[binomial coefficient]]s. It is defined by the [[integral]]


:<math> \Beta(z_1,z_2) = \int_0^1 t^{z_1-1}(1-t)^{z_2-1}\,dt</math>
<math display="block"> \Beta(z_1,z_2) = \int_0^1 t^{z_1-1}(1-t)^{z_2-1}\,dt</math>
for [[complex number]] inputs  
for [[complex number]] inputs  
<math> z_1, z_2 </math> such that <math> \operatorname{Re}(z_1), \operatorname{Re}(z_2)>0</math>.
<math> z_1, z_2 </math> such that <math> \operatorname{Re}(z_1), \operatorname{Re}(z_2)>0</math>.
Line 29: Line 29:
A key property of the beta function is its close relationship to the [[gamma function]]:<ref name=Davis622/>
A key property of the beta function is its close relationship to the [[gamma function]]:<ref name=Davis622/>


:<math> \Beta(z_1,z_2)=\frac{\Gamma(z_1)\,\Gamma(z_2)}{\Gamma(z_1+z_2)}</math>
<math display="block"> \Beta(z_1,z_2)=\frac{\Gamma(z_1)\,\Gamma(z_2)}{\Gamma(z_1+z_2)}</math>


A proof is given below in {{slink||Relationship to the gamma function}}.
A proof is given below in {{slink||Relationship to the gamma function}}.
Line 35: Line 35:
The beta function is also closely related to [[binomial coefficient]]s. When {{mvar|m}} (or {{mvar|n}}, by symmetry) is a positive integer, it follows from the definition of the gamma function {{math|Γ}} that<ref name=Davis622/>
The beta function is also closely related to [[binomial coefficient]]s. When {{mvar|m}} (or {{mvar|n}}, by symmetry) is a positive integer, it follows from the definition of the gamma function {{math|Γ}} that<ref name=Davis622/>


:<math> \Beta(m,n) =\frac{(m-1)!\,(n-1)!}{(m+n-1)!} = \frac{m + n}{mn} \Bigg/ \binom{m + n}{m} </math>
<math display="block"> \Beta(m,n) =\frac{(m-1)!\,(n-1)!}{(m+n-1)!} = \frac{m + n}{mn} \Bigg/ \binom{m + n}{m} </math>


== Relationship to the gamma function ==
== Relationship to the gamma function ==
To derive this relation, write the product of two factorials as integrals. Since they are integrals in two separate variables, we can combine them into an iterated integral:
To derive this relation, write the product of two factorials as integrals. Since they are integrals in two separate variables, we can combine them into an [[iterated integral]]:


:<math>\begin{align}
<math display="block">\begin{align}
  \Gamma(z_1)\Gamma(z_2) &= \int_{u=0}^\infty\ e^{-u} u^{z_1-1}\,du \cdot\int_{v=0}^\infty\ e^{-v} v^{z_2-1}\,dv \\[6pt]
  \Gamma(z_1)\Gamma(z_2) &= \int_{u=0}^\infty\ e^{-u} u^{z_1-1}\,du \cdot\int_{v=0}^\infty\ e^{-v} v^{z_2-1}\,dv \\[6pt]
  &=\int_{v=0}^\infty\int_{u=0}^\infty\ e^{-u-v} u^{z_1-1}v^{z_2-1}\, du \,dv.
  &=\int_{v=0}^\infty\int_{u=0}^\infty\ e^{-u-v} u^{z_1-1}v^{z_2-1}\, du \,dv.
\end{align}</math>
\end{align}</math>


Changing variables by {{math|''u'' {{=}} ''st''}} and {{math|''v'' {{=}} ''s''(1 − ''t'')}}, because {{math|''u + v'' {{=}} ''s''}} and {{math| ''u'' / ''(u+v)'' {{=}} ''t''}}, we have that the limits of integrations for {{math| ''s''}} are 0 to ∞ and the limits of integration for {{math| ''t''}} are 0 to 1. Thus produces
Changing variables by {{math|''u'' {{=}} ''st''}} and {{math|''v'' {{=}} ''s''(1 − ''t'')}}, because {{math|''u + v'' {{=}} ''s''}} and {{math|1=''u'' / (''u''+''v'') = ''t''}}, we have that the limits of integrations for {{math| ''s''}} are 0 to ∞ and the limits of integration for {{math| ''t''}} are 0 to 1. Thus produces


:<math>\begin{align}
<math display="block">\begin{align}
\Gamma(z_1)\Gamma(z_2) &= \int_{s=0}^\infty\int_{t=0}^1 e^{-s} (st)^{z_1-1}(s(1-t))^{z_2-1}s\,dt \,ds \\[6pt]
\Gamma(z_1)\Gamma(z_2) &= \int_{s=0}^\infty\int_{t=0}^1 e^{-s} (st)^{z_1-1}(s(1-t))^{z_2-1}s\,dt \,ds \\[6pt]
  &= \int_{s=0}^\infty e^{-s}s^{z_1+z_2-1} \,ds\cdot\int_{t=0}^1 t^{z_1-1}(1-t)^{z_2-1}\,dt\\
  &= \int_{s=0}^\infty e^{-s}s^{z_1+z_2-1} \,ds\cdot\int_{t=0}^1 t^{z_1-1}(1-t)^{z_2-1}\,dt\\[1ex]
  &=\Gamma(z_1+z_2) \cdot \Beta(z_1,z_2).
  &=\Gamma(z_1+z_2) \cdot \Beta(z_1,z_2).
\end{align}</math>
\end{align}</math>
Line 57: Line 57:
The stated identity may be seen as a particular case of the identity for the [[convolution#Integration|integral of a convolution]]. Taking
The stated identity may be seen as a particular case of the identity for the [[convolution#Integration|integral of a convolution]]. Taking


:<math>\begin{align}f(u)&:=e^{-u} u^{z_1-1} 1_{\R_+} \\ g(u)&:=e^{-u} u^{z_2-1} 1_{\R_+}, \end{align}</math>
<math display="block">\begin{align}f(u)&:=e^{-u} u^{z_1-1} 1_{\R_+} \\ g(u)&:=e^{-u} u^{z_2-1} 1_{\R_+}, \end{align}</math>


one has:
one has:


:<math> \Gamma(z_1) \Gamma(z_2) = \int_{\R}f(u)\,du\cdot \int_{\R} g(u) \,du = \int_{\R}(f*g)(u)\,du =\Beta(z_1,z_2)\,\Gamma(z_1+z_2).</math>
<math display="block"> \Gamma(z_1) \Gamma(z_2) = \int_{\R}f(u)\,du\cdot \int_{\R} g(u) \,du = \int_{\R}(f*g)(u)\,du =\Beta(z_1,z_2)\,\Gamma(z_1+z_2).</math>


See ''The Gamma Function'', page 18–19<ref>{{citation|last1=Artin|first1=Emil|title=The Gamma Function|pages=18–19|url=http://www.plouffe.fr/simon/math/Artin%20E.%20The%20Gamma%20Function%20(1931)(23s).pdf|access-date=2016-11-11|archive-url=https://web.archive.org/web/20161112081854/http://www.plouffe.fr/simon/math/Artin%20E.%20The%20Gamma%20Function%20(1931)(23s).pdf|archive-date=2016-11-12|url-status=dead}}</ref> for a derivation of this relation.
See ''The Gamma Function'', page 18–19<ref>{{citation|last1=Artin|first1=Emil|title=The Gamma Function|pages=18–19|url=http://www.plouffe.fr/simon/math/Artin%20E.%20The%20Gamma%20Function%20(1931)(23s).pdf|access-date=2016-11-11|archive-url=https://web.archive.org/web/20161112081854/http://www.plouffe.fr/simon/math/Artin%20E.%20The%20Gamma%20Function%20(1931)(23s).pdf|archive-date=2016-11-12|url-status=dead}}</ref> for a derivation of this relation.
Line 69: Line 69:
We have
We have


:<math>\frac{\partial}{\partial z_1} \mathrm{B}(z_1, z_2) = \mathrm{B}(z_1, z_2) \left( \frac{\Gamma'(z_1)}{\Gamma(z_1)} - \frac{\Gamma'(z_1 + z_2)}{\Gamma(z_1 + z_2)} \right) = \mathrm{B}(z_1, z_2) \big(\psi(z_1) - \psi(z_1 + z_2)\big),</math>
<math display="block">\frac{\partial}{\partial z_1} \mathrm{B}(z_1, z_2) = \mathrm{B}(z_1, z_2) \left( \frac{\Gamma'(z_1)}{\Gamma(z_1)} - \frac{\Gamma'(z_1 + z_2)}{\Gamma(z_1 + z_2)} \right) = \mathrm{B}(z_1, z_2) \big(\psi(z_1) - \psi(z_1 + z_2)\big),</math>


:<math>\frac{\partial}{\partial z_m} \mathrm{B}(z_1, z_2, \dots, z_n) = \mathrm{B}(z_1, z_2, \dots, z_n) \left(\psi(z_m) - \psi\left( \sum_{k=1}^n z_k \right)\right), \quad 1\le m\le n,</math>
<math display="block">\frac{\partial}{\partial z_m} \mathrm{B}(z_1, z_2, \dots, z_n) = \mathrm{B}(z_1, z_2, \dots, z_n) \left(\psi(z_m) - \psi{\left( \sum_{k=1}^n z_k \right)}\right), \quad 1\le m\le n,</math>


where <math>\psi(z)</math> denotes the [[digamma function]].
where <math>\psi(z)</math> denotes the [[digamma function]].
Line 78: Line 78:
[[Stirling's approximation]] gives the asymptotic formula
[[Stirling's approximation]] gives the asymptotic formula


:<math>\Beta(x,y) \sim \sqrt {2\pi } \frac{x^{x - 1/2} y^{y - 1/2} }{( {x + y} )^{x + y - 1/2} }</math>
<math display="block">\Beta(x,y) \sim \sqrt {2\pi } \frac{x^{x - 1/2} y^{y - 1/2} }{( {x + y} )^{x + y - 1/2} }</math>


for large {{mvar|x}} and large {{mvar|y}}.  
for large {{mvar|x}} and large {{mvar|y}}.  
Line 84: Line 84:
If on the other hand {{mvar|x}} is large and {{mvar|y}} is fixed, then
If on the other hand {{mvar|x}} is large and {{mvar|y}} is fixed, then


:<math>\Beta(x,y) \sim \Gamma(y)\,x^{-y}.</math>
<math display="block">\Beta(x,y) \sim \Gamma(y)\,x^{-y}.</math>


== Other identities and formulas ==
== Other identities and formulas ==
The integral defining the beta function may be rewritten in a variety of ways, including the following:
The integral defining the beta function may be rewritten in a variety of ways, including the following:
:<math>
<math display="block">
\begin{align}
\begin{align}
\Beta(z_1,z_2) &= 2\int_0^{\pi / 2}(\sin\theta)^{2z_1-1}(\cos\theta)^{2z_2-1}\,d\theta, \\[6pt]
\Beta(z_1,z_2) &= 2\int_0^{\pi / 2}(\sin\theta)^{2z_1-1}(\cos\theta)^{2z_2-1}\,d\theta, \\[6pt]
Line 96: Line 96:
\end{align}</math>
\end{align}</math>


where in the second-to-last identity {{mvar|n}} is any positive real number. One may move from the first integral to the second one by substituting <math>t = \tan^2(\theta)</math>.
where in the second-to-last identity {{mvar|n}} is any positive [[real number]]. One may move from the first integral to the second one by substituting <math>t = \tan^2(\theta)</math>.


For values <math>z=z_1=z_2\neq1</math> we have:
For values <math>z=z_1=z_2\neq1</math> we have:


:<math>
<math display="block">
\Beta(z,z) = \frac{1}{z}\int_0^{\pi / 2}\frac{1}{(\sqrt[z]{\sin\theta} + \sqrt[z]{\cos\theta})^{2z}}\,d\theta
\Beta(z,z) = \frac{1}{z}\int_0^{\pi / 2}\frac{1}{\left(\sqrt[z]{\sin\theta} + \sqrt[z]{\cos\theta}\right) ^{2z}}\,d\theta
</math>
</math>


The beta function can be written as an infinite sum<ref>{{citation|url=https://functions.wolfram.com/GammaBetaErf/Beta/06/03/0001/|title = Beta function : Series representations (Formula 06.18.06.0007)}}</ref>
The beta function can be written as an infinite sum<ref>{{citation|url=https://functions.wolfram.com/GammaBetaErf/Beta/06/03/0001/|title = Beta function : Series representations (Formula 06.18.06.0007)}}</ref>
: <math>\Beta(x,y) = \sum_{n=0}^\infty \frac{(1-x)_n}{(y+n)\,n!}</math>  
<math display="block">\Beta(x,y) = \sum_{n=0}^\infty \frac{(1-x)_n}{(y+n)\,n!}</math>  
If <math>x</math> and <math>y</math> are equal to a number <math>z</math> we get:
If <math>x</math> and <math>y</math> are equal to a number <math>z</math> we get:
:<math>
<math display="block">
\Beta(z,z) = 2\sum_{n=0}^\infty \frac{(2z+n-1)_n (-1)^n}{(z+n)n!} = \lim_{x \to 1^-}2\sum_{n=0}^\infty \frac{(-2z)_n x^n}{(z+n)n!}
\Beta(z,z) = 2\sum_{n=0}^\infty \frac{(2z+n-1)_n (-1)^n}{(z+n)n!} = \lim_{x \to 1^-}2\sum_{n=0}^\infty \frac{(-2z)_n x^n}{(z+n)n!}
</math>
</math>
: (where <math>(x)_n</math> is the [[falling and rising factorials|rising factorial]])
where <math>(x)_n</math> is the [[falling and rising factorials|rising factorial]],
and as an infinite product
and as an infinite product
: <math>\Beta(x,y) = \frac{x+y}{x y} \prod_{n=1}^\infty \left( 1+ \dfrac{x y}{n (x+y+n)}\right)^{-1}.</math>
<math display="block">\Beta(x,y) = \frac{x+y}{x y} \prod_{n=1}^\infty \left( 1+ \dfrac{x y}{n (x+y+n)}\right)^{-1}.</math>


The beta function satisfies several identities analogous to corresponding identities for binomial coefficients, including a version of [[Pascal's identity]]
The beta function satisfies several identities analogous to corresponding identities for binomial coefficients, including a version of [[Pascal's identity]]


:<math> \Beta(x,y) = \Beta(x, y+1) + \Beta(x+1, y)</math>
<math display="block"> \Beta(x,y) = \Beta(x, y+1) + \Beta(x+1, y)</math>


and a simple recurrence on one coordinate:  
and a simple recurrence on one coordinate:<ref>{{citation|last=Mäklin|first=Tommi|year=2022|title=Probabilistic Methods for High-Resolution Metagenomics|publisher=Unigrafia|location=Helsinki|pages=27|series=Series of publications A / Department of Computer Science, University of Helsinki|issn=2814-4031|isbn=978-951-51-8695-9|url=https://helda.helsinki.fi/bitstream/handle/10138/349862/M%C3%A4klin_Tommi_dissertation_2022.pdf}}</ref>


:<math>\Beta(x+1,y) = \Beta(x, y) \cdot \dfrac{x}{x+y}, \quad \Beta(x,y+1) = \Beta(x, y) \cdot \dfrac{y}{x+y}.</math><ref>{{citation|last=Mäklin|first=Tommi|year=2022|title=Probabilistic Methods for High-Resolution Metagenomics|publisher=Unigrafia|location=Helsinki|pages=27|series=Series of publications A / Department of Computer Science, University of Helsinki|issn=2814-4031|isbn=978-951-51-8695-9|url=https://helda.helsinki.fi/bitstream/handle/10138/349862/M%C3%A4klin_Tommi_dissertation_2022.pdf}}</ref>
<math display="block">\Beta(x+1,y) = \Beta(x, y) \cdot \dfrac{x}{x+y}, \quad \Beta(x,y+1) = \Beta(x, y) \cdot \dfrac{y}{x+y}.</math>


The positive integer values of the beta function are also the partial derivatives of a 2D function: for all nonnegative integers <math>m</math> and <math>n</math>,
The positive integer values of the beta function are also the [[Partial derivative|partial derivatives]] of a 2D function: for all nonnegative integers <math>m</math> and <math>n</math>,
:<math>\Beta(m+1, n+1) = \frac{\partial^{m+n}h}{\partial a^m \, \partial b^n}(0, 0),</math>
<math display="block">\Beta(m+1, n+1) = \frac{\partial^{m+n}h}{\partial a^m \, \partial b^n}(0, 0),</math>
where
where
:<math>h(a, b) = \frac{e^a-e^b}{a-b}.</math>
<math display="block">h(a, b) = \frac{e^a-e^b}{a-b}.</math>
The Pascal-like identity above implies that this function is a solution to the [[first-order partial differential equation]]
The Pascal-like identity above implies that this function is a solution to the [[first-order partial differential equation]]
:<math>h = h_a+h_b.</math>
<math display="block">h = h_a + h_b.</math>


For <math>x, y \geq 1</math>, the beta function may be written in terms of a [[convolution]] involving the [[truncated power function]] <math>t \mapsto t_+^x</math>:
For <math>x, y \geq 1</math>, the beta function may be written in terms of a [[convolution]] involving the [[truncated power function]] <math>t \mapsto t_+^x</math>:
:<math> \Beta(x,y) \cdot\left(t \mapsto t_+^{x+y-1}\right) = \Big(t \mapsto t_+^{x-1}\Big) * \Big(t \mapsto t_+^{y-1}\Big)</math>
<math display="block"> \Beta(x,y) \cdot\left(t \mapsto t_+^{x+y-1}\right) = \Big(t \mapsto t_+^{x-1}\Big) * \Big(t \mapsto t_+^{y-1}\Big)</math>


Evaluations at particular points may simplify significantly; for example,  
Evaluations at particular points may simplify significantly; for example,  
:<math> \Beta(1,x) = \dfrac{1}{x} </math>
<math display="block"> \Beta(1,x) = \dfrac{1}{x} </math>
and
and<ref>{{citation|title=Euler's Reflection Formula - ProofWiki|url=https://proofwiki.org/wiki/Euler%27s_Reflection_Formula | access-date=2020-09-02|website=proofwiki.org}}</ref>
:<math> \Beta(x,1-x) = \dfrac{\pi}{\sin(\pi x)}, \qquad x \not \in \mathbb{Z} </math><ref>{{citation|title=Euler's Reflection Formula - ProofWiki|url=https://proofwiki.org/wiki/Euler%27s_Reflection_Formula|access-date=2020-09-02|website=proofwiki.org}}</ref>
<math display="block"> \Beta(x,1-x) = \dfrac{\pi}{\sin(\pi x)}, \qquad x \not \in \mathbb{Z} </math>


By taking <math> x = \frac{1}{2}</math> in this last formula, it follows that <math>\Gamma(1/2) = \sqrt{\pi}</math>.
By taking <math> x = \frac{1}{2}</math> in this last formula, it follows that <math>\Gamma(1/2) = \sqrt{\pi}</math>.
Generalizing this into a bivariate identity for a product of beta functions leads to:
Generalizing this into a bivariate identity for a product of beta functions leads to:
:<math> \Beta(x,y) \cdot \Beta(x+y,1-y) = \frac{\pi}{x \sin(\pi y)} .</math>
<math display="block"> \Beta(x,y) \cdot \Beta(x+y,1-y) = \frac{\pi}{x \sin(\pi y)} .</math>
 
Also, using [[Multiplication_theorem#Gamma_function%E2%80%93Legendre_formula|Legendre duplication formula]], we get
<math display="block"> 2^{z-1}\Beta(z/2,z/2) = \Beta(1/2,z/2) .</math>


Euler's integral for the beta function may be converted into an integral over the [[Pochhammer contour]] {{mvar|C}} as
Euler's integral for the beta function may be converted into an integral over the [[Pochhammer contour]] {{mvar|C}} as


:<math>\left(1-e^{2\pi i\alpha}\right)\left(1-e^{2\pi i\beta}\right)\Beta(\alpha,\beta) =\int_C t^{\alpha-1}(1-t)^{\beta-1} \, dt.</math>
<math display="block">\left(1-e^{2\pi i\alpha}\right)\left(1-e^{2\pi i\beta}\right)\Beta(\alpha,\beta) =\int_C t^{\alpha-1}(1-t)^{\beta-1} \, dt.</math>


This Pochhammer contour integral converges for all values of {{mvar|α}} and {{mvar|β}} and so gives the [[analytic continuation]] of the beta function.
This Pochhammer contour integral converges for all values of {{mvar|α}} and {{mvar|β}} and so gives the [[analytic continuation]] of the beta function.


Just as the gamma function for integers describes [[factorial]]s, the beta function can define a [[binomial coefficient]] after adjusting indices:
Just as the gamma function for integers describes [[factorial]]s, the beta function can define a [[binomial coefficient]] after adjusting indices:
:<math>\binom{n}{k} = \frac{1}{(n+1)\,\Beta(n-k+1, k+1)}.</math>
<math display="block">\binom{n}{k} = \frac{1}{(n+1)\,\Beta(n-k+1,\, k+1)}.</math>


Moreover, for integer {{mvar|n}}, {{math|Β}} can be factored to give a closed form interpolation function for continuous values of {{mvar|k}}:
Moreover, for integer {{mvar|n}}, {{math|Β}} can be factored to give a closed form interpolation function for continuous values of {{mvar|k}}:
:<math>\binom{n}{k} = (-1)^n\, n! \cdot\frac{\sin (\pi k)}{\pi \displaystyle\prod_{i=0}^n (k-i)}.</math>
<math display="block">\binom{n}{k} = (-1)^n\, n! \cdot\frac{\sin (\pi k)}{\pi \displaystyle\prod_{i=0}^n (k-i)}.</math>


==Reciprocal beta function==
==Reciprocal beta function==
The '''reciprocal beta function''' is the [[special function|function]] about the form
The '''reciprocal beta function''' is the [[special function|function]] about the form


:<math>f(x,y)=\frac{1}{\Beta(x,y)}</math>
<math display="block">f(x,y)=\frac{1}{\Beta(x,y)}</math>


Interestingly, their integral representations closely relate as the [[definite integral]] of [[trigonometric functions]] with product of its power and [[List of trigonometric identities#Multiple-angle formulae|multiple-angle]]:<ref>{{dlmf|id=5.12|title=Beta Function|first=R. B. |last=Paris}}</ref>  
Interestingly, their integral representations closely relate as the [[definite integral]] of [[trigonometric functions]] with product of its power and [[List of trigonometric identities#Multiple-angle formulae|multiple-angle]]:<ref>{{dlmf|id=5.12|title=Beta Function|first=R. B. |last=Paris}}</ref>  


:<math>\int_0^\pi\sin^{x-1}\theta\sin y\theta~d\theta=\frac{\pi\sin\frac{y\pi}{2}}{2^{x-1}x\Beta\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}</math>
<math display="block">\begin{align}
 
\int_0^\pi         \sin^{x-1}\theta\sin y\theta~d\theta &= \frac{\pi\sin\frac{y\pi}{2}}{2^{x-1} x \Beta{\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}} \\[1ex]
:<math>\int_0^\pi\sin^{x-1}\theta\cos y\theta~d\theta=\frac{\pi\cos\frac{y\pi}{2}}{2^{x-1}x\Beta\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}</math>
\int_0^\pi         \sin^{x-1}\theta\cos y\theta~d\theta &= \frac{\pi\cos\frac{y\pi}{2}}{2^{x-1} x \Beta{\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}} \\[1ex]
 
\int_0^\pi         \cos^{x-1}\theta\sin y\theta~d\theta &= \frac{\pi\cos\frac{y\pi}{2}}{2^{x-1} x \Beta{\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}} \\[1ex]
:<math>\int_0^\pi\cos^{x-1}\theta\sin y\theta~d\theta=\frac{\pi\cos\frac{y\pi}{2}}{2^{x-1}x\Beta\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}</math>
\int_0^\frac{\pi}{2}\cos^{x-1}\theta\cos y\theta~d\theta &= \frac{\pi}{                 2^x    x \Beta{\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}}
 
\end{align}</math>
:<math>\int_0^\frac{\pi}{2}\cos^{x-1}\theta\cos y\theta~d\theta=\frac{\pi}{2^xx\Beta\left(\frac{x+y+1}{2},\frac{x-y+1}{2}\right)}</math>


==Incomplete beta function==
==Incomplete beta function==
Line 185: Line 187:
  | title = Incomplete beta functions}}</ref>
  | title = Incomplete beta functions}}</ref>


:<math> \Beta(x;\,a,b) = \int_0^x t^{a-1}\,(1-t)^{b-1}\,dt. </math>
<math display="block"> \Beta(x;\,a,b) = \int_0^x t^{a-1}\,(1-t)^{b-1}\,dt. </math>


For {{math|''x'' {{=}} 1}}, the incomplete beta function coincides with the complete beta function. For positive integers ''a'' and ''b'', the incomplete beta function will be a polynomial of degree ''a''&nbsp;+&nbsp;''b''&nbsp;-&nbsp;1 with rational coefficients.
For {{math|1=''x'' = 1}}, the incomplete beta function coincides with the complete beta function. For positive integers ''a'' and ''b'', the incomplete beta function will be a polynomial of degree {{math|''a'' + ''b'' 1}} with rational coefficients.


By the substitution <math>t = \sin^2\theta</math> and <math>t = \frac1{1+s}</math>, we can show that  
By the substitution <math>t = \sin^2\theta</math> and <math>t = \frac1{1+s}</math>, we can show that  
:<math>\Beta(x;\,a,b) = 2 \int_0^{\arcsin \sqrt x} \sin^{2a-1\!}\theta\cos^{2b-1\!}\theta\,\mathrm d\theta = \int_{\frac{1-x}x}^\infty \frac{s^{b-1}}{(1+s)^{a+b}}\,\mathrm ds</math>
<math display="block">\begin{align}
\Beta(x;\,a,b) &= 2 \int_0^{\arcsin \sqrt x} \sin^{2a-1\!}\theta \cos^{2b-1\!}\theta \, d\theta \\[1ex]
&= \int_{\frac{1-x}x}^\infty \frac{s^{b-1}}{(1+s)^{a+b}} \, ds
\end{align}</math>


The '''regularized incomplete beta function''' (or '''regularized beta function''' for short) is defined in terms of the incomplete beta function and the complete beta function:
The '''regularized incomplete beta function''' (or '''regularized beta function''' for short) is defined in terms of the incomplete beta function and the complete beta function:


:<math> I_x(a,b) = \frac{\Beta(x;\,a,b)}{\Beta(a,b)}. </math>
<math display="block"> I_x(a,b) = \frac{\Beta(x;\,a,b)}{\Beta(a,b)}. </math>


The regularized incomplete beta function is the [[cumulative distribution function]] of the [[beta distribution]], and is related to the [[cumulative distribution function]] <math>F(k;\,n,p)</math> of a [[random variable]] {{mvar|X}} following a [[binomial distribution]] with probability of single success {{mvar|p}} and number of Bernoulli trials {{mvar|n}}:
The regularized incomplete beta function is the [[cumulative distribution function]] of the [[beta distribution]], and is related to the [[cumulative distribution function]] <math>F(k;\,n,p)</math> of a [[random variable]] {{mvar|X}} following a [[binomial distribution]] with probability of single success {{mvar|p}} and number of Bernoulli trials {{mvar|n}}:


:<math>F(k;\,n,p) = \Pr\left(X \le k\right) = I_{1-p}(n-k, k+1) = 1 - I_p(k+1,n-k). </math>
<math display="block">\begin{align}
F(k;\,n,p) &= \Pr\left(X \le k\right) \\[1ex]
&= I_{1-p}(n-k, k+1) \\[1ex]
&= 1 - I_p(k+1,n-k).
\end{align} </math>


===Properties===
===Properties===
<!-- (Many other properties could be listed here.)-->
<!-- (Many other properties could be listed here.)-->
:<math>\begin{align}
<math display="block">\begin{align}
I_0(a,b) &= 0 \\
I_0(a,b) &= 0, \\
I_1(a,b) &= 1 \\
I_1(a,b) &= 1, \\
I_x(a,1) &= x^a\\
I_x(a,1) &= x^a,\\
I_x(1,b) &= 1 - (1-x)^b \\
I_x(1,b) &= 1 - (1-x)^b, \\
I_x(a,b) &= 1 - I_{1-x}(b,a) \\
I_x(a,b) &= 1 - I_{1-x}(b,a), \\
I_x(a+1,b) &= I_x(a,b)-\frac{x^a(1-x)^b}{a \Beta(a,b)} \\
I_x(a+1,b) &= I_x(a,b)-\frac{x^a(1-x)^b}{a \Beta(a,b)}, \\
I_x(a,b+1) &= I_x(a,b)+\frac{x^a(1-x)^b}{b \Beta(a,b)} \\
I_x(a,b+1) &= I_x(a,b)+\frac{x^a(1-x)^b}{b \Beta(a,b)}, \\
\int \Beta(x;a,b) \mathrm{d}x &= x \Beta(x; a, b) - \Beta(x; a+1, b) \\
\int \Beta(x;a,b) \, dx &= x \Beta(x; a, b) - \Beta(x; a+1, b), \\
\Beta(x;a,b)&=(-1)^{a} \Beta\left(\frac{x}{x-1};a,1-a-b\right)
\Beta(x;a,b) &= (-1)^a \Beta\left(\frac{x}{x-1};a,1-a-b\right).
\end{align}</math>
\end{align}</math>


===Continued fraction expansion===
===Continued fraction expansion===


The [[generalized continued fraction|continued fraction]] expansion
The [[continued fraction]] expansion is


:<math>\Beta(x;\,a,b) = \frac{x^{a} (1 - x)^{b}}{a \left( 1 + \frac{{d}_{1}}{1 +} \frac{{d}_{2}}{1 +} \frac{{d}_{3}}{1 +} \frac{{d}_{4}}{1 +} \cdots \right)}</math>
<math display="block">\Beta(x;\,a,b) = \frac{x^{a} (1 - x)^{b}}{a \left(1 + \frac{{d}_{1}}{1 + \frac{{d}_{2}}{1 + \frac{{d}_{3}}{1 + \cdots}}}\right)},</math>


with odd and even coefficients respectively
with odd and even coefficients given by


:<math>{d}_{2 m + 1} = - \frac{(a + m) (a + b + m) x}{(a + 2 m) (a + 2 m + 1)}</math>
<math display="block">\begin{align}
:<math>{d}_{2 m} = \frac{m (b - m) x}{(a + 2 m - 1) (a + 2 m)}</math>
{d}_{2m + 1} &= - \frac{(a + m) (a + b + m) x}{(a + 2 m) (a + 2 m + 1)}, \\[1ex]
{d}_{2m} &= \frac{m (b - m) x}{(a + 2 m - 1) (a + 2 m)}.
\end{align}</math>


converges rapidly when <math>x</math> is not close to 1.  The <math>4 m</math> and <math>4 m + 1</math> convergents are less than <math>\Beta(x;\,a,b)</math>, while the <math>4 m + 2</math> and <math>4 m + 3</math> convergents are greater than <math>\Beta(x;\,a,b)</math>.
The <math>4 m</math> and <math>4 m + 1</math> convergents are less than <math>\Beta(x;\,a,b)</math>, while the <math>4 m + 2</math> and <math>4 m + 3</math> convergents are greater than <math>\Beta(x;\,a,b)</math>.


For <math>x > \frac{a + 1}{a + b + 2}</math>, the function may be evaluated more efficiently using <math>\Beta(x;\,a,b) = \Beta(a, b) - \Beta(1 - x;\,b,a)</math>.<ref name="paris-ibf"/>
It converges rapidly for <math>x<(a+1)/(a+b+2)</math>. For <math>x > (a + 1)/(a + b + 2)</math> or <math>1 - x < (b + 1)/(a + b + 2)</math>, the function may be evaluated more efficiently through the relation <math>\Beta(x;\,a,b) = \Beta(a, b) - \Beta(1 - x;\,b,a)</math>.<ref name="paris-ibf"/>


==Multivariate beta function==
==Multivariate beta function==
The beta function can be extended to a function with more than two arguments:
The beta function can be extended to a function with more than two arguments:


:<math>\Beta(\alpha_1,\alpha_2,\ldots\alpha_n) = \frac{\Gamma(\alpha_1)\,\Gamma(\alpha_2) \cdots \Gamma(\alpha_n)}{\Gamma(\alpha_1 + \alpha_2 + \cdots + \alpha_n)} .</math>
<math display="block">\Beta(\alpha_1,\alpha_2,\ldots\alpha_n) = \frac{\Gamma(\alpha_1)\,\Gamma(\alpha_2) \cdots \Gamma(\alpha_n)}{\Gamma(\alpha_1 + \alpha_2 + \cdots + \alpha_n)} .</math>


This multivariate beta function is used in the definition of the [[Dirichlet distribution]].  Its relationship to the beta function is analogous to the relationship between [[multinomial coefficient]]s and binomial coefficients. For example, it satisfies a similar version of Pascal's identity:
This multivariate beta function is used in the definition of the [[Dirichlet distribution]].  Its relationship to the beta function is analogous to the relationship between [[multinomial coefficient]]s and binomial coefficients. For example, it satisfies a similar version of Pascal's identity:


:<math>\Beta(\alpha_1,\alpha_2,\ldots\alpha_n) = \Beta(\alpha_1+1,\alpha_2,\ldots\alpha_n)+\Beta(\alpha_1,\alpha_2+1,\ldots\alpha_n)+\cdots+\Beta(\alpha_1,\alpha_2,\ldots\alpha_n+1) .</math>
<math display="block">\Beta(\alpha_1,\alpha_2,\ldots\alpha_n) = \Beta(\alpha_1+1,\alpha_2,\ldots\alpha_n)+\Beta(\alpha_1,\alpha_2+1,\ldots\alpha_n)+\cdots+\Beta(\alpha_1,\alpha_2,\ldots\alpha_n+1) .</math>


== Applications ==
== Applications ==

Latest revision as of 01:58, 25 December 2025

Template:Short description Script error: No such module "about".

File:Beta function.svg
Contour plot of the beta function

In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral

B(z1,z2)=01tz11(1t)z21dt for complex number inputs z1,z2 such that Re(z1),Re(z2)>0.

The beta function was studied by Leonhard Euler and Adrien-Marie Legendre and was given its name by Jacques Binet; its symbol ΒScript error: No such module "Check for unknown parameters". is a Greek capital beta.

Properties

The beta function is symmetric, meaning that B(z1,z2)=B(z2,z1) for all inputs z1 and z2.[1]

A key property of the beta function is its close relationship to the gamma function:[1]

B(z1,z2)=Γ(z1)Γ(z2)Γ(z1+z2)

A proof is given below in Template:Slink.

The beta function is also closely related to binomial coefficients. When Template:Mvar (or Template:Mvar, by symmetry) is a positive integer, it follows from the definition of the gamma function ΓScript error: No such module "Check for unknown parameters". that[1]

B(m,n)=(m1)!(n1)!(m+n1)!=m+nmn/(m+nm)

Relationship to the gamma function

To derive this relation, write the product of two factorials as integrals. Since they are integrals in two separate variables, we can combine them into an iterated integral:

Γ(z1)Γ(z2)=u=0 euuz11duv=0 evvz21dv=v=0u=0 euvuz11vz21dudv.

Changing variables by u = stScript error: No such module "Check for unknown parameters". and v = s(1 − t)Script error: No such module "Check for unknown parameters"., because u + v = sScript error: No such module "Check for unknown parameters". and u / (u+v) = tScript error: No such module "Check for unknown parameters"., we have that the limits of integrations for sScript error: No such module "Check for unknown parameters". are 0 to ∞ and the limits of integration for tScript error: No such module "Check for unknown parameters". are 0 to 1. Thus produces

Γ(z1)Γ(z2)=s=0t=01es(st)z11(s(1t))z21sdtds=s=0essz1+z21dst=01tz11(1t)z21dt=Γ(z1+z2)B(z1,z2).

Dividing both sides by Γ(z1+z2) gives the desired result.

The stated identity may be seen as a particular case of the identity for the integral of a convolution. Taking

f(u):=euuz111+g(u):=euuz211+,

one has:

Γ(z1)Γ(z2)=f(u)dug(u)du=(f*g)(u)du=B(z1,z2)Γ(z1+z2).

See The Gamma Function, page 18–19[2] for a derivation of this relation.

Differentiation of the beta function

We have

z1B(z1,z2)=B(z1,z2)(Γ(z1)Γ(z1)Γ(z1+z2)Γ(z1+z2))=B(z1,z2)(ψ(z1)ψ(z1+z2)),

zmB(z1,z2,,zn)=B(z1,z2,,zn)(ψ(zm)ψ(k=1nzk)),1mn,

where ψ(z) denotes the digamma function.

Approximation

Stirling's approximation gives the asymptotic formula

B(x,y)2πxx1/2yy1/2(x+y)x+y1/2

for large Template:Mvar and large Template:Mvar.

If on the other hand Template:Mvar is large and Template:Mvar is fixed, then

B(x,y)Γ(y)xy.

Other identities and formulas

The integral defining the beta function may be rewritten in a variety of ways, including the following: B(z1,z2)=20π/2(sinθ)2z11(cosθ)2z21dθ,=0tz11(1+t)z1+z2dt,=n01tnz11(1tn)z21dt,=(1a)z201(1t)z11tz21(1at)z1+z2dtfor any a1,

where in the second-to-last identity Template:Mvar is any positive real number. One may move from the first integral to the second one by substituting t=tan2(θ).

For values z=z1=z21 we have:

B(z,z)=1z0π/21(sinθz+cosθz)2zdθ

The beta function can be written as an infinite sum[3] B(x,y)=n=0(1x)n(y+n)n! If x and y are equal to a number z we get: B(z,z)=2n=0(2z+n1)n(1)n(z+n)n!=limx12n=0(2z)nxn(z+n)n! where (x)n is the rising factorial, and as an infinite product B(x,y)=x+yxyn=1(1+xyn(x+y+n))1.

The beta function satisfies several identities analogous to corresponding identities for binomial coefficients, including a version of Pascal's identity

B(x,y)=B(x,y+1)+B(x+1,y)

and a simple recurrence on one coordinate:[4]

B(x+1,y)=B(x,y)xx+y,B(x,y+1)=B(x,y)yx+y.

The positive integer values of the beta function are also the partial derivatives of a 2D function: for all nonnegative integers m and n, B(m+1,n+1)=m+nhambn(0,0), where h(a,b)=eaebab. The Pascal-like identity above implies that this function is a solution to the first-order partial differential equation h=ha+hb.

For x,y1, the beta function may be written in terms of a convolution involving the truncated power function tt+x: B(x,y)(tt+x+y1)=(tt+x1)*(tt+y1)

Evaluations at particular points may simplify significantly; for example, B(1,x)=1x and[5] B(x,1x)=πsin(πx),x∉

By taking x=12 in this last formula, it follows that Γ(1/2)=π. Generalizing this into a bivariate identity for a product of beta functions leads to: B(x,y)B(x+y,1y)=πxsin(πy).

Also, using Legendre duplication formula, we get 2z1B(z/2,z/2)=B(1/2,z/2).

Euler's integral for the beta function may be converted into an integral over the Pochhammer contour Template:Mvar as

(1e2πiα)(1e2πiβ)B(α,β)=Ctα1(1t)β1dt.

This Pochhammer contour integral converges for all values of Template:Mvar and Template:Mvar and so gives the analytic continuation of the beta function.

Just as the gamma function for integers describes factorials, the beta function can define a binomial coefficient after adjusting indices: (nk)=1(n+1)B(nk+1,k+1).

Moreover, for integer Template:Mvar, ΒScript error: No such module "Check for unknown parameters". can be factored to give a closed form interpolation function for continuous values of Template:Mvar: (nk)=(1)nn!sin(πk)πi=0n(ki).

Reciprocal beta function

The reciprocal beta function is the function about the form

f(x,y)=1B(x,y)

Interestingly, their integral representations closely relate as the definite integral of trigonometric functions with product of its power and multiple-angle:[6]

0πsinx1θsinyθdθ=πsinyπ22x1xB(x+y+12,xy+12)0πsinx1θcosyθdθ=πcosyπ22x1xB(x+y+12,xy+12)0πcosx1θsinyθdθ=πcosyπ22x1xB(x+y+12,xy+12)0π2cosx1θcosyθdθ=π2xxB(x+y+12,xy+12)

Incomplete beta function

The incomplete beta function, a generalization of the beta function, is defined as[7][8]

B(x;a,b)=0xta1(1t)b1dt.

For x = 1Script error: No such module "Check for unknown parameters"., the incomplete beta function coincides with the complete beta function. For positive integers a and b, the incomplete beta function will be a polynomial of degree a + b − 1Script error: No such module "Check for unknown parameters". with rational coefficients.

By the substitution t=sin2θ and t=11+s, we can show that B(x;a,b)=20arcsinxsin2a1θcos2b1θdθ=1xxsb1(1+s)a+bds

The regularized incomplete beta function (or regularized beta function for short) is defined in terms of the incomplete beta function and the complete beta function:

Ix(a,b)=B(x;a,b)B(a,b).

The regularized incomplete beta function is the cumulative distribution function of the beta distribution, and is related to the cumulative distribution function F(k;n,p) of a random variable Template:Mvar following a binomial distribution with probability of single success Template:Mvar and number of Bernoulli trials Template:Mvar:

F(k;n,p)=Pr(Xk)=I1p(nk,k+1)=1Ip(k+1,nk).

Properties

I0(a,b)=0,I1(a,b)=1,Ix(a,1)=xa,Ix(1,b)=1(1x)b,Ix(a,b)=1I1x(b,a),Ix(a+1,b)=Ix(a,b)xa(1x)baB(a,b),Ix(a,b+1)=Ix(a,b)+xa(1x)bbB(a,b),B(x;a,b)dx=xB(x;a,b)B(x;a+1,b),B(x;a,b)=(1)aB(xx1;a,1ab).

Continued fraction expansion

The continued fraction expansion is

B(x;a,b)=xa(1x)ba(1+d11+d21+d31+),

with odd and even coefficients given by

d2m+1=(a+m)(a+b+m)x(a+2m)(a+2m+1),d2m=m(bm)x(a+2m1)(a+2m).

The 4m and 4m+1 convergents are less than B(x;a,b), while the 4m+2 and 4m+3 convergents are greater than B(x;a,b).

It converges rapidly for x<(a+1)/(a+b+2). For x>(a+1)/(a+b+2) or 1x<(b+1)/(a+b+2), the function may be evaluated more efficiently through the relation B(x;a,b)=B(a,b)B(1x;b,a).[8]

Multivariate beta function

The beta function can be extended to a function with more than two arguments:

B(α1,α2,αn)=Γ(α1)Γ(α2)Γ(αn)Γ(α1+α2++αn).

This multivariate beta function is used in the definition of the Dirichlet distribution. Its relationship to the beta function is analogous to the relationship between multinomial coefficients and binomial coefficients. For example, it satisfies a similar version of Pascal's identity:

B(α1,α2,αn)=B(α1+1,α2,αn)+B(α1,α2+1,αn)++B(α1,α2,αn+1).

Applications

The beta function is useful in computing and representing the scattering amplitude for Regge trajectories. Furthermore, it was the first known scattering amplitude in string theory, first conjectured by Gabriele Veneziano. It also occurs in the theory of the preferential attachment process, a type of stochastic urn process. The beta function is also important in statistics, e.g. for the beta distribution and beta prime distribution. As briefly alluded to previously, the beta function is closely tied with the gamma function and plays an important role in calculus.

Software implementation

Even if unavailable directly, the complete and incomplete beta function values can be calculated using functions commonly included in spreadsheet or computer algebra systems.

In Microsoft Excel, for example, the complete beta function can be computed with the GammaLn function (or special.gammaln in Python's SciPy package):

Value = Exp(GammaLn(a) + GammaLn(b) − GammaLn(a + b))

This result follows from the properties listed above.

The incomplete beta function cannot be directly computed using such relations and other methods must be used. In GNU Octave, it is computed using a continued fraction expansion.

The incomplete beta function has existing implementation in common languages. For instance, betainc (incomplete beta function) in MATLAB and GNU Octave, pbeta (probability of beta distribution) in R and betainc in SymPy. In SciPy, special.betainc computes the regularized incomplete beta function—which is, in fact, the cumulative beta distribution. To get the actual incomplete beta function, one can multiply the result of special.betainc by the result returned by the corresponding beta function. In Mathematica, Beta[x, a, b] and BetaRegularized[x, a, b] give B(x;a,b) and Ix(a,b), respectively.

See also

Template:More footnotes

References

<templatestyles src="Reflist/styles.css" />

  1. a b c Script error: No such module "citation/CS1".. Specifically, see 6.2 Beta Function.
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".
  4. Script error: No such module "citation/CS1".
  5. Script error: No such module "citation/CS1".
  6. Script error: No such module "citation/CS1"..
  7. Script error: No such module "citation/CS1".
  8. a b Script error: No such module "citation/CS1"..

Script error: No such module "Check for unknown parameters".

  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1".

External links

Template:Authority control