This paper investigates the differential algebraic properties of generating functions for quarter-plane walks, revealing conditions under which these functions satisfy algebraic differential relations with respect to length and position variables.
Contribution
It establishes a precise link between differential relations in length and position variables for generating functions of quarter-plane walks, advancing the understanding of their algebraic nature.
Findings
01
In the unweighted case, $Q(x,y,t)$ satisfies an algebraic differential relation in $t$ iff in $x$ or $y$
02
Characterizes $t$-differential transcendence for 79 walk models
03
Uses difference Galois theory to analyze the generating series
Abstract
In the present paper, we use difference Galois theory to study the nature of the generating function counting walks with small steps in the quarter plane. These series are trivariate formal power series Q(x,y,t) that count the number of walks confined in the first quadrant of the plane with a fixed set of admissible steps, called the model of the walk. While the variables x and y are associated to the ending point of the path, the variable t encodes its length. In this paper, we prove that in the unweighted case, Q(x,y,t) satisfies an algebraic differential relation with respect to t if and only if it satisfies an algebraic differential relation with respect x (resp. y). Combined with other papers, we are able to characterize the t-differential transcendence of the 79 models of walks listed by Bousquet-M\'elou and Mishna.
Equations338
0=ℓ=0∑naℓd⋆dℓQ(x,y,t).
0=ℓ=0∑naℓd⋆dℓQ(x,y,t).
0=P⋆(Q(x,y,t),…,d⋆dnQ(x,y,t)).
0=P⋆(Q(x,y,t),…,d⋆dnQ(x,y,t)).
D={(i,j)∈{0,±1}2∣di,j=0}.
D={(i,j)∈{0,±1}2∣di,j=0}.
\leavevmodeto34.94pt\vboxto34.94pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-16.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.707116.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.707116.56976pt16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt16.36182pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt16.36182pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture or {\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.707116.56976pt16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.707116.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto17.87pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt16.36182pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt16.36182pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-16.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture},
\leavevmodeto34.94pt\vboxto34.94pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-16.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.707116.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.707116.56976pt16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt16.36182pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt16.36182pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture or {\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.707116.56976pt16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.707116.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto17.87pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt16.36182pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt16.36182pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto17.87pt\vboxto17.87pt\pgfpicture\makeatletter\lower-17.47182ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-16.56978pt-16.56978pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-16.56976pt-16.56976pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture},
i1(x,y)=(x,A1(x)yA−1(x)) and i2(x,y)=(B1(y)xB−1(y),y),
i1(x,y)=(x,A1(x)yA−1(x)) and i2(x,y)=(B1(y)xB−1(y),y),
\begin{array}[]{llll}&\iota_{1}([x_{0}:x_{1}],[y_{0}:y_{1}])&=&\left([x_{0}:x_{1}],\left[\dfrac{A_{-1}(\frac{x_{0}}{x_{1}})}{A_{1}(\frac{x_{0}}{x_{1}})\frac{y_{0}}{y_{1}}}:1\right]\right),\\
\text{ and }&\iota_{2}([x_{0}:x_{1}],[y_{0}:y_{1}])&=&\left(\left[\dfrac{B_{-1}(\frac{y_{0}}{y_{1}})}{B_{1}(\frac{y_{0}}{y_{1}})\frac{x_{0}}{x_{1}}}:1\right],[y_{0}:y_{1}]\right).\end{array}
\begin{array}[]{llll}&\iota_{1}([x_{0}:x_{1}],[y_{0}:y_{1}])&=&\left([x_{0}:x_{1}],\left[\dfrac{A_{-1}(\frac{x_{0}}{x_{1}})}{A_{1}(\frac{x_{0}}{x_{1}})\frac{y_{0}}{y_{1}}}:1\right]\right),\\
\text{ and }&\iota_{2}([x_{0}:x_{1}],[y_{0}:y_{1}])&=&\left(\left[\dfrac{B_{-1}(\frac{y_{0}}{y_{1}})}{B_{1}(\frac{y_{0}}{y_{1}})\frac{x_{0}}{x_{1}}}:1\right],[y_{0}:y_{1}]\right).\end{array}
{P,ι1(P)}=E∩({x}×P1(C)) and {P,ι2(P)}=E∩(P1(C)×{y}).
{P,ι1(P)}=E∩({x}×P1(C)) and {P,ι2(P)}=E∩(P1(C)×{y}).
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Length derivative of the generating function of walks confined in the quarter plane
Thomas Dreyfus
Institut de Recherche Mathématique Avancée, U.M.R. 7501 Université de Strasbourg et C.N.R.S. 7, rue René Descartes 67084 Strasbourg, FRANCE
In the present paper, we use difference Galois theory to study the nature of the generating function counting walks with small steps in the quarter plane. These series are trivariate formal power series
Q(x,y,t) that count the number of walks confined in the first quadrant of the plane with a fixed set of admissible steps, called the model of the walk. While the variables x and y are associated to the ending point of the path, the variable t encodes its length. In this paper, we prove
that in the unweighted case, Q(x,y,t) satisfies an algebraic differential relation with respect to t if and only if it satisfies an algebraic differential relation with respect x (resp. y). Combined with [BMM10, BvHK10, BBMR16, DHRS18, DHRS20b], we are able to characterize the t-differential transcendence of the 79 models of walks listed by Bousquet-Mélou and Mishna.
Key words and phrases:
Random walks, Difference Galois theory, Transcendence, Valued differential fields.
2010 Mathematics Subject Classification:
05A15,30D05,39A06
This project has been partially founded by ANR De rerum natura project (ANR-19-CE40-0018). The second author would like to thank the ANR-11-LABX-0040-CIMI within
the program ANR-11-IDEX-0002-0 for its partial support.
Classifying lattice walks in restricted domains is an important problem in enumerative combinatorics. Recently much progress has been
made in the study of walks with small steps in the quarter plane. A small steps model in the quarter plane Z≥0×Z≥0 is composed by a set of admissible cardinal directions D⊂{\leavevmodeto9.34pt\vboxto4.16pt\pgfpicture\makeatletter\lower-2.07996ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@setlinewidth0.64pt\pgfsys@setdash0.0pt\pgfsys@roundcap\pgfsys@roundjoin\pgfsys@moveto-1.55997pt2.07996pt\pgfsys@curveto-1.42996pt1.29997pt0.0pt0.12999pt0.38998pt0.0pt\pgfsys@curveto0.0pt-0.12999pt-1.42996pt-1.29997pt-1.55997pt-2.07996pt\pgfsys@stroke\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-7.8259pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-1.00.00.0-1.0-7.8259pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-8.03386pt8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.70710.7071-0.7071-0.7071-8.03384pt8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt7.8259pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt7.8259pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto8.03386pt8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.70718.03384pt8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto0.8pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto7.8259pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.07.8259pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto8.03386pt-8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.70718.03384pt-8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt-7.8259pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.0-1.01.00.00.0pt-7.8259pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-8.03386pt-8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-8.03384pt-8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture}. Given D, we consider the walks that start at (0,0), with directions in D, and that stay in the quarter plane, for instance:
For a given model, one defines qi,j,k to be the number of walks confined to the first quadrant of the plane that
begin at (0,0) and end at (i,j) in k admissible steps. The algebraic nature of the associated complete generating function Q(x,y,t)=∑i,j,k=0∞qi,j,kxiyjtk captures many important combinatorial properties of the model: symmetries, asymptotic information, and recursive relations of the coefficients.
Among the 28−1=255 models in the first quadrant of the plane, Bousquet-Mélou and Mishna proved in [BMM10] that, after accounting for symmetries and eliminating the trivial and one dimensional cases, only 79 cases remained. It is worth mentioning that the generating function is algebraic in all the trivial and one dimensional cases.
For any choice of a variable ⋆ among x,y,t, one classifies the algebraic nature of the generating series Q(x,y,t) with respect to ⋆
as follows:
•
Algebraic cases: the series Q(x,y,t) satisfies a nontrivial polynomial relation with coefficients in Q(x,y,t).
•
Transcendental ⋆-holonomic cases: the series Q(x,y,t) is transcendental and holonomic with respect to ⋆, i.e. there exists n∈Z≥0, such that there exist a0,…,an∈Q(x,y,t), not all zero, such that
[TABLE]
•
Nonholonomic d⋆d-differentially algebraic cases: the series Q(x,y,t) is nonholonomic and d⋆d-differentially algebraic, i.e.
there exists n∈Z≥0, such that there exists nonzero multivariate polynomial P⋆∈Q(x,y,t)[X0,…,Xn], such that
[TABLE]
We stress out the fact that in the above definition, it is equivalent to require that P⋆∈Q[X0,…,Xn], see Remark C.7.
•
d⋆d-differentially transcendental cases: the series is not d⋆d-differentially algebraic.
The authors of [BMM10, BvHK10, BBMR16, DHRS18, DHRS20b] proved that the algebraic nature of the generating series was identical for the variables x and y. The classification of the models of walks regarding the algebraic nature of their series with respect to the variables x and y is the culmination of ten years of research and the works of many researchers (see Figure 1 below).
Statement of the main result
In this paper, we address the question of the classification with respect to the variable t and we prove that this classification coincides with the classification with respect to x and y. There is a priori no relation between the dxd and dtd differential algebraic properties of a function in these two variables. For instance, the function tΓ(x) is holonomic with respect to t but not differentially algebraic with respect to x, thanks to Hölder’s result. In that case, the fibration induced by t is “isotrivial”. The main difficulty in our case is to show that such a situation does not happen and that the x and t-algebraic behavior are intrinsically connected.
Our main result is as follows:
Theorem 1** (Theorem 2.1 and Corollary 3.14 below).**
For any of the 79 models of Figure 1, the complete generating function
is dtd-differentially algebraic over Q if and only if
it is dxd-differentially algebraic over Q.
Theorem 1 is the corollary of the following proposition proved in the more general setting of
weighted walks that are walks whose directions are weighted (see §1). To any such a walk, one attaches an algebraic curve of genus zero or one called the kernel curve and a group of automorphisms of that curve called the group of the walk (see §1). The following holds.
For a genus zero kernel curve attached to the models (G0), the generating series is dtd-differentially transcendental over Q. For a genus one kernel curve with infinite group of the walk, if the generating series is dtd-differentially algebraic over Q, then it is dxd-differentially algebraic over Q.
In [DHRS20b], the authors proved that for a genus zero kernel curve attached to the models (G0), the generating series was dxd-differentially transcendental over Q.
The authors of [BBMR16] proved that the nine nonholomic dxd-differentially algebraic models of Figure 1 were also dtd-differentially algebraic over Q by giving an explicit description of the series in terms of analytic invariants. In §3.4, we will discuss how the construction of [BBMR16] and the results of [HS20] should imply that the second statement of Theorem 2 is in fact an equivalence.
Strategy of the proof
The classification results of Figure 1 come from many approaches: probabilistic methods, combinatorial classification, computer algebra and “Guess and Prove”, analysis and boundary value problems, and more recently difference Galois theory and algebraic geometry. The
analytic approach consists in studying the asymptotic growth of the coefficients of the generating function, or else showing that it has an infinite number of singularities, in order to prove its nonholonomicity. This approach also allows for the study of some important specializations of the complete generating function as for instance Q(1,1,t) the generating function for the number of nearest neighbor walks in the quarter plane (see [MM14, MR09]). Though very powerful, these analytic techniques are unable to detect the differentially algebraic generating functions among the nonholonomic ones. For instance, the generating function ∏k=1∞(1−xk)1 counting the number of partitions has an infinite number of singularities, and yet is dxd-differentially algebraic.
In order to detect these more subtle kinds of functional dependencies it is necessary to use new arguments that focus on the functional equation satisfied by the complete generating function.
Indeed, the combinatorial decomposition of a walk into a shorter walk followed by an admissible step translates into a functional equation for the generating function. Following the ideas of Fayolle, Iasnogorodski and Malyshev [FIM99], the authors of [KR12] and [DHRS20b] specialized this functional equation to the so-called kernel curve to find a linear discrete equation: a linear q-difference equation in the genus zero case and a shift difference equation in genus one. Difference Galois theory allowed then to characterize the differentially transcendental complete generating function ([DHRS18, DHRS20b]) whereas the clever use of Tutte invariants produces explicit differential algebraic relations for the 9 nonholomic but differentially algebraic cases ([BBMR16]).
Unfortunately, all the above methods for proving the differential transcendence are only valid for a fixed value of the parameter t in the field of complex numbers. This allowed
the authors to consider the kernel curve as a complex algebraic curve but prevented them to study the variations of the parameter t.
Our work relies on an nonarchimedean uniformization of the kernel curve, which we consider as an algebraic curve over Q(t).
We use here the formalism of Tate curves over Q(t) as in [Roq70] to show that for both situations, genus one and zero, the differential algebraic properties of the complete generating functions are encoded by the differential algebraic properties of a solution of a rank one nonhomogeneous linear q-difference equation which unifies the genus zero and the genus one cases.
Then, we generalize some Galoisian criterias for q-difference equations of [HS08] to
prove Theorem 2.1 and Theorem 3.12 below.
Organization of the paper
The paper is organized as follows. In Section 1 we present some reminders and notations for walks in the quarter plane. In Section 2 we consider walks with genus zero kernel curve while Section 3 deals with the genus one case. Since this paper combines many different fields, nonarchimedian uniformization, combinatorics, and Galois theory, we choose to postpone many technical intermediate results to the appendices. This should allow the reader to understand the articulation of our proofs in Sections 2 and 3 in three steps without being lost in too many technicalities. These three steps are the uniformization of the kernel and the construction of a linear q-difference equation, the Galoisian criteria, and finally, the resolution of telescoping problems. Appendix A is devoted to the nonarchimedean estimates that we used in the uniformization procedure. Appendix B contains some reminders on special functions on Tate curves and their normal forms. Appendix C proves the Galoisian criteria mentioned above. Finally, Appendix D studies the transcendence properties of special functions on Tate curves which will be used for the descent of our telescoping equations.
1. The walks in the quadrant
The goal of this section is to introduce some basic properties of walks in the quarter plane. In §\refsec:notationwalk, we introduce the generating function Q(x,y,t) of a walk confined in the quarter plane. In §\refsec:Kernelcurve, we attach to any walk a kernel curve, which is an algebraic curve
defined over Q[t]. This curve has been intensively studied as an algebraic curve over C by fixing a morphism from Q[t] to C. For instance, [FIM99] is concerned
with t=1 whereas the papers [DHRS18] and [DR19] focus respectively on t∈C transcendental over Q and t∈]0,1[. Unfortunately,
specializing t even generically does not allow to study the t-dependencies of the generating function. In this paper, we do not work with a specialization of t. This
forces us to move away from the archimedean framework of the field of complex numbers and to consider the kernel curve over a suitable valued field extension
of Q(t) endowed with the valuation at [math].
1.1. The walks
The cardinal directions of the plane {\leavevmodeto9.34pt\vboxto0.8pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-7.8259pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-1.00.00.0-1.0-7.8259pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-8.03386pt8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.70710.7071-0.7071-0.7071-8.03384pt8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt7.8259pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt7.8259pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto8.03386pt8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.70710.7071-0.70710.70718.03384pt8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto0.8pt\pgfpicture\makeatletter\lower-0.4ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto7.8259pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.07.8259pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto8.03386pt-8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.7071-0.70710.70710.70718.03384pt-8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto0.8pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt-7.8259pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.0-1.01.00.00.0pt-7.8259pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto9.34pt\vboxto9.34pt\pgfpicture\makeatletter\lower-8.9359ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke ; \pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-8.03386pt-8.03386pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm-0.7071-0.70710.7071-0.7071-8.03384pt-8.03384pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture} are identified with pairs of integers (i,j)∈{0,±1}2\{(0,0)}. A walk W in the quarter plane Z≥02 is a sequence of points (Mn)n∈Z≥0 such that
•
it starts at (0,0), that is, M0=(0,0);
•
for all n∈Z≥0, the point Mn belong to the quadrant Z≥0×Z≥0;
•
for all n∈Z≥0, the vector Mn+1−Mn belongs to a given subset D of the set of cardinal directions.
Fixing a family of elements (di,j)(i,j)∈{0,±1}2 of Q∩[0,1] such that ∑i,jdi,j=1, one can choose to weight the model of the walk in order to add a probabilistic flavor to our study. For (i,j)∈{0,±1}2\{(0,0)} (resp. (0,0)), the element di,j can be viewed as the probability for the walk to go in the direction (i,j) (resp. to stay at the same position). In that case, the di,j are called the weights and the model is called a weighted model. The set of stepsD of the walk is the
set of cardinal directions with nonzero weight, that is,
[TABLE]
A model is unweighted if d0,0=0 and if the nonzero di,j’s all have the same value.
Remark 1.1*.*
In what follows we will represent model of walks with arrows. For instance, the family of models represented by
[TABLE]
correspond to models with d1,1,d1,−1,d0,1,d−1,−1=0, d1,0=d0,−1=d−1,1=d−1,0=0, and where nothing is assumed on the value of d0,0. In the following results,
the behavior of the kernel curve never depends on d0,0. This is the reason why, to reduce the amount of notations, we have decided not to mention d0,0 in the graphical representation of the model.
The weight of the walk is defined to be the product of the weights of its component steps. For any (i,j)∈Z≥02 and any k∈Z≥0, we let qi,j,k be the sum of the weights of all walks reaching the position (i,j) from the initial position (0,0) after k steps. We introduce the corresponding trivariate generating function
[TABLE]
Note that the generating function is not exactly the same as the one that we defined in the introduction. To recover the latter, we should take di,j∈{0,1} and di,j=1 if and only if the corresponding direction belongs to D. Fortunately, the assumption ∑i,jdi,j=1 can be relaxed by rescaling the t-variable, and the results of the present paper stay valid for the generating function of the introduction since both generating functions have the same nature.
Remark 1.2*.*
For simplicity, we assume that the weights di,j belong to Q. However, we would like to mention that any of the arguments and statements below will hold with arbitrary real weights in [0,1]. One just needs to replace the field Q with the field Q(di,j).
The kernel polynomial of a weighted model (di,j)i,j∈{0,±1}2 is defined by
[TABLE]
where
[TABLE]
and Ai(x)∈x−1Q[x], Bi(y)∈y−1Q[y].
By [DHRS20b, Lemma 1.1], see also [BMM10, Lemma 4], the generating function Q(x,y,t) satisfies the following functional equation:
[TABLE]
where
[TABLE]
Remark 1.3*.*
We shall often use the following symmetry argument between x and y. Exchanging x and y in the kernel polynomial amounts to consider the kernel polynomial of a weighted model D′:={(i,j)\mboxsuchthat(j,i)∈D} with weights di,j′:=dj,i.
1.2. The kernel curve
The kernel polynomial may be seen as a bivariate polynomial in x,y with coefficients in Q(t). The latter is a valued field endowed with the valuation at zero. It is neither algebraically closed nor complete. In order to use the theory of Tate curves, one needs to consider a complete algebraically closed field extension of Q(t). The field of Puiseux series with coefficients in Q is algebraically closed but not complete. We may consider the field C of Hahn series or Malcev-Neumann series with coefficients in Q, and monomials from Q. We recall that a Hahn series f
is a formal power series ∑γ∈Qcγtγ with coefficients cγ in Q and such that the subset {γ∣cγ=0} is a well ordered subset of Q. The valuation v0(f) of f is the smallest element of the subset {γ∣cγ=0}. The field C is algebraically closed and complete
with respect to the valuation at zero, see [AvdDvdH17, Ex. 3.2.23 and p. 151]. One can endow
C with a derivation ∂t as follows
[TABLE]
Then, ∂t extends the derivation tdtd of Q(t), see [AvdDvdH17, Ex.(2), §4.4].
Let us fix once for all α∈R such that 0<α<1. For any f∈C, we define the norm of f as ∣f∣=αv0(f). For any Hahn series f such that ∣f∣<1, we have ∣∂t(f)∣<1. This is not true when ∂t is replaced by dtd.
We need to discard some degenerate cases. Following [FIM99], we have the following definition.
Definition 1.4**.**
A weighted model is called degenerate if one of the following holds:
•
K(x,y,t) is reducible as an element of the polynomial ring C[x,y],
•
K(x,y,t) has x-degree less than or equal to 1,
•
K(x,y,t) has y-degree less than or equal to 1.
Remark 1.5*.*
In [DHRS20b], the authors specialize the variable t
as a transcendental complex number. Then, they study the kernel curve as a complex algebraic curve in P1(C)×P1(C). In this work, we shall use any algebraic geometric result
of [DHRS20b] by appealing to Lefschetz Principle: every true statement about an algebraic variety defined over C remains true when C is replaced by an algebraically closed field of characteristic zero.
The following proposition gives very simple conditions on D to decide whether a weighted model is degenerate or not.
A weighted model is degenerate if and only if at least one of the following holds:
(1)
There exists i∈{−1,1} such that di,−1=di,0=di,1=0. This corresponds to walks with steps supported in one of the following configurations
[TABLE]
2. (2)
There exists j∈{−1,1} such that d−1,j=d0,j=d1,j=0. This corresponds to walks with steps supported in one of the following configurations
[TABLE]
3. (3)
All the weights are zero except maybe {d1,1,d0,0,d−1,−1} or {d−1,1,d0,0,d1,−1}. This corresponds to walks with steps supported in one of the following configurations
[TABLE]
Note that we only discard one dimensional problems as explained in [BMM10]. For all the degenerate cases, the generating function Q(x,y,t) is algebraic.
From now on, we shall always assume that the weighted model under consideration is nondegenerate.
To any weighted model, we attach a curve E, called the kernel curve, that is defined as the zero set in P1(C)×P1(C) of the following homogeneous polynomial
[TABLE]
Let us write K(x0,x1,y0,y1,t)=∑i,j=02Ai,jx0ix12−iy0jy12−j where Ai,j=−tdi−1,j−1 if (i,j)=(1,1) and A1,1=1−td0,0. The partial discriminants of K(x0,x1,y0,y1,t) are defined as the discriminants of the second degree homogeneous polynomials y↦K(x0,x1,y,1,t) and x↦K(x,1,y0,y1,t), respectively, i.e.
[TABLE]
and
[TABLE]
Introduce
[TABLE]
where
[TABLE]
The discriminants Δx(x0,x1),Δy(y0,y1) are homogeneous polynomials of degree 4.
Their Eisenstein invariants can be defined as follows:
we define the Eisenstein invariants of f(x0,x1) as
•
D(f)=a0a4+3a22−4a1a3
•
E(f)=a0a32+a12a4−a0a2a4−2a1a2a3+a23
•
F(f)=27E(f)2−D(f)3.
Since C is algebraically closed of characteristic zero, we can apply [Dui10, §2.4] to the kernel curve. The following proposition characterizes the smoothness of the kernel curve in terms of the invariants F(Δx), F(Δy).
Proposition 1.8** (Proposition 2.4.3 in [Dui10] and Proposition 2.1 in [DHRS20a]).**
The following statements are equivalent
•
The kernel curve E is smooth, i.e. it has no singular point;
•
F(Δx)=0;
•
F(Δy)=0.
Furthermore, if E is smooth then it is an elliptic curve with J-invariant given by the element J(E)∈C such that
[TABLE]
Otherwise, if E is nondegenerate and singular, E has a unique singular point and is a genus zero curve.
We define the genus of a weighted model as the genus of the associated kernel curve E. We recall the results obtained in [FIM99, Theorem 6.1.1] and [DHRS20a, Corollary 2.6], that classify all the weighted models attached to a genus zero kernel.
Theorem 1.9**.**
Any nondegenerate weighted model of genus zero has steps included in one of the following 4 sets of steps:
[TABLE]
Otherwise, for any other nondegenerate weighted model, the kernel curve E is an elliptic curve.
Remark 1.10*.*
The walks corresponding to the fourth configuration never enter the quarter-plane. As described in [BMM10, Section 2.1], if we consider walks corresponding to the second and third configurations we are in the situation where one of the quarter plane constraints implies the other. In the last three configurations, the generating function is algebraic. So the only interesting nondegenerate genus zero weighted models have steps included in
[TABLE]
Note that due to Proposition 1.6, the anti-diagonal steps have nonzero attached weights.
Moreover, by Theorem 1.9, combined with Proposition 1.6, the nondegenerate weighted models of genus one are the walks where there are no three consecutive cardinal directions with weight zero. Or equivalently, this corresponds to the situation where the set of steps is not included in any half plane (See (G0) below).
Thanks to Theorem 1.9, one can reduce our study to two cases depending on the genus of the kernel curve attached to
a nondegenerate weighted model. The following lemma proves that when the kernel curve is of genus one, its J-invariant has modulus strictly greater than 1. This property
allows us to use the theory of Tate curves in order to analytically uniformize the kernel curve.
Lemma 1.11**.**
When E is smooth, the invariant J(E) belongs to Q(t) and is such that ∣J(E)∣>1, where ∣∣ denotes the norm of (C,∣∣).
Proof.
At t=0, Δy(y0,y1) reduces to y02y12. This proves that the reduction of D(Δy) (resp. E(Δy)) at t=0 is 121 (resp. 631). One concludes that F(Δy) vanishes for t=0.
By Proposition 1.8, J(E)∈Q(t) has a strictly negative valuation at t=0. Thus, ∣J(E)∣>1.
∎
1.3. The automorphism of the walk
Following [BMM10, Section 3] or [KY15, Section 3], we introduce the involutive birational transformations of P1(C)×P1(C) given by
P* is the only singular point of E, and E is of genus zero.*
2. Generating functions for walks, genus zero case
In this section, we fix a nondegenerate weighted model of genus zero. Following Remark 1.10, after eliminating duplications of trivial cases and the interchange of x and y, we should focus on walks W arising from the following 5 sets of steps:
[TABLE]
A function f(x,y,t)∈Q[[x,y,t]] is (dxd,dtd)-differentially algebraic over Q if there exists a nonzero polynomial P with coefficients in Q such that P(f(x,y,t),dxdf(x,y,t),dtdf(x,y,t),…)=0. The function f(x,y,t) is (dxd,dtd)-differentially transcendental over Q otherwise. Note that if f is dtd-differentially algebraic over Q then it is (dxd,dtd)-differentially algebraic over Q. We define similarly the notion of (dyd,dtd)-differential algebraicity.
In this section, we prove the following theorem:
Theorem 2.1**.**
For any weighted model listed in (G0), the generating function Q(x,0,t) is (dxd,dtd)-differentially transcendental over Q.
For any weighted model listed in (G0), the generating function Q(0,y,t) is (dyd,dtd)-differentially transcendental over Q.
Theorem 2.1 implies the dtd-differential transcendence of the complete generating function.
Corollary 2.2**.**
For any weighted model listed in (G0), the generating function Q(x,y,t) is (dxd,dtd) and (dyd,dtd)-differentially transcendental over Q. Therefore, Q(x,y,t) is dtd-differentially transcendental over Q.
Suppose to the contrary that Q(x,y,t) is (dxd,dtd)-algebraic over Q. Let P be a nonzero polynomial with coefficients in Q such that P(Q(x,y,t),dxdQ(x,y,t),dtdQ(x,y,t),…)=0. Specializing at y=0 this relation and noting that dxididtjdj(Q(x,0,t)) is the specialization of dxididtjdj(Q(x,y,t)), one finds a nontrivial
differential algebraic relations for Q(x,0,t) in the derivatives dxd and dtd. This contradicts Theorem 2.1. The proof for the (dyd,dtd)-differential transcendence is similar.
∎
As detailed in the introduction, our proof has three major steps:
Step 1:
we attach to the incomplete generating functions Q(x,0,t) and Q(0,y,t) some auxiliary functions which share the same differential behavior than the generating series but
satisfy simple q-difference equations. This is done via the uniformization of the kernel curve (see §2.1 and §2.2).
Step 2:
we apply difference Galois theory to the q-difference equations satisfied by the auxiliary functions in order to relate the differential algebraicity of the incomplete generating functions to the existence of telescoping relations. These telescoping relations are of the form (2.7) below.
Step 3:
we prove that there is no such telescoping relation. This allows us to conclude that the generating series is dtd-differentially transcendental over Q (see §2.3).
2.1. Uniformization of the kernel curve
With the notation of §\refsec1, especially (1.5), any weighted model listed in (G0) satisfies α0=α1=β0=β1=0. Moreover, since the weighted model is nondegenerate, one finds that the product d1,−1d−1,1 is nonzero. Furthermore,
[TABLE]
The uniformization of the kernel curve of a weighted model listed in (G0) is given by the following proposition.
Proposition 2.3** (Propositions 1.5 in [DHRS20b]).**
Let us consider a weighted model listed in (G0) and let E be its kernel curve. There exist λ∈C∗ and a parametrization ϕ:P1(C)→E with
[TABLE]
such that
•
ϕ:P1(C)∖{0,∞}→E∖{(0,0)}* is a bijection and ϕ−1((0,0))={0,∞};*
•
The automorphisms ι1,ι2,σ of E induce automorphisms ι~1,ι~2,σq of P1(C) via ϕ that satisfy ι~1(s)=s1, ι~2(s)=sq, σq(s)=qs, with λ2=q∈{q,q−1} and
[TABLE]
Thus, we have the commutative diagrams
[TABLE]
The following estimate on the norm of q holds:
Lemma 2.4**.**
We have ∣q∣>1.
Proof.
We consider the expansion as a Puiseux series of q. It is then easily seen that its valuation is negative, which gives ∣q∣>1.
∎
2.2. Meromorphic continuation of the generating functions
In this paragraph, we combine the functional equation (1.3) with the uniformization of the kernel curve obtained
above to meromorphically continue the generating function.
We define the norm of an element b=[b0:b1]∈P1(C) as follows: if b1=0, we set ∣b∣=∣b1b0∣ and ∣[1:0]∣=∞ by convention.
Since ∣t∣<1,
the generating function Q(x,y,t) as well as F1(x,t),F2(y,t) converge for any (x,y)∈P1(C)×P1(C) such that
∣x∣ and ∣y∣ are smaller than or equal to 1. On that domain, they satisfy
[TABLE]
We claim that there exist two positive real numbers c0,c∞ such that ϕ maps the disks U0={s∈P1(C)∣∣s∣<c0} and U∞={s∈P1(C)∣∣s∣>c∞} into the domain U defined by {(x,y)∈E\mboxsuchthat∣x∣≤1\mboxand∣y∣≤1}. Indeed,
the αi and βi are of norm smaller than or equal to 1 and ∣α2∣=1 (see (1.5)). Thus, if ∣s∣<min(1,∣α32−4α2α4∣), then
[TABLE]
An analogous reasoning for y(s) shows that when ∣s∣ is sufficiently small, we find ∣x(s)∣,∣y(s)∣≤1. Similarly, one can prove that, when ∣s∣ is sufficiently big, one has ∣x(s)∣,∣y(s)∣≤1. This proves our claim.
We set F˘1(s)=F1(x(s),t) and F˘2(s)=F2(y(s),t). Based on the above, these functions are well defined on U0∪U∞. Evaluating (2.1) for (x,y)=(x(s),y(s)), one finds
[TABLE]
The following lemma shows that one can use the above equation to meromorphically continue
the functions F˘i(s) so that they satisfy a q-difference equation.
Lemma 2.5**.**
For i=1,2, the restriction of the function F˘i(s) to U0 can be continued to a meromorphic function Fi(s) on C such that
[TABLE]
and
[TABLE]
Proof.
We just give a sketch of a proof since the arguments are the exact analogue in our ultrametric context of those employed in [DHRS20b, §2.1].
Since ι~1(s)=s1 and ι~2(s)=sq, we can assume without loss of generality that ι~1(U0)⊂U∞ and ι~2(U∞)⊂U0.
Then one can evaluate (2.2) at any s∈U0. We obtain
Using the invariance of x(s) (resp. y(s)) with respect to ι~1 (resp. ι~2), the second equation is
[TABLE]
Subtracting this last equation to the first, we find that, for any s∈U0, we have
[TABLE]
By Lemma 2.4, the norm of q
is strictly greater than one and therefore the norm of ∣q∣ is distinct from 1. This allows us
to use (2.3) to meromorphically continue F˘2 to C
so that it satisfies (2.3) everywhere. The proof for F˘1 is similar.
∎
Note that, for i=1,2, the function Fi(s) does not coincide a priori with F˘i(s) in the neighborhood of infinity.
2.3. Differential transcendence in the genus zero case
We recall that any holomorphic function f on C∗ can be represented as an everywhere convergent Laurent series with coefficients in C, see [Lan13, Theorem 2.1, Chapter 5]. Moreover any nonzero meromorphic function on C∗ can be written as the quotient of two holomorphic functions on C∗ with no common zeros. We denote by Mer(C∗) the field of meromorphic functions over C∗ and by σq the q-difference operator that maps a meromorphic function g(s) onto g(qs). Finally, let Cq be the
the field formed by the meromorphic functions over C∗ fixed by σq.
We now define the q-logarithm. If ∣q∣>1, the Jacobi Theta function is the meromorphic function defined by
θq(s)=∑n∈Zq−n(n+1)/2sn∈Mer(C∗). It satisfies the the q-difference equation
[TABLE]
Its logarithmic derivative ℓq(s)=θq∂s(θq)∈Mer(C∗) satisfies
ℓq(qs)=ℓq(s)+1. If ∣q∣<1 then the meromorphic function −ℓ1/q is solution of σq(−ℓ1/q)=−ℓ1/q+1. Abusing the notation, we still denote by ℓq the function −ℓ1/q when ∣q∣<1.
Since we want to use the q-difference equations of Lemma 2.5 as a constraint
for the form of the differential algebraic relations satisfied by the functions Fi(s), we need to consider
derivations that are compatible with σq in the sense that they commute with σq. This is not the case for the derivation ∂t=tdtd. By Lemma D.2, the derivations ∂s=sdsd and Δt,q=∂t(q)ℓq(s)∂s+∂t commute
with σq. The following lemma relates the differential transcendence of the incomplete generating functions Q(x,0,t) and Q(0,y,t)
to the differential transcendence of the auxiliary functions Fi(s). We refer to Definition C.5 for the notion of (∂s,Δt,q)-differential algebraicity over a field.
Lemma 2.6**.**
If the generating function Q(x,0,t) is (dxd,dtd)-differentially algebraic over Q, then F1(s) is (∂s,Δt,q)-differentially algebraic over K=Cq(s,ℓq(s)).
If the generating function is Q(0,y,t) is (dyd,dtd)-differentially algebraic over Q, then F2(s) is (∂s,Δt,q)-differentially algebraic over K=Cq(s,ℓq(s)).
Proof.
The statement being symmetrical in x and y, we prove it only for Q(x,0,t).
Assume that the generating function is Q(x,0,t) is (dxd,dtd)-differentially algebraic over Q. Since F1(x,t) is the product of Q(x,0,t) by the polynomial K(x,0,t)∈Q[x,t], the function F1(x,t) is (dxd,dtd)-differentially algebraic over Q. It is therefore (dxd,∂t)-differentially algebraic over Q(t), and finally (dxd,∂t)-differentially algebraic over Q, since t is ∂t-differentially algebraic over Q. Remember that F1(s) coincides with F1(x(s),t) for s∈U0 where x(s) is defined thanks to Proposition 2.3. Therefore, we need to understand the relations between the x and t derivatives of F1(x,t) and the derivatives of
F1(x(s),t) with respect to ∂s and Δt,q.
Let us study these relations for an arbitrary bivariate function G(x,t) which converges on ∣x∣,∣y∣≤1. Denote by δx the derivation dxd and by G(s)=G(x(s),t). From the equality (∂sG(s))=∂s(x(s))(δxG)(x(s),t), we conclude that
[TABLE]
where c=∂s(x(s))∂t(x(s)). The element c belongs to K because x(s)∈K and K is stable by ∂s,Δt,q and thereby by ∂t=Δt,q−∂t(q)ℓq(s)∂s, see Lemma D.5. An easy induction shows that
[TABLE]
where the bi,j’s belong to K. By Lemma D.2, we have ∂sΔt,q−Δt,q∂s=f∂s, where f=∂t(q)∂s(ℓq)∈K.
Combining (2.4) with ∂t=Δt,q−∂t(q)ℓq(s)∂s, we find that
[TABLE]
for some di,j’s in K.
Moreover, an easy induction shows that, for any m∈N∗, we have
[TABLE]
where ai∈K.
Applying (2.5) with G replaced by δxmG, we find that for every m,n∈N,
[TABLE]
Combining this equation with (2.6), we conclude that
[TABLE]
where the ri,j’s are elements of K.
Applying the computations above to G=F1(x,t), we find that any nontrivial polynomial equation in the derivatives δxm∂tnF1(x,t) over Q yields to a nontrivial polynomial equation over K between the derivatives Δt,qj∂si(F1(s)). ∎
Thus, we have reduced the proof of Theorem 2.1 to the following proposition:
Proposition 2.7**.**
The functions F1(s) and F2(s) are (∂s,Δt,q)-differentially transcendental over K.
Proof.
Suppose to the contrary that F1(s) is (∂s,Δt,q)-differentially algebraic over K. By Lemma 2.5, the meromorphic function F1(s) satisfies
F1(qs)−F1(s)=b1=(x(qs)−x(s))y(qs) with b1∈C(s)⊂Cq(s). We now apply difference Galois theory to this q-difference equation. More precisely,
by Proposition D.6 and Corollary D.14 with K=Cq(s), there exist m∈N, d0,…,dm∈Cq not all zero and h∈Cq(s) such that
[TABLE]
Let (eβ)β∈B be a C-basis of C(s). Then, (eβ)β∈B is a Cq-basis of Cq(s) by [Wib10, Lemma 1.1.6]. Now, decompose the dk’s and h over (eβ)β∈B. Since b1∈C(s), it is easily seen that (2.7) amounts into a collection of polynomial equations with coefficients in C that should satisfy the coefficients of the dk’s and h with respect to the basis (eβ)β∈B.
Since this collection of polynomial equations has a nonzero solution in Cq, we can conclude that it has a nonzero solution in C because C is algebraically closed.
Therefore,
there exists ck∈C not all zero and g∈C(s) such that
[TABLE]
By [HS08, Lemma 6.4] there exist f∈C(s) and c∈C, such that
[TABLE]
Since F1 is meromorphic at s=0, we conclude that c must be equal to zero. Finally, we have shown that there exist f∈C(s) such that
[TABLE]
By duality, the morphism ϕ:P1→E gives rise to a field isomorphism ϕ∗ from the field C(E)=C(x,y)***Here x and y denote the coordinate functions on the curve E. of rational functions on E and the field C(s) of rational functions on P1.
Moreover, one has σqϕ∗=ϕ∗σ∗, where σ∗ is the action induced by the automorphism of the walk on C(E). Then, it is easily seen that the equation (2.8) is equivalent to
[TABLE]
where f~∈C(x,y) is the rational function corresponding to f via ϕ∗.
The coefficients of f~ as a rational function over E belong to a finitely generated extension F of Q(t).
There exists a Q-embedding ψ of F into C that maps t onto a transcendental complex number.
Since σ and E are defined over Q(t), we apply ψ to (2.9) and we find
[TABLE]
where f belongs to C(E) the field of rational functions on the complex algebraic curve E defined by the kernel polynomial K(x,y,ψ(t)) and where σ is the automorphism of C(E) induced by the automorphism of the walk corresponding to E. In [DHRS20b, §3.2], the authors proved that there is no such equation. This concludes the proof by contradiction.
∎
3. Generating functions of walks, genus one case
In this section we consider the situation where the kernel curve E is an elliptic curve. By Remark 1.10, this corresponds to the case where the set of steps is not included in an half plane. Unlike the genus zero cases of (G0), the group of the walk might be finite for genus one walks. For unweighted walks of genus one with finite group, it was proved in [BMM10, BvHK10] that the series was holonomic with respect to the three variables. More recently, the authors of [DR19] studied weighted walks of genus one with finite group. They proved that the uniformization of the generating series was a product of zeta functions and elliptic functions over curve isogeneous to the kernel curve. This allowed them to conclude that the generating series was holonomic with respect to the variables x and y. Their description should also allow to conclude to the dtd-differential algebraicity of the series but in that case the question of the holonomy with respect to the variable t is still open.
In this section, we shall focus on the weighted walks of genus one with infinite group and we will prove analogously to the genus zero case that the (dxd,dtd)-differential algebraicity of the series implies its dxd-differential algebraicity. This result combined to [BBMR16] shows that, for unweighted walks of genus one with infinite group, the series is dxd-differentiallly algebraic if and only if it is dtd-differentially algebraic (see Corollary 3.14 below).
Our strategy follows the basic lines of the one employed in the genus zero situation. However, the uniformization procedure in the genus one case is more delicate and differs from previous works such as [FIM99, KR12, DR19] which relied on the uniformization of elliptic curves over C by a fundamental parallelogram of periods. Over a nonarchimedean field C, there might be a lack
of nontrivial lattices. One has to consider multiplicative analogues, that is, discrete subgroups of C∗ of the form qZ. Then, rigid analytic geometry gives a geometric meaning to the quotient C∗/qZ. This geometric quotient is called a Tate curve (see [Roq70] for more details). For simplicity of exposition, we will not give here many details on this nonarchimedean geometry
The multiplicative uniformization of the kernel curve allows us as in §2.2 to attach to the incomplete generating functions Q(x,0,t) and Q(0,y,t) some meromorphic functions Fi(s) satisfying
[TABLE]
for some q∈C∗ and bi(s)∈Cq, the field of q-periodic meromorphic functions over C∗. This
process detailed in §3.1, 3.2 and 3.3 has many advantages. Though technical, it is much more simple than the uniformization
by a fundamental parallelogram of periods since we only have to deal with one generator
of the fundamental group of the elliptic curve, precisely the loop around the origin in C∗. Moreover, it gives a unified framework to study the genus zero and one case, namely, the Galois theory of q-difference equations. This is the content of §3.4
where we apply the Galoisian criteria of Appendix C
to translate the differential algebraicity of the generating function in terms of the existence of a telescoper.
3.1. Uniformization of the kernel curve
Let us fix a weighted model of genus one. By Lemma 1.11, the norm of the J-invariant J(E) of the kernel curve is such that ∣J(E)∣>1. By Proposition B.2, there exists q∈C such that 0<∣q∣<1 and J(E)=J(Eq)=∣q∣1, where Eq is the elliptic curve attached to the Tate curve C∗/qZ (see Proposition 3.1, Lemmas B.5, and B.7). The curve Eq can be analytically uniformized by C∗ thanks to special functions, which have their origins in the theory of Jacobi q-theta functions (see Proposition 3.1 below). Finally, since E and Eq have the same J-invariant, there exists an algebraic isomorphism between these two elliptic curves. In order to describe the uniformization
of the kernel curve E, one needs to explicit this algebraic isomorphism. This is not completely obvious since Eq is given by its Tate normal form in P2, i.e. by an equation of the form
[TABLE]
Therefore, many intermediate technical results are postponed to the appendix B. The following proposition describes the multiplicative uniformization of an elliptic curve given by a Tate normal form.
Following [Roq70, Page 28], we set sk=∑n>01−qnnkqn∈C for k≥1.
Proposition 3.1**.**
The series
•
X(s)=∑n∈Z(1−qns)2qns−2s1;
•
Y(s)=∑n∈Z(1−qns)3(qns)2+s1;
are q-periodic meromorphic functions over C∗. Furthermore X(s)=X(1/s), and X(s) has a pole of order 2 at any element of the form qZ. Moreover, the analytic map
[TABLE]
is onto and his image is Eq, the elliptic curve defined by the following Tate normal form
[TABLE]
where B=−5s3 and C=−121(5s3+7s5). Moreover, π(s1)=π(s2) if and only if s1∈s2qZ.
Proof.
This is [FvdP04, Theorem 5.1.4, Corollary 5.1.5, and Theorem 5.1.10].
∎
In the notation of Section 1.2, set D(x):=Δx(x,1). Let us write the kernel polynomial
[TABLE]
with Ai(x)∈C[x] and Bi(y)∈C[y]. For i≥1, let D(i)(x) denote the i-th derivative
with respect to x of D(x).
The analytic uniformization of the kernel curve is given by the following proposition.
Theorem 3.2**.**
There exists a root a of D(x) in C such that ∣a∣,∣D(2)(a)−2∣,∣D(i)(a)∣<1 for i=3,4, ∣q∣1/2<∣D(1)(a)∣<1. For any such a, there exists u∈C∗ with ∣u∣=1 such that the map ϕ given by
[TABLE]
is surjective where
[TABLE]
Proof.
Lemma A.1 and Lemma B.7 guaranty the existence of a.
The element a allows us to write down the isomorphism between the kernel curve E and one of its Weierstrass normal form E1. More precisely, by Proposition B.4, the application wE
[TABLE]
where
[TABLE]
is an isomorphism between the elliptic curve E1⊂P2(C) given by the equation y12=4x13−g2x1−g3 and the kernel curve E. Now, it remains to explicit the isomorphism between Eq and one of its Weierstrass normal form E1. By Lemma B.5, the application
\begin{array}[]{llll}w_{T}:&E_{q}&\rightarrow&\widetilde{E}_{1},\\
&\hbox{}[X:Y:1]&\mapsto&[X+\frac{1}{2}:2Y+X:1]\end{array}
induces an isomorphism between Eq and the curve E1 given by y2=4x3−h2x−h3. Since E and Eq have the same J-invariants and are therefore isomorphic, the same holds for their Weierstrass normal forms. Thus, there exists u∈C∗
such that \begin{array}[]{llll}\psi:&\widetilde{E}_{1}&\rightarrow&E_{1},\\
&[x:y:1]&\mapsto&[u^{2}x:u^{3}y:1]\end{array} induces an isomorphism of elliptic curves (see Lemma B.6). To conclude, we set ϕ=wE∘ψ∘wT∘π where π is the uniformization of Eq by C∗ given in Proposition 3.1. The norm estimate on u is Lemma B.7.∎
Remark 3.3*.*
•
Note that by construction ϕ(s1)=ϕ(s2) if and only if if s1∈s2qZ (see Proposition 3.1).
•
Via ϕ, the field of rational functions over E can be identified with field of q-periodic meromorphic functions over C∗.
•
The conditions on a are crucial to guaranty the meromorphic continuation of the generating function (see the proof of Lemma 3.7).
•
The symmetry arguments between x and y of Remark 1.3 can be pushed further and one can construct another uniformization of E as follows. Denoting by E(y) the polynomial Δy(y,1). One can prove that there exist a root b∈C∗ of E such that ∣b∣,∣E(2)(b)−2∣,∣E(i)(b)∣<1 for i=3,4 and ∣q∣1/2<∣E(1)(b)∣<1 and
v∈C∗ with ∣v∣=1 such that the analytic map ψ given by
[TABLE]
is surjective with
y(s)=b+v2X(s)+12v2−6E(2)(b)E(1)(b) (see [DR19, (2.16)] for similar arguments).
3.2. The group of the walk
The following proposition gives an explicit form for the automorphisms of C∗ induced via ϕ by the automorphisms σ,ι1,ι2 of E.
Proposition 3.4**.**
There exists q in C∗ such that the automorphism of C∗ defined by σq:s↦qs induces via ϕ the automorphism σ, that is σ∘ϕ=ϕ∘σq.
Similarly, the involutions ι~1,ι~2 of C∗, that are defined by ι~1(s)=1/s and ι~2(s)=q/s, induce via ϕ the automorphisms ι1,ι2.
Proof.
By [Dui10, Proposition 2.5.2], the automorphism σ corresponds to the addition by a prescribed point Ω of E. Let π:C∗→Eq be the surjective map defined in Proposition 3.1. By [FvdP04, Exercise 5.1.9], the map π is a group isomorphism between the multiplicative group (C∗,∗) and the Mordell-Weil group of Eq ††† This is the group whose underlying set is the set of points of Eq and whose group law is given by the addition on the elliptic curve E.. Moreover, since Eq and E are elliptic curves, any isomorphism between Eq and E is a group morphism between their respective Mordell-Weil groups. This proves that ϕ is a group morphism. Then, there exists q∈C∗
such that σ∘ϕ=ϕ∘σq. Since ϕ is q-invariant, the element q is determined modulo qZ (see Remark 3.3). This proves the first statement.
Let us denote by ι~1,ι~2 some automorphisms of C∗, obtained by pulling back to C∗ via ϕ the automorphisms ι1,ι2 of E. The automorphisms ι~1,ι~2 are uniquely determined up to multiplication by some power of q. The automorphisms of C∗ are of the form s↦ls±1 with l∈C∗. Note that x(qZ)=a, and (a,2A(a)−B(a))∈E is fixed by ι1. Indeed, by construction D(a)=0. This proves that ι~1(1) belongs to qZ. Since ι1 is not the identity, we can modify ι~1 by a suitable power of q to get
ι~1(s)=1/s. The expression of ι~2 follows with σ=ι2∘ι1.
∎
Remark 3.5*.*
•
The choice of the element q is unique up to multiplication by qZ. Since ∣q∣=1, we can choose q such that ∣q∣1/2≤∣q∣<∣q∣−1/2.
•
Pursuing the symmetry arguments of Remark 3.3, we easily note that Proposition 3.4 has a straightforward analogue when one replaces ϕ by ψ and one exchanges ι~1 and ι~2.
The proof of the following lemma is straightforward.
Lemma 3.6**.**
The automorphism σ has infinite order if and only if
q and q are multiplicatively independent‡‡‡Note that multiplicatively independent is sometimes replaced in the literature by noncommensurable (see [Roq70, §6])., that is, there is no (r,l)∈Z2∖(0,0) such that qr=ql.
3.3. Meromorphic continuation
In this section, we prove that the functions
[TABLE]
can be meromorphically continued to C∗. We follow some of the ideas initiated in [FIM99]. We note that, since ∣t∣<1, the series F1(x,t) and F2(y,t) converge on the affinoid subset U={(x,y)∈E⊂P1(C)×P1(C)∣∣x∣≤1,∣y∣≤1} of E. With Lemma A.3, U is not empty. For (x,y)∈U, we have
[TABLE]
Set Ux={(x,y)∈E⊂P1(C)×P1(C)∣∣x∣≤1}. Note that F1(x,t) is analytic on Ux. We continue F2(y,t)
on Ux by setting
[TABLE]
Composing Fi(x,t) with the surjective map
[TABLE]
we define the functions F˘1(s)=F1(x(s),t) and F˘2(s)=F2(y(s),t) for any s in the set
[TABLE]
The goal of the following lemma is to prove that Ux is an annulus
whose size is large enough in order to continue the functions F˘1,F˘2, to the whole C∗ (see Figure 3).
Lemma 3.7**.**
Let ∣s∣∈[∣q∣1/2,∣q∣−1/2[. The following statements hold:
•
if ∣s∣∈]∣D(1)(a)∣,∣D(1)(a)∣−1[, then ∣x(s)∣<1;
•
if ∣s∣=∣D(1)(a)∣±1, then ∣x(s)∣=1;
•
otherwise ∣x(s)∣>1.
In conclusion, Ux=[∣D(1)(a)∣,∣D(1)(a)∣−1].
Proof.
From the definition of X(s), we have X(s)=X(1/s) so that x(s)=x(1/s). Using this symmetry, we just have to prove Lemma 3.7 for ∣s∣∈[∣q∣1/2,1].
We have
[TABLE]
with equality if ∣a∣=u2X(s)+12u2−6D(2)(a)D(1)(a).
Remember that ∣u∣=1, ∣a∣<1, and ∣q∣1/2<∣D(1)(a)∣<1, see Theorem 3.2.
Let us first assume that ∣s∣∈[∣D(1)(a)∣,1[. By Lemma B.3, ∣u2X(s)∣=∣s∣ and by Lemma B.8,
∣12u2−6D(2)(a)∣<∣D(1)(a)∣. Therefore
[TABLE]
Combining this equality with (3.3) and ∣a∣<1, we find that ∣x(s)∣<1 if ∣s∣∈]∣D(1)(a)∣,1[, and ∣x(s)∣=1 if ∣s∣=∣D(1)(a)∣.
Assume now that ∣s∣=1. By construction, ∣x(1)∣=∣a∣<1. So let us assume that s=1. Since ∣12u2−6D(2)(a)∣<∣D(1)(a)∣<1 and ∣u2X(s)∣≥1 by Lemma B.3, we find
[TABLE]
This concludes the proof of the first two points.
Assume that ∣s∣∈]∣q∣1/2,∣D(1)(a)∣[. By Lemma B.3, ∣u2X(s)∣=∣X(s)∣=∣s∣. Since
[TABLE]
we find that ∣u2X(s)+12u2−6D(2)∣<∣D(1)(a)∣ and therefore, ∣x(s)∣>1. If we have ∣s∣=∣q∣1/2<∣D(1)(a)∣ then Lemma B.3 implies that ∣u2X(s)∣=∣X(s)∣≤∣s∣<∣D(1)(a)∣. Since ∣12u2−6D(2)(a)∣<∣D(1)(a)∣, we deduce that ∣u2X(s)+12u2−6D(2)(a)∣<∣D(1)(a)∣
and therefore, ∣x(s)∣>1. This concludes the proof.
∎
Remark 3.8*.*
By symmetry between x and y, one could have define Uy={(x,y)∈E⊂P1(C)×P1(C)∣∣y∣≤1} and continue F1(x,t)
on Uy by setting
[TABLE]
Then, the composition of the Fi with the surjective map ψ defined in Remark 3.3 yields to functions F˘i that are defined on
Uy:=ψ−1(Uy)∩{s∈C∗∣∣s∣∈[∣q∣1/2,∣q∣−1/2[}. The analogue of Lemma 3.7 is as follows. For ∣s∣∈[∣q∣1/2,∣q∣−1/2[, the following statements hold:
•
if ∣s∣∈]∣E(1)(b)∣,∣E(1)(b)∣−1[, then ∣y(s)∣<1;
•
if ∣s∣=∣E(1)(b)∣±1 then ∣y(s)∣=1;
•
otherwise ∣y(s)∣>1.
By Proposition 3.4, the automorphism of the walk corresponds to
the q-dilatation on C∗. The following lemma shows that one can cover C∗ either with the q-orbit of the set Ux or with the q-orbit of Uy.
Lemma 3.9**.**
The following statement hold:
•
∣q∣=1;
•
moreover, up to replace q by some convenient qZ-multiple, the following hold:
–
if either d−1,1=0 or d1,−1=0, then,
[TABLE]
–
if either d−1,1=0 or d1,−1=0 then,
[TABLE]
Proof.
Let us first prove that ∣q∣=1. By Remark 3.5, one can choose q so that we have
∣q∣1/2≤∣q∣<∣q∣−1/2.
By construction, x(1)=a. Let b∈P1(C) such that (a,b)∈E. Since ι1(a,b)=(a,b) we have ι2(a,b)=(a,b) by Lemma 1.12. So let a′∈P1(C) distinct from a such that σ(a,b)=(a′,b). Then, x(q)=a′. By Lemma 3.7, ∣x(s)∣<1 for ∣s∣=1. Thus, it suffices to prove that ∣x(q)∣=∣a′∣≥1 to conclude that ∣q∣=1.
Remember that K(x,y,t)=A−1(x)+A0(x)y+A1(x)y2=B−1(y)+B0(y)x+B1(y)x2 with Ai(x)∈C[x] and Bi(y)∈C[y].
With ι1(a,b)=(a,b) and the formulas in §\refsec:autoofthewalks, one finds that
[TABLE]
Let ν be the valuation at X=0 of A1(X)A−1(X). Lemma A.2 with ∣a∣<1 gives ∣b∣2=∣a∣ν. Note that A1 and A−1 are polynomial of degree at most two in X, so the integer ν belongs to {−2,−1,0,1,2}. We have
[TABLE]
We will prove that ∣a′∣≥1 with a case by case study of the values of ν.
Remember that
[TABLE]
Case ν≥1. Then, ∣b∣=∣a∣ν/2<1. Combining (3.4) and Lemma A.2, we find
∣a∣∣a′∣=∣b∣l where l is the valuation at X=0 of B1(X)B−1(X). This gives ∣a′∣=∣a∣lν/2−1. Since l belongs to {−2,…,2} and ν is in {1,2}, we get −3≤lν/2−1≤1. If lν/2−1 equals 1 then ν must be equal to 2 and by (3.5), we must have d−1,−1=d0,−1=0 and d−1,1=0. By Remark 1.10, we must have d−1,0d1,−1=0 so that l=1 and lν/2−1=0. A contradiction. Then, lν/2−1≤0 and
∣a′∣≥1.
Case ν=0. Then, ∣b∣=1. With Lemma A.3 and ∣a∣<1, we obtain ∣a′∣>1.
Case ν≤−1. Then ∣b∣=∣a∣ν/2>1. Combining (3.4) and Lemma A.2, we find
∣a′∣=∣a∣lν/2−1 where l∈{−2,…,2} is the degree in X of B1(X)B−1(X). Since l belongs to {−2,…,2} and ν is in {−1,−2}, we get 1≥lν/2−1≥−3. If lν/2−1=1 then ν=−2 and by (3.5), we must have d−1,1=d0,1=0 and d−1,−1=0. By Remark 1.10, we must have d−1,0d1,1=0 so that l=−1 and lν/2−1=0. A contradiction. Then, lν/2−1≤0 and
∣a′∣≥1.
Assume that either d−1,1=0 or d1,−1=0 and let us prove that
[TABLE]
By Lemma A.4, there exists (a0,b0)∈E such that ∣a0∣=1 and σ(a0,b0)=(a1,b1) with ∣a1∣≤1.
By Lemma 3.7, there exists s0∈C∗ with ∣s0∣=∣D(1)(a)∣±1 such that
x(s0)=a0. Since ∣q∣1/2≤∣q∣<∣q∣−1/2 and ∣q∣1/2<∣D(1)(a)∣<1, we find that ∣q∣<∣qs0∣<∣q∣−1/2. Since ∣x(qs0)∣=∣a1∣≤1, we conclude using Lemma 3.7 that
•
either ∣qs0∣∈Ux. This proves that
[TABLE]
Since ∣q∣=1, we deduce that
[TABLE]
•
or ∣qs0∣∈[∣q∣∣D(1)(a)∣,∣q∣∣D(1)(a)∣−1]. Replacing q by q/q allows to conclude.
•
or ∣qs0∣∈[∣q∣−1∣D(1)(a)∣,∣q∣−1∣D(1)(a)∣−1]. Replacing q by qq allows to conclude.
The proof for Uy is obtained by a symmetry argument using Lemma A.4 and Remark 3.8.
∎
According to Lemma 3.9, we define some auxiliary functions as follows
•
if d−1,1=0, we define, for i=1,2, the function Fi(s) on Ux as Fi(ϕ(s),t);
•
if d−1,1=0, the function Fi(s) is defined on Uy as Fi(ψ(s),t).
A priori the auxiliary functions F1(s),F2(s) are defined on Ux if d−1,1=0 and on Uy otherwise. Theorem 3.10 below shows that one can meromorphically
continue the functions Fi(s) on C∗ so that they satisfy
some nonhomogeneous rank 1 linear q-difference equations.
Theorem 3.10**.**
The auxiliary functions F1(s),F2(s) can be continued meromorphically on C∗ so that they satisfy
[TABLE]
and
[TABLE]
where b1=(x(qs)−x(s))y(qs) and b2=(y(qs)−y(s))x(s) are two q-periodic meromorphic functions over C∗.
Proof.
The proof is completely similar to the proof of Lemma 2.5 and relies on the fact that either the q-orbit of Ux or the q-orbit of Uy covers C∗.
∎
Note that by Remark 3.3, the coefficients b1,b2 of the q-difference can be identified with rational functions on the algebraic curve E.
3.4. Differential transcendence
The strategy to study the differential transcendence of generating functions of nondegenerate weighted models of genus one with infinite group is similar to the one employed in §2. One first relate the differential behavior of the incomplete generating functions to the differential algebraic properties of their associated auxiliary functions. Then, one applies to these auxiliary functions the Galois theory of q-difference equations.
However, since the coefficients of the q-difference equations satisfied by the auxiliary functions are no longer rational but elliptic, the Galoisian criteria as well as the descent method to obtain some “simple telescopers” are quite technical and postponed to Appendix C. Theorem 3.11 below gives a first criteria to guaranty the differential transcendence of the incomplete generating function.
Theorem 3.11**.**
Assume that the weighted model is nondegenerate, of genus one, and that the group of the walk is infinite. If
Q(x,0,t) is (dxd,dtd)-differentially algebraic over Q then there exist c0,…,cn∈C not all zero and h∈Cq such that
[TABLE]
A symmetrical result holds for Q(0,y,t) replacing b1 by b2.
Proof.
Since the group of the walk is of infinite order, the automorphism σ is of infinite order. Therefore
by Lemma 3.6 the elements q and q defined in Proposition 3.4 are multiplicatively independent.
Assume that Q(x,0,t) is (dxd,dtd)-differentially algebraic over Q. Let F1(s) be the auxiliary function defined above.
We denote by Cq.Cq the compositum of the fields Cq and Cq inside the field of meromorphic functions over C∗.
We claim that F1(s)
is (∂s,Δt,q)-differentially algebraic over Cq.Cq(ℓq,ℓq). Let us prove this claim when d−1,1=0, the proof when d−1,1=0 being similar. Reasoning as in Lemma 2.6, one can show that, for n,m∈N, one has
[TABLE]
where ri,j∈Cq(ℓq)(x(s),∂sl∂tk(x(s)),…). By construction, x(s) is in Cq so that Lemma D.5 implies that ∂sl∂tk(x(s))∈Cq(ℓq) for any positive integers k,l. Then, the field Cq(ℓq)(x(s),∂sl∂tk(x(s)),…) generated by x
and its derivatives with respect to ∂s and ∂t is contained in Cq.Cq(ℓq,ℓq). Thus,
any nontrivial polynomial relation between the x-t-derivatives of Q(x,0,t) yields to a
nontrivial polynomial relation between the derivatives of F1(s) with respect to ∂s and Δt,q
over Cq.Cq(ℓq,ℓq). This proves the claim.
By Theorem 3.10, the function F1(s) satisfies F1(qs)−F1(s)=b1(s) with b1(s)∈Cq⊂Cq.Cq(ℓq,ℓq). Since F1(s) is (∂s,Δt,q)-differentially algebraic over Cq.Cq(ℓq,ℓq), Proposition D.6 and
Corollary D.14 imply that
there exist m∈N and d0,…,dm∈Cq not all zero and g∈Cq.Cq(ℓq) such that
[TABLE]
Since b1 is in Cq, Lemma D.13 allows to perform a descent on the coefficients of the telescoping relation above. Thus, there exist c0,…,cn∈C not all zero and h∈Cq such that
[TABLE]
This concludes the proof. The symmetry argument between x and y gives the proof for Q(0,y,t).
∎
Theorem 3.11 has an easy corollary concerning the differential transcendence of the complete generating function for weighted models of genus one with infinite group.
Theorem 3.12**.**
For any nondegenerate weighted model of genus one with infinite group, the following statements are equivalent:
(1)
the series Q(x,0,t) is (dxd,dtd)-differentially algebraic over Q;
2. (2)
the series Q(x,0,t) is dxd-differentially algebraic over C.
Remark 3.13*.*
An analogous result holds for Q(0,y,t) replacing the derivation dxd by dyd.
Proof.
Since the group is infinite, the automorphism σ is of infinite order. Therefore
by Lemma 3.6 the elements q and q defined in Proposition 3.4 are multiplicatively independent.
Assume that (1) holds. By Theorem 3.11, there exist c0,…,cn∈C not all zero and h∈Cq such that
[TABLE]
Combining (3.7) with the functional equation satisfied by F1(s) and using the commutativity of σq and ∂s, one finds that
[TABLE]
Since F1 and h are meromorphic over C∗, there exists g∈Cq such that
[TABLE]
Therefore,
F1(s) is ∂s-differentially algebraic over Cq. Reasoning as in Lemma 2.6, one finds a nontrivial algebraic relation with coefficients in Cq between the first n-th derivatives of F1 with respect to ∂x evaluated in (x(s),t). Any element of Cq=C(x(s),y(s)) is algebraic over C(x(s)). Therefore, the
first n-th derivatives of F1 with respect to ∂x evaluated in (x(s),t) are still algebraically dependent over C(x(s)). We conclude that F1(x,t)=K(x,0,t)Q(x,0,t) is dxd-differentially algebraic over C(x) and therefore over Q by Remark C.7. This proves that (1)⇒(2). Statement (2) implies obviously (1).
∎
A corollary of Theorem 3.11 is that the dtd-differential algebraicity of the series implies the dxd-algebraicity of the series of the series. One of the major breakthrough of [BBMR16] is to show that for unweighted walks, the series was dxd-differentially algebraic over Q if and only if the models was decoupled, that is, there exist f,g∈Q(t)(X) such that
[TABLE]
The authors of [BBMR16] used boundary value problems and the notion of analytic invariants to deduce from (3.9) a closed form of the generating series allowing them to conclude that the series was also dtd-algebraic (see [BBMR16, §6.4]). Combining our result to [BBMR16], one finds the following corollary
Corollary 3.14**.**
If the walk is unweighted of genus one with infinite group, the following statement are equivalent
•
the generating series is dxd-differentially algebraic over Q;
•
the generating series is dtd-differentially algebraic over Q;
In a recent publication [HS20], M.F.Singer and the second author generalized the results of [BBMR16] and proved that a weighted model of genus one with infinite group was decoupled if and only if the series was dxd-differentially algebraic. There is no doubt that
the arguments of [BBMR16] proving that if a model is decoupled then the series is dtd-algebraic over Q will hold in a weighted situation. Combined to Theorem 3.12, this will prove that Corollary 3.14 is also true for weighted walks.
Appendix A Nonarchimedean estimates
In this section, we give some nonarchimedean estimates, which will be crucial to uniformize the kernel curve.
A.1. Discriminants of the kernel equation
Lemma A.1 relates the genus of the kernel curve to the simplicity of the roots of the discriminant
of the kernel polynomial. It also ensures the existence of a root with convenient norm estimates. Let us remind, see (1.4), that we have defined D(x):=Δx(x,1), where Δx(x0,x1) is the discriminants of the second degree homogeneous polynomials y↦K(x0,x1,y,1,t).
Lemma A.1**.**
For any nondegenerate weighted model of genus one, the following holds:
•
all the roots of Δx(x0,x1) in P1(C) are simple;
•
the discriminant D(x):=Δx(x,1) has a root a∈C such that ∣a∣<1, ∣D(2)(a)−2∣<1, and ∣D(1)(a)∣,∣D(3)(a)∣,∣D(4)(a)∣<1 where D(i) denote the i-th derivative
with respect to x of D(x).
A symmetric statement holds for Δy(y0,y1) by replacing D by E.
Proof.
The first assertion is [DHRS20a, Proposition 2.1]. First, let us prove the existence of a root a∈C of D(x) such that ∣a∣<1. Suppose to the contrary that all the roots of D(x) have a norm greater than or equal to 1. If α0 is zero then zero is a root: a contradiction. Thus, we can assume that α0 is nonzero.
Let us first assume that α4=0. The product of the roots of D(x) equals
[TABLE]
Then we conclude that ∣α4α0∣=1 so that each of the roots must have norm 1. Then, considering the symmetric functions of the roots of D(x), we conclude that, for any i=0,…,3, the element α4αi should have norm smaller than or equal to 1. Since
[TABLE]
has norm strictly greater than 1, we find a contradiction.
Assume now that α4=0. Since the roots of Δx(x0,x1) in P1(C) are simple, the coefficient α3 is nonzero. The product of the roots of D(x) equals
[TABLE]
Then, it is clear that ∣α3α0∣≤1 and that each of the roots has norm 1. Thus, the symmetric function α3α2
should also have norm smaller than or equal to 1.
But
[TABLE]
has norm strictly bigger than 1. We find a contradiction again.
Let a be a root of D(x) in C with ∣a∣<1. Since a,α1,α3,α4 have norm smaller than 1, ∣α2−1∣<1, and
•
D(1)(a)=α1+2α2a+3α3a2+4α4a3;
•
D(2)(a)=2α2+6α3a+12α4a2;
•
D(3)(a)=6α3+24α4a;
•
D(4)(a)=24α4,
we have ∣D(2)(a)−2∣<1, and ∣D(1)(a)∣,∣D(3)(a)∣,∣D(4)(a)∣<1.
The statement for Δy(y0,y1) is symmetrical and we omit its proof.
∎
A.2. Automorphisms of the walk on the domain of convergence
In this section, we study the action of the group of the walk on the product of the unit disks in P1(C)×P1(C). This product is the fundamental domain of convergence of the generating function.
We need a preliminary lemma that explains how one can compute the norm of
the values of a rational function.
Lemma A.2**.**
Let f∈C(X) be a nonzero rational function and let a∈P1(C). Let ν (resp. d) be the valuation at X=0 (resp. ∞) of f with the convention that ν=+∞, d=−∞ if f=0. The following statements hold:
•
if ∣a∣<1, then ∣f(a)∣=∣a∣ν;
•
if ∣a∣>1, then ∣f(a)∣=∣a∣d.
Proof.
Let us prove the first case, the second being completely symmetrical. Let us write f(X) as ∑j=ν2r2djXj∑i=ν1r1ciXi with cν1dν2=0. If k>l, we note that ∣ak∣<∣al∣. Then
[TABLE]
∎
The following lemma explains how the fundamental involutions permute the interior and the exterior of the fundamental domain of convergence.
Lemma A.3**.**
For any nondegenerate weighted model, the following statements hold:
(1)
for any a∈C with ∣a∣=1, there exist b±∈P1(C) with ∣b−∣<1, and ∣b+∣>1, such that K(a,b±,t)=0;
2. (2)
for any b∈C with ∣b∣=1, there exist a±∈P1(C) with ∣a−∣<1, and ∣a+∣>1, such that K(a±,b,t)=0.
Proof.
See [DR19, Section 1.3] for a similar result in the situation where C is replaced by C.
The statements are symmetrical, so we only prove the first one. Since C is algebraically closed and the model is nondegenerate, Proposition 1.6 implies that K(x,y,t) is of degree 2 in y. Then, for any a∈C, there are two elements b±∈P1(C) such that
K(a,b±,t)=0. let a∈C with ∣a∣=1. We write
[TABLE]
where
•
α=−∑i=−11di,−1ai+1;
•
β=a−t∑i=−11di,0ai+1;
•
γ=−∑i=−11di,1ai+1.
Since ∣a∣=1, we find ∣β∣=1, ∣α∣,∣γ∣≤1. First let us prove that there is no point (a0,b0)∈E such that ∣a0∣=∣b0∣=1. Indeed, suppose to the contrary that ∣a0∣=∣b0∣=1 and K(a0,b0,t)=0. Then, ∣β∣=∣a0∣=1 and ∣γ∣,∣α∣≤1 so that the equality
∣βb0∣=∣t(α+γb02)∣ implies
∣b0∣<1. We find a contradiction. From the equation K(a,b,t)=0, we deduce that
[TABLE]
[TABLE]
Using K(a,b±,t)=0, we find
[TABLE]
with the convention that b+ is [1:0] if γ=0. If γ=0 then b−=β−tα has norm smaller than 1, which concludes the proof in that case. Assume now that γ=0.
Since ∣b+∣ and ∣b−∣ cannot have norm 1, we just need to discard the cases “∣b+∣<1 and ∣b−∣<1” or “∣b+∣>1 and ∣b−∣>1”. If α=0, then one of the root is zero, say b−=0, and ∣b+∣=∣tγ∣∣β∣>1, which concludes the proof in that case. If α=0 then one can suppose to the contrary that ∣b+∣<1 and ∣b−∣<1. From (A.2), we obtain ∣b+∣=∣b−∣=∣tα∣, which gives
[TABLE]
Then,
∣t2α∣=∣γ∣1≥1, which contradicts ∣t2α∣<1. Suppose to the contrary that ∣b+∣>1 and ∣b−∣>1. By (A.3), ∣b+∣=∣b−∣=∣tγ∣1 which gives
[TABLE]
Thus, ∣t2α∣=∣γ∣1≥1, and once again, we find a contradiction.
∎
Lemma A.4 explains how the the intersection of the fundamental domain of convergence of the generating function and its image by σ is nonempty. This result is therefore crucial in order to continue the generating function to the whole C∗.
Lemma A.4**.**
For any nondegenerate weighted model, the following statements hold:
•
if d−1,1=0 or d1,−1=0 there exists (a,b)∈E with ∣a∣=1 such that σ(a,b)=(a′,b′) with ∣a′∣≤1;
•
if d−1,1=0 or d1,−1=0 there exists (a,b)∈E with ∣b∣=1 such that σ(a,b)=(a′,b′) with ∣b′∣≤1.
Proof.
Using the symmetry between x and y mentioned in Remark 1.3, we only prove the first statement of Lemma A.4.
Let a∈P1(C) such that ∣a∣=1. By Lemma A.3, there exist b+∈P1(C) with ∣b+∣>1 and b−∈C with ∣b−∣<1 such that (a,b±)∈E. Let Bi as in (1.2) and note that by Proposition 1.6, B1 is not identically zero.
Let ν (resp. d) be the valuation at [math] (resp. ∞) of the rational fraction B1(y)B−1(y)=∑j=−11d1,jyj∑j=−11d−1,jyj∈C(y). We claim that either ν≥0 or d≤0. If d1,−1=0 then ν≥0. If d−1,1=0 then either d≤0 or d=1. In the latter situation, we must have d1,1=d1,0=0 and d−1,0=0. Since the model is nondegenerate, we must have d1,−1=0 by Proposition 1.6. In that case, ν≥0. This proves the claim.
Let a+,a−∈P1(C) such that ι2(a,b+)=(a+,b+) and ι2(a,b−)=(a−,b−). This gives
[TABLE]
Since σ(a,b−)=(a+,b+) (resp. σ(a,b+)=(a−,b−)), it is enough to prove that either a+ or a− has norm smaller or equal to 1. If d≤0, we combine (A.5), Lemma A.2 and ∣b+∣>1 to find ∣aa+∣=∣a+∣=∣b+∣d≤1. If ν≥0, we combine (A.5), Lemma A.2 and ∣b−∣<1 to find ∣aa−∣=∣a−∣=∣b−∣ν≤1. This ends the proof.
∎
Appendix B Tate curves and their normal forms
Let (C,∣∣) be a complete nonarchimedean algebraically closed valued field of zero characteristic and let q∈C such that 0<∣q∣<1. In this section, we recall
some of the basic properties of elliptic curves over nonarchimedean fields. The period lattice is here replaced by a discrete multiplicative group of the form qZ. Then, the quotient of C by a period lattice is replace by the so called Tate curve, which corresponds to the naive quotient of the multiplicative group C∗ by qZ.
However, in the nonarchimedean context, only elliptic curves with J-invariant of norm greater than equal to one can be analytically uniformized by Tate curves (see Proposition B.2). The analytic geometry behind is the rigid analytic geometry as developed in [FvdP04]. We will not introduce this theory here but we just recall briefly the algebraic geometrical and special functions aspects of Tate curves.
B.1. Special functions on a Tate curve
We recall that any holomorphic function f on C∗ can be represented by an everywhere convergent Laurent series ∑n∈Zansn with an∈C. Moreover any nonzero meromorphic function on C∗ can be written as hg such that the holomorphic functions g and h have no common zeros. We shall denote by Mer(C∗) the field of meromorphic functions over C∗.
Remark B.1*.*
If k is a complete nonarchimedian sub-valued field of C and q belongs to k, every result quoted above still holds over k.
The analytification of the elliptic curve Eq is isomorphic to the Tate curve, which is the rigid analytic space corresponding to the naive quotient of C∗/qZ. The curve Eq is therefore a“canonical” elliptic curve. A natural question is ”Given an elliptic curve E defined over C, is there a q such that E is isomorphic to Eq?” The answer is positive under certain assumption on the J-invariant J(E) of E.
Let E be an elliptic curve over C such that ∣J(E)∣>1. Then, there exists q∈C such that 0<∣q∣<1 and E is isomorphic to the elliptic curve Eq.
Remind that we have defined sk=∑n>01−qnnkqn∈C for k≥1, and
[TABLE]
They are q-periodic meromorphic functions over C∗.
By Proposition 3.1, the field Cq of q-periodic meromorphic functions over C∗ coincides with the field generated over C by X(s) and Y(s).
Since we need to understand what is the pullback of the fundamental domain of convergence of the generating function via this uniformization, we prove some basic properties on the norm of X(s). Remind that X(s)=X(1/s) and X(qs)=X(s). Thus it suffices to study ∣X(s)∣ for ∣q∣1/2≤∣s∣≤1. The following study follows the arguments of [Sil94, §V.4].
Lemma B.3**.**
Let s∈C∗. The following holds:
•
If ∣q∣1/2<∣s∣<1, then ∣X(s)∣=∣s∣;
•
If ∣s∣=1, then ∣X(s)∣≥1;
•
If ∣s∣=∣q∣1/2, then ∣X(s)∣≤∣s∣.
Proof.
Since X(s) has a pole in s=1 we may further assume that s=1. Let us rewrite X(s):
[TABLE]
This means that we have
[TABLE]
with equality when ∣(1−s)2s∣=∣∑n>0(1−qns)2qns+(1−qns−1)2qns−1−21−qnqn∣.
Let us consider s∈C∗∖{1} with ∣q∣1/2≤∣s∣≤1.
Using ∣q∣<1 we find that
∣qns∣≤∣qs∣<1 for every n≥1. This shows that the norm of qns is strictly smaller than 1. Then, (1−qns)2qns=∣qns∣<∣s∣. On the other hand,
∣qn∣≤∣q∣<∣s∣ and
∣1−qnqn∣<∣s∣.
Finally, when ∣q∣1/2<∣s∣, we have ∣qns−1∣≤∣qs−1∣<∣qq−1/2∣<∣s∣ and therefore (1−qns−1)2qns−1=∣qns−1∣<∣s∣.
This proves that, for any s∈P1(C) such that ∣q∣1/2<∣s∣≤1, we have
[TABLE]
When, ∣q∣1/2=∣s∣ and n≥2, we have ∣qns−1∣≤∣q2s−1∣=∣q2q−1/2∣<∣s∣, and therefore (1−qns−1)2qns−1=∣qns−1∣<∣s∣. Moreover, if ∣q∣1/2=∣s∣ then ∣qs−1∣=∣qq−1/2∣=∣s∣. Therefore (1−qs−1)2qs−1=∣qs−1∣=∣s∣. We conclude that
[TABLE]
It remains to consider the term (1−s)2s. If ∣s∣<1 then we have (1−s)2s=∣s∣. Combining with (B.1), (B.2) and (B.3) respectively, we obtain the result when ∣q∣1/2<∣s∣<1 and ∣q∣1/2=∣s∣<1 respectively.
If ∣s∣=1 and s=1 then ∣1−s∣≤1. Thus, (1−s)2s≥∣s∣=1, which, combined with (B.1) and (B.2) concludes the proof.∎
B.2. Tate and Weierstrass normal forms
In [DR19], the authors generalize the results of [KR12] and attach a Weierstrass normal form to the kernel curve. The following proposition proves that, with some care, their result passes to a nonarchimedean framework.
Let us consider a nondegenerate weighted model of genus one and let us write its kernel polynomial as follows: K(x,y,t)=A0(x)+A1(x)y+A2(x)y2=B0(y)+B1(y)x+B2(y)x2 with Ai(x)∈C[x] and Bi(y)∈C[y]. The following proposition gives a Weierstrass normal form for the kernel curve.
Proposition B.4**.**
Let a∈C be as in Lemma A.1. Let E1 be the elliptic curve defined by the Weierstrass equation
[TABLE]
with
[TABLE]
Then, the rational map
[TABLE]
where
[TABLE]
is an isomorphism of elliptic curves that sends the point O=[1:0:0] in E1 to the point (a,2A2(a)−A1(a))∈E.
Proof.
This is the same proof as in [DR19, Proposition 18]. Note that there is only one configuration here since we have chosen a root of the discriminant ∣a∣<1 which can not be infinity.
∎
We recall that the J-invariant J(E1) of the elliptic curve E1 given in a Weierstrass form y12=4x13−g2x1−g3 equals to J(E1)=123g23−27g32g23. For a weighted model of genus one, the J-invariant J(E) of the kernel curve has modulus strictly greater than 1 by Lemma 1.11. Since J(E)=J(E1),
Proposition B.2 shows that there exists q∈C∗ such that 0<∣q∣<1 and E1 is isomorphic to Eq. In order to explicit this isomorphism, we
need to understand how one passes from to a Tate normal form to a Weierstrass normal form. This is the content of the following lemmas.
Lemma B.5**.**
[§6, Page 29 in [Roq70]]
In the notation of Proposition 3.1, the change of variable X=x−121 and Y=21(y−x+121) maps the Tate equation
[TABLE]
onto the Weierstrass equation
[TABLE]
where h2=121+20s3 and h3=63−1+37s5.
As detailed above, the elliptic curves E1 and Eq are isomorphic. The following lemma gives the form of an explicit isomorphism between theses two curves.
Lemma B.6**.**
Let y2=4x3−h2x−h3 be the Weierstrass normal form (resp. Y2+XY=X3+BX+C its Tate normal form ) of Eq as in Lemma B.5 and let
y12=4x13−g2x1−g3 be the Weierstrass normal form of E1 as in Proposition B.4.
There exists u∈C∗ such that the following map
[TABLE]
is an isomorphism of elliptic curves. Moreover, the following holds
•
h2=u4g2* and h3=u6g3;*
•
Δq=u12Δ1* where Δ1 and Δq denote the discriminants
of the Weierstrass equations of E1 and Eq respectively.*
Proof.
From [Sil09, Proposition 3.1, Chapter III], we deduce that any isomorphism between the elliptic curves E1 and Eq is given by
x1=u2x+α and y1=u3y+βu2x+γ with u∈C∗, α,β,γ∈C. Since both equations are in Weierstrass normal form, we necessarily have α=β=γ=0. This proves the first point. From y12=4x13−g2x1−g3, we substitute x1,y1 by x,y to find
[TABLE]
Dividing the both sides by u6 we find h2=u4g2 and h3=u6g3. The assertion on the discriminants follows from Δq=h23−27h32 and Δ1=g23−27g32.
∎
The lemma below gives some precise estimate for the norms of Δq=h23−27h32 and Δ1=g23−27g32, the discriminants of the elliptic curves Eq,E1, and the element u defined in Lemma B.6.
Lemma B.7**.**
The following statement hold:
•
∣Δq∣=∣q∣, with ∣h2−121∣=∣q∣ and ∣h3−(−631)∣=∣q∣;
•
∣Δ1∣=∣q∣* with ∣g2−34∣<1, ∣g3−(−278)∣<1;*
•
∣u∣=1;
•
∣D(1)(a)∣∈]∣q∣1/2,1[.
Proof.
Following [Roq70, Pages 29-30], we find ∣Δq∣=∣q∣,∣s3∣=∣q∣=∣s5∣. Combining the latter norm estimates with Lemma B.5, we find ∣h2−121∣=∣q∣ and ∣h3−(−631)∣=∣q∣.
Let us prove the second point. It follows from (1.5) that ∣1−α2∣<1 and ∣αi∣<1 for i=0,1,3,4. By Lemma A.1, ∣D(1)(a)∣,∣D(3)(a)∣,∣D(4)(a)∣<1,∣D(2)(a)−2∣<1. Combining these norm estimates with (B.5), we find ∣g2−34∣<1, ∣g3−(−278)∣<1. Since ∣J(E1)∣=∣J(Eq)∣=∣Δ1123g2∣=∣Δq123h2∣ and ∣g2∣=∣h2∣=1, we find ∣Δq∣=∣Δ1∣=∣q∣. By Lemma B.6, Δq=u12Δ1, and then ∣u∣=1.
Let us prove the last point. Let us expand Δ1=g23−27g32 with the expression of g2,g3 given in (B.5):
[TABLE]
Since ∣D(1)(a)∣,∣D(3)(a)∣,∣D(4)(a)∣<1,∣D(2)−2∣<1 , the previous expression is a sum of terms that are all strictly smaller in norm than ∣D(1)(a)∣2. This proves that ∣Δ1∣=∣q∣<∣D(1)(a)∣2.
∎
The following estimate will be required to uniformize the generating function.
Lemma B.8**.**
In the notation of Theorem 3.2, we have ∣12u2−6D(2)(a)∣<∣D(1)(a)∣.
Proof.
Using (B.5) and the norm estimate on the D(i)(a)’s, we get
[TABLE]
where ∣ω∣,∣ω′∣<1. This proves that
[TABLE]
with ∣ω′′∣<1. Then, we find
[TABLE]
Finally, with the norm estimate of Lemma B.7, it is sufficient to show that ∣12u2+2g23g3∣≤∣q∣.
By Lemma B.6, we have 12u2=12g2h3g3h2. By Lemma B.7, ∣h2−121∣=∣q∣ and ∣h3−(−631)∣=∣q∣. Then, by Lemma B.7 again, we find
[TABLE]
∎
Appendix C Difference Galois theory
In this section, we establish some criteria to guaranty the transcendence of functions satisfying a difference equation of order 1. This criteria is based on the Galois theory of difference fields as developed in [vdPS97] but generalizes some of the existing results in the literature, for instance the assumption that the field of constants is algebraically closed
(see for instance Theorem C.9).
The algebraic framework of this section is difference algebra and more precisely the notion of difference fields.
A difference field is a pair (K,σ) where K is a field and σ is an automorphism of K. The field
σ-constants Kσ of (K,σ) is formed by the elements f∈K such that σ(f)=f. An extension (K,σK)⊂(L,σL) of difference fields is a field
extension K⊂L such that σL coincides with σK on K. If there is no confusion, we shall denote by σ the automorphism σK and σL. For a complete introduction on difference algebra, we shall refer to [Coh65].
C.1. Rank one difference equations
In this section, we focus on rank one difference equations.
Lemma C.1**.**
Let (K,σ)⊂(L,σ) be an extension of difference fields such that Lσ=Kσ. Let x∈L. The following statements are equivalent
(1)
x* is algebraic over Kσ;*
2. (2)
there exists r∈N∗ such that σr(x)=x.
Proof.
Assume that x is algebraic over Kσ. Then, σ induces a permutation on the set of roots of the minimal polynomial of x over Kσ. Thus, there exists r∈N∗ such that σr(x)=x. Conversely, if there exists r∈N∗ such that σr(x)=x, the polynomial P(X)=∏i=0r−1(X−σi(x))∈L[X] is fixed by σ and thereby P(X)∈Lσ[X]=Kσ[X]. Since P(x)=0, we have proved that x is algebraic over Kσ.
∎
Lemma C.2**.**
Let (K,σ)⊂(L,σ) be an extension of difference fields such that Lσ=Kσ. Let f∈L and 0=c∈K, such that
σ(f)=f+c. The following statements are equivalent
(1)
f∈K;
2. (2)
f* is algebraic over K;*
3. (3)
There exists α∈K such that σ(α)=α+c.
Moreover, let K be the algebraic closure of K endowed with a structure of σ-field extension of K. For all α∈K,i∈Z we denote by αi the element of K such that σi(f−α)=f−αi. If f is transcendental over K then for i,j∈Z such that i=j, the elements αj and αi are distinct.
Proof.
Let us prove the first part of the proposition. The first statement implies trivially the second one. Assume that f is algebraic over K and let P(X)=Xn+an−1Xn−1+…a0∈K[X] be its minimal polynomial over K. Note that n=0. Using σ(f)−f=c and P(f)=0, we find that
σ(P(f))−P(f)=0=(nc+σ(an−1)−an−1)fn−1+bn−2fn−2+⋯+b0 with bi∈K for i=0,…,n−2. By minimality of P(X), we find that σ(an−1)−an−1=−nc with an−1∈K. Then, σ(α)−α=c with α=−nan−1∈K. We have shown that the second statement implies the third. Finally, assume that there exists α∈K such that σ(α)=α+c. With σ(f)−f=c, we find that σ(α−f)=α−f. This gives that α−f∈Lσ=Kσ and the element f belongs to K.
Now, let us assume that f is transcendental over K. Suppose to the contrary that there exist α∈K and i>j∈Z such that
[TABLE]
The latter equality gives σr(β)−β=γ where r=i−j>0, β=σj(α) and γ=σi−1(c)+⋯+σj(c). Since α is algebraic over K, the same holds for β. Let P(X)=Xn+an−1Xn−1+⋯+a0∈K[X]∖K be the minimal polynomial of β over K. Using the fact that σr(β)−β=γ and the minimality of P, we conclude, as above, that σr(an−1)−an−1=−nγ, that is σr(β~)−β~=γ where β~=−nan−1∈K. Combining this equality with
σr(σj(f))−σj(f)=γ, we find that β~−σj(f)∈L is fixed by σr. By Lemma C.1, this means that β~−σj(f) is algebraic over Kσ, which yields to f algebraic over K. We find a contradiction.
∎
Lemma C.3**.**
Let (K,σ)⊂(L,σ) be an extension of difference fields such that Lσ=Kσ. Let f∈L and 0=c∈K, such that
σ(f)=f+c. Assume that f is transcendental over K. If there exists g∈K(f) such that
σ(g)−g∈K[f], then g∈K[f].
Proof.
Let K be an algebraic closure of K, endowed with a structure of σ-field extension of K. Since f is transcendental over K, we can write a partial fraction decomposition of g∈K(f). Let R be the largest integer such that there exists α∈K so that the element (f−α)R1 appears in the partial fraction decomposition of g. Suppose to the contrary that R>0 and let α∈K such that (f−α)R1 appears in the partial fraction decomposition of g. We deduce from Lemma C.2 applied to K and f, that the elements {αi,i∈Z} are all distinct. Then, there exists N, the largest integer such that σN((f−α)R1) appears in the partial fraction decomposition of g. The element σN+1((f−α)R1) appears in the partial fraction decomposition of σ(g). This proves that σN+1((f−α)R1) appears in the partial fraction decomposition of σ(g)−g. A contradiction with σ(g)−g∈K[f]. This proves that g∈K[f].
∎
C.2. Differential transcendence criteria
In this section, a (σ,∂,Δ)-field K is a difference field (K,σ) endowed with two derivations ∂,Δ commuting with σ such that ∂Δ−Δ∂=cK∂ with cK∈Kσ. We assume that ∂ is nontrivial on K, that is, it is not the zero derivation. The element cK has to be considered as part of the data of the notion of (σ,∂,Δ)-field. An extension of (σ,∂,Δ)-fields is an inclusion of two (σ,∂,Δ)-fields (K,σK,∂K,ΔK)⊂(L,σL,∂L,ΔL) such that
•
K⊂L is a field extension;
•
σK,∂K,ΔK are the restrictions of σL,∂L,ΔL to K;
•
cK=cL.
If there is no confusion, we shall omit the subscripts K,L. If σ is the identity, we shall speak of (∂,Δ)-fields, (∂,Δ)-fields extension for short.
Example C.4*.*
As proved in §D, the following fields are (σ,∂,Δ)-fields, that correspond respectively to the framework of the genus zero and genus one kernel curve. Remind that σq denote the automorphism of Mer(C∗) defined by f(s)↦f(qs) and Cq denote the field of meromorphic functions fixed by σq.
In the two examples, we have Δq,t=∂t(q)ℓq(s)∂s+∂t where ℓq is the so called q-logarithm. That is, an element of Mer(C∗) satisfying σq(ℓq)=ℓq+1, and cK=∂t(q)∂s(ℓq)∈Cq.
•
Let q∈C∗ with ∣q∣=1. Then, the inclusion
[TABLE]
is an extension of (σ,∂,Δ)-fields.
•
Let q and q two elements of C∗ such that ∣q∣,∣q∣=1, that are multiplicatively independent, that is, there are no r,l∈Z2∖(0,0) such that qr=ql. Since Cq⊂Mer(C∗) and Cq⊂Mer(C∗), we
consider Cq.Cq⊂Mer(C∗), the field compositum of Cq and Cq inside Mer(C∗). Then, the inclusion
[TABLE]
is an extension of (σ,∂,Δ)-fields.
Definition C.5**.**
Let (K,∂,Δ)⊂(L,∂,Δ). An element f∈L is said to be (∂,Δ)-differentially algebraic over K if there exists N∈N, such that the elements
•
∂i(f) for i≤N are algebraically dependent over K if Δ is a K-multiple of ∂;
•
∂iΔj(f) for i,j≤N are algebraically dependent over K otherwise.
Otherwise, we will say that f is (∂,Δ)-transcendental over K.
Remark C.6*.*
Note that since ∂Δ−Δ∂=c∂ with c∈Kσ⊂K, the (∂,Δ)-field extension of K generated by some element f∈L coincides with the field extension of K generated by the set
{∂iΔj(f),\mboxfori,j∈N}.
Let us make a remark concerning the field of definition of the coefficients of the differential polynomials.
Remark C.7*.*
Let (K,∂,Δ)⊂(K′,∂,Δ)⊂(L,∂,Δ) and assume that K′ is a field generated over K by elements that are (∂,Δ)-differentially algebraic over K.
By [Kol73, Proposition 8, Page 101], f∈L is (∂,Δ)-differentially transcendental over K if and only if it is (∂,Δ)-differentially transcendental over K′.
The following lemma will be crucial in many arguments:
Lemma C.8**.**
If K⊂M is a σ-field extension such that Mσ=K and K⊂L is a σ-field extension with Lσ=L. Then M and L are linearly disjoint over K.
Proof.
Let c1,…,cr∈L be K-linearly independent elements, that become dependent
over M. Up to a permutation of the ci’s, a minimal linear relation among these elements over M has the following form
[TABLE]
with λi∈M for i=2,…,r. Computing σ(\eqrefeq:minimalliaison)−\eqrefeq:minimalliaison, we find
[TABLE]
By minimality, σ(λi)=λi and λi∈Mσ=K. By K-linear independence of the ci, we find that λi=0 for i=2,…,r and then c1=0. A contradiction.
∎
The following statement, whose proof is due to Michael Singer, is a version of an old theorem of Ostrowski [Ost46, Kol68] and its proof follows the lines of the proof of [DHRS18, Proposition 3.6]. In this last paper, it was assumed that Kσ is algebraically closed, which is not the case in this article. One could use the powerful scheme-theoretic tools developed in [OW15] to prove the result in our more general setting. Instead we will argue in a more elementary way to reduce Theorem C.9 to the case where Kσ is algebraically closed.
Theorem C.9**.**
Let (K,σ,∂,Δ) be a (σ,∂,Δ)-field such that
Kσ is relatively algebraically closed in K, that is there are no proper algebraic extension of Kσ inside K. Let (L,σ,∂,Δ) be a (σ,∂,Δ)-ring extension of (K,σ,∂,Δ). Let f∈L and b∈K such that σ(f)=f+b. If f is (∂,Δ)-differentially algebraic over K then there exist ℓ1,ℓ2∈N, ci,j∈Kσ not all zero and g∈K such that
[TABLE]
Furthermore, we may take ℓ2=0 in the case where ∂ and Δ are K-linearly dependent. We call (C.2) a telescoping relation for b.
The proof of this result depends on results from the Galois theory of linear difference equations and we will refer to [DHRS18, Appendix A] and the references given there for relevant facts from this theory. Let (K,σ) be a difference field and consider the system of difference equations
[TABLE]
Let us see (C.3) as a system σ(Y)=AY, where A∈GL2(n+1)(K) is a diagonal bloc matrix A=Diag(A0,…,An) with Ai=(10bi1) which correspond to the equation σ(yi)−yi=bi. A Picard-Vessiot extension for σ(Y)=AY is a difference ring extension (R,σ) of (K,σ) such that:
•
there exists U∈GL2(n+1)(R) such that σ(U)=AU;
•
R is generated as a K-algebra by the entries of U and det(U)−1;
•
R is a simple difference ring, that is, the σ-ideals of R are {0} and R.
Assume that (K,σ) is a difference field with Kσ algebraically closed. Let R be a Picard-Vessiot extension for the system (C.3) and z0,…,zn∈R be solutions of this system. If z0,…,zn are algebraically dependent over K, then there exist ci∈Kσ, not all zero, and g∈K such that
[TABLE]
Before proving Theorem C.9, we give a slight generalization of Lemma C.10.
Lemma C.11**.**
Let (K,σ) be a difference field with Kσ relatively algebraically closed in K and let b0,…,bn be some elements in K. Let (L,σ) be a σ-ring extension of (K,σ). Let z0,…,zn∈L be solutions of σ(zi)−zi=bi. If z0,…,zn are algebraically dependent over K, then there exist ci∈Kσ, not all zero, and g∈K such that
[TABLE]
Proof.
Let k be the algebraic closure of Kσ. We extend σ to be the identity on k§§§On the other hand, there is no unique procedure to extend a field automorphism of Kσ to the algebraic closure k. Indeed, these extensions are controlled by the Galois group of the field k over Kσ.. Under the assumption that Kσ is relatively algebraically closed, the ring K=K⊗Kσk is an integral domain and in fact is a field. We have Kσ=k. Let L=L⊗Kσk. We then have a natural inclusion of K⊂L. Let S=K[z0,…,zn]⊂L. It is easily seen that S is a σ-ring extension of K. Let I be a maximal difference ideal in S and let R=S/I. For each r=0,…,n, let ur be the image of zr in R. Since Kσ=k is algebraically closed and R is a simple difference ring, we have that R is a Picard-Vessiot ring for the system associated to σ(yr)−yr=br, r=0,…,n, over K. The elements u0,…,un are algebraically dependent over K and solutions of σ(yr)−yr=br,r=0,…,n. Lemma C.10 proves that there exist ci∈k, not all zero, and g∈K such that
[TABLE]
Let {dr}⊂k be a Kσ-basis of k. By Lemma C.8, it is also a K-basis of K. We may write each ci and g as
[TABLE]
for some ci,r∈Kσ and gr∈K. Since not all the ci are zero, there exists r such that ci,r are not all zero. For this r, we have
Assuming that f is (∂,Δ)-differentially algebraic over K, there is some finite set {∂i0Δj0(f),…,∂inΔjn(f)}⊂L of elements that are algebraically dependent over K. Note that jk=0 for all k if Δ is K-linearly dependent from ∂. Since σ commutes with Δ and ∂, we have for all r=0,…,n,
[TABLE]
To conclude it remains to apply Lemma C.11 with zr=∂irΔjr(f) and br=∂irΔjr(b) for r=0,…,n.
∎
Appendix D Meromorphic functions on a Tate curve and their derivations
In this section we translate the galoisian criteria of Theorem C.9 in the context of elliptic functions field. We start by defining the derivations.
Studying the transcendence properties of the q-logarithm, we then perform a descent on the field of coefficients and on the number of derivations involved in the telescoping relation.
D.1. Derivation on nonarchimedean elliptic functions field
Let q∈C∗ such that ∣q∣=1 and let σq denote the automorphism of Mer(C∗) defined by σq(f(s))=f(qs). We denote
by Cq the field of meromorphic functions fixed by σq. By Proposition 3.1, it is the
field of rational functions on the Tate curve Eq or E1/q, depending whether ∣q∣<1 or ∣q∣>1. In this section, we construct, as in [DVH12, §2] a derivation of these functions that encode their t-depencies and commute with σq.
The fact that ∂s=sdsd acts on Mer(C∗), and its commutation with σq is straightforward. Unfortunately, the t-derivative of q may be nontrivial, implying a more complicated commutation rule between ∂t=tdtd and σq.
More precisely, we have
[TABLE]
The following statement holds.
Lemma D.1**.**
The ∂s-constants Mer(C∗)∂s={f∈Mer(C∗)∣∂s(f)=0} of Mer(C∗) are precisely the constant functions C.
Next Lemma introduces a twisted t-derivation that commutes with σq. Remind that the q-logarithm ℓq has been defined in §\refsec43.
Note that since ∂s,Δt,q commute with σq, we can derive the equation σq(ℓq)=ℓq+1 to find σq(∂s(ℓq))=∂s(ℓq) and σq(Δt,q(ℓq))=Δt,q(ℓq). We then conclude that ∂s(ℓq),Δt,q(ℓq) belong to Cq.
The link with the iterates of Δt,q and the derivatives ∂s,∂t is now made in the following lemma.
Lemma D.4**.**
For any i∈N, there exist cj,k,l∈Cq such that
[TABLE]
Proof.
Let us prove the result by induction on i. For i=1, this comes from the fact that Δt,q=∂t(q)ℓq∂s+∂t. Let us fix i∈N and assume that the result holds for i. We find
[TABLE]
that is
[TABLE]
Note that the commutation of σq with Δt,q implies that Cq is stabilized by Δt,q.
Since by Remark D.3, Δt,q(ℓq) belongs to Cq, we get that, for any integer j, any c~∈Cq, we have Δt,q(c~(ℓq)j)=Δt,q(c~)(ℓq)j+c~c(ℓq)j−1 where c=jΔt,q(ℓq)∈Cq. Therefore, with Δt,q(c~)∈Cq, we find that Δt,q(c~(ℓq)j)∈Cq[ℓq] is of degree at most j in ℓq. With
∂t(q),cj,k,l∈Cq, this ends the proof.
∎
From now on, let us fix q∈C∗ with ∣q∣=1, that is multiplicatively independent to q,
that is there are no r,l∈Z2∖(0,0) such that qr=ql.
Remind that Cq.Cq⊂Mer(C∗) is the compositum of fields and ℓq∈Mer(C∗) is a solution of σq(ℓq)=ℓq+1. We now give examples of difference differential fields for σq,∂s and Δt,q.
Lemma D.5**.**
The following statement hold.
(1)
The field Cq(s,ℓq) is stabilized by σq, ∂s and Δt,q. The field Cq(s) is stabilized by σq, and ∂s. The field C(s) is stabilized by ∂s, ∂t.
2. (2)
The field Cq.Cq(ℓq,ℓq) is stabilized by σq, ∂s and Δt,q. The field Cq.Cq(ℓq) is stabilized by σq, and ∂s. The field Cq(ℓq) is stabilized by ∂s, ∂t.
Proof.
(1) Since σq(ℓq)=ℓq+1, we easily see that Cq(s,ℓq),Cq(s) are stabilized by σq. Since σq commutes with ∂s and Δt,q, the field Cq is stabilized by ∂s and Δt,q. It is now clear that Cq(s) is stabilized by ∂s and Δt,q(Cq(s))⊂Cq(s,ℓq).
By Remark D.3, Δt,q(ℓq),∂s(ℓq)∈Cq. Combining the lasts assertions, we obtain the result for Cq(s,ℓq). Finally, the field C(s) is stable by ∂s, ∂t, since C is stable by ∂s,∂t, and ∂s(s)=s, ∂t(s)=0.
(2) Let us prove that Cq(ℓq) is stabilized by σq. Using σq(ℓq)=ℓq+1 and the commutation between σq and σq, we find that
σq(ℓq)−ℓq∈Cq. Similarly, σq(Cq)⊂Cq, proving that Cq(ℓq) is stabilized by σq. Using ∂s(Cq)⊂Cq and ∂s(ℓq)∈Cq, we find that the field Cq.Cq(ℓq) is stabilized by σq and ∂s.
Let us now consider the field Cq.Cq(ℓq,ℓq). The field Cq(ℓq) is clearly stable by σq. From what preceede, Cq(ℓq) is stable by σq, and therefore, Cq.Cq(ℓq,ℓq) is stable by σq. The same arguments than those used in (1), prove that Δt,q(Cq(ℓq))⊂Cq.Cq(ℓq) and ∂s(Cq(ℓq))⊂Cq(ℓq).
It remains to prove that Δt,q(Cq(ℓq))⊂Cq.Cq(ℓq,ℓq). We note that ∂t(q)ℓq∂s+∂t=Δt,q=Δt,q+(∂t(q)ℓq−∂t(q)ℓq)∂s. Since Cq is stabilized by Δt,q and ∂s, we find that Δt,q(Cq)⊂Cq.Cq(ℓq,ℓq). Moreover, since ∂s(ℓq),Δt,q(ℓq)
belong to Cq, see Remark D.3, we find that Δt,q(ℓq)∈Cq.Cq(ℓq,ℓq). We have shown the inclusion Δt,q(Cq(ℓq))⊂Cq.Cq(ℓq,ℓq). This concludes the proof for Cq.Cq(ℓq,ℓq).
Let us now consider Cq(ℓq). By Remark D.3 and ∂t=Δt,q−∂t(q)ℓq∂s, we find that the inclusion holds ∂s(ℓq),∂t(ℓq)∈Cq(ℓq). Since ∂s,Δt,q commute with σq, Cq is stable by ∂s,Δt,q. With ∂t=Δt,q−∂t(q)ℓq∂s, it follows that ∂t(Cq)⊂Cq(ℓq). Finally, we obtain that the field Cq(ℓq) is stable by ∂s,∂t.
∎
D.2. Difference Galois theory for elliptic function fields
In this section, we apply the results of §C to the specific cases of elliptic function fields introduced in Lemma D.5. We recall that the following fields extensions are (σ,∂,Δ)-fields extensions.
•
Let q∈C∗ with ∣q∣=1. Then, let us consider
[TABLE]
•
Let q and q two elements of C∗ such that ∣q∣,∣q∣=1, that are multiplicatively independent. Let us consider
[TABLE]
In that framework, the criteria obtained in §C to guaranty the (∂s,Δt,q)-differential transcendence of a solution of a rank one q-difference equation can be simplified and some descent arguments prove that the existence of a telescoping relation involving the two derivatives implies the existence of a telescoping relations involving only the derivation ∂s. More precisely, we find the following proposition:
Proposition D.6**.**
Let K⊂Mer(C∗) be a (σq,∂s)-field and let us assume that
(H1)* L=K(ℓq) is a (σq,∂s,Δt,q)-field;*
(H2)* Kσq=Lσq=Cq is relatively algebraically closed in L;*
(H3)* ℓq is transcendental over K.*
Let f∈Mer(C∗), that satisfies σq(f)=f+b, for some b that belongs to a subfield of K stable by ∂s,∂t.
If f is (∂s,Δt,q)-differentially algebraic over L then, there exist m∈N, d0,…,dm∈Cq not all zero, and h∈K such that
[TABLE]
Proof.
Since f is (∂s,Δt,q)-differentially algebraic over L and Kσq is relatively algebraically closed, Theorem C.9 yields that there exist M∈N, ci,j∈Lσq not all zero, and g∈L such that
[TABLE]
By Lemma D.4, for all i∈N, there exist cj,k,l∈Cq such that
[TABLE]
The left hand side of (D.1) is a polynomial in ℓq with coefficients in K. By Lemma C.3 with (H2) and (H3), we find that g∈K[ℓq] as well.
Thus, let us write g=∑k=0Rαkℓqk with αk∈K and αR=0.
Let
[TABLE]
By (D.2), the coefficient of highest degree in ℓq of the left hand side of (D.1) is
[TABLE]
On the other hand, we have
[TABLE]
where P(X)∈K[X] is a polynomial of degree strictly smaller than R−1. Then, comparing (D.3) and (D.4), we find that
•
either R<N so that
[TABLE]
•
either R=N so that
[TABLE]
•
or R>N so that R>0, 0=αR∈Lσq. We claim that R=N−1. Indeed, R>N−1 implies σq(αR)=σq(αR), σq(αR−1)−αR−1+RαR=0 and then σq(αRαR−1)−αRαR−1+R=0 with αRαR−1∈K in contradiction with Lemma C.2 applied to f=ℓq. Thus, we get R=N−1 and
[TABLE]
For all these cases, note that there exists i0 such that ci0,N=0 by definition of N. Since ∂s commutes with σq, we can derive (D.7) with respect to ∂s and obtain that in any case, there exists dk∈Lσq=Cq not all zero and h∈K such that
[TABLE]
∎
D.3. Transcendence properties
The goal of this subsection is to prove some transcendence properties of the q-logarithm in order to perform some descent procedure on telescopers. More precisely, we need to prove that the assumptions (H1) to (H3) of Proposition D.6 are satisfied for the fields Cq(s) and Cq.Cq(ℓq,ℓq) for q and q two multiplicatively independent elements of C∗ with ∣q∣=1, ∣q∣=1. We recall that q and q are multiplicatively independent if there are no (r,l)∈Z2∖(0,0) such that qr=ql. Remind that Cq.Cq⊂Mer(C∗) is the compositum of fields and ℓq∈Mer(C∗) is a solution of σq(y)=y+1. With Lemma D.5,
(H1) of Proposition D.6 is satisfied for K=Cq(s) and K=Cq.Cq(ℓq).
Lemma D.7**.**
Any element in a σq-extension of Cq¶¶¶We recall that since σq and σq commute, the field Cq is a σq-field. that is algebraic over Cq and
invariant by σq is in C. Any element in a σq-extension of Cq that is algebraic over Cq and
invariant by σq is in C.
Proof.
The two statements are symmetrical, so let us only prove the first one. First let us prove that Cq∩Cq=C. Let f be an element of Cq that is σq-invariant.
Suppose to the contrary that f is nonconstant. Then f has a nonzero pole c.
Since σq(f)=f, the multiplication by q induces a permutation of the poles of f modulo q. Since the set of poles modulo q is a finite set, there exists m∈N such that qmc=qdc for some d∈Z. A contradiction with the fact that q and q are multiplicatively independent.
Now, let f be in a σq-extension of Cq algebraic over Cq and
invariant by σq. Let μ(X)∈Cq[X] be the monic minimal polynomial of f above Cq. Since σq(f)=f, we easily see that the coefficients of μ must be fixed by σq. Then,
these coefficients belong to Cq∩Cq, which is equal to C. Then, f is algebraic over C. The latter field being algebraically closed, we conclude that f∈C.
∎
Lemma D.8**.**
The following statements hold:
(1)
the fields Cq and Cq are linearly disjoint over C;
2. (2)
for all α∈Cq.Cq, σq(α)=α+1 and
σq(α)=α+1;
3. (3)
for all α∈Cq(s),
σq(α)=α+1.
Proof.
(1) This is Lemmas D.7 and C.8 with K=C, M=Cq and
L=Cq, σ=σq.
(2) Suppose to the contrary that there exists α∈Cq.Cq, such that σq(α)=α+1. Since
Cq is by Proposition 3.1, the field of meromorphic functions over a Tate curve, there exist x,y∈Cq such that x is transcendental over C, y algebraic of degree 2 over C(x) and Cq=C(x,y). Since Cq is linearly disjoint from Cq over C, the field Cq.Cq equals Cq(x,y) and there are P(X),Q(X)∈Cq(X) such that α=P(x)y+Q(x). Since x,y are fixed by σq and y is of degree 2 over Cq(x), we deduce from σq(α)=α+1 that
Pσq(x)=P(x) and
Qσq(x)−Q(x)=1 where Pσq(X) (resp. Qσq(X)) denotes the fraction obtained from P(X) (resp. Q(X)) by applying σq to the coefficients.
Let Cq be some algebraic closure of Cq. We endow Cq with a structure of σq-field extension of Cq. Let us write Q(X)=Xrcr+⋯+Xc1+R(X) with R∈Cq(X) with no pole at X=0. Then, since x is transcendental over Cq and fixed by σq
[TABLE]
Using the transcendence of x over Cq, we find that 1=σq(β~)−β~ for β~=R(0)∈Cq. There exists a unique derivation extending ∂s to Cq and this derivation commutes with σq. Denoting this derivation by ∂s and
deriving 1=σq(β~)−β~, we conclude that
∂s(β~)∈Cq∩Cqr. Note that q and qr are multiplicatively independent. By Lemma D.7, we find that ∂s(β~)∈C which leads to β~=cs+d for some c,d∈C. A contradiction with 1=σq(β~)−β~.
The proof for q is similar.
(3) Let α∈Cq(s). Using the partial fraction decomposition of α in Cq(s), the fact that σq(s)=qs and the transcendence of s over Cq, one can easily see that σq(α)−α=1.
∎
Lemma D.9**.**
The following statements hold:
(1)
the function ℓq (resp. ℓq) is transcendental over Cq.Cq;
2. (2)
the function ℓq
is transcendental over Cq(s). In particular, (H3) of Proposition D.6 is satisfied for K=Cq(s).
Proof.
(1)
Since σq(ℓq)=ℓq+1 and Cq⊂(Cq.Cq)σq⊂Mer(C∗)σq=Cq, we can apply Lemma C.2 and find that ℓq is algebraic over Cq.Cq if and only if there exists α∈Cq.Cq such that
σq(α)=α+1. We conclude by Lemma D.8. The proof for ℓq is symmetrical.
(2)
Since σq(ℓq)=ℓq+1 and Cq⊂(Cq(s))σq⊂Mer(C∗)σq=Cq, we can apply Lemma C.2 and find that ℓq is algebraic over Cq(s) if and only if there exists α∈Cq(s) such that
σq(α)=α+1. We again conclude by Lemma D.8.
∎
Lemma D.10**.**
The following statement hold:
(1)
let f∈Cq. If there exists α∈Cq.Cq satisfying σq(α)−α=f, then there exists β∈Cq such that
σq(β)−β=f;
2. (2)
let f∈Cq.Cq. If there exists α∈Cq.Cq(ℓq) satisfying σq(α)−α=f, then, there exist a~∈Cq,b~∈Cq.Cq such that
σq(a~ℓq+b~)−(a~ℓq+b~)=f.
Proof.
(1)
Analogously to the proof of Lemma D.8, let us write α=P(x)y+Q(x) for P(X),Q(X)∈Cq(X) and Cq=C(x,y). Reasoning as in the proof of Lemma D.8, we find that Qσq(x)−Q(x)=f. Since x is transcendental over Cq, we conclude as in Lemma D.8 that there is β~∈Cq, for some Cq algebraic closure of Cq such that σq(β~)−β~=f. Since by Lemma D.7, Cqσq=Cqσq=C, Lemma C.2 implies that there exists β∈Cq such that
σq(β)−β=f.
(2) First of all, let us note that since σq and σq commute, there exists d∈Cq such that
[TABLE]
By Lemma D.9, the function ℓq is transcendental over Cq.Cq. This implies that ℓq∈/Cq and then d=0. Since Cq.Cq(ℓq)σq=Cq=Mer(C∗)σq=Cq.Cqσq=Cq, Lemma C.3, applied to σq(ℓq)=ℓq+d, implies that there exists P∈Cq.Cq[X] such that
[TABLE]
Now, let us write P(X)=∑k=0NakXk with ak∈Cq.Cq, and N minimal. We find
[TABLE]
We conclude in view of (D.10) that if N=0 we are done by setting a~=0 and b~=aN. Let us now assume that N>0. Then, by minimality of N, σq(aN)=aN. We claim that σq(aN−1)−aN−1+Ndσq(aN)=σq(aN−1)−aN−1+NdaN=0. To the contrary, σq(aN−1)=aN−1−NdaN implies σq(aNaN−1+Nℓq)=aNaN−1+Nℓq and aNaN−1+Nℓq∈Cq, contradicting the transcendence of ℓq over Cq.Cq, see Lemma D.9. This proves the claim. If N>1, then (D.10) with σq(aN)=aN and
σq(aN−1)−aN−1+NdaN=0, would give an equation of order N−1 which would contradicts the transcendence of ℓq over Cq.Cq. This proves that N=1 and f=σq(a1ℓq+a0)−(a1ℓq+a0) for some a1∈Cq,a0∈Cq.Cq.
∎
Lemma D.11**.**
The function ℓq is transcendental over Cq.Cq(ℓq). In particular, the assumption (H3) of Proposition D.6 holds for K=Cq.Cq(ℓq).
Proof.
By Lemma C.2, the function ℓq is algebraic over Cq.Cq(ℓq) if and only if we have ℓq∈Cq.Cq(ℓq). Suppose to the contrary that ℓq∈Cq.Cq(ℓq). Since 1=σq(ℓq)−ℓq, we conclude by Lemma D.10 that there exist a~∈Cq,b~∈Cq.Cq such that 1=σq(a~ℓq+b~)−(a~ℓq+b~). Combining this equation with σq(ℓq)−ℓq=1, we find that σq(ℓq)−ℓq=σq(a~ℓq+b~)−(a~ℓq+b~), proving that σq(a~ℓq+b~−ℓq)=a~ℓq+b~−ℓq∈Cq. Then, there exists b1∈Cq.Cq such that
By Remark D.3, ∂s(ℓq),∂s(ℓq)∈Cq.Cq. In virtue of the commutation between ∂s and σq,σq, the fields Cq,Cq are stabilized by ∂s, which implies ∂s(a),∂s(b1)∈Cq.Cq. By Lemma D.9, the function ℓq is transcendental over the latter field, we conclude that ∂s(a)=0 and therefore a∈C. In particular it belongs to Cq and Cq. Using 1=σq(a~ℓq+b~)−(a~ℓq+b~), we find
[TABLE]
where d=σq(ℓq)−ℓq∈Cq, see (D.9).
Since 1−ad∈Cq, we conclude by Lemma D.10, that there exists b2∈Cq such that 1−ad=σq(b2)−b2. Replacing the left hand side gives
[TABLE]
This shows that ℓq−aℓq−b2∈Cq and then, there exists c∈Cq such that ℓq+c=aℓq+b2. Deriving this equation with respect to ∂s, we find (we use
∂s(a)=0)
[TABLE]
By Remark D.3, the left hand side of the equation belongs to Cq whereas the right hand side is in Cq. By Lemma D.7, we conclude that ∂s(ℓq+c)∈C. This means that there exist a0,b0∈C such that ℓq=a0s+b0−c in contradiction with ℓq transcendental over Cq(s), see Lemma D.9.
∎
We can now prove that our fields satisfy the assumption (H2) of Proposition D.6.
Lemma D.12**.**
The following holds:
(1)
Cq* is relatively algebraically closed in Cq(s,ℓq);*
2. (2)
Cq* is relatively algebraically closed in Cq.Cq(ℓq,ℓq).*
In particular, (H2) of Proposition D.6 holds for K=Cq(s) and K=Cq.Cq(ℓq).
Proof.
(1)
The first point is a consequence of transcendence of s over Cq, and the transcendence of ℓq
over Cq(s), see Lemma D.9.
(2) Let us prove the second point. Let us start by proving that Cq is relatively algebraically closed in Cq.Cq. As in the proof of Lemma D.8, we have Cq=C(x,y) and Cq.Cq=Cq(x,y) where y is of degree 2 over both C(x) and Cq(x). Let f∈Cq(x,y). Then f=P(x)y+Q(x) with P(x),Q(x)∈Cq(x).
If f is algebraic over Cq then Lemma C.1 implies that σqr(f)=f for some r∈Z∗ and therefore σqr(P(x))=P(x) and σqr(Q(x))=Q(x). We claim that P(x) and Q(x) are in C(x), and therefore that f∈Cq. Let P(x)=P1(x)/P2(x) where P1(x),P2(x)∈Cq[x] are relatively prime and P1(x) is monic. We then have that σqr(P1(x))P2(x)=σqr(P2(x))P1(x) and consequently P1(x) divides σqr(P1(x)) (resp. σqr(P1(x)) divides P1(x)). Since P1(x) is monic, P1(x)=σqr(P1(x)) and P2(x)=σqr(P2(x)). This implies that the coefficients of P1(x) and P2(x) are left fixed by σqr . Note that by assumption, q and qr are multiplicatively independent. Therefore, by Lemma D.7, applied with q replaced by qr, P1,P2∈C[X]. The proof for Q is similar. This proves our claim and show that f∈Cq. Then Cq is relatively algebraically closed in Cq.Cq.
Note that Lemma D.9 implies that ℓq is transcendental over Cq.Cq and Lemma D.11 implies that ℓq is transcendental over Cq.Cq(ℓq). Therefore Cq is relatively algebraically closed in Cq.Cq(ℓq,ℓq).
∎
Finally, we prove a lemma that will allows us to descend some telescoping relations on smaller base fields.
Lemma D.13**.**
Let b∈Cq such that there exist N∈N, ci∈Cq with cN=0, and g∈Cq.Cq(ℓq,ℓq) that satisfy
[TABLE]
Then, there exist m∈N, d0,…,dm∈C not all zero and h∈Cq such that
[TABLE]
Proof.
First of all note that the left hand side of (D.12) belongs to Cq.Cq.
By Lemma D.11, the function ℓq is transcendental over
Cq.Cq(ℓq).
By Lemma C.3, g∈Cq.Cq(ℓq)[ℓq]. So let us write g=∑k=0Rαkℓqk with αk∈Cq.Cq(ℓq), αR=0.
Claim. There exist m∈N, ck′∈Cq, cm′=0, and α∈Cq.Cq(ℓq) such that
[TABLE]
If R=0 the claim is proved. Assume that R>0.
Then, we have
[TABLE]
where P(X)∈Cq.Cq(ℓq)[X] is a polynomial of degree smaller than R−1.
Then, comparing (D.14) and (D.12), we find, by transcendence of ℓq over Cq.Cq(ℓq), see Lemma D.11, that σq(αR)=αR. Let us prove that σq(αR−1)−αR−1+RαR=0. Indeed if σq(αR−1)−αR−1+RαR=0 then σq(αRαR−1)−αRαR−1+R=0 with αRαR−1∈Cq.Cq in contradiction with Lemma D.9 and Lemma C.2. We then obtain that R=1 since otherwise we would deduce from (D.14) an algebraic relation for ℓq over Cq.Cq(ℓq), contradicting Lemma D.11. Thus,
[TABLE]
Remind that α1∈Cq and the latter field is stable by ∂s due to the commutation between ∂s and σq. By Lemma D.5, the field Cq.Cq(ℓq) is stabilized by ∂s. We can derive (D.15) with respect to ∂s and using the commutation between σq and ∂s, we obtain our claim.
Claim. There exist
M∈N, dk∈Cq, dM=0 and β∈Cq.Cq such that
[TABLE]
Indeed, by Lemma D.10, we can find a∈Cq,b∈Cq.Cq such that
[TABLE]
Either a=0 and ∑kck′∂sk(b)=σq(b)−(b) for some b∈Cq.Cq. Or a=0 and dividing (D.16) by a and deriving with respect to ∂s, we find
[TABLE]
where the dk are in Cq, dm+1=acm′=0. Furthermore, by Remark D.3 and the fact that Cq, Cq, are stable by ∂s, we find
∂s(ℓq)+∂s(b/a)∈Cq.Cq. This proves the claim.
Now, let us consider an equation of the form
[TABLE]
with β∈Cq.Cq, dk∈Cq and dM=0, minimal with respect to the maximal order of derivation M of b. We can write this minimal equation as follows
[TABLE]
with dM∈Cq∗. Then dividing by dM, we find
[TABLE]
Therefore, we can without loss of assumption assume that dM=1. Now, if we compute the element σq(σq(β)−β))−(σq(β)−β)) and use the fact that b∈Cq, we find
[TABLE]
By minimality, we find that, for all k, the element dk∈Cq is fixed by σq. This means that dk∈C by Lemma D.7.
Since ∂sM(b)+∑k=0M−1dk∂sk(b)∈Cq and
∂sM(b)+∑k=0M−1dk∂sk(b)=σq(β)−β with β∈Cq.Cq, Lemma D.10 shows that we have the existence of h∈Cq such that
[TABLE]
∎
The results of Appendix D.3 are summarized in the following crucial corollary.
Corollary D.14**.**
The assumptions of Proposition D.6 are satisfied for
•
Genus zero case: K=Cq(s) and b∈C(s) with q∈C∗ such that ∣q∣=1;
•
Genus one case: K=Cq.Cq(ℓq) and b∈Cq(ℓq) with q,q∈C∗ such that ∣q∣,∣q∣=1 and q and q are multiplicatively independent.
Proof.
The fact that the field K and b satisfy the assumptions (Hi) is Lemmas D.5, D.9, D.11, and D.12.
∎
Bibliography30
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Avd Dvd H 17] Matthias Aschenbrenner, Lou van den Dries, and Joris van der Hoeven, Asymptotic differential algebra and model theory of transseries , Annals of Mathematics Studies, vol. 195, Princeton University Press, Princeton, NJ, 2017.
2[BBMR 16] Olivier Bernardi, Mireille Bousquet-Mélou, and Kilian Raschel, Counting quadrant walks via Tutte’s invariant method (extended abstract) , to appear in Proceedings of FPSAC 2015 , Discrete Math. Theor. Comput. Sci. Proc., 2016.
3[BMM 10] Mireille Bousquet-Mélou and Marni Mishna, Walks with small steps in the quarter plane , Algorithmic probability and combinatorics, Contemp. Math., vol. 520, Amer. Math. Soc., Providence, RI, 2010, pp. 1–39.
4[Bv HK 10] Alin Bostan, Mark van Hoeij, and Manuel Kauers, The complete generating function for gessel walks is algebraic , Proc. Amer. Math. Soc. 138 (2010), no. 9, 3063–3078.
5[Coh 65] Richard M. Cohn, Difference algebra , Interscience Publishers John Wiley & Sons, New York-London-Sydeny, 1965.
6[DHRS 18] Thomas Dreyfus, Charlotte Hardouin, Julien Roques, and Michael F Singer, On the nature of the generating series of walks in the quarter plane , Inventiones mathematicae 213 (2018), no. 1, 139–203.
7[DHRS 20a] by same author, On the kernel curves associated with walks in the quarter plane , ar Xiv preprint ar Xiv:2004.01035 (2020).
8[DHRS 20b] by same author, Walks in the quarter plane: Genus zero case , Journal of Combinatorial Theory, Series A 174 (2020), 105251.