This paper addresses the fundamental problem of determining when telescopers exist for rational functions in three variables, providing criteria that enable effective algorithm termination in creative telescoping.
Contribution
It reduces the existence problem from three variables to two, solving 18 cases and enabling efficient construction of telescopers for trivariate rational functions.
Findings
01
Reduced the existence problem from three to two variables.
02
Provided criteria for telescoper existence in 18 cases.
03
Enabled termination detection for algorithms with trivariate inputs.
Abstract
Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or (q-)recurrence operators computed by algorithms for creative telescoping. For a given class of inputs, when telescopers exist and how to construct telescopers efficiently if they exist are two fundamental problems related to creative telescoping. In this paper, we solve the existence problem of telescopers for rational functions in three variables including 18 cases. We reduce the existence problem from the trivariate case to the bivariate case and some related problems. The existence criteria given in this paper enable us to determine the termination of algorithms for creative telescoping with trivariate rational inputs.
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Polynomial and algebraic computation · semigroups and automata theory
Full text
On the Existence of Telescopers for Rational Functions in Three Variables
aKLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences,
Beijing, 100190, China
bSchool of Mathematical Sciences, University of Chinese Academy of Sciences,
Beijing, 100049, China
cInstitute for Algebra, Johannes Kepler University,
Linz, A4040, Austria
dSchool of Mathematical Sciences, Tiangong University,
Tianjin, 300387, China
Abstract
Zeilberger’s method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities.
Telescopers are linear differential or (q-)recurrence operators computed by algorithms for creative telescoping. For a given class of inputs,
when telescopers exist and how to construct telescopers efficiently if they exist are two fundamental problems related to creative telescoping.
In this paper, we solve the existence problem of telescopers for rational functions in three variables including 18 cases. We
reduce the existence problem from the trivariate case to the bivariate case and some related problems.
The existence criteria given in this paper enable us to determine the termination of algorithms for creative telescoping with trivariate rational inputs.
keywords:
Creative telescoping, Existence criterion, Reduction, Telescoper
1 Introduction
Creative telescoping plays a crucial role in the algorithmic proof theory
of combinatorial identities developed by Wilf and Zeilberger in the early
1990s Zeilberger1990 ; Zeilberger1991 ; Wilf1992 .
For a given function f(x,y1,…,yn), the process of creative telescoping
constructs a nonzero linear differential or (q-)recurrence operator L in x such that
[TABLE]
where Θyi denotes the derivation or (q-)difference operator in yi
and the gi’s belong to the same class of functions as f. The operator L is then called
a telescoper for f, and the gi’s
are called the certificates of L. Two fundamental problems have been studied extensively
related to creative telescoping.
The first problem is the existence problem of telescopers, i.e., deciding the existence of
telescopers for a given class of functions.
The second one is the construction problem of telescopers, i.e., designing efficient
algorithms for computing telescopers if they exist. For more open problems related to creative telescoping, one can see chen2017JSSC .
In this paper, we will mainly focus on the existence problem of telescopers and study the construction problem
of telescopers in future work.
The existence of telescopers is closely connected to the termination of algorithms for creative telescoping and the hypertranscendence and algebraic dependency
of functions defined by indefinite sums or integrals Hardouin2008 ; Schneider2010 . In 1990,
Zeilberger first presented a sufficient condition on the
existence of telescopers by showing that telescopers always exist for so-called holonomic functions
in Zeilberger1990 using Bernstein’s theory of algebraic D-modules.
Soon after this work, Wilf and Zeilberger in Wilf1992 proved that telescopers exist for
proper hypergeometric terms. However, holonomicity and properness
are only sufficient conditions. Abramov and Le AbramovLe2002 gave a
necessary and sufficient condition on the existence of telescopers for
rational functions in two discrete variables. This work was soon extended to the
hypergeometric case by Abramov Abramov2003 , the q-hypergeometric case
in ChenHouMu2005 , and the mixed rational and hypergeometric
case in ChenSinger2012 ; Chen2015 .
All of the above work only focussed on the problem for
bivariate functions of a special class.
The first criterion on the existence of telescopers beyond the bivariate case was
given in Chen2016 , in which a necessary and sufficient condition is presented on the existence problem of telescopers for
rational functions in three discrete variables. The goal of this paper is continuing this project
by considering the remaining cases, in which the continuous, discrete and q-discrete variables can appear.
The remainder of this paper is organized as follows. We define the existence problem of telescopers
precisely in Section 2 and recall different types of reductions that are used in testing
the exactness of bivariate rational functions in Section 3. Existence criteria are given
for 18 types of telescopers for rational functions in three variables in Section 4.
A preliminary version chen2019ISSAC of this article has appeared in the Proceedings of ISSAC’19.
In the present version, we include twelve more cases in which the q-shift operator appears
and also more detailed proofs throughout.
Acknowledgement.
The authors would like to thank Ruyong Feng, Hui Huang and Ziming Li for many helpful discussions.
In this work, Shaoshi Chen and Chaochao Zhu was supported by the NSFC grants (No. 11871067 and No. 11688101) and by the Fund of the Youth Innovation Promotion Association, CAS.
Lixin Du was supported by the NSFC grant (No. 11871067) and the Austrian FWF grant (No. P31571-N32). Rong-Hua Wang was supported by the Natural Science Foundation of Tianjin (No. 19JCQNJC14500) and the NSFC grant (No. 11871067).
2 Preliminaries
Let K be a field of characteristic zero and K(v) be the field of rational functions in the
variables v={x,y1,…,yn} over K. For each v∈v,
the derivationδv on K(v) is defined as the usual partial derivation ∂/∂v
with respect to v satisfying that
δv(f+g)=δv(f)+δv(g) and δv(fg)=gδv(f)+fδv(g)
for all f,g∈K(v).
Moreover, δv(c)=0 if and only if
c∈K(v∖{v}), i.e., c is free of v.
For each v∈v, the shift operatorσv
is the K-automorphism of K(v) defined by σv(v)=v+1
and σv(w)=w for all w∈v∖{v}. Let q∈K∖{0} be such that qm=1 for all nonzero m∈Z.
For each v∈v,
the q-shift operatorτq,v is the K-automorphism defined by τq,v(v)=qv
and τq,v(w)=w for all w∈v∖{v}.
Abusing notation, we let δv and θv with θv∈{σv,τq,v} denote arbitrary extensions
of δv and θv to derivation
and K-automorphism of K(v), the algebraic closure of K(v).
Over the field K(v), we have a noncommutative algebra
D:=K(v)⟨∂x,∂y1,…,∂yn⟩
in which commutation rules are ∂vi∂vj=∂vj∂vi for all vi,vj∈v,
and for any v∈v and f∈K(v),
[TABLE]
where Dv,Sv, and Tq,v refer to the differential, shift and q-shift operators, respectively.
The algebra D is also called the ring of linear functional operators or Ore
polynomials (for more details, see BronsteinPetkovsek1996 ; ChyzakSalvy1998 ). Let
Δv be the difference operator Sv−1 and Δq,v be the q-difference operator Tq,v−1.
For each v∈v, we define
[TABLE]
The action of the operator ∂v∈D on an element f∈K(v) is defined as
[TABLE]
In general, the action of the operator L=∑i0,i1,…,in≥0ai0,i1,…,in∂xi0∂y1i1⋯∂ynin∈D on f∈K(v) is defined as
[TABLE]
Then the field K(v) becomes a left D-module. In this paper, we will mainly work with rational functions in three variables x,y,z
and the operators in K(x,y,z)⟨∂x,∂y,∂z⟩.
Example 2.1**.**
Let L=1+(x+yz)Dx+2SyTq,z∈K(x,y,z)⟨Dx,Sy,Tq,z⟩ and f=1/(x+yz). Then we have
[TABLE]
The functions we consider will be in certain D-module,
such as the field K(v) or K(v).
The ring K(x)⟨∂x⟩ is a subring of D that is also
a left Euclidean domain. Efficient algorithms for
basic operations in K(x)⟨∂x⟩, such as computing
the least common left multiple (LCLM) of operators, have
been developed in BronsteinPetkovsek1996 ; AbramovLeLi2005 .
Lemma 2.2**.**
For an operator L=∑i=0ρeiDxi∈K(x)⟨Dx⟩ with eρ=1,
we let F be a finite normal extension of K(x) containing the coefficients ei’s
and G be the Galois group of F over K(x). Let T be the LCLM of the operators σ(L)=∑i=0ρσ(ei)Dxi
for all σ∈G. Then T belongs to K(x)⟨Dx⟩.
Proof..
It suffices to show that τ(T)=T for all τ∈G.
Since Dx commutes with any automorphism in G by (BronsteinBook, , Theorem 3.2.4 (i)), we have τ(L1L2)=τ(L1)τ(L2)
for all L1,L2∈F⟨Dx⟩.
For each σ∈G, we have T=Pσσ(L) for some Pσ∈F⟨Dx⟩, which implies that
τ(σ(L)) divides τ(T). When σ runs through all elements of G, so does τσ.
Hence τ(T) is also a common left multiple of the operators σ(L)
for all σ∈G. Since τ(T) and T are both monic and of the same degree in Dx,
we get τ(T)=T.
Remark 1**.**
The above assertion is not true in the (q-)shift case. For example, take L=Sx+x.
The LCLM of L and its conjugation Sx−x is Sx2−x(x+1), which is not in K(x)⟨Sx⟩.
Definition 2.3**.**
For a rational function f∈K(x,y,z), a nonzero
operator L(x,∂x)∈K(x)⟨∂x⟩ is called a telescoper of type (∂x,Θy,Θz) for f
if there exist rational functions g,h∈K(x,y,z) such that
[TABLE]
The rational functions g,h are called the certificates of L.
Note that all of the telescopers for a given function together with the zero operator form a left
ideal of K(x)⟨∂x⟩ (see (Chyzak2009, , Definition 1)).
The following lemma summarizes closure properties related to the existence of telescopers.
Lemma 2.4**.**
Let f,g∈K(x,y,z), a,b∈K(x) and α,β∈K(x). Then we have
(i)
if both f and g have telescopers in K(x)⟨Dx⟩ of type (Dx,Θy,Θz), so does αf+βg;
(ii)
if both f and g have telescopers in K(x)⟨∂x⟩ of type (∂x,Θy,Θz) with ∂x∈{Sx,Tq,x}, so does af+bg.
Proof..
We first show that αf has a telescoper in K(x)⟨Dx⟩ if f does.
When α=0 the conclusion is obvious.
Next we assume that α=0 and
L=∑i=0ρeiDxi∈K(x)⟨Dx⟩ is a telescoper for f.
Then
L(f)=Θy(u)+Θz(v) with
u,v∈K(x,y,z).
Set L~=L⋅α1, which belongs to K(x)⟨Dx⟩.
Then we have L~(αf)=Θy(u)+Θz(v), which means L~
is a telescoper for αf. By Lemma 2.2, there exists
T∈K(x)⟨Dx⟩ such that T is a left multiple of L~. So T is also a telescoper for αf.
When telescopers are in K(x)⟨Sx⟩ or K(x)⟨Tq,x⟩, the above argument works for af for any a∈K(x).
It remains to show that f+g has a telescoper in K(x)⟨∂x⟩ with ∂x∈{Dx,Sx,Tq,x} if both f and g do. Assume that P,Q∈K(x)⟨∂x⟩
are telescopers for f,g, respectively. Then the LCLM of P and Q
is a telescoper for f+g by the commutativity between operators in K(x)⟨∂x⟩ and the operators Θy and Θz.
Let V=(V1,…,Vm) be any set partition of the variables v={x,y1,…,yn}.
A rational function f∈K(v) is said to be split with respect to the partition V
if f=f1⋯fm with fi∈K(Vi). A polynomial p∈K[v] is said to be integer-linear in K[v]
if there exist r∈K[z] and a,b1,…,bn∈Z such that p=r(ax+b1y1+⋯+bnyn).
A polynomial p∈K[v] is said to be q-integer-linear in K[v]
if there exist r∈K[z] and a,b1,…,bn,s,t1,…,tn∈Z such that p=xsy1t1⋯yntnr(xay1b1⋯ynbn),
A rational function f=P/Q∈K(v) with P,Q∈K[v] and gcd(P,Q)=1 is said to be (q-)proper in K(v) if
Q is a product of (q-)integer-linear polynomials over K. Split polynomials and (q-)proper rational
functions will be used to state our existence criteria for telescopers in Section 4.
In the subsequent sections, we will study the existence of telescopers for rational functions in three variables.
More precisely, we consider the following problem.
Existence Problem for Telescopers.
For a rational function f∈K(x,y,z), decide the existence
of telescopers of type (∂x,Θy,Θz) for f.
Remark 2.6**.**
In the trivariate case, there are 18 different types of telescopers up to the symmetry among (Θy,Θz) which
are collected into six different classes in Table 2 according to different techniques used in the studies.
Different types of partial fraction decompositions will be
used in solving the existence problems of telescopers.
Let G=⟨θx,θy,θz⟩ be the free abelian group generated by the
operators θx,θy,θz with θv∈{σv,τq,v}.
Let f∈K(x,y,z) and H be a subgroup of G.
We call the set
[TABLE]
the H-orbit at f. Two elements f,g∈K(x,y,z) are said to be H-equivalent if [f]H=[g]H, denoted by f∼Hg. The relation
∼H is an equivalence relation in K(x,y,z). Let f=P/Q and g=A/B with P,Q,A,B∈K[x,y,z],
gcd(P,Q)=1 and gcd(A,B)=1.
If f∼Hg, then P∼HQ and A∼HB since any ψ∈H is an automorphism on K(x,y,z).
So detecting the H-equivalence among rational functions
can be reduced to that among polynomials. Two irreducible polynomials in distinct H-orbits are clearly coprime.
A nonzero rational function f∈K(x,y,z) is said to be (θx,θy,θz)-invariant if there exist m,n,k∈Z, not all zero, and c∈K∖{0} such that θxmθynθzk(f)=c⋅f. By comparing
the leading coefficients, the constant c in the above relation must be of the form qs for some s∈Z.
Moreover, c=1 if all θx,θy, and θz
are shift operators.
For any subgroup H of G and any polynomial Q∈K(x,y)[z], one can group all of irreducible factors in z of Q
into distinct H-orbits that leads to the factorization
[TABLE]
and the di’s are monic irreducible polynomials in distinct H-orbits. With respect to this factorization, we have the unique partial
fraction decomposition for a rational function f=P/Q∈K(x,y,z) of the form
[TABLE]
where p,ai,j,ℓ∈K(x,y)[z] satisfying that degz(ai,j,ℓ)<degz(di).
In the sequel, we will take different H according to different types of existence problems.
Example 2.7**.**
Consider the rational function of the form
[TABLE]
If H=⟨σy⟩, then we have the decomposition
[TABLE]
where d1=z2+2x+y, d2=z2+2qx+y and d3=z2+2qx+y+2z+2. Note that d1,d2,d3
are in distinct ⟨σy⟩-orbits. If H=⟨τq,x,σy⟩, then we have the different decomposition
[TABLE]
where d1,d3 are in distinct ⟨τq,x,σy⟩-orbits. If H=⟨τq,x,σy,σz⟩, then we have
another decomposition
[TABLE]
3 Reductions and Exactness Criteria
In this section, let F be any field of characteristic zero and will take F=K(x) in Section 4.
In order to detect the existence of telescopers, we first need to check whether 1 is a telescoper or not. This is equivalent to the following problem.
Exactness Testing Problem.
For a rational function f∈F(y,z), decide whether there exist g,h∈F(y,z) such that
[TABLE]
If such g,h exist, we say that f is (Θy,Θz)-exact in F(y,z).
Remark 3.1**.**
Since there are three choices for each operator in {Θy,Θz}
together with the symmetry between Θy and Θz, there are 6 different types of exactness testing problems, listed in Table 3.1.
The following lemma shows that the exactness is unchanged even when we are looking for the g and h
in a larger field.
Lemma 3.3**.**
Let f∈F(y,z).
Then f is (Θy,Θz)-exact in F(y,z)
if and only if it is (Θy,Θz)-exact in F(y,z).
Proof..
The sufficiency is obvious. For the necessity, we assume that there exist
u,v∈F(y,z) such that f=Θy(u)+Θz(v).
Let L be a finite normal extension of F(y,z) containing the u,v and Θy(u),Θz(v) and
let TrL/F(y,z) be the trace from L to F(y,z), which commutes with (q-)shift operators by (ChenSinger2014, , Lemma 3.1)
and also with derivations by (BronsteinBook, , Theorem 3.2.4 (i)). Then
[TABLE]
Since f∈F(y,z), we have TrL/F(y,z)(f)=mf with m=[L:F(y,z)].
Thus f=Θy(g)+Θz(h) with g=m1TrL/F(y,z)(u) and
h=m1TrL/F(y,z)(v) that are both in F(y,z).
Let E denote the set of all (Θy,Θz)-exact rational functions in F(y,z). Note that E
forms a subspace of F(y,z) viewed as an F-vector space.
Reduction algorithms have been developed in Chen2012 ; ChenSinger2014 ; HouWang2015 ; Chen2018 ; Wang2020
for simplifying rational functions modulo E and then reducing the exactness problem from general rational functions to
simple fractions. For later use, we summarize these reductions as follows.
3.1 The continuous case
For a rational function f∈F(y,z), the Ostrogradsky–Hermite reduction Ostrogradsky1845 ; Hermite1872 with respect to z
decomposes f into the form
[TABLE]
where g∈F(y,z) and a,b∈F(y)[z] with gcd(a,b)=1, degz(a)<degz(b)
and b being squarefree in z over F(y). Moreover, f=Dz(u) for some u∈F(y,z)
if and only if a=0. We recall the criterion on the (Dy,Dz)-exactness of bivariate rational functions from (Chen2012, , Lemma 4).
where αi,βi∈F(y) with βi=βj for i,j with 1≤i,j≤n and i=j.
Then f is (Dy,Dz)-exact in F(y,z) if and only if for each i
with 1≤i≤n, we have αi=Dy(γi) for some γi∈F(y).
The above lemma reduces the exactness problem in the differential case from bivariate rational functions
to univariate algebraic functions. Let α∈F(y) be an algebraic function over F(y)
with n:=[F(y,α):F(y)]. If α=Dy(β) for some β∈F(y), then
β∈F(y,α) by the trace argument as in the proof of Lemma 3.3. Assume that
β=b0+b1α+⋯+bn−1αn−1 with bi∈F(y). Then the equality
α=Dy(β) leads to a system of linear differential equations on the bi’s, whose rational solutions
can be computed by the method in Barkatou1999 . A generalization of the Ostrogradsky–Hermite reduction
to the algebraic case also solves the exactness problem of algebraic functions chen2016ISSACb .
3.2 The discrete cases
For any automorphism θ on F(y,z) and a,b∈F(y,z), we have
the reduction formula
[TABLE]
where g=∑i=0n−1θi(b)θi−n(a) if n≥0 and g=−∑i=0−n−1θn+i(b)θi(a) if n<0.
By using the above reduction formula, Abramov’s reduction in zAbramov1975 ; Abramov1995b decomposes f∈F(y,z) into the form
[TABLE]
where g∈F(y,z) and a,b∈F(y)[z] with gcd(a,b)=1, degz(a)<degz(b)
and b being shift-free in z over F(y), i.e., for any k∈Z∖{0} we have gcd(b,σzk(b))=1. Moreover, f=Δz(u) for some u∈F(y,z)
if and only if a=0. We use the reduction formula (7) with θ=σy to further decompose f as
[TABLE]
where u,v∈F(y,z), ai,j∈F(y)[z], and di∈F[y,z] are such that
degz(ai,j)<degz(di) and the di’s are irreducible polynomials in
distinct ⟨σy,σz⟩-orbits. We recall the criterion on the (Δy,Δz)-exactness of bivariate rational functions
by combining Lemma 3.2 and Theorem 3.3 in HouWang2015 .
Lemma 3.5**.**
Let f∈F(y,z) be of the form (9). Then
f is (Δy,Δz)-exact in F(y,z) if and only if for all i,j with 1≤i≤I, 1≤j≤Ji,
we have σymi(di)=σzni(di) for some mi,ni∈Z with mi>0 and ai,j=σymiσz−ni(bi,j)−bi,j
for some bi,j∈F(y)[z] with degz(bi,j)<degz(di).
In particular, if f is (Δy,Δz)-exact, so is each ai,j/dij.
For a rational function f∈F(y,z), Abramov’s reduction in z and its q-analogue in y
decompose f into
[TABLE]
where g,h∈F(y,z), ai,j∈F(y)[z], di∈F[y,z] satisfy that degz(ai,j)<degz(di)
and di’s are irreducible polynomials in distinct ⟨τq,y,σz⟩-orbits.
We recall the criterion on the (Δq,y,Δz)-exactness in F(y,z) from (Chen2018, , Theorem 3).
Lemma 3.6**.**
Let f∈F(y,z) be of the form (10).
Then f is (Δq,y,Δz)-exact in F(y,z) if and only if for each i∈{1,…,I},
di∈F[z] and for each j∈{1,…,Ji}, ai,j=Δq,y(bi,j) for some bi,j∈F(y)[z].
In particular, if f is (Δq,y,Δz)-exact, so is each ai,j/dij.
The q-analogue of Abramov’s reduction decomposes f∈F(y,z) into the form
[TABLE]
where g∈F(y,z), c∈F(y) and a,b∈F(y)[z] with gcd(a,b)=1, degz(a)<degz(b)
and b being q-shift-free in z over F(y), that is gcd(b,τq,zkb)=1 for any k∈Z∖{0}. Moreover, f=Δq,z(u) for some u∈F(y,z)
if and only if c=0 and a=0.
Applying the reduction formula (7) with θ=τq,y, we can further decompose f as
[TABLE]
where u,v∈F(y,z), c∈F(y), ai,j∈F(y)[z], and di∈F[y,z] are such that
degz(ai,j)<degz(di) and the di’s are irreducible polynomials in
distinct ⟨τq,y,τq,z⟩-orbits.
Then the (Δq,y,Δq,z)-exactness criterion of f can be given
by combining Lemma 3.6 and Theorem 3.8 in Wang2020 , which is a q-analogue of Lemma 3.5.
Lemma 3.7**.**
Let f∈F(y,z) be of the form (12).
Then f is (Δq,y,Δq,z)-exact in F(y,z) if and only if
c=Δq,y(h) for some h∈F(y)
and for all i,j with 1≤i≤I, 1≤j≤Ji, we have σymi(di)=qsiσzni(di) for some mi,ni,si∈Z with mi>0
and for the smallest positive integer mi, ai,j=q−jsiτq,ymiτq,z−ni(bi,j)−bi,j
for some bi,j∈F(y)[z] with degz(bi,j)<degz(di).
In particular, if f is (Δq,y,Δq,z)-exact, so is each ai,j/dij.
3.3 The mixed cases
For a rational function f∈F(y,z), applying the Ostrogradsky–Hermite reduction in z and the reduction
formula (7) with θ=θy∈{σy,τq,y}
to f yields
[TABLE]
where u,v∈F(y,z),ai∈F(y)[z],di∈F[y,z] with degz(ai)<degz(di)
and the di’s are irreducible polynomials in distinct ⟨θy⟩-orbits.
We recall the criterion on the (Θy,Dz)-exactness in F(y,z) from (Chen2018, , Theorem 2).
Lemma 3.8**.**
Let θy∈{σy,τq,y} and f∈F(y,z) be of the form (13).
Then f is (Θy,Dz)-exact in F(y,z) if and only if for each i∈{1,…,I},
di∈F[z] and ai=Θy(bi) for some bi∈F(y)[z].
In particular, if f is (Θy,Dz)-exact, so is each ai/di.
4 Existence Criteria
We will reduce the existence problem of telescopers in the trivariate case
to that in the bivariate case and two related problems. To this end,
we first recall the existence criteria
on telescopers for bivariate rational functions
from AbramovLe2002 ; Le2001 ; Abramov2003 ; ChenSinger2012 ; Chen2015 .
Theorem 4.1**.**
Let f(x,y) be a rational function in K(x,y). Then
(i)
Differential case (see (ChenSinger2012, , Theorem 4.5)): f always has a telescoper of type (Dx,Dy);
2. (ii)
Shift case (see (AbramovLe2002, , Theorem 1) or (ChenSinger2012, , Theorem 4.11)): f has a telescoper of type (Sx,Δy) if and only if f
is of the form f=Δy(g)+r for some g,r∈K(x,y) and r is proper in K(x,y).
3. (iii)
q-Shift case (see (Le2001, , Theorem 1) or (ChenSinger2012, , Theorem 4.15)):
f has a telescoper of type (Tq,x,Δq,y) if and only if f
is of the form f=Δq,y(g)+r for some g,r∈K(x,y) and r is q-proper in K(x,y).
4. (iv)
Mixed cases (see (ChenSinger2012, , Theorems 4.6, 4.7, 4.9, 4.12, 4.13, 4.14)): f has a telescoper of type (∂x,Θy)∈{(Sx,Dy),(Tq,x,Dy),(Dx,Δy),(Tq,x,Δy),(Dx,Δq,y),(Sx,Δq,y)} if and only if f
is of the form f=Θy(g)+r for some g,r∈K(x,y) and the denominator of r is split
with respect to the partition ({x},{y}).
Example 4.2**.**
Let f=1/(x+y). Then f has a telescoper of type (Dx,Dy), (Sx,Δy) and (Tq,x,Δq,y), but has
no telescoper in the mixed cases since x+y is not split.
Problem 4.3** (Shift Equivalence Testing Problem).**
Let F be any computable field of characteristic zero.
Given p∈F[x1,...,xn], decide whether there exist m1,…,mn∈Z with
m1>0 such that p(x1+m1,…,xn+mn)=p(x1,…,xn).
Problem 4.4** (q-Shift Equivalence Testing Problem).**
Let p∈F[x1,...,xn], decide if there exist m,m1,…,mn∈Z with
m1>0 such that p(qm1x1,…,qmnxn)=qmp(x1,…,xn).
This problem is much easier than the shift case, and an algorithm for testing q-shift equivalence has been given in Wang2020 .
Problem 4.5** (Separation Problem).**
Given an algebraic function α∈K(x,y), decide whether
there exists a nonzero operator L∈K(x)⟨Dx⟩ such that L(α)=0.
If such an operator exists, we say that α is separable in x and y.
As a special case of (Chen2014, , Proposition 10), a rational function in K(x,y) is separable
if and only if it is of the form a/(bc) with a∈K[x,y],b∈K[x] and c∈K[y].
This motivates the nomenclature of Problem 4.5.
We will study the separation problem in the forthcoming paper Chen2019 , in which an algorithm is presented for constructing such a differential annihilator L∈K(x)⟨Dx⟩ if it exists.
4.1 Existence problems of first class
In the pure differential setting, telescopers always exist for general D-finite functions
over K(v), which was proved by Zeilberger in 1990 using the elimination property of holonomic D-modules Zeilberger1990 .
For the sake of completeness, we will give a more direct proof for rational functions in K(v).
We first adapt Wegschaider’s “non-commutative trick” in (Wegschaider1997, , Theorem 3.2) to the differential case.
Lemma 4.6**.**
Let f∈K(x,y1,…,yn) and A∈K[x]⟨Dx,Dy1,…,Dyn⟩ be a nonzero operator such that A(f)=0.
Then there exists a nonzero operator L∈K[x]⟨Dx⟩
such that L(f)=Dy1(g1)+⋯+Dyn(gn) for some g1,…,gn∈K(x,y1,…,yn).
Proof..
We will follow the same argument in the proof of (Wegschaider1997, , Theorem 3.2).
We claim that for every ℓ∈{1,…,n+1}, there exist Qj,ℓ∈K[v]⟨Dx,Dyj,…,Dyn⟩
for each j∈{1,…,ℓ−1} and a nonzero Rℓ∈K[x]⟨Dx,Dyℓ,…,Dyn⟩ such that f
is annihilated by the operator
[TABLE]
The lemma follows from this claim since Rn+1 is the desired operator L∈K[x]⟨Dx⟩ with
gj:=−Qj,ℓ(f)∈K(v) for j∈{1,…,n}.
We prove the claim inductively: for ℓ=1 take P1=R1=A. Assume that for some
ℓ∈{1,…,n} we have a nonzero operator Pℓ of the form (14)
that annihilates f. We show that by division of Rℓ by Dℓ we can construct the operator Pℓ+1.
Since Dyℓ commutes with x and Dx,Dyℓ+1,…,Dyn,
we can write Rℓ=Dyℓm(Rℓ+1+DyℓM),
where m∈N, M∈K[x]⟨Dx,Dyℓ,…,Dyn⟩, and Rℓ+1
is a nonzero operator in K[x]⟨Dx,Dyℓ+1,…,Dyn⟩. For any w∈K[yℓ] of degree at most m, we have
[TABLE]
for some r∈K and Q~ℓ∈K[yℓ]⟨Dyℓ⟩. In particular, r=(−1)mm!=0 if we take w=yℓm.
Using the fact rDyi=Dyir for all i∈{1,…,n} and (15), we find
[TABLE]
Since Pℓ(f)=0, we have Pℓ+1(f)=0. So Pℓ+1 is the desired operator.
Theorem 4.7**.**
For any rational function f∈K(v), there exists a nonzero L∈K[x]⟨Dx⟩
such that L(f)=Dy1(g1)+⋯+Dyn(gn) for some g1,…,gn∈K(v).
Proof..
It suffices to show that there exists a nonzero A∈K[x]⟨Dx,Dy1,…,Dyn⟩
such that A(f)=0 by Lemma 4.6.
Write f=P/Q with P,Q∈K[v] and gcd(P,Q)=1.
Denote dx=max{degx(P),degx(Q)} and dyi=max{degyi(P),degyi(Q)} for i∈{1,…,n}.
Let WN be the K-vector space generated by the set
[TABLE]
over K.
By an easy combinatorial counting, the
dimension of WN is (n+2N+n+2)=O(Nn+2) over K.
Furthermore, for any (i,j0,…,jn)∈Nn+2, a direct calculation yields
[TABLE]
where Pi,j0,…,jn∈K[v] with degx(Pi,j0,…,jn)≤(i+j0+⋯+jn+1)dx+i and
[TABLE]
So the set WN(f) is included in the K-vector space VN spanned by the set
[TABLE]
whence the dimension of VN is (N+1)(dx+1)∏i=1n((N+1)dyi+1)=O(Nn+1) over K. Define
linear map ψ:WN→VN by ψ(L)=L(f) for any L∈WN.
For sufficiently large N, we have
[TABLE]
which implies that the kernel of ψ is nontrivial.
Therefore, there exists a nonzero operator A∈WN⊆K[x]⟨Dx,Dy1,…,Dyn⟩
such that A(f)=0.
Remark 4.8**.**
In the continuous setting, the existence of telescopers for rational functions
implies that for algebraic functions by (Chen2012, , Lemma 4). Efficient algorithms for computing
telescopers have been given in BCCL2010 ; Chen2012 ; BLS2013 ; Lairez2016 .
4.2 Existence problems of second class
We now solve the second class of existence problems
where telescopers are linear differential operators in K(x)⟨Dx⟩ and (Θy,Θz)∈{(Δy,Δz),(Δq,y,Δz),(Δq,y,Δq,z)}.
Problem 4.9**.**
Given f∈K(x,y,z), determine if there exists a nonzero operator L∈K(x)⟨Dx⟩ such that
L(f)=Θy(g)+Θz(h) for some g,h∈K(x,y,z).
For v∈{y,z}, let θv=σv if Θv=Δv or θv=τq,v if Θv=Δq,v.
By partial fraction decomposition w.r.t z and the transformation (7) with θ=θy and subsequently with θ=θz, any rational function f∈K(x,y,z) can be decomposed into
[TABLE]
where u,v∈K(x,y,z),μ∈K(x,y),ai,j∈K(x,y)[z],di∈K[x,y,z] with degz(ai,j)<degz(di), di’s are irreducible polynomials in distinct ⟨θy,θz⟩-orbits and none of nonzero ai,j/dij is (Θy,Θz)-exact.
The following theorem shows that Problem 4.9 can be reduced to the same problem but for simple fractions and bivariate rational functions.
Theorem 4.10**.**
Let f∈K(x,y,z) be of the form (17).
Then f has a telescoper of type (Dx,Θy,Θz) if and only if μ and the fraction ai,j/dij has a telescoper of the same type for all i,j with 1≤i≤I and 1≤j≤Ji.
Proof..
The sufficiency follows from Lemma 2.4.
For the necessity, when f has a telescoper of type (Dx,Θy,Θz), since Dx does not change the ⟨θy,θz⟩-equivalence of the denominators, one can deduce that μ and r=∑i=1I∑j=1Jidijai,j both have a telescoper of the same type.
Next we will show each fraction ai,j/dij has a telescoper of the same type when r has a telescoper.
To this end, we first show that Dx(di)=0, that is di∈K[y,z] for all 1≤i≤I.
Over the field K(x,y), we can decompose r as
[TABLE]
where u⋆,v⋆∈K(x,y)(z), αi,j,βi∈K(x,y) with αi,Ji′=0, z−βi and z−βi′ are not ⟨θy,θz⟩-equivalent for all i,i′ with 1≤i=i′≤I′.
It suffices to show Dx(βi)=0 for all i with 1≤i≤I′.
We will prove this claim by contradiction.
Suppose that Dx(βk)=0 for some 1≤k≤I′ and that L=∑ℓ=0ρeℓDxℓ∈K(x)⟨Dx⟩ with eρe0=0 is a telescoper for r⋆.
Then
[TABLE]
where Ji′ρ=Ji′(Ji′+1)⋯(Ji′+ρ−1) and α~i,j∈K(x,y).
As L(r⋆) is (Θy,Θz)-exact and Dx(βk)=0,
we have
[TABLE]
for some mk,nk,sk∈Z with mk>0 and
[TABLE]
for some γk∈K(x,y).
From the Equation (18), we know θymkDx(βk)=qskDx(βk).
Dividing Identity (19) by Jk′ρeρDx(βk)ρ gives
[TABLE]
Thus (z−βk)Jk′αk,Jk′ is (Θy,Θz)-exact in K(x,y)(z), and hence can be moved into u⋆ and v⋆.
Then by similar discussions as above, one can see (z−βk)jαk,j is (Θy,Θz)-exact for all j with 1≤j≤Ji.
Notice that βk is a root of dk for some 1≤k≤I and that
Dx(βk)=0 leads to Dx(β)=0 for any conjugate root β of dk.
Then all fractions of the form (z−β)jα in r⋆ are
also (Θy,Θz)-exact.
Collecting all these fractions together, we get dkjak,j is (Θy,Θz)-exact in K(x,y)(z) and hence in K(x,y,z) by Lemma 3.3, which contradicts the assumption that none of nonzero dijai,j in r is not exact.
At this stage we have proved di∈K[y,z].
Since L is also a telescoper for r. Then
[TABLE]
for some g,h∈K(x,y,z).
Notice that di’s are in distinct ⟨θy,θz⟩-orbits,
[TABLE]
for some gi,j,hi,j∈K(x,y,z).
So L is a telescoper for all ai,j/dij with 1≤i≤I and 1≤j≤Ji.
Notice that for μ∈K(x,y), having telescopers of type (Dx,Θy,Θz) or (Dx,Θy) are equivalent.
As the existence problem of telescopers for bivariate rational functions has been settled by Theorem 4.1,
we only need to decide when f=dja,
where a∈K(x,y)[z],d∈K[x,y,z] with degz(a)<degz(d) and d being irreducible, has telescopers of type (Dx,Θy,Θz).
Same argument as in the proof of Theorem 4.10 implies that f has a telescoper of type (Dx,Θy,Θz) only when d is free of x. Assume d∈K[y,z] and L∈K(x)⟨Dx⟩ is a telescoper of f.
Then L(f)=djL(a) is (Θy,Θz)-exact.
We will proceed by checking whether the two conditions for the exactness in
Lemma 3.5, 3.7 and 3.6 are satisfied.
If θym(d)=qtθzn(d) whenever m,n,t∈Z and m>0, then we have L(a)=0 which can be reduced to solving the separation problem of bivariate rational functions and settled via GCD computations.
If θym(d)=qtθzn(d) for some m,n,t∈Z with m being the smallest positive integer, then
L(a) satisfies an equation.
Next we will show how to solve the equation for different (θy,θz) separately.
(1)
When (θy,θz)=(σy,σz).
Lemma 3.5 shows that L(x,Dx)(a)=σymσz−n(b)−b for some b∈K(x,y)[z] with degz(b)<degz(d).
Taking yˉ=y/m and zˉ=ny+mz shows
L(x,Dx)(a)=σymσz−n(b)−b is equivalent to the existence problem of telescopers of type (Dx,Δy) for bivariate rational functions, which has been solved by Theorem 4.1.
(2)
When (θy,θz)=(τq,y,σz), Lemma 3.6 leads to L(a)=Δq,y(b), which is the existence problem of telescopers of type (Dx,Δq,y) solved by Theorem 4.1.
(3)
When (θy,θz)=(τq,y,τq,z), by Lemma 3.7 we know
L(x,Dx)(a)=q−jtτq,ymτq,z−n(b)−b for some b∈K(x,y)[z] with degz(b)<degz(d).
Define an F-homomorphism φ of F(y,z) by y↦ym,z↦y−nz. Then the q-difference equation can also be simplified.
Proposition 4.11**.**
Given a rational function f∈F(y,z) and integers m,n,s∈N with m>0.
Then f=qsτq,ymτq,z−n(g)−g for some g∈F(y,z) if and only if φ(f)=qsτq,y(h)−h for some h∈F(y,z).
Proof..
Let τ=τq,ymτq,z−n.
The necessity follows from the fact that φ∘τ=τq,y∘φ.
For the sufficiency, define ψ:F(y,z)→F(y,z) by y↦y1/m,z↦yn/mz, where F(y,z) is the algebraic closure of F(y,z).
It is easy to see ψ∘φ=IdF(y,z) and ψ∘τq,y=τ∘ψ, where τq,y is extended to F(y,z).
Thus φ(f)=qsτq,y(h)−h implies f=qsτq,ymτq,z−n(g~)−g~ with g~=ψ(h)∈F(y,z).
By similar trace arguments used in Lemma (3.3), one can see
f=qsτq,ymτq,z−n(g~)−g~ if and only if f=qsτq,ymτq,z−n(g)−g for some g∈F(y,z).
At this stage, by letting yˉ=y1/m and zˉ=yn/mz, we only need to decide whether L(aˉ)=q−jtτq,y(bˉ)−bˉ for some bˉ∈K(x,y,z), which can be determined by a similar discussion process as the existence problem of telescopers of type (Dx,Δq,y).
4.3 Existence problems of third class
We now consider the third class of the existence problems of telescopers for
rational functions in three variables.
Problem 4.12**.**
Given f∈K(x,y,z), decide whether there exists a nonzero operator L in K(x)⟨∂x⟩ with ∂x∈{Sx,Tq,x}
such that L(f)=Dy(g)+Dz(h)
for some g,h∈K(x,y,z).
Let f∈F(y,z) be of the form (6) with F=K(x).
If f is (Dy,Dz)-exact in K(x,y,z), then 1 is a telescoper for f.
From now on, we assume that f is not (Dy,Dz)-exact. Let (∂x,θx)∈{(Sx,σx),(Tq,x,τq,x)}.
By dividing the roots of b in K(x,y) into different ⟨θx⟩-orbits, we can write f as f=Dz(u)+r with u∈F(y,z)
and
[TABLE]
where αi,j,βi∈K(x,y) and the βi’s are in distinct ⟨θx⟩-orbits.
Note that f has a telescoper of type (∂x,Dy,Dz) if and only if r has a telescoper of the same type.
Lemma 4.13**.**
Let r=∑j=0Jαj/(z−θxj(β)) with αj,β∈K(x,y) and
θxm(β)=β for any m∈Z∖{0}.
Then r is (Dy,Dz)-exact if it has a telescoper of type (∂x,Dy,Dz).
Proof..
Assume that L=∑ℓ=0ρeℓ∂xℓ∈K(x)⟨∂x⟩ with e0=0 is a telescoper for r
of type (∂x,Dy,Dz). Then
[TABLE]
where u,v∈K(x,y)(z) and α~j=∑k=0jekθxk(αj−k) with ek=0 for k>ρ
and αj=0 for j>J.
Since θxm(β)=β whenever m∈Z∖{0}, for each 1≤j≤J+ρ we have
α~j=Dy(γ~j) for some γ~j∈K(x,y) by Lemma 3.4.
We now prove inductively that for each j with 0≤j≤J, αj=Dy(γj) for some γj∈K(x,y).
Since α~0=e0α0 and e0∈K(x)∖{0}, we have α0=Dy(γ0) with γ0=γ~0/e0.
Suppose that we have shown that αj=Dy(γj) for j=0,…,k−1 with k≤J.
Note that α~k=e0αk+e1θx(αk−1)+⋯+ekθxk(α0)=Dy(γ~k).
Then αk=Dy(γk) with γk=e01(γ~k−∑j=1kejθxj(γk−j)).
So r is (Dy,Dz)-exact by Lemma 3.4.
Theorem 4.14**.**
Let r∈K(x,y,z) be of the form (20).
Then r has a telescoper of type (∂x,Dy,Dz) if and only if for each i with 1≤i≤I, either αi,j/(z−θxj(βi))
is (Dy,Dz)-exact or βi∈K(y) and there exists a nonzero Li,j∈K(x)⟨∂x⟩ such that
Li,j(αi,j)=Dy(γi,j) for some γi,j∈K(x,y)(βi).
Proof..
The sufficiency follows from Lemma 2.4 since each fraction αi,j/(z−θxj(βi))
is either (Dy,Dz)-exact or has a telescoper of type (∂x,Dy,Dz). To show the necessity, we assume that
L=∑ℓ=0ρeℓ∂xℓ∈K(x)⟨∂x⟩ with e0=0 is a telescoper
for r of type (∂x,Dy,Dz).
Then we have
[TABLE]
where u,v∈K(x,y,z) and α~i,j=∑k=0jekθxk(αi,j−k) with ek=0 for k>ρ
and αi,j=0 for j>Ji. By Lemma 3.4, we have ri=∑j=0Ji+ρz−θxj(βi)α~i,j
is (Dy,Dz)-exact for each i with 1≤i≤I since the βi’s are in distinct ⟨θx⟩-orbits.
If there exists a nonzero mi∈N such that θxmi(βi)=βi, then βi∈K(y) by (ChenSinger2012, , Lemma 3.4 (i)). So
Ji=0 and L(αi,0/(z−βi))=L(αi,0)/(z−βi) is (Dy,Dz)-exact, which implies that L(αi,0)=Dy(γi,0)
for some γi,0∈K(x,y). Since αi,0∈K(x,y)(βi), we can choose γi,0∈K(x,y)(βi) by the trace argument.
If there is no nonzero mi∈N such that θxmi(βi)=βi, then the theorem follows from Lemma 4.13.
Problem 4.12 now has been reduced to the exactness testing problem and the following existence problem.
Problem 4.15**.**
Given α∈K(x,y)(β) with β algebraic over K(y), decide whether α has a telescoper
of type (∂x,Dy) with ∂x∈{Sx,Tq,x}, i.e.,
there exists a nonzero L∈K(x)⟨∂x⟩
such that L(α)=Dy(γ)
for some γ∈K(x,y)(β).
In order to solve the above problem, we first present a vector version of the Hermite-like reduction in GeddesLeLi2004 . Let a=d1(a1,…,an)∈K(x,y)n with ai,d∈K[x,y] satisfying that gcd(d,a1,…,an)=1
and B=e1(bi,j)∈K(x,y)n×n with e,bi,j∈K[x,y] such that gcd(e,b1,1,…,b1,n,…,bn,n)=1.
Let p∈K[x,y] be any irreducible factor of d that is coprime with e. Then d=pmd1 with d1∈K[x,y] and gcd(p,d1)=1.
Since gcd(p,Dy(p))=1, we have gcd(p,Dy(p)d1)=1 and then the Bézout relation
[TABLE]
where si,ti∈K(x)[y].
Using integration by parts, we get
[TABLE]
where ui=ti(1−m)−1 and vi=si−(1−m)−1Dy(ti)d1.
Let u=(u1,…,un) and v=(v1,…,vn).
Then we have
[TABLE]
where w∈K(x)[y]n. Repeating this process yields
[TABLE]
where g,h∈K(x)[y]n. By reducing the multiplicity of each irreducible factor of d that is coprime with e in the above way, we obtain
the additive decomposition
[TABLE]
where b∈K(x,y)n and r=pc1(r1,…,rn) with ri∈K(x)[y]
and p,c∈K[x,y] be such that p is a squarefree polynomial and gcd(p,e)=1 and each irreducible factor of c divides e.
We call the above process
a vector Hermite reduction of a with respect to B.
Let β∈K(y) and n=[K(y,β):K(y)].
Assume that {β1,…,βn} is a basis for K(y,β)
as a linear space over K(y).
Since Dy(βi)∈K(y,β), we have
Dy(βi)=e1∑j=1nbj,iβj with e,bj,i∈K[y]. Set B=e1(bi,j)∈K(y)n×n. Then
Dy(β)=β⋅B with β=(β1,…,βn).
Since α∈K(x,y)(β), we can write
α=a⋅βT for some a=d1(a1,…,an)∈K(x,y)n with d,ai∈K[x,y].
Applying the vector Hermite reduction to a with respect to B yields the additive decomposition (21), which is equivalent to
[TABLE]
where ri,p,c∈K[x,y] with p being squarefree and gcd(p,e)=1 and each irreducible factor of c divides e∈K[y].
Theorem 4.16**.**
Let α∈K(x,y)(β) be of the form (22).
Then α has a telescoper
of type (∂x,Dy) if and only if the polynomial p in (22) is split in x and y.
Proof..
Assume that p is split in x and y, i.e., p=p1p2 for some p1∈K[x] and p2∈K[y].
Then α~ can be written as α~=∑j=1mfj⋅gj with fj∈K(x) and gj∈K(y)(β)
since βi∈K(y)(β) and c∈K[y]. Let Lj=fj(x)∂x−θx(fj)∈K(x)⟨∂x⟩ for each 1≤j≤m. Then Lj(fj⋅gj)=0.
So the LCLM of the Lj’s annihilates α~, which then is a telescoper for α of type (∂x,Dy).
To show the necessity, we assume that L=∑ℓ=0ρeℓ∂xℓ∈K(x)⟨∂x⟩ with e0eρ=0 is a telescoper
for α of type (∂x,Dy).
Then L(α~)=Dy(γ~) for some γ~∈K(x,y)(β).
Write γ~=s⋅βT with s∈K(x,y)n
and r=(r1,…,rn).
Then we have
[TABLE]
Suppose that p is not split in x and y. Then there exists a non-split irreducible factor p0 of p such that θx(p0)∤p.
Then θxρ(p0) is also a non-split irreducible polynomial and only divides the denominator θxρ(p)c.
Since p is squarefree, the valuation of the left-hand side of the
above equality at θxρ(p0) is −1. However, the valuation of the right-hand side is either ≥0 or <−1 since B∈K(y)n×n. This
leads to a contradiction. So p is split in x and y.
Example 4.17**.**
Let f=x/(z2−y). Then
[TABLE]
where α=x/(2y) and β=y. By Theorem 4.14, f has a telescoper of type (∂x,Dy,Dz)
since β∈K(y) and L=x∂x−θx(x) is a telescoper for α of type (∂x,Dy).
Indeed, L is also a telescoper for f of type (∂x,Dy,Dz).
4.4 Existence problems of fourth class
We continue to address the fourth class of the existence problems of telescopers for
rational functions in three variables. There are four cases in this class.
Problem 4.18**.**
Let ∂x∈{Sx,Tq,x} and Θy∈{Δy,Δq,y}.
Given f∈K(x,y,z), decide whether there exists a nonzero operator L∈K(x)⟨∂x⟩
such that L(f)=Θy(g)+Dz(h) for some g,h∈K(x,y,z).
Let (∂v,θv)∈{(Sv,σv),(Tq,v,τq,v)} for v∈{x,y}.
By the Ostrogradsky–Hermite reduction in z and the reduction formula (7) with σ=θy, we can decompose
f as
[TABLE]
with ai,j∈K(x,y)[z] and di∈K[x,y,z] satisfying the condition degz(ai,j)<degz(di)
and the di’s are irreducible polynomials in distinct ⟨θx,θy⟩-orbits.
Note that f has a telescoper of type (∂x,Θy,Dz)
if and only if r does.
Lemma 4.19**.**
Let r∈K(x,y,z) be as in (23). Then r has a telescoper of type (∂x,Θy,Dz)
if and only if for each i with 1≤i≤I, we have ri=∑j=0Jiθxj(di)ai,j
has a telescoper of the same type.
Proof..
The sufficiency follows from Lemma 2.4. For the necessity we assume that L=∑k=0ρℓk∂xk∈K(x)⟨∂x⟩ with ∂x∈{Sx,Tq,x} and ℓ0=0
is a telescoper for r of type (∂x,Θy,Dz). Then
[TABLE]
with ℓk=0 if k>ρ and ai,j=0 if j>Ji is (Θy,Dz)-exact.
Since the di’s are in distinct ⟨θx,θy⟩-orbits, the θxj(di)’s are
in distinct ⟨θy⟩-orbits. By Lemma 3.8, we have L(ri) is (Θy,Dz)-exact for each i with 1≤i≤I. So each ri has a telescoper of the same type.
Now the existence problem is reduced to that for rational functions of the form
[TABLE]
where ai∈K(x,y)[z],d∈K[x,y,z] with degz(ai)<degz(d) and d is irreducible in z over K(x,y).
We will proceed by a case distinction according to whether or not d satisfies the condition:
there exist c∈K∖{0} and integers m,n with m>0 such that
[TABLE]
Note that the constant c in (25) must be 1
if (θx,θy)∈{(σx,σy),(σx,τq,y),(τq,x,σy)} by the comparison of leading coefficients.
When (θx,θy)=(τq,x,τq,y), we claim that c=qs for some s∈Z. To show this claim, we write
d=∑i,j,kci,j,kxiyjzk. Then the equality τq,xm(d)=cτq,yn(d)
implies that for all i,j, we have c=qim−jn. Let s=gcd(m,n). Then m=smˉ and n=snˉ. For different pairs (i1,j1) and (i2,j2)
with qi1m−j1n=qi2m−j2n, we have i1m−j1n=i2m−j2n since q is not a root of unity, which further implies that
(i2,j2)=(i1,j1)+λ(nˉ,mˉ) for some nonzero λ∈Z. Thus d=xi0yj0dˉ, where i0,j0∈Z and dˉ=∑k=0ρdk(xnˉymˉ)zk with dk∈K[T]. Since τq,xm(dˉ)=τq,yn(dˉ), we have c=qi0m−j0n.
Combing the above discussions with (chen2019wz, , Proposition 1) yields a characterization of polynomials satisfying the condition (25).
Lemma 4.20**.**
Let d=∑i=0ρdizi∈K(x,y)[z] be a polynomial in z over K(x,y).
If there exist c∈K∖{0} and m,n∈Z with m>0 such that θxm(d)=c⋅θyn(d), then for each i with
0≤i≤ρ we have
if (θx,θy)=(σx,σy), then c=1 and di is integer-linear in x and y, i.e., di=f(nx+my) for some f∈K(z);
2. 2.
if (θx,θy)=(σx,τq,y) or (τq,x,σy), then c=1 and di∈K(y) and di∈K if n=0;
3. 3.
if (θx,θy)=(τq,x,τq,y), then c=qs for some s∈Z and di is q-integer-linear in x and y, i.e., di=xn0ym0fi(xnym) for some fi∈K(z) and n0,m0∈Z.
By the above characterization, the condition (25) can be checked by solving the bivariate case of
Problems 4.3 and 4.4 in the pure shift and q-shift cases, respectively.
Lemma 4.21**.**
Let f∈K(x,y,z) be of the form (24) and d does not satisfy the condition (25). Then
f has a telescoper of type (∂x,Θy,Dz)
if and only if f is (Θy,Dz)-exact.
Proof..
The sufficiency is clear by definition.
Assume that L=∑k=0ρℓk∂xk with ℓ0=0
is a telescoper for f of type (∂x,Θy,Dz). Then we have that
[TABLE]
is (Δy,Dz)-exact, where ℓj=0 if j>ρ and ai=0 if i>I.
Since d does not satisfy the condition (25), we have θxi(d) and θxi′(d) in distinct ⟨θy⟩-orbits for all i=i′.
By Lemma 3.8, for any i with 0≤i≤ρ+I, there exist ui,vi∈K(x,y,z) such that
[TABLE]
To show that all fractions ai/θxi(d) are (Θy,Dz)-exact, we proceed by induction.
The assertion is true for i=0 since a0/d=Θy(u0/ℓ0)+Dz(v0/ℓ0). Suppose that we have
shown that ai/θxi(d) is (Θy,Dz)-exact for i=0,…,s−1 with s≤I. By the equality (26) with i=s,
we get
[TABLE]
By the commutativity between θx and θy,δz and Lemma 3.8, we have a/θxi(d) is (Θy,Dz)-exact
for any i∈N if a/d is.
By the induction hypothesis, we have ℓ0ℓjθxj(as−j/θxs−j(d)) is (Θy,Dz)-exact
for all 1≤j≤s. So are as/θxs(d) and f.
We now deal with the case in which d satisfies the condition (25).
From now on, we will always assume that m is the smallest positive integer such
that θxm(d)=c⋅θyn(d) for some n∈Z and c∈K∖{0}.
By the reduction formula (7) with σ=θy, the existence problem is further reduced to
that for rational functions of the form
[TABLE]
where ai∈K(x,y)[z],d∈K[x,y,z]
with degz(ai)<degz(d) and d is irreducible in z over K(x,y).
The following lemma is similar to Lemma 5.3 in Chen2016 .
Lemma 4.22**.**
Let f∈K(x,y,z) be of the form (27) and d satisfy the condition (25). Then
f has a telescoper of type (∂x,Θy,Dz)
if and only if for each i with 0≤i≤I, the fraction ai/θxi(d) has a telescoper of the same type.
Proof..
The sufficiency follows from Lemma 2.4.
For the necessity direction, one can adapt the second part of the proof of (Chen2016, , Lemma 5.3) to the setting of telescopers of type (∂x,Θy,Dz)
literally by interpreting ≡y,z0 as being (Θy,Dz)-exact.
The above lemma further reduces the existence problem to that for simple fractions of the form
[TABLE]
where a,d∈K[x,y,z],b∈K[x,y] satisfy that gcd(a,bd)=1 and degz(a)<degz(d), and
d is irreducible and satisfies the condition (25).
We will consider two cases according to whether d is in K[x,z] or not.
If d∈K[x,z], then θyi(d)=d for all i∈N.
The condition θxm(d)=θyn(d) implies that d is also free of x,
i.e., d∈K[z]. Thus L∈K(x)⟨∂x⟩ is a telescoper for f of type
(∂x,Θy,Dz) if and only if L(a/b)=Θy(u) for some u∈K(x,y)[z]
with degz(u)<degz(d). Write a=∑i=0degz(d)−1aizi
and u=∑i=0degz(d)−1uizi. Then for each i with 0≤i≤degz(d)−1, we have
L(ai/b)=Θy(ui), i.e., L is a telescoper for all ai/b of type (∂x,Θy).
The existence problem is then reduced to that in the bivariate case, for which Theorem 4.1 applies.
So it remains to deal with the case when d is not in K[x,z].
Lemma 4.23**.**
Let τ:=θxmθy−n with m,n∈Z and m>0 and let p∈K[x,y] be an irreducible polynomial.
If τi(p)=λ⋅p for some nonzero i∈Z and nonzero λ∈K, then τ(p)=μ⋅p for some
nonzero μ∈K.
Proof..
We prove by cases. Write p=∑i,jpi,jxiyj with pi,j∈K. If (θx,θy)=(σx,σy), then τi(p)=λ⋅p
implies that λ=1 by comparing the leading coefficients. So σxim(p)=σyin(p). By Lemma 4.20, we have p=r(inx+imy)
for some r=∑j=0srjzj∈K[z]. Thus p=r~(nx+my) with r~=∑j=0srjijzj, which implies that τ(p)=p.
If (θx,θy)=(σx,τq,y), then τi(p)=λ⋅p
implies that p∈K[y] and moreover p=c⋅y for some c∈K if n=0 by (Chen2015, , Lemma 5.4), which leads to that τ(p)=μ⋅p with μ=q.
If (θx,θy)=(τq,x,σy), then τi(p)=λ⋅p
implies that p∈K[y] and moreover p∈K if n=0 by (Chen2015, , Lemma 5.4).
Then we have τ(p)=p. If (θx,θy)=(τq,x,τq,y), then τi(p)=λ⋅p
implies that p=(xsyt)⋅r(xinyim) for some s,t∈Z and r∈K[z] by (DuLi2019, , Lemma 5.2).
So we have τ(p)=μ⋅p with μ=qsm−nt. This completes the proof.
Lemma 4.24**.**
Let τ:=θxmθy−n with m,n∈Z and m>0 and let f=a/b with a,b∈K[x,y] and gcd(a,b)=1.
If there exist e0,…,er∈K(x), not all zero, such that ∑i=0reiτi(f)=0, then
b=b1b2 with b1∈K[x] and b2∈K[x,y] satisfying that τ(b2)=λ⋅b2 for some nonzero λ∈K.
Proof..
Assume that ∑i=0reiτi(f)=0.
Let b1 and b2 be the content and primitive part of b as a polynomial in y over K[x].
If b2 is a constant in K, then the assertion holds since τ(b2)=b2.
We now assume that b2∈/K.
Then all of its irreducible factors have positive degree in y.
Assume that there exists an irreducible factor p of b2 such that τ(p)=c⋅p for any c∈K.
Then for any integer i=0, τi(p)=ci⋅p for any ci∈K by Lemma 4.23.
Among all of such irreducible factors, we can always find one factor
p of multiplicity m such that τi(p)∤b2 for all integer i<0.
Then τi(p) is also irreducible for all i∈Z and gcd(τi(p),τj(p))=1
if i=j. Let s be the largest integer such that τs(p)∣b2. Then the irreducible polynomial τr+s(p)
only divides the denominator τr(b) and not others, which implies that ∑i=0reiτi(f)=0 since p depends on y and the coefficients ei are in K(x). This leads to a contradiction. So for each irreducible factor p of b2 we have τ(p)=c⋅p for some c∈K.
This implies that τ(b2)=λ⋅b2 for some λ∈K.
Lemma 4.25**.**
Let a∈K(x)[y,z] and b∈K[x,y,z] be such that b=0 and θxm(b)=c⋅θyn(b) for some c∈K∖{0} and m,n∈Z with m>0.
Then a/b has a telescoper of type (∂x,Θy,Dz).
Proof..
Set f=a/b. It suffices to show that for sufficiently large I∈N,
there exist ℓ0,…,ℓI∈K(x), not all zero, and g∈K(x,y,z) such that
L(f)=Θy(g) with L=∑i=0Iℓi∂xim. By the reduction formula (7) with σ=θy, we have
[TABLE]
for some gi∈K(x,y,z). Note that the degrees of the polynomials θy−inθxim(a) in y and z are the same as that of a.
So all the polynomials θy−inθxim(a) lie in a finite dimensional linear space over K(x). Therefore, for sufficiently large I,
there exist ℓ0,…,ℓI∈K(x), not all zero, such that ∑i=0Iℓiθy−inθxim(a)=0. This implies that
L is a telescoper for f of type (∂x,Θy,Dz).
Theorem 4.26**.**
Let f∈K(x,y,z) be of the form (28). Assume that
d is not in K[x,z].
Then f has a telescoper of type (∂x,Θy,Dz)
if and only if b=b1b2 for some b1∈K[x] and b2∈K[x,y] satisfying θxm(b2)=λ⋅θyn(b2)
for some nonzero λ∈K.
Proof..
The sufficiency follows from Lemma 4.25. For the necessity, we assume that L∈K(x)⟨∂x⟩
is a telescoper for f of type (∂x,Θy,Dz). Write L=L0+L1+⋯+Lm−1 with Li=∑j=0riℓi,j∂xjm+i.
Since θxi(d) and θxj(d) are in distinct ⟨θy⟩-orbits for all 0≤i=j≤m−1, Lemma 3.8 implies that
Li is also a telescoper for f of the same type for each i with 0≤i≤m−1. A direct calculation yields
[TABLE]
where A=∑j=0r0c−jℓ0,jτj(a/b) with τ=θy−nθxm and τ(d)=c⋅d. By Lemma 3.8, we have A=0 since d∈/K[x,z].
So the necessity follows from Lemma 4.24.
Example 4.27**.**
Let f=1/(bd) with b=x+y and d=z2−x−y. Note that d satisfies the condition σx(d)=σy(d) and is not in K[x,z].
By Theorem 4.26, f has a telescoper of type (Sx,Δy,Dz) since b satisfies the same condition as d.
Indeed, L=Sx−1 is a telescoper for f since L(f)=Δy(f)+Dz(0).
4.5 Existence problems of fifth class
We now consider the fifth class of existence problems in which both telescopers and
(Θy,Θz) are involving (q-)shift operators. In this class, we let
∂x∈{Sx,Tq,z} and (Θy,Θz)∈{(Δy,Δz),(Δq,y,Δz),(Δq,y,Δq,z)}. More precisely, we
solve the following problem.
Problem 4.28**.**
Given f∈K(x,y,z), determine if there exists a nonzero operator L∈K(x)⟨∂x⟩ such that
L(f)=Θy(g)+Θz(h) for some g,h∈K(x,y,z).
For v∈{x,y,z}, let θv=σv if Θv=Δv or θv=τq,v if Θv=Δq,v.
By partial fraction decomposition w.r.t z and the transformation (7) with θ=θy and subsequently with θ=θz, any rational function f∈K(x,y,z) can be decomposed into
[TABLE]
where u,v∈K(x,y,z),μ∈K(x,y),ai,j,ℓ∈K(x,y)[z],di∈K[x,y,z] with degz(ai,j,ℓ)<degz(di), di’s are
irreducible polynomials in distinct ⟨θx,θy,θz⟩-orbits, θxℓdi and θxℓ′di
are not ⟨θy,θz⟩-equivalent for any 1≤i≤I, 0≤ℓ,ℓ′≤ti,j with ℓ=ℓ′.
Then by similar discussions as the proof of Lemma 5.2 and Lemma 5.3 in Chen2016 , we can obtain the following result.
Lemma 4.29**.**
Let f∈K(x,y,z) be of the form (29).
Then f has telescopers of type (∂x,Θy,Θz) if and only if
μ and all θxℓdijai,j,ℓ with 1≤i≤I,1≤j≤Ji and 0≤ℓ≤ti,j have telescopers of the same type.
Notice that for μ∈K(x,y), having telescopers of type (∂x,Θy,Θz) and (∂x,Θy) are equivalent.
The existence problem of bivariate rational functions has been solved by Theorem 4.1.
Thus Problem 4.28 for a general rational function has been reduced to that for a rational function of the form
[TABLE]
where λ∈N∖{0}, c∈K[x,y], b,d∈K[x,y,z] with 0≤degz(b)<degz(d).
Suppose α(x)∈K(x)∖{0}.
It is easy to check that
[TABLE]
whenever ai(x)∈K(x) and f∈K(x,y,z).
This means the existence problem of f is equivalent to that of αf.
As such we can assume in the form (30) that b,c,d are all primitive in y,z.
If f is (Θy,Θz)-exact.
Then L=1 is a telescoper for f.
From now on, we will also assume f is not (Θy,Θz)-exact.
Lemma 4.30**.**
Let f∈K(x,y,z) be of the form (30).
If f has a telescoper of type (∂x,Θy,Θz) then
[TABLE]
Proof..
We prove the claim by contradiction.
Suppose the condition (31) does not hold.
Assume that L=∑i=0Iai∂xi∈K(x)⟨∂x⟩ with a0=0 is a telescoper for f.
Then
[TABLE]
for some g,h∈K(x,y,z).
By assumption, we know θxid’s are in distinct ⟨θy,θz⟩-orbits, Lemmas 3.5, 3.7 and 3.6 show that
for any 0≤i≤I, θxi(c)θxi(dλ)aiθxi(b) are (Θy,Θz)-exact.
Particularly,
[TABLE]
As a0∈K(x)∖{0}, we get cdλb=Θy(a0g0)+Θz(a0h0) which contradicts to the assumption that f is not (Θy,Θz)-exact.
This completes the proof.
Next, we will proceed by case distinction according to whether or not
[TABLE]
Theorem 4.31**.**
Let f∈K(x,y,z) be of the form (30) and d satisfy the condition (31) but not the condition (32).
Then f has a telescoper of type (∂x,Θy,Θz) if and only if
[TABLE]
for the (m,n) as in (31) and some t,s2∈Z with t>0.
Proof..
For the sufficiency, assume that c satisfies the condition (33).
Then set
L=∑i=0Iai∂xitm,
where I∈N and ai∈K(x) are to be determined.
Applying the reduction formula (7) yields
[TABLE]
for some u,v∈K(x,y,z).
Note that the degrees of the polynomials θxitmθy−itnθz−itk(b) in y or z are the same as that of b.
Thus all shifts of b lie in a finite dimensional linear space over K(x).
If I is large enough, then there always exist ai∈K(x), not all zero, such that
∑i=0Iaiq−is2−itsθxitmθy−itnθz−itk(b)=0.
As a result L=∑i=0Iai∂xitm is a telescoper for f.
For the necessity, assume f=c(x,y)d(x,y,z)λb(x,y,z) has a telescoper L1 of type (∂x,Θy,Θz).
Let C1 be the maximal factor of c satisfying the condition (33) and C2=c/C1.
If C2∈K then we have done.
Now assume that C2∈K.
Then degy(C2)>0 since c is primitive with respect to y,z.
It follows that there exist B1,B2∈K[x,y,z] with degz(Bi)<degz(d) and gcd(Bi,Ci)=1 for i=1,2, such that
[TABLE]
Then C1dλB1 has a telescoper L2 of type (∂x,Θy,Θz) by the sufficiency.
The least common left multiple of L1 and L2 is a telescoper for C2dλB2.
Since d satisfies the condition (31), we can assume
L=∑i=0Iai∂xim∈K(x)⟨∂x⟩ with a0aI=0 to be a telescoper for C2dλB2. Thus
[TABLE]
for some u,v∈K(x,y,z).
Notice that L(C2dλB2) is (Θy,Θz)-exact and that d does not satisfy the condition(32).
Then Lemma 3.5, 3.7 and 3.6 lead to
[TABLE]
Let Λ={cj∈K[x,y]∖K[x]∣cj is an irreducible factor of C2}.
Then Λ is nonempty and finite and none of cj satisfies condition (33) by the maximality of C1.
By the method of proof by contradiction, one can prove that there exists a cℓ∈Λ such that
cℓ=qs′θximθy−incj for any
cj∈Λ and s′,i∈Z with i>0.
This fact together with equation (35) and the constraint gcd(B2,C2)=1 derive B2=0, which concludes the proof.
Lemma 4.32**.**
Let f∈K(x,y,z) be of the form (30) and d satisfy conditions (31) and (32).
Suppose
[TABLE]
Then f has a telescoper of type (∂x,Θy,Θz).
Proof..
Since d satisfies both (31) and (32), without lose of generality, we assume m,n1 are the smallest positive integers.
Let m0=mm2n1 and
L=∑i=0Iai∂xim0,
where I∈N and ai∈K(x) are to be determined.
Then
[TABLE]
where u,v∈K(x,y,z),
α=−ims2n1−ism2n1−i(m2n−mn2)s1
and
β=ikm2n1+i(m2n−mn2)k1.
Since the (q-)shift operators do not change the degree of b,
when I is large enough, we can find nontrivial solutions ai such that
[TABLE]
Then identity (37) leads to the fact that L=∑i=0Iai∂xim0 is a telescoper for f.
Theorem 4.33**.**
Let f be of the form (30) and assume that d satisfies conditions (31) and (32).
Then f has a telescoper of type (∂x,Θy,Θz) if and only if f can be decomposed into the form
[TABLE]
where B1,B2∈K[x,y,z], C1,C2∈K[x,y] satisfy the following two constrains: (1) C1 satisfies the condition (36);
(2) B2/(C2dλ)
is (Θy,Θz)-exact.
Proof..
The sufficiency follows from Lemma 4.32.
For the necessity, let C1 be the maximal factor of c satisfying the condition (36) and C2=c/C1.
If C2∈K then we have done.
Now assume that C2∈K.
Then degy(C2)>0 since c is primitive with respect to y,z.
It follows that there exist B1,B2∈K[x,y,z] with degz(Bi)<degz(d) and gcd(Bi,Ci)=1 for i=1,2, such that
f=dλ1(C1B1+C2B2).
Next we will prove
C2dλB2
is (Θy,Θz)-exact.
Note that C1dλB1 has a telescoper of the same type with f by Lemma 4.32.
Then C2dλB2 has a telescoper L=∑i=0Iai∂xim and
[TABLE]
for some u,v∈K(x,y,z).
Since degz(B2)<degz(d),
function
i=0∑Iθximθy−in(C2)dλq−isaiθximθy−inθz−ik(B2)
is (Θy,Θz)-exact and d satisfies condition (32),
exactness criteria in Lemmas 3.5, 3.7 and 3.6 yield that
there exists g∈K(x,y)[z] such that
[TABLE]
Let Λ={cj∈K[x,y]∖K[x]∣cj is an irreducible factor of C2}.
Then Λ is nonempty and finite since degy(C2)>0.
Notice that none of cj in Λ satisfies the condition (36).
One can find a cℓ∈Λ such that
cℓ=qsθxm3θyn3cj for any
cj∈Λ and s,m3,n3∈Z with m3>0.
Collecting all irreducible factors in C2, which are ⟨θy⟩-equivalent to cℓ, into D1.
Then we can decompose C2B2 into
C2B2=D1A1+DA,
where A1,A∈K[x,y,z],D=C2/D1.
Rewrite g=g1+g2 where g1,g2∈K(x,y)[z] and
the denominator of g1 contains exactly all irreducible factors in the denominator of g which are ⟨θy⟩-equivalent to cℓ.
Equation (39) and the choice of D1 and g1 derive
D1A1=q−λs1θyn1θz−k1(g1)−g1,
and hence
[TABLE]
where h1=i=0∑Iq−isaiθximθy−inθz−ik(g1).
Subtracting Equation (40) from (39), we obtain
[TABLE]
with g1⋆=g−h1.
Repeating the above arguments for the equation (41), one can finally decompose
C2B2=D1A1+D2A2+⋯+DTAT for Di∈K[x,y] and
DiAi=q−λs1θyn1θz−k1(gi)−gi for any 1≤i≤T.
Then we get
[TABLE]
and hence C2dλB2 is (Θy,Θz)-exact.
This completes the proof.
4.6 Existence problems of sixth class
We consider the last class of the existence problems of telescopers for
rational functions in three variables.
Problem 4.34**.**
Let ∂y∈{Sy,Tq,y} and Θy=∂y−1. Given f∈K(x,y,z), decide whether there exists a nonzero operator L∈K(x)⟨Dx⟩
such that L(f)=Θy(g)+Dz(h) for some g,h∈K(x,y,z).
By the Ostrogradsky–Hermite reduction and the reduction formula (7), we can decompose
f∈K(x,y,z) as
[TABLE]
where u,v∈K(x,y,z) and αi,βi∈K(x,y) with αi=0 and the βi’s are in
distinct ⟨θy⟩-orbits with θy∈{σy,τq,y}.
Then f has a telescoper of type (Dx,Θy,Dz) if and only if r
has a telescoper of the same type.
Lemma 4.35**.**
For any L=∑j=0ρℓjDxj∈K(x)⟨Dx⟩ and α,β∈K(x,y), there exists
g∈K(x,y)(z) such that
[TABLE]
Proof..
Let resz(f,β) denote the residue of f∈K(x,y,z) at z=β in z. The map resz(⋅,β)
is K(x,y)-linear and commutes with the operator Dx by (Chen2012, , Proposition 3). Then we have
[TABLE]
So all residues of h:=L(α/(z−β))−L(α)/(z−β) at all of its poles are zero. By Proposition 2.2 in ChenSinger2012 , we have
h is Dz-exact, i.e., h=Dz(g) for some g∈K(x,y)(z).
The next theorem reduces Problem 4.34 to the separation problem for algebraic functions (Problem 4.5)
and the existence problem of telescopers in K(x,y)(β) with β∈K(x).
Theorem 4.36**.**
Let f∈K(x,y,z) be of the form (42).
Then f has a telescoper of type (Dx,Θy,Dz) if and only if for each i with 1≤i≤I, either
αi is separable in x and y or βi∈K(x) and αi∈K(x,y)(βi) has a telescoper of type (Dx,Θy).
Proof..
If for each i with 1≤i≤I, either αi is separable or βi∈K(x) and αi∈K(x,y)(βi)
has a telescoper of type (Dx,Θy),
then there exists a nonzero Li∈K(x)⟨Dx⟩ such that either Li(αi)=0 or Li(αi)=Θy(γi) for some γi∈K(x,y)(βi).
By Lemma 4.35, we have
[TABLE]
where gi∈K(x,y)(z). So for each i with 1≤i≤I, the fraction αi/(z−βi)
has a telescoper of type (Dx,Θy,Dz). Then f has a telescoper of the same type by
Lemmas 2.4 and 3.3. To show the necessity, we assume that L∈K(x)⟨Dx⟩ is a telescoper for f of type (Dx,Θy,Dz).
By Lemma 4.35, there exists w∈K(x,y)(z) such that
[TABLE]
for some g,h∈K(x,y,z). For each i with 1≤i≤I, either αi is separable if L(αi)=0 or
L(αi)/(z−βi) is (Θy,Dz)-exact if L(αi)=0. In the later case we have
βi∈K(x) and L(αi)=Θy(γi) for some γi∈K(x,y)(βi) by Lemma 3.8.
Remark 4.37**.**
The separation problem on algebraic functions will be solved in the forthcoming paper Chen2019 .
The existence problem of telescopers of type (Dx,Θy) can be verified by Theorem 4.1, whose statement is for functions in K(x,y),
but its proof also works for functions in K(x)(y).
In particular, this covers the case in which the functions are in K(x,y)(β) with β∈K(x).
where α=2(x+y)x+y1 and β=x+y. Note that α
is not separable in x and y since its successive derivatives Dxi(α)=(−1)i∏j=0i(j+1/2)(x+y)−(i+3/2)
are linearly independent over K(x).
Since β is not in K(x). So f has no telescoper of type (Dx,Θy,Dz) by Theorem 4.36.
5 Conclusion
In this paper, we present existence criteria for telescopers for rational functions in three variables.
The criteria reduce the existence problems of telescopers for the trivariate inputs to that for the bivariate inputs and two related solvable problems: the (q-)shift equivalence testing problem and the separation problem.
In the pure differential case, algorithms for constructing minimal telescopers for rational functions in three variables have been presented in Chen2012 ; BLS2013 using residues and reductions. This has also recently been extended to the pure shift case in CHHLW2019 based on the existence criteria given in Chen2016 . The first natural direction for future work is to develope efficient algorithms for other twelve cases using the existence criteria in this paper. The next more challenging direction is to study the existence problem of telescopers for more general inputs, such as rational functions and hypergeometric terms in several variables. To this end, we need first solve the multivariate summability problem for those inputs. In particular, it is already quite intriguing to extend the classical Gosper algorithm for indefinite hypergeometric summation Gosper1978 to the bivariate case.
Bibliography45
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Sergei A. Abramov. The rational component of the solution of a first order linear recurrence relation with rational right hand side. Ž. Vyčisl. Mat. i Mat. Fiz. , 15(4):1035–1039, 1090, 1975.
2[2] Sergei A. Abramov. Indefinite sums of rational functions. In ISSAC ’95: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation , pages 303–308, New York, NY, USA, 1995. ACM.
3[3] Sergei A. Abramov. When does Zeilberger’s algorithm succeed? Adv. in Appl. Math. , 30(3):424–441, 2003.
4[4] Sergei A. Abramov and Ha Quang Le. A criterion for the applicability of Zeilberger’s algorithm to rational functions. Discrete Math. , 259(1-3):1–17, 2002.
5[5] Sergei A. Abramov, Ha Quang Le, and Ziming Li. Univariate Ore polynomial rings in computer algebra. J. of Mathematical Sci. , 131(5):5885–5903, 2005.
6[6] Moulay A. Barkatou. On rational solutions of systems of linear differential equations. J. Symbolic Comput. , 28(4-5):547–567, 1999.
7[7] Alin Bostan, Shaoshi Chen, Frédéric Chyzak, and Ziming Li. Complexity of creative telescoping for bivariate rational functions. In ISSAC ’10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation , pages 203–210, New York, NY, USA, 2010. ACM.
8[8] Alin Bostan, Pierre Lairez, and Bruno Salvy. Creative telescoping for rational functions using the Griffiths-Dwork method. In ISSAC’13: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation , pages 93–100. ACM, New York, 2013.