Proofs of some conjectures of Chan on Appell–Lerch sums

On page 3 of his lost notebook, Ramanujan defines the Appell–Lerch sum ϕ(q):=∑n=0∞(-q;q)2nqn+1(q;q2)n+12,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \phi (q):=\sum _{n=0}^\infty \dfrac{(-q;q)_{2n}q^{n+1}}{(q;q^2)_{n+1}^2}, \end{aligned}$$\end{document}which is connected to some of his sixth order mock theta functions. Let ∑n=1∞a(n)qn:=ϕ(q)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{n=1}^\infty a(n)q^n:=\phi (q)$$\end{document}. In this paper, we find a representation of the generating function of a(10n+9)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a(10n+9)$$\end{document} in terms of q-products. As corollaries, we deduce the congruences a(50n+19)≡a(50n+39)≡a(50n+49)≡0(mod25)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a(50n+19)\equiv a(50n+39)\equiv a(50n+49)\equiv 0~(\text {mod}~25)$$\end{document} as well as a(1250n+250r+219)≡0(mod125)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a(1250n+250r+219)\equiv 0~(\text {mod}~125)$$\end{document}, where r=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r=1$$\end{document}, 3, and 4. The first three congruences were conjectured by Chan in 2012, whereas the congruences modulo 125 are new. We also prove two more conjectural congruences of Chan for the coefficients of two Appell–Lerch sums.