\documentclass[11pt]{amsart} \usepackage{amsmath} \usepackage{amssymb} \usepackage{amsthm} \usepackage{booktabs} \usepackage{array} \usepackage{hyperref} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \numberwithin{equation}{section} \setlength{\emergencystretch}{2em} \newcommand{\NN}{\mathbb{N}} \newcommand{\ZZ}{\mathbb{Z}} \newcommand{\QQ}{\mathbb{Q}} \newcommand{\RR}{\mathbb{R}} \newcommand{\CC}{\mathbb{C}} \newcommand{\cO}{\mathcal{O}} \newcommand{\cD}{\mathcal{D}} \newcommand{\cC}{\mathcal{C}} \newcommand{\cP}{\mathcal{P}} \newcommand{\Nm}{\operatorname{N}} \newcommand{\eu}{\phi_{\mathrm E}} \newcommand{\Res}{\operatorname{res}} \newcommand{\lean}[1]{{\def\_{\textunderscore\allowbreak}\texttt{#1}}} \begin{document} \hypersetup{pdftitle={The reciprocal cube sums of Lucas sequences of quadratic units are irrational},pdfauthor={Shawn Krisman}} \title[Reciprocal cubes of Lucas sequences]{The reciprocal cube sums of Lucas sequences of quadratic units are irrational} \author{Shawn Krisman} \subjclass[2020]{Primary 11J72; Secondary 11B39, 33D15, 41A21, 68V20} \keywords{Lucas sequences, Pell numbers, Fibonacci numbers, irrationality, $q$-series, Hankel determinants, Lean} \begin{abstract} Let $\eta>1$ be a unit of a real quadratic order and $U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta)$ its Lucas sequence. We prove that $\sum_{n\ge1}U_n^{-3}$ is irrational. Equivalently, $\sum_{n\ge1}U_n(P,Q)^{-3}\notin\QQ$ for the Lucas sequences with $Q=-1$, $P\ge1$, and with $Q=1$, $P\ge3$. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers $F_{kn}$, for every $k\ge1$, are irrational. The case of the Fibonacci numbers was treated in earlier work of the author; the proof here is the same Hankel-determinant construction, carried out for a general unit and for both signs of its norm. The constants of the argument do not depend on $\eta$ once they are measured in units of $\log\eta$. The whole argument is formalised in Lean~4 with Mathlib. \end{abstract} \maketitle % =========================================================================== \section{Introduction} % =========================================================================== For integers $P,Q$ let $U_n=U_n(P,Q)$ be the Lucas sequence $U_0=0$, $U_1=1$, $U_{n+1}=PU_n-QU_{n-1}$. When $Q=\pm1$ and $D=P^2-4Q>0$ is not a square, $U_n=(\eta^n-\bar\eta^n)/\sqrt D$ with $\eta=(P+\sqrt D)/2$ a unit of the order $\ZZ[\eta]$ of norm $\eta\bar\eta=Q$. Conversely, every unit $\eta>1$ of a real quadratic order arises in this way, with $P=\eta+\bar\eta\ge1$ if $Q=-1$ and $P\ge3$ if $Q=1$. The Fibonacci numbers are $U_n(1,-1)$, the Pell numbers $\cP_n$ are $U_n(2,-1)$, and $F_{kn}/F_k=U_n(L_k,(-1)^k)$, where $L_k$ is the $k$-th Lucas number. \begin{theorem}\label{thm:main} Let $Q=-1$ and $P\ge1$, or $Q=1$ and $P\ge3$. Then $\displaystyle\sum_{n\ge1}\frac1{U_n(P,Q)^3}$ is irrational. \end{theorem} \begin{corollary}\label{cor:main} The numbers $\sum_{n\ge1}\cP_n^{-3}$ and, for every $k\ge1$, $\sum_{n\ge1}F_{kn}^{-3}$ are irrational. \end{corollary} \begin{proof} Theorem~\ref{thm:main} with $(P,Q)=(2,-1)$, and with $(P,Q)=(L_k,(-1)^k)$, which is admissible: $L_k\ge1$, and $L_k\ge3$ for $k\ge2$. Then $U_n=F_{kn}/F_k$ by Binet's formula, so $\sum_nF_{kn}^{-3}=F_k^{-3}\sum_nU_n^{-3}$. \end{proof} The case $(P,Q)=(1,-1)$, $\sum_nF_n^{-3}\notin\QQ$, is the main result of the preprint \cite{Kri26}; we refer there for the history of the Fibonacci zeta function. Briefly: Andr\'e-Jeannin proved that $\sum_nU_n^{-1}$ is irrational for a class of binary recurrences that includes every $U_n(P,\pm1)$, in particular $\sum_nF_n^{-1}\notin\QQ$ \cite{AJ89}. For both signs of $Q$, Duverney, Ke.~Nishioka, Ku.~Nishioka and Shiokawa proved that the even powers $\sum_nU_n^{-2s}$ ($s\ge1$) are transcendental, and for $Q=-1$ also the odd-index sums $\sum_nU_{2n-1}^{-s}$ \cite{DNNS97}; Elsner, Shimomura and Shiokawa determined the algebraic relations among such numbers \cite{ESS07,ESS08,ESS12}. These sums are values of quasi-modular forms at algebraic points, to which Nesterenko's theorem \cite{Nes96} applies (see \cite[\S3.4]{Wal10} for the Fibonacci zeta function). The odd powers $\sum_nU_n^{-(2s+1)}$ of the full sums are not known to be of this kind. For the Pell numbers, Xu and Wang \cite{XW13} evaluated the integer part of $\bigl(\sum_{k\ge n}\cP_k^{-3}\bigr)^{-1}$; we know of no irrationality result for any full sum $\sum_nU_n^{-3}$ before the preprint \cite{Kri26}. \subsection*{The method} Put $t=\eta^{-1}$ and $w=Qt^2$. Since $\bar\eta/\eta=Qt^2$, we have $U_n=t^{-n}(1-w^n)/\sqrt D$, and so \begin{equation}\label{eq:Xi} \Xi:=\frac1{D\sqrt D}\sum_{n\ge1}\frac1{U_n^3}=\sum_{N\ge1}\frac{t^{3N}}{(1-w^N)^3}. \end{equation} We follow \cite{Kri26}, which adapted to $\ZZ[\varphi]$ a construction of an unrefereed, AI-assisted research draft on the $q$-zeta value $\sum_nn^2/(p^n-1)$, $p\ge2$ an integer \cite{UPL,QZ3}; the construction is a moving-denominator Hankel determinant in the line of Uvarov \cite{Uva69}, Krattenthaler \cite{Kra21}, Pr\'evost \cite{Pre96} and Zudilin \cite{Zud16,Zud17}. A linear functional $L$, a second Euler derivative summed against the weights $(Qt)^n$ at the nodes $w^n$, has moments $L(s^k)\in\QQ(\sqrt D)$, rational functions of $t$, and satisfies $L(1/(1-w^as))=\lambda_a(\Xi-S_a)$ with explicit $\lambda_a$ and partial sums $S_a$ of \eqref{eq:Xi}. The Hankel determinants $\Delta_K(X)$ of $L$ against $D_K(s)=\prod_{a\le K}(1-w^as)$ satisfy $\Delta_K(\Xi)=\det[L(s^{i+j}/D_K)]$, and four estimates are combined: \begin{center} \small \begin{tabular}{lll} \toprule & size (per $K^3\log\eta$) & \\ \midrule real decay $|\Delta_K(\Xi)|$ & $-2/9$ & Proposition~\ref{prop:decay}\\ conjugate $|\sigma\Delta_K(-\Xi)|$ & $-1$ & Proposition~\ref{prop:conj}\\ denominators $\log|\Nm C_K(t)|$ & $\le c_*=1.1954\ldots<11/9$ & Propositions~\ref{prop:global}, \ref{prop:cost}\\ nonvanishing & infinitely many $K$ & Proposition~\ref{prop:nonvan}\\ \bottomrule \end{tabular} \end{center} If $\sum_nU_n^{-3}$ were rational, $C_K(t)(mD^2)^K\Delta_K(\Xi)$, where $m$ is the denominator of the sum, would be a nonzero element of $\ZZ[\eta]$ of norm $<1$ for large $K$. Compared with \cite{Kri26} there are three changes. First, the sign: for $Q=1$ the nodes $w^n=t^{2n}$ are positive and the roots of unity at which the coefficients have poles are of a different type (Section~\ref{sec:den}); the local arguments are unchanged, only the classification of the roots changes, and the elementary count of the $\alpha$-roots used in the proof is the same for both signs (the difference appears only in the sharp constant of Remark~\ref{rem:sharp}). Second, the unit: all analytic estimates use only $01$ does not cover the alternating sums $\sum_n(-1)^{n-1}U_n(P,-1)^{-3}=\sum_nU_n(-P,-1)^{-3}$. \subsection*{Formal verification} The theorem and every step of its proof are formalised in Lean~4 with Mathlib (\url{https://github.com/telaviv/lucas-zeta3-irrationality}; Section~\ref{sec:lean}). The analytic ingredients are formalised for every real $t$ with $0a}\rho^Nw^N/(1-w^N)^3$, and $\rho^Nw^N=Q^{2N}t^{3N}=t^{3N}$. \end{proof} Let $D_K(s)=\prod_{a=1}^K(1-w^as)$, with poles $x_a=w^{-a}$, $|x_a|=\eta^{2a}$. For a polynomial $P_0$ of degree $<2K-1$, \[ \frac{P_0}{D_K}=Q_0+\sum_{a=1}^K\frac{\Res_a(P_0)}{1-w^as},\qquad \Res_a(P_0)=\frac{P_0(x_a)}{\prod_{b\ne a}(1-w^{b-a})}, \] with $Q_0$ a polynomial of degree $\le\deg P_0-K$. Let $L_X$ be the linear map with $L_X(s^k)=\nu_k$ and $L_X(1/(1-w^as))=\lambda_a(X-S_a)$, $X$ an indeterminate, and \[ \Delta_K(X)=\det\bigl[L_X(s^{i+j}/D_K)\bigr]_{0\le i,jm-j}(x_{a_i}-x_{a_l})\prod_{l>m-k}(x_{a_i}-x_{a_l})} {\prod_{b\ne a_i}(1-w^{b-a_i})}. \] Here $(F/F_r)(x_{a_i})$ is a unit, each displayed difference has valuation exactly $1$ by (a), and the denominator has valuation exactly $m-1$. So $v(\Res_{a_i})=j+k-(m-1)$. (iii) $v(\lambda_a)=0$, and by (b) the Gauss valuation of $X-S_a$ is $\ge-3$ if $a\ge e$ and $\ge0$ if $aK$ and $\zeta$ is an $\alpha$-root, then $-v(\Delta_{K,\tau})\le\max(0,K-1-k_{\min}(d))$. \end{lemma} \begin{proof} Work in the monomial basis. Since $e>K$, no difference $|a-b|a}\psi_N=\Gamma(r_a)$, using $t^{4a}=w^{2a}=r_a^2$ (for both signs) and $w^{a+M}=r_aw^M$, where \[ \Gamma(r)=2r\sum_{M\ge1}\frac{t^{3M}}{(1-rw^M)^3}=\sum_{n\ge1}\gamma_nr^n,\qquad \gamma_n=n(n+1)\sum_{M\ge1}t^{3M}w^{M(n-1)}, \] analytic on $|r|<\eta^2$, with $|\gamma_n|\le n(n+1)t^{2n+1}/(1-t^{2n+1})\le n(n+1)t^{2n+1}/(1-t^3)$. Partial fractions give \[ \frac{s^k}{F^\sigma(s)}=\sum_{j=0}^{k-K}h_{k-K-j}(r)\,s^j+\sum_{a=1}^K\frac{r_a^k}{(F^\sigma)'(r_a)(s-r_a)}, \] and with $\sum_ar_a^m/(F^\sigma)'(r_a)=h_{m-K+1}(r)$ we get \[ Y_k(-\Xi)=\sum_{j=0}^{k-K}h_{k-K-j}(r)\,\sigma\nu_j+\sum_{n\ge1}\gamma_nh_{k+n-K+1}(r). \] \emph{Bounds.} As $h_m(r_1,\dots,r_K)=w^mh_m(1,w,\dots,w^{K-1})$, $|h_m(r)|\le C_0t^{2m}$, using $\prod_{i\ge1}(1-t^{2i})^{-1}\le C_0$ for $t\le\varphi^{-1}$. For $j\ge1$, $|\sigma\nu_j|\le j(j+1)/(1-t^3)$, so the first sum is at most $C_0K^2/((1-t^3)(1-t^2))$. For the second, $\sum_nn(n+1)t^{2n+1}=2t^3/(1-t^2)^3\le2$ and $1/(1-t^3)\le\varphi^2/2$ for $t\le\varphi^{-1}$, so $\sum_n|\gamma_n|\le\varphi^2$. All these quantities increase with $t$, so $|Y_k(-\Xi)|\le M_K$ for $0\le k\le2K-2$. Hadamard's inequality and $|w|^{A_KK}=\eta^{-K^2(K+1)}$ finish the proof. \end{proof} % =========================================================================== \section{Nonvanishing}\label{sec:nonvan} % =========================================================================== \begin{proposition}\label{prop:nonvan} $\Delta_K(\Xi)\ne0$ for infinitely many $K$. \end{proposition} \begin{proof} The proof of \cite[Proposition~6.1]{Kri26} uses only $0<|w|<1$, $\rho\ne0$ and the distinctness of the nodes; we repeat it. Let $\cC(z)=L(1/(z-s))=\sum_n\rho^n\,2w^nz/(z-w^n)^3$ for $|z|>t^2$. It continues to $\CC\setminus\{0\}$ with a pole of order exactly $3$ at each $w^n$ (leading coefficient $2\rho^nw^{2n}\ne0$), so it is not rational; it is analytic at $\infty$ and $O(1/z)$. For $\deg R\le n-1$ put $H_{n,R}(z)=L\bigl(R(s)/((z-s)D_n(s))\bigr)$, analytic for $|z|>t^2$ and in particular at every $x_a$, and \[ T_{n,R}(z)=L\Bigl(\frac{R(z)D_n(s)-D_n(z)R(s)}{(z-s)D_n(s)}\Bigr), \] a polynomial in $z$ of degree $\le n-1$. Then $\cC R-T_{n,R}=D_nH_{n,R}$. If $\Delta_n(\Xi)=0$, any kernel vector gives $R_n\ne0$ of degree $\le n-1$ with $L(s^jR_n/D_n)=0$ for $jt^2+\epsilon_0$ ($\epsilon_0>0$), gives $H_{n,R_n}(z)=O(z^{-n-1})$, so $E_n=O(z^{-1})$ and $E_n(x_a)=0$ for $a\le n$. If $\Delta_n(\Xi)=\Delta_{n+1}(\Xi)=0$, then $V_0=T_{n+1}R_n-T_nR_{n+1}=R_{n+1}E_n-R_nE_{n+1}$ is a polynomial, $O(z^{n-1})$, vanishing at $x_1,\dots,x_n$; so $V_0=0$ and $T_n/R_n=T_{n+1}/R_{n+1}$. If $\Delta_n(\Xi)=0$ for all $n\ge N$, all $T_n/R_n$ equal one reduced fraction $T/R_0$, so $R_n=U'_nR_0$, $T_n=U'_nT$, and $E:=\cC R_0-T\ne0$. Then $U'_nE=E_n=O(1/z)$ forces $E=c_0z^{-q}(1+o(1))$ with $c_0\ne0$, $q\ge1$, and $\deg U'_n\le q-1$; but $E(x_a)\ne0$ for all large $a$ while $E_n(x_a)=0$, so $U'_n(x_a)=0$ for all large $a\le n$, too many zeros once $n$ is large. \end{proof} % =========================================================================== \section{\texorpdfstring{Proof of Theorem~\ref{thm:main}}{Proof of the theorem}}\label{sec:proof} % =========================================================================== Suppose $\sum_nU_n^{-3}=u/m$ with $u\in\ZZ$, $m\in\ZZ_{>0}$. By \eqref{eq:Xi} and Lemma~\ref{lem:unit}(iv), $\Xi=u\sqrt D/(mD^2)=u(P-2Qt)/(mD^2)$ and $\sigma\Xi=-\Xi$. For $K$ in the infinite set of Proposition~\ref{prop:nonvan} put $y_K=C_K(t)(mD^2)^K\Delta_K(\Xi)$. By Proposition~\ref{prop:global}, $y_K\in\cO$, and $y_K\ne0$ because $\Delta_K(\Xi)\ne0$ and $C_K(t)\ne0$ ($t$ is not a root of unity). Moreover $\sigma y_K=C_K(\sigma t)(mD^2)^K\sigma\Delta_K(-\Xi)$. The norm $y_K\,\sigma y_K$ of the nonzero algebraic integer $y_K$ is a nonzero rational integer, so $|y_K\,\sigma y_K|\ge1$, and by Propositions~\ref{prop:decay}, \ref{prop:conj} and \ref{prop:cost} \begin{multline*} 0\le\log|\Nm C_K(t)|+2K\log(mD^2)+\log|\Delta_K(\Xi)|+\log|\sigma\Delta_K(-\Xi)|\\ \le\bigl(c_*-\tfrac29-1\bigr)K^3\log\eta+O(K^2\log K). \end{multline*} Since $c_*-\tfrac{11}9=\tfrac{11}8\beta_7-\tfrac89=-0.02684\ldots<0$, this fails for large $K$. \qed \begin{remark} Not used in the proof. With the constants of Remark~\ref{rem:sharp} the margin is at least $0.0914$ ($Q=-1$) and $0.1214$ ($Q=1$) per $K^3\log\eta$. At finite $K$, computed with exact determinants over $\QQ(\sqrt D)$ and interval arithmetic, the left side above without the term $2K\log(mD^2)$, divided by $K^3\log\eta$, is about $-0.12$ for the Pell numbers at $K=20$ and $K=25$ and about $-0.14$ for $(P,Q)=(3,1)$, i.e.\ $\sum_nF_{2n}^{-3}$, at $K=20$. With the true denominator, the norm of the ideal generated by the coefficients of $\Delta_K$, in place of $C_K(t)$, these numbers become about $-0.17$ and $-0.21$. For $Q=1$ the local bounds of Section~\ref{sec:den} agree with the exact multiplicities of the cyclotomic factors in $\QQ(\tau)[X]$ for $K\le13$, with equality in most cases. The scripts are available from the author. \end{remark} % =========================================================================== \section{Formal verification}\label{sec:lean} % =========================================================================== The Lean development is the repository \begin{center} \url{https://github.com/telaviv/lucas-zeta3-irrationality}; \end{center} all file names below refer to it. It (library \lean{LucasU}, Lean~4.35.0, Mathlib v4.35.0, about 9200 lines) generalises the formalisation of \cite{Kri26} and proves \begin{center} \lean{theorem LucasU.irrational\_zetaU (hA : Admissible a E) : Irrational (zetaU a E)}, \end{center} where \lean{Admissible a E} means $E=1$, $a\ge1$ or $E=-1$, $a\ge3$, and \lean{zetaU a E} is the series $\sum_{n\ge0}1/U_{n+1}^3$ for the sequence \lean{Useq a E} with $U_{n+2}=aU_{n+1}+EU_n$, written with a \lean{tsum}; so $(a,E)=(P,-Q)$. The proof uses only the axioms \lean{propext}, \lean{Classical.choice} and \lean{Quot.sound}; there is no \lean{sorry}, no \lean{native\_decide} and no added axiom. \emph{What has to be trusted.} For the theorem itself, only the definitions of \lean{Useq}, \lean{zetaU} and \lean{Admissible} (and Mathlib's \lean{tsum} and \lean{Irrational}) have to be read. Since a divergent \lean{tsum} has the value $0$, which is rational, the statement cannot hold for a degenerate reason; moreover \lean{hasSum\_zetaU} shows that the series converges (to $D\sqrt D\,\Xi$). The corollaries are \lean{LucasU.irrational\_pell}, that the \lean{tsum} of $1/\cP_{n+1}^3$ over $n\ge0$ is irrational, with \lean{pell} $=$ \lean{Useq 2 1}, and \lean{LucasU.irrational\_fib\_mul}, that for $k\ge1$ the \lean{tsum} of $1/F_{k(n+1)}^3$ over $n\ge0$, written with \lean{Nat.fib}, is irrational; the identity $F_{kn}=F_kU_n(L_k,(-1)^k)$ is \lean{LucasU.fib\_mul\_eq}, stated as $F_{kn}=F_k\,U_n$ for \lean{Useq (lucasNum k) ((-1)\^{}(k+1))}, i.e.\ $(a,E)=(L_k,(-1)^{k+1})$, with the Lucas numbers \lean{lucasNum} (all in \lean{LucasU/Corollaries.lean} and \lean{LucasU/Final.lean}). \subsection*{Definitions and the chain} \lean{LucasU/Defs.lean} defines the construction of Section~\ref{sec:setup} over an arbitrary field with a sign $\varepsilon=Q$ and a parameter $\tau$ (\lean{wpar} $=\varepsilon\tau^2$, \lean{alpha}, \lean{nu}, \lean{psi}, \lean{S}, \lean{node}, \lean{F}, \lean{res}, \lean{mConst}, \lean{mLin}, \lean{nrm}, \lean{Delta}), the real functional \lean{Lfun} and \lean{XiR} as functions of $(\varepsilon,t)$, and the clearing polynomial \lean{CKpoly} with exponents \lean{nExp}. \lean{LucasU/Statements.lean} states the ingredients as propositions in $(\varepsilon,t)$ (and \lean{Integrality} in $\varepsilon$ alone, for every real $\tau\ne0$ that is not a root of unity); the proofs below assume \lean{Good}~$\varepsilon$~$t$, i.e.\ $\varepsilon=\pm1$ and $0