Jacobi triple product

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Nofootnotes

Template:Redirects here In mathematics, the Jacobi triple product is the identity:

m=1(1x2m)(1+x2m1y2)(1+x2m1y2)=n=xn2y2n,

for complex numbers x and y, with |x| < 1 and y ≠ 0. It was introduced by Template:Harvs in his work Fundamenta Nova Theoriae Functionum Ellipticarum.

The Jacobi triple product identity is the Macdonald identity for the affine root system of type A1, and is the Weyl denominator formula for the corresponding affine Kac–Moody algebra.

Properties

Jacobi's proof relies on Euler's pentagonal number theorem, which is itself a specific case of the Jacobi triple product identity.

Let x=qq and y2=q. Then we have

ϕ(q)=m=1(1qm)=n=(1)nq3n2n2.

The Rogers–Ramanujan identities follow with x=q2q, y2=q and x=q2q, y2=qq.

The Jacobi Triple Product also allows the Jacobi theta function to be written as an infinite product as follows:

Let x=eiπτ and y=eiπz.

Then the Jacobi theta function

ϑ(z;τ)=n=eπin2τ+2πinz

can be written in the form

n=y2nxn2.

Using the Jacobi triple product identity, the theta function can be written as the product

ϑ(z;τ)=m=1(1e2mπiτ)[1+e(2m1)πiτ+2πiz][1+e(2m1)πiτ2πiz].

There are many different notations used to express the Jacobi triple product. It takes on a concise form when expressed in terms of q-Pochhammer symbols:

n=qn(n+1)2zn=(q;q)(1z;q)(zq;q),

where (a;q) is the infinite q-Pochhammer symbol.

It enjoys a particularly elegant form when expressed in terms of the Ramanujan theta function. For |ab|<1 it can be written as

n=an(n+1)2bn(n1)2=(a;ab)(b;ab)(ab;ab).

Proof

Let fx(y)=m=1(1x2m)(1+x2m1y2)(1+x2m1y2)

Substituting Template:Mvar for Template:Mvar and multiplying the new terms out gives

fx(xy)=1+x1y21+xy2fx(y)=x1y2fx(y)

Since fx is meromorphic for |y|>0, it has a Laurent series

fx(y)=n=cn(x)y2n

which satisfies

n=cn(x)x2n+1y2n=xfx(xy)=y2fx(y)=n=cn+1(x)y2n

so that

cn+1(x)=cn(x)x2n+1==c0(x)x(n+1)2

and hence

fx(y)=c0(x)n=xn2y2n

Evaluating Template:Math

Showing that c0(x)=1 (the polynomial of x of y0 is 1) is technical. One way is to set y=1 and show both the numerator and the denominator of

1c0(e2iπz)=n=e2iπn2zm=1(1e2iπmz)(1+e2iπ(2m1)z)2

are weight 1/2 modular under z14z, since they are also 1-periodic and bounded on the upper half plane the quotient has to be constant so that c0(x)=c0(0)=1.

Other proofs

A different proof is given by G. E. Andrews based on two identities of Euler.[1]

For the analytic case, see Apostol.[2]

References

Template:Reflist

  1. Template:Cite journal
  2. Chapter 14, theorem 14.6 of Template:Apostol IANT