1. Notation
Throughout this paper, we use the standard q-series notation [Reference Gasper and Rahman13]. Let q be a complex number with $0 \lt |q| \lt 1$. Recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU1.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU2.png?pub-status=live)
where m is a positive integer. In addition, the basic hypergeometric series $_{r+1}\phi_r$ is defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU3.png?pub-status=live)
Recall that a series is called a Hecke-type double sum if it has the following form:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU4.png?pub-status=live)
where $H(m,n)$ and
$L(m,n)$ are linear forms,
$Q(m,n)$ is a quadratic form and D is a subset of
$\mathbb{Z} \times \mathbb{Z}$ such that
$Q(m,n)\geq 0$. In their paper [Reference Hickerson and Mortenson18], Hickerson and Mortenson gave the following definition for a special type of Hecke-type double sums.
Definition 1. [Reference Hickerson and Mortenson18]
Let $x,y\in \mathbb{C}^{*}: =\mathbb{C}-\{0\}$ and define sg
$(r):=1$ for
$r\geq 0$ and sg
$(r):=-1$ for r < 0. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU5.png?pub-status=live)
Note that,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn1.png?pub-status=live)
Moreover, we will use the following definition of Appell-Lerch sums, which were first studied by Appell [Reference Appell2] and Lerch [Reference Lerch19].
Definition 2. ([Reference Hickerson and Mortenson18])
Let $x,z\in \mathbb{C}^{*}$ with neither z nor xz an integral power of q. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU6.png?pub-status=live)
2. Introduction
In 1920, Ramanujan introduced 17 functions, which he called ‘mock theta functions’ in his famous deathbed letter to Hardy. He defined each of these functions as a q-series and found that these functions have certain asymptotic properties as q approaches a root of unity, which are similar to theta functions, but that they are not theta functions. Motivated by Ramanujan’s work, mock theta functions have attracted the attention of many mathematicians. With the contribution of many works, Andrews and Hickerson [Reference Andrews and Hickerson1], Berndt and Chan [Reference Berndt and Chan3], Chen and Wang [Reference Chen and Wang5], Choi [Reference Choi6–Reference Choi9], Gordon and McIntosh [Reference Gordon and McIntosh14, Reference McIntosh25] and Waston [Reference Watson28, Reference Watson29], to name a few, many new mock theta functions were discovered and a number of identities satisfied by those mock theta functions were proved. See [Reference Gordon and McIntosh15] for a summary on the classical mock theta functions.
In 2002, Zwegers [Reference Zwegers33] established the modularity theory for classical mock theta functions by using the Appell-Lerch sums or Hecke-type double sums. With the contribution of the works of Bringmann and Ono [Reference Bringmann and Ono4] and Zwegers [Reference Zwegers33], we now know that each of Ramanujan’s original 17 mock theta functions is the holomorphic part of a weight $1/2$ harmonic weak Maass form with a weight
$3/2 $ unary theta function as its ‘shadow’. In [Reference Zagier31], Zagier gave the definition of mock theta functions in the modern sense. A function is called a mock modular form of weight k if it is the holomorphic part of a weight k harmonic weak Maass form f(q) (as usual
$q:={\rm e}^{2\pi {\rm i} \tau}$, where
$\tau=x+y{\rm i}\in \mathbb{H}$). In addition, if the weight of a harmonic weak Maass form f(q) is
$1/2$ and its ‘shadow’ is a unary theta function, then the holomorphic part of f(q) is called a mock theta function. In particular, Zagier [Reference Zagier31] and Zwegers [Reference Zwegers33] showed that specializations of Appell-Lerch sums
$m(x,q,z)$ give rise to mock theta functions. In [Reference Hickerson and Mortenson18], Hickerson and Mortenson proved that if n and p are positive integers with
$\gcd(n,p)=1$, then
$f_{n,n+p,n}(x,y,q)$ can be represented as a linear combination of Appell-Lerch sums
$m(x,q,z)$ and theta functions.
In his plenary address at the Millennial Conference on Number Theory, Andrews challenged mathematicians in the 21st century to elucidate the overlap between classes of q-series and modular forms. Motivated by Andrews’ challenge, seeking examples of q-hypergeometric series which are mock theta functions in the modern sense and finding their alternative representations have become important tasks for studying mock theta functions and have attracted the attention of many mathematicians. In recent years, some mathematicians discovered genuine mock theta functions. Lovejoy and Osburn [Reference Lovejoy and Osburn22–Reference Lovejoy and Osburn24] used the Bailey machinery to produce families of q-hypergeometric multisums, which are mock theta functions. Cui et al. [Reference Cui, Gu and Hao11], Gu and Hao [Reference Gu and Hao16], Gu and Liu [Reference Gu and Liu17] and Zhang and Li [Reference Zhang and Li32] also discovered several new mock theta functions on Bailey pairs. Recently, Cui and Gu [Reference Cui and Gu10] established three two-parameter mock theta functions and represented them in terms of Appell-Lerch sums by using some formulas of basic hypergeometric series. Very recently, Yao [Reference Yao30] used partial fraction decomposition to give rise to several families of two-parameter mock theta functions and expressed them in the form of Appell-Lerch sums. In particular, she established some identities involving several families of mock theta functions and Appell–Lerch sums, which imply three identities proved by Cui and Gu [Reference Cui and Gu10]. Very recently, Mortenson et al. [Reference Mortenson, Postnova and Solovyev27] obtained new symmetries for string functions by exploiting their natural setting of Hecke-type double sums, where special double sums are expressed in terms of Appell-Lerch sums and theta functions. By expressing Hecke-type double-sums in terms of theta functions and Appell-Lerch functions, Mortenson [Reference Mortenson26] gave general string function formulas for the affine Lie algebra $A_1^{(1)}$ for levels
$N=1,2,3,4$. Motivated by those works, we present several new mock theta functions and express them in terms of linear combinations of
$f_{n,n+p,n}(x,y,q)$ and theta functions by using some basic hypergeometric series identities due to Liu [Reference Liu20, Reference Liu21] in this paper.
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU7.png?pub-status=live)
The main results of the paper can be stated as follows.
Theorem 2.1 The following identities are true:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn2.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn3.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn4.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn5.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn6.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn7.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn8.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn9.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn10.png?pub-status=live)
Remark. Note that some identities are sign flips away from classical mock theta functions. Sometimes sign flips can be interesting. $M_3(q)$ is related to the sixth order mock theta function
$\phi_{-}(q)$:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU8.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU9.png?pub-status=live)
and $M_4(q)$ is a sign flip away from
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU10.png?pub-status=live)
where $V_0(q)$ is the eighth order mock theta function defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU11.png?pub-status=live)
Moreover, $M_5(q)$ is related to the second-order mock theta function A(q):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU12.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU13.png?pub-status=live)
Furthermore, $M_8(q)$ is a sign flip away from
$f_{1,2,1}(-q,q,-q)$ [Reference Hickerson and Mortenson18, (6.1)]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU14.png?pub-status=live)
where $\phi(q)$ is the sixth-order mock theta function defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU15.png?pub-status=live)
Hickerson and Mortenson [Reference Hickerson and Mortenson18] proved that $f_{n,n+p,n}(x,y,q)$ can be represented as linear combinations of Appell-Lerch sums and theta functions. Therefore,
$M_i(q)$ can be represented in terms of Appell-Lerch sums and theta functions. In the following, we list some simple expressions of
$M_i(q) \ (5\leq i \leq 8)$. The expressions of
$M_i(q)\ (i=1,2,3,4,9)$ are analogous but lengthy, so are omitted.
Theorem 2.2. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn11.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn12.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn13.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn14.png?pub-status=live)
The paper is organized as follows. In § 3, we recall some basic hypergeometric series identities and prove several lemmas. Sections 4 and 5 are devoted to the proofs of Theorems 2.1 and 2.2, respectively.
3. Preliminaries
In this section, we recall some identities on $j(x;q)$ and
$m(x,q,z)$ and present several lemmas, which will be used to prove the main results of this paper.
The following identities will be frequently used without mention [Reference Hickerson and Mortenson18]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU16.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU17.png?pub-status=live)
The Appell-Lerch sum $m(x,q,z)$ satisfies the following identities.
Lemma 3.1. (Hickerson and Mortenson [Reference Hickerson and Mortenson18])
For generic $x,z_0,z_1\in \mathbb{C}-\{0\}$,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn15.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn16.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn17.png?pub-status=live)
We also require some identities on $f_{a,b,c}(x,y,q)$.
Lemma 3.2. ([Reference Hickerson and Mortenson18, (6.2), (6.3), (6.5)])
For $x,y\in\mathbb{C}^{*}$ and
$k,l\in \mathbb{Z}$,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn18.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn19.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn20.png?pub-status=live)
Now, we prove some lemmas.
Lemma 3.3. For $ |ab/q| \lt 1$,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn21.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn22.png?pub-status=live)
Proof. It follows from [Reference Liu21, Equation (3.14)] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn23.png?pub-status=live)
Setting $(\alpha, \beta, c,d)\rightarrow (1,cd/q^2,c/q,d/q) $ in Equation (3.9) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn24.png?pub-status=live)
We also require the following formula proved by Chen and Wang [Reference Chen and Wang5, Lemma 2.3]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn25.png?pub-status=live)
where $F_n(c,d,q)$ is defined by Equation (3.8).
The following identity was proved by Liu [Reference Liu20, Theorem 1.7]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn26.png?pub-status=live)
where $| uab/q| \lt 1$. Taking
$(u,c,d,v)\rightarrow (1 ,c/q , d/q , cd/q^2)$ in Equation (3.12) and employing Equation (3.10), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn27.png?pub-status=live)
where $ |ab/q| \lt 1$. Substituting Equation (3.11) into Equation (3.13) yields Equation (3.7). This completes the proof of this lemma.
Lemma 3.4. Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn28.png?pub-status=live)
Then,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn29.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn30.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn31.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn32.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_inline50.png?pub-status=live)
Proof. Setting $c=-q$ in Equation (3.14), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU18.png?pub-status=live)
which yields Equation (3.15).
Setting $(q,c)\rightarrow (q^2,-q^3)$ in Equation (3.14) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU19.png?pub-status=live)
which implies Equation (3.16).
Taking $c=q^{3/2}$ and
$d=-q^{3/2}$ in Equation (3.8), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU20.png?pub-status=live)
which yields Equation (3.17) after simplification.
At last, setting $(q,c,d)\rightarrow (q^2,-q^2, -q^3)$ in Equation (3.8), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU21.png?pub-status=live)
which implies Equation (3.18). This completes the proof.
Lemma 3.5. Suppose that $2\alpha,\ 2\beta,\ 2\lambda,\ 2\mu$ be integers with
$\alpha \gt \lambda \gt 0$. Then,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn33.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn34.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU22.png?pub-status=live)
Proof. Here we only prove Equation (3.19). One can use the same method to prove Equation (3.20), so we omit the details. It is easy to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn35.png?pub-status=live)
Setting $n=\frac{r+s}{2}$ and
$j=\frac{r-s}{2}$, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn36.png?pub-status=live)
which yields Equation (3.19) after combining Equation (3.21). This completes the proof.
4. Proofs of the main results
The aim of this section is to present proofs of the main results of this paper.
4.1. Proof of Equation (2.1)
Taking $d\rightarrow \infty$ in Equation (3.7) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn37.png?pub-status=live)
where $G_n(c, q)$ is defined by Equation (3.14). Setting
$(b,c)\rightarrow (0,-q)$ in Equation (4.1), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn38.png?pub-status=live)
Taking $( q,a) \rightarrow (q^2,-q)$ in Equation (4.2) and using Equation (3.15), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn39.png?pub-status=live)
We recall Jacobi’s triple product identity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn40.png?pub-status=live)
By Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn41.png?pub-status=live)
In view of Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn42.png?pub-status=live)
It follows from Equations (4.3), (4.5) and (4.6) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn43.png?pub-status=live)
Setting $(a,b,c,q,x,y,k,l)\rightarrow
(1,5,1,q^2 , q,q,1,1) $ in Equation (3.4) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn44.png?pub-status=live)
Taking $(a,b,c,q,x,y,k,l)\rightarrow (1,5,1, q^2 , 1/q, 1/q,1,1) $ in Equation (3.4) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU23.png?pub-status=live)
from which with Equations (4.7) and (4.8), Equation (2.1) follows.
4.2. Proof of Equation (2.2)
Taking $a\rightarrow 0$ in Equation (4.2) and utilizing Equation (3.15), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn45.png?pub-status=live)
Thanks to Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn46.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn47.png?pub-status=live)
Moreover, by Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn48.png?pub-status=live)
Combining Equations (4.9)–(4.12), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn49.png?pub-status=live)
Putting $(a,b,c, q,x,y,k,l)\rightarrow (1,3,1,q^2,q,q,1,1)$ in Equation (3.4), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU24.png?pub-status=live)
from which with Equation (4.13), Equation (2.2) follows.
4.3. Proof of Equation (2.3)
Putting $(q,c)\rightarrow(q^2,-q^3)$ in Equation (4.1), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn50.png?pub-status=live)
Setting $b\rightarrow 0$ in Equation (4.14) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn51.png?pub-status=live)
Setting $a=-q^2$ in Equation (4.15) and employing Equation (3.16), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn52.png?pub-status=live)
Thanks to Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn53.png?pub-status=live)
In light of Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU25.png?pub-status=live)
from which with Equations (4.16) and (4.17), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn54.png?pub-status=live)
Taking $(a,b,c,x,y,q)\rightarrow (1,5,1,1/q,q,q^2)$ in Equation (3.6), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn55.png?pub-status=live)
Combining Equations (4.18) and (4.19) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn56.png?pub-status=live)
Setting $(a,b,c,q,x,y,k,l)\rightarrow (1,5,1,q^2, q,q,1,1) $ in Equation (3.4), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU26.png?pub-status=live)
from which with Equation (4.20), Equation (2.3) follows.
4.4. Proof of Equation (2.4)
Taking $a\rightarrow 0$ in Equation (4.15) and using Equation (3.16) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn57.png?pub-status=live)
In view of Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn58.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn59.png?pub-status=live)
It follows from Equations (4.21) to (4.23) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn60.png?pub-status=live)
Taking $(a,b,c,x,y,q,k,l)\rightarrow (1,3,1,1/q,q,q^4,1,1)$ in Equation (3.4), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn61.png?pub-status=live)
Substituting Equation (4.25) into Equation (4.24) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn62.png?pub-status=live)
Equation (2.4) follows from Equations (3.5) and (4.26).
4.5. Proof of Equation (2.5)
Setting $c=q^{3/2}$ and
$d=-q^{3/2}$ in Equation (3.7) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn63.png?pub-status=live)
Putting $(q,a,b)\rightarrow (q^2,q,-q^2)$ in Equation (4.27) and utilizing Equation (3.17), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn64.png?pub-status=live)
Based on Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn65.png?pub-status=live)
In light of Equation (3.20),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn66.png?pub-status=live)
It follows from Equations (4.28) to (4.30) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn67.png?pub-status=live)
Putting $(a,b,c,x,y,q,k,l)\rightarrow (1,3,1,1/q,q,q^2,1,1)$ in Equation (3.4), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn68.png?pub-status=live)
Substituting Equation (4.32) into Equation (4.31) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU27.png?pub-status=live)
from which with Equation (2.2), Equation (2.5) follows.
4.6. Proof of Equation (2.6)
Setting $b\rightarrow 0$ in Equation (4.27) and employing Equation (3.17), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn69.png?pub-status=live)
Taking $(q,a)\rightarrow (q^2,q)$ in Equation (4.33) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn70.png?pub-status=live)
By Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn71.png?pub-status=live)
Moreover, in view of Equation (3.20),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn72.png?pub-status=live)
Combining Equations (4.34)–(4.36) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn73.png?pub-status=live)
Putting $(a,b,c,q,x,y,k,l)\rightarrow (1,2,1,q^4,q,q,1,1)$ in Equation (3.4), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn74.png?pub-status=live)
which yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn75.png?pub-status=live)
Taking $(a,b,c,q,x,y)\rightarrow (1,2,1,q^4,1/q,q) $ in Equation (3.6), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn113.png?pub-status=live)
from which with Equations (4.37) and (4.39), Equation (2.6) follows.
4.7. Proof of Equation (2.7)
Taking $(q,b,c,d)\rightarrow (q^2,0, -q^2, -q^3)$ in Equation (3.7) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn76.png?pub-status=live)
Taking $a=-q$ in Equation (4.41) and using Equation (3.18), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn77.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn78.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn79.png?pub-status=live)
In addition, thanks to Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU29.png?pub-status=live)
which yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn80.png?pub-status=live)
after combining Equations (4.42)–(4.44).
Taking $(a,b,c,q,x,y)\rightarrow(1,2,1,q^2,q,q )$ in Equation (3.6) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn81.png?pub-status=live)
In view of Equation (3.5),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU30.png?pub-status=live)
which yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn82.png?pub-status=live)
Equation (2.7) follows from Equations (4.45) to (4.47).
4.8. Proof of Equation (2.8)
Putting $a=-q^2$ in Equation (4.41) and employing Equation (3.18), we see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn83.png?pub-status=live)
The following identity follows from Jacobi’s triple product identity Equation (4.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn84.png?pub-status=live)
In view of Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn85.png?pub-status=live)
It follows from Equations (4.48) to (4.50) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn86.png?pub-status=live)
Taking $(a,b,c,q,x,y,k,l)=(1,2,1,q^4,q,q,1,1)$ in Equation (3.4), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn87.png?pub-status=live)
Combining Equations (4.51) and (4.52) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn88.png?pub-status=live)
Equation (2.8) follows from Equations (3.5) and (4.53).
4.9. Proof of Equation (2.9)
Setting $a\rightarrow 0$ in Equation (4.41) and utilizing Equation (3.18), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn89.png?pub-status=live)
In light of Equation (4.4)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn90.png?pub-status=live)
Moreover, by Equation (3.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn91.png?pub-status=live)
Substituting Equations (4.55) and (4.56) into Equation (4.54), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn92.png?pub-status=live)
Setting $(a,b,c,q,x,y,k,l)=(3,5,3,q^2,q^3,q^3,1,1)$ in Equation (3.4), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn93.png?pub-status=live)
Setting $(a,b,c,q,x,y,k,l)=(3,5,3,q^2,q,q,1,1)$ in Equation (3.4) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn94.png?pub-status=live)
Equation (2.9) follows from Equations (4.57) to (4.59). This completes the proof of Theorem 2.1. $\Box$
5. Proof of Theorem 2.2
In [Reference Hickerson and Mortenson18], Hickerson and Mortenson proved that for generic $x,y\in \mathbb{C}-\{0\}$,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn95.png?pub-status=live)
where n is a positive integer with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn96.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU31.png?pub-status=live)
Setting $(n,p,x,y,q)\rightarrow (1,2,1/q,q,q^2)$ in Equation (5.1) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn97.png?pub-status=live)
Taking $(n,p,x,y,q)\rightarrow (1,2,q^3,q^5,q^2)$ in Equation (5.1) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn98.png?pub-status=live)
Substituting Equations (5.3) and (5.4) into Equation (4.31), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn99.png?pub-status=live)
The following identities can be proved by using the MAPLE package thetaids [Reference Frye and Garvan12]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn100.png?pub-status=live)
Equation (2.10) follows from Equations (5.5) and (5.6).
Hickerson and Mortenson [Reference Hickerson and Mortenson18] also proved that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn101.png?pub-status=live)
where $g_{a,b,c}(x,y,q,z_1,z_0)$ is defined by Equation (5.2). Setting
$(x,y,q)\rightarrow (1/q,q,q^4)$ in Equation (5.7) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn102.png?pub-status=live)
Taking $(x,y,q)\rightarrow (q^5,q^7,q^4)$ in Equation (5.7), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn103.png?pub-status=live)
In view of Equation (3.3),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn104.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn105.png?pub-status=live)
Substituting Equations (5.8) and (5.9) into Equation (4.37) and using Equations (5.10) and (5.11), we get Equation (2.11).
Hickerson and Mortenson [Reference Hickerson and Mortenson18] proved that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn106.png?pub-status=live)
Taking $(x,y,q)\rightarrow (1,1,q^4)$ in Equation (5.12), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn107.png?pub-status=live)
Setting $(x,y,q)\rightarrow (q^6,q^6,q^4)$ in Equation (5.12), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn108.png?pub-status=live)
Substituting Equations (5.13) and (5.14) into Equation (4.45), we arrive at Equation (2.12).
Putting $(x,y,q)\rightarrow (q,q,q^4)$ in Equation (5.12), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn109.png?pub-status=live)
By Equations (3.7) and (3.8),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn110.png?pub-status=live)
Setting $(x,y,q)\rightarrow(q^7,q^7,q^4) $ in Equation (5.12) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn111.png?pub-status=live)
Substituting Equations (5.15) and (5.17) into Equation (4.51) and using Equation (5.16), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqn112.png?pub-status=live)
With the MAPLE package thetaids [Reference Frye and Garvan12], one can prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240220180110862-0470:S0013091523000457:S0013091523000457_eqnU32.png?pub-status=live)
which yields Equation (2.13) after combining Equation (5.18). This completes the proof.
6. Concluding remarks
As seen in $\S~2$ ‘Introduction’, seeking examples of q-hypergeometric series which are mock theta functions in the modern sense and finding their alternative representations have received a lot of attention in recent years. In this paper, we pose several new mock theta factions and express them in terms of Appell-Lerch sums and Hecke-type double sum
$f_{a,b,c}(x,y,q)$. It would be interesting to find new methods to establish new mock theta functions and find their finding their alternative representations.
Acknowledgements
The author cordially thanks the anonymous referee for his/her helpful comments.
Funding Statement
This work was supported by the Natural Science Foundation of Jiangsu Province of China (no. BK20221383).