The inverse of an incomplete elliptic integral of the first kind in Legendre normal form defines the Jacobi elliptic sine. The corresponding inverse of an incomplete elliptic integral of the second kind does not define a known special function: even Wolfram is looking for such an inverse. This presentation will develop expansions for both kinds of incomplete integrals in closed form using partial Bell polynomials, providing rather compact forms for both inverse integrals.

The incomplete integrals of the first and second kind in Legendre normal form will be denoted

$F(x|m) =∫dx (1-x2) (1-mx2 )$

$E(x|m) =∫dx 1-mx2 1-x2$

Both integrals can be explicitly evaluated in terms of Appell functions, which are hypergeometric functions of two arguments. The evaluation requires a generalization of the binomial formula to arbitrary exponents,

$(1-x )a =1-ax +a (a-1) 2! x2 -a(a-1) (a-2) 3! x3 +⋯ (1-x )a =∑k=0 ∞ Γ(−a +k) Γ(−a) xkk!$

and proceeds as follows:

$∫dx (1-x2 )−1/2 (1-mx2 )∓1/2 =∫dx ∑p,r=0 ∞ Γ(12 +p) Γ(12) Γ(±12 +r) Γ(±12 ) mr p!r! x2p+2r =∑ p,r=0 ∞ Γ(12 +p) Γ(12) Γ(±12 +r) Γ(±12 ) 12 p+r +12 mr p!r! x2p+2r +1 =x∑ p,r=0 ∞ Γ(12 +p) Γ(12) Γ(±12 +r) Γ(±12 ) Γ(12 +p+r) Γ(12) Γ(12 +1) Γ(12+1 +p+r) (x2 )pp! (mx2 )rr! =x F1( 12; 12, ±12; 32; x2, mx2) =u$

An independent variable for the inversion has been included in the final equality. The only difference between the two cases is a negative sign on the third argument.

These integrals can be inverted with Lagrange inversion: for a function $u=f\left(x\right)$ , the inverse function expanded about a center c is

$x=f−1 (u) =c +∑k=1 ∞ [u-f(c) ]kk! limx→c dk-1 dx k-1 [x-c f(x) -f(c) ]k$

Since both integrals are zero at the origin, the expansion about that center simplifies to

$x=∑k=1 ∞ ukk! limx→0 dk-1 dx k-1 [1 F1( 12; 12, ±12; 32; x2, mx2) ]k$

The inverse power of the Appell functions can be expressed using partial Bell polynomials. They are defined by the generating function

$1k! (∑p=1 ∞x tpp! )k =∑n=k ∞ Bn,k( x1, x2,…, xn-k +1) tnn!$

The coefficients appearing in the partial polynomials can be evaluated by expansion of the generating function and collection of terms. They can be more efficiently generated recursively with the relation

$Bn,k =∑i=1 n-k+1 (n-1 i-1) xiB n-i,k-1$

The first few nonzero explicit forms are

$B0,0 =1 B1,1 =x1 B2,1 =x2 B2,2 =x12 B3,1 =x3 B3,2 =3x1x2 B3,3 =x13 B4,1 =x4 B4,2 =3x22 +4x1x3 B4,3 =6x12x2 B4,4 =x14$

While the partial polynomials are not trivial to generate from scratch, they are known mathematical entities that can be used to express the expansions desired in compact forms.

Partial Bell polynomials are useful in this context because they describe function composition: given two functions expressed as power series,

$f(x) =∑n=1 ∞an xnn! g(x) =∑n=1 ∞bn xnn!$

the composite function $g\left[f\left(x\right)\right]$ can be expressed as

$g[ f(x)] =∑n=1 ∞ xnn! ∑k=1 nbk Bn,k( a1, a2,…, an-k +1)$

Partial Bell polynomials are essentially a bookkeeping method for tracking the combinations appearing in an arbitrary power of an infinite series. The exact same coefficients appear when taking multiple derivatives of a composite function, so that an arbitrary derivative of the composite function $g\left[f\left(x\right)\right]$ can be expressed compactly with partial Bell polynomials in derivatives of $f\left(x\right)$ .

Setting $n=p+r$ and $i=p-r 2$ , the summation for the Appell functions can be written

$F1 =1+∑ n=1∞ x2n 2n+1 1n! ∑ i=−n/2 n/2 (n n2 +i) Γ(n2 +i+12) Γ(12) Γ(n2 -i±12) Γ(±12 ) mn/2-i$

and one can then take

$f(x) =∑n=1 ∞an (x2 )nn! an =12n+1 ∑ i=−n/2 n/2 (n n2 +i) Γ(n2 +i+12) Γ(12) Γ(n2 -i±12) Γ(±12 ) mn/2-i$

The expansion of the inverse power is

$(11+x )k =∑n=0 ∞ (−1 )n Γ(k+n) Γ(k) xn =1+g(x)$

so that for the second part of the composition one can take

$g(x) =∑n=1 ∞bn xnn! bn =(−1 )n Γ(k+n) Γ(k)$

The composite functions can now be expressed compactly with partial Bell polynomials:

$[1 F1( 12; 12, ±12; 32; x2, mx2) ]k =1+∑ n=1∞ (x2 )nn! ∑l=1 nbl Bn,l( a1, a2,…, an-l +1)$

The multiple derivative is easily evaluated:

$dk-1 dx k-1 [1 F1( 12; 12, ±12; 32; x2, mx2) ]k =∑ 2n≥k-1 (2n)! (2n-k +1)! x2n-k +1n! ∑l=1 nbl Bn,l( a1, a2,…, an-l +1) , k>1$

The limit $x\to 0$ is now trivial: merely picking out terms for which

$2n-k+1=0 → k=2n+1$

Application of this restriction to the coefficients ${b}_{l}$ can be captured by adding an additional index to these coefficients.

A complete expansion about the origin for both cases can thus be expressed as

It is now straightforward to evaluate the first few terms of this series in Mathematica or the like. Taking the upper signs this gives

$u -1+m6 u3 +1+14m +m2120 u5 -1+135m +135m2 +m35040 u7 +1+1228m +5478m2 +1228m3 +m4362880 u9 -…$

which precisely matches the expansion of the Jacobi elliptic sine about the origin. Since as stated at the outset this function inverts the elliptic integral of the first kind, the match confirms the accuracy of the method. That means that taking lower signs will give the first few terms of the inverse of the elliptic integral of the second kind:

$u -1-m6 u3 +1-14m +13m2120 u5 -1-135m +627m2 -493m35040 u7 +1-1228m +19662m2 -55804m3 +37369m4362880 u9 -…$

The numerical coefficients of each polynomial in m are symmetric for the inverse elliptic integral of the first kind, but not for that of the second kind.

In summary, the inverse of an incomplete elliptic integral of the first kind can be expressed compactly as

while the inverse of the incomplete integral of the second kind can be expressed compactly as

The radii of convergence for these series will be controlled by the singularities of the Appell functions. Since these functions converge as long as both arguments of the independent variable are less than unity, a rough estimate for the radii of convergence can be taken to be $1m$ .

These expressions appear to be more compact and concise than available existing expansions. They can be evaluated numerically by any library that handles partial Bell polynomials, such as Math.

Interested, Wolfram?

Uploaded 2019.05.27 — Updated 2019.05.29 analyticphysics.com