Pfaffian definitions of Weierstrass elliptic functions (Q2225632)

This paper treats Weierstrass functions and their definitions in terms of Pfaffian functions. A simple domain is the image of a product of open intervals under an invertible affine transformation. A finite union of the common zero sets of finite Pfaffian functions defined on simple domains is called piecewise Pfaffian. Its projection image is called piecewise subpfaffian. Given a lattice \(\Omega \subset \mathbb C\), the graphs of the Weierstrass \(\wp\)-function and \(\zeta\)-function restricted to the fundamental domain \(\mathcal F_{\Omega}\) with the origin removed are piecewise pfaffian and piecewise subpfaffian, respectively. This paper provides their explicit definitions as piecewise Pfaffian/subpfaffian sets and explicit estimates of their complexity independent of the lattice. On a simply connected open set, the real and imaginary parts of any fixed branch of the inverse of the \(\wp\)-function are Pfaffian. In order to get the above explicit definition of the graph as a piecewise Pfaffian set, one needs an estimate on how many branches of the inverse of the \(\wp\)-function are necessary to cover the graph. The explicit bounds for the Betti coordinates are calculated and used as the bound of the number of branches. The graph of Weierstrass \(\sigma\) function \(\sigma_{\Omega}\) restricted to \(\mathcal F_{\Omega}\) is piecewise subpfaffian, but its complexity depends on the lattice. This paper also demonstrates that a modification \(\varphi_{\Omega}\) of \(\sigma_{\Omega}\) is of complexity independent of the lattice \(\Omega\). These results have many applications such as an explicit upper bound for the number of zeros of a restricted Weierstrass function, an answer to the question raised by [\textit{S. David}, J. Number Theory 64, No. 1, 104--129 (1997; Zbl 0873.11035)] on additive extensions of elliptic curves etc.