\documentclass[11pt]{amsart} \IfFileExists{lmodern.sty}% {\usepackage[T1]{fontenc}\usepackage{lmodern}\usepackage{microtype}}% {\usepackage[expansion=false]{microtype}} \usepackage{amssymb,mathtools} \usepackage{booktabs,array} \usepackage{enumitem} \emergencystretch=2.5em \usepackage[colorlinks=true,linkcolor=blue,citecolor=blue,urlcolor=blue]{hyperref} % --------------------------------------------------------------------------- % Location of the Lean formalization. \newcommand{\FormalizationURL}{https://github.com/slitsey/catalan-irrationality-measure} \newcommand{\FormalizationLink}{\url{\FormalizationURL}} % --------------------------------------------------------------------------- \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \numberwithin{equation}{section} \setcounter{tocdepth}{1} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\C}{\mathbb C} \newcommand{\F}{\mathbb F} \newcommand{\N}{\mathbb N} \newcommand{\den}{\operatorname{den}} \newcommand{\rank}{\operatorname{rank}} \newcommand{\corank}{\operatorname{corank}} \newcommand{\lean}[1]{\nolinkurl{#1}} \renewcommand{\Re}{\operatorname{Re}} \renewcommand{\Im}{\operatorname{Im}} \newcommand{\Lw}{\mathsf L} % Loewner matrix \newcommand{\cO}{\mathcal O} \begin{document} \title{Irrationality measures for $G\pm5\pi^2/48$ and $L(2,\chi_{-3})$} \author{Sean Litsey} \email{sean.litsey.math@gmail.com} \date{October 19, 2026} \subjclass[2020]{Primary 11J82; Secondary 11J72, 15A15, 31A15, 68V20} \keywords{Catalan's constant, $L(2,\chi_{-3})$, irrationality exponent, L\"owner matrices, Cauchy determinants, Andr\'eief identity, $p$-adic valuations, Jacobi matrices, Darboux transformation, formal verification, Lean} \begin{abstract} Building on OpenAI's determinant method for the irrationality of Catalan's constant $G=\sum_{j\ge0}(-1)^j/(2j+1)^2$, we prove \[ \begin{gathered} \mu\Bigl(G-\frac{5\pi^2}{48}\Bigr)\le 38.35,\qquad \mu\Bigl(G+\frac{5\pi^2}{48}\Bigr)\le 38.35,\\ \mu\bigl(L(2,\chi_{-3})\bigr)\le 23.82 , \end{gathered} \] where $\mu$ is the irrationality exponent. We know of no earlier irrationality measure for $G\pm5\pi^2/48$. For $L(2,\chi_{-3})$, which Calegari, Dimitrov and Tang proved irrational, the previous best bound we know of is their effective bound $\mu\le24781$. The approximations come from determinants of \emph{rectangular} L\"owner matrices of digamma differences at integer nodes. We bound their denominators with $p$-adic assignment problems and rank deficits modulo $p$. We prove nonvanishing modulo a prime by reducing it to bordered Krylov determinants, which we evaluate through Jacobi matrices and Darboux transformations. We bound their size with Andr\'eief's identity and a certified lower bound for a discrete logarithmic energy. Every result is formalized in Lean~4, with no unproved steps and only the standard axioms. \end{abstract} \maketitle \tableofcontents %% ===================================================================== \section{Introduction}\label{sec:intro} OpenAI \cite{OpenAI2026} recently proved that Catalan's constant \[ G=\sum_{j=0}^\infty\frac{(-1)^j}{(2j+1)^2}=0.91596\,55941\ldots \] is irrational, and formalized the proof in Lean. (An earlier claimed proof \cite{Sun2026} was found to contain a gap \cite{Wachs2026}.) Their argument, and the irrationality-measure results built on it \cite{Jha2026,Carreira2026,Litsey2026}, use a determinant of large size whose denominators and decay are balanced very closely. In the present paper we study a different, much smaller, family of determinants: rectangular L\"owner matrices of digamma differences, attached to the numbers \[ \begin{gathered} \lambda=\frac G2-\frac{5\pi^2}{96},\qquad \lambda'=\frac G2+\frac{5\pi^2}{96},\qquad \frac14L(2,\chi_{-3}),\\ L(2,\chi_{-3})=\sum_{k\ge0}\Bigl(\frac1{(3k+1)^2}-\frac1{(3k+2)^2}\Bigr)=0.78130\,24128\ldots \end{gathered} \] Thus $G-5\pi^2/48=2\lambda$, $G+5\pi^2/48=2\lambda'$, and $\lambda+\lambda'=G$. Recall that the \emph{irrationality exponent} $\mu(\xi)$ of a real number $\xi$ is the infimum of the $\mu$ such that $|\xi-a/b|>b^{-\mu}$ for all integers $a$ and all sufficiently large $b$. \begin{theorem}\label{thm:main} For every $\varepsilon>0$ there is $q_0$ such that for all coprime integers $p$, $q$ with $q\ge q_0$, \[ \begin{gathered} \Bigl|G-\frac{5\pi^2}{48}-\frac pq\Bigr|>q^{-38.35-\varepsilon},\qquad \Bigl|G+\frac{5\pi^2}{48}-\frac pq\Bigr|>q^{-38.35-\varepsilon},\\ \Bigl|L(2,\chi_{-3})-\frac pq\Bigr|>q^{-23.82-\varepsilon}. \end{gathered} \] In particular $G\pm5\pi^2/48$ are irrational, $\mu(G\pm5\pi^2/48)\le38.35$ and $\mu(L(2,\chi_{-3}))\le23.82$. \end{theorem} The computed values of the exponents are $38.342$ and $23.8194$. Theorem~\ref{thm:main}, together with every result in this paper, has been verified in the Lean~4 proof assistant, with no unproved steps and only the standard axioms; see Section~\ref{sec:lean}. The formalization is available at \FormalizationLink. The use of AI in this work is disclosed at the end of the paper. \subsection{Previous results} For earlier work on the arithmetic of $G$ and related values see \cite{RivoalZudilin2003,Zudilin2003,Zudilin02Cheb,KrattRivoal08,KrattZudilin19} and the survey \cite{Zudilin19Survey}; for recent rational approximations to $G$ see Eskandari \cite{Eskandari2026}. Finite irrationality exponents for $G$ itself were obtained after OpenAI's proof by Jha \cite{Jha2026}, Carreira \cite{Carreira2026} and the author \cite{Litsey2026}. Our searches found no previous irrationality result, and no irrationality measure, for $G-5\pi^2/48$ or $G+5\pi^2/48$. Eskandari, Murty and Nemoto \cite{EMN2025} construct a $2$-dimensional mixed motive over $\Q$ with period $G$ and use it to obtain linear forms in $1$ and $G$. Eskandari \cite{Eskandari2026} improves the approximation exponent of these Rivoal--Zudilin type forms from $0.52$ to $0.62$ (a preprint; explicit approximations, not a lower bound for all rationals). Sun's preprint \cite{Sun2026} claimed a proof of the irrationality of $G$; Wachs \cite{Wachs2026} reports that its main estimate is not justified. Calegari, Dimitrov and Tang proved that $1$, $\zeta(2)$ and $L(2,\chi_{-3})$ are linearly independent over $\Q$ \cite{CDT2024}, by a new arithmetic holonomy bound applied to a construction of Zagier. In \cite{CDT2025} they made holonomy bounds effective; Theorem~5.1 there gives $\mu(L(2,\chi_{-3}))\le24781$. Theorem~\ref{thm:main} improves this to $23.82$. For comparison, among classical constants, the bound $\mu(\log2)<3.5746$ of Marcovecchio \cite{Marcovecchio09} and the Rhin--Viola bounds for $\zeta(2)$ and $\zeta(3)$ \cite{RhinViola96,RhinViola01} (after Ap\'ery and Beukers \cite{Beukers79}) have been joined by recent preprints. OpenAI proved $\mu(\pi)=2$, with a Lean formalization \cite{OpenAIPi2026}, improving the bound $\mu(\pi)<7.1033$ of Zeilberger and Zudilin \cite{ZeilbergerZudilin20}. Liu, Jiang and Zhang proved $\mu(\log a)=2$ for every rational $a>0$, $a\ne1$, and for nonzero rational combinations of such logarithms \cite{LiuJiangZhang26}. Giraudin \cite{Giraudin26} lowered the bound for $\mu(\zeta(2))$ to below $5.0193784$. Fauzan \cite{Fauzan2026} announced a proof that $\zeta(5)$ is irrational, using rationally normalized Hankel determinants, and Lai \cite{Lai2026} combined his method with simultaneous approximations of Zudilin and of Dauguet and Zudilin to show that $1$, $\zeta(3)$ and $\zeta(4)$ are linearly independent over $\Q$. \emph{Related work on determinants.} Irrationality proofs built on determinants of large size have a precedent in Zudilin's determinantal criterion with Hankel determinants \cite{Zudilin}; the preprint of Liu, Jiang and Zhang on logarithms \cite{LiuJiangZhang26} uses a separated-weight interpolation determinant, and the arguments of Fauzan and Lai \cite{Fauzan2026,Lai2026} use Hankel determinants. Brown \cite{Brown26} proposes a multivariate transfinite-diameter test for Mellin-type integrals, applied to $\zeta(2)$. The framework we use, determinants whose decay is controlled by Cauchy determinants and Andr\'eief's identity and whose denominators are controlled prime by prime, is OpenAI's \cite{OpenAI2026}. Our determinants are L\"owner (divided-difference) matrices of a digamma difference, a matrix-valued analogue of Pad\'e and Hermite--Pad\'e approximation \cite{NikishinSorokin91}. Formal proofs of irrationality results in Lean also include the irrationality of $\zeta(3)$ by Liu, Zhang and Zhi \cite{LZZ25}. \subsection{Outline of the proof} Section~\ref{sec:overview} explains the construction and the new ideas without technicalities, and states the general deduction. Sections~\ref{sec:construction}--\ref{sec:decay} give the construction and the three estimates (denominator, nonvanishing, decay); Section~\ref{sec:proof} deduces Theorem~\ref{thm:main}. Section~\ref{sec:lean} describes the formalization, and the disclosure of AI use follows it. \subsection{Notation and conventions} $\psi=\Gamma'/\Gamma$ is the digamma function; $v_p$ is the $p$-adic valuation; for $P\in\Q[x]$, $\den P$ is the least positive integer $d$ with $dP\in\Z[x]$; $\vartheta(x;M,a)=\sum_{p\le x,\ p\equiv a\ (M)}\log p$; $(x)_n=x(x+1)\cdots(x+n-1)$; $[0,r)=\{0,1,\dots,r-1\}$. For finite sets $I,J$ of integers and a matrix $A$ indexed by integers, $A[I,J]$ is the submatrix with rows $I$ and columns $J$. %% ===================================================================== \section{Overview of the method and of the new ideas}\label{sec:overview} \subsection{L\"owner matrices of digamma differences} For a function $F$ analytic near distinct points $x_0,\dots,x_{h-1}$ the \emph{L\"owner matrix} \cite{Loewner34} is the matrix of divided differences \[ \Lw_F[a,b]=\frac{F(x_b)-F(x_a)}{x_b-x_a}\ (a\ne b),\qquad \Lw_F[a,a]=F'(x_a). \] It is a Cauchy-like structured matrix, and Hermite's formula gives $\Lw_F=\frac1{2\pi i}\oint F(z)\,v(z)v(z)^{\top}dz$ with $v_a(z)=1/(z-x_a)$, so that a representation of $F$ as a Stieltjes or contour integral exhibits $\Lw_F$ as a Gram matrix of Cauchy kernels. We take three digamma differences, with integer nodes: \begin{equation}\label{eq:frames} \begin{gathered} F_\lambda(z)=\psi(z+1)-\psi(z+\tfrac34),\quad \omega=\tfrac1{16},\quad \xi=\lambda:=\tfrac G2-\tfrac{5\pi^2}{96},\\ F_{\lambda'}(z)=\psi(z+1)-\psi(z+\tfrac14),\quad \omega=-\tfrac1{16},\quad \xi=\lambda':=\tfrac G2+\tfrac{5\pi^2}{96},\\ F_{\chi}(z)=-\tfrac13\psi(z+\tfrac13)+\tfrac12\psi(z+\tfrac12)-\tfrac16\psi(z+1),\\ \omega=-\tfrac16,\quad \xi=\tfrac14L(2,\chi_{-3}). \end{gathered} \end{equation} In each case $\xi=\omega\,F'(0)$ (this is an evaluation of $\psi'$ at $\frac13,\frac12,\frac14,\frac34,1$), while $F(b)-F(a)$ and $F'(a)-F'(0)$ are rational for integers $a,b\ge0$. Hence, for any finite sets of nonnegative integer nodes $R$ (rows) and $Q$ (columns), \begin{equation}\label{eq:shift} \omega\,\Lw_F[R,Q]=M[R,Q]+\xi\,E_{R,Q},\qquad E_{R,Q}[a,b]=\mathbf 1[a=b], \end{equation} with an explicit rational symmetric kernel $M$ on $\Z_{\ge0}^2$ (\S\ref{sec:construction}). Replacing $\xi$ by a variable $x$ gives a matrix polynomial $\Phi(x)=M[R,Q]+xE_{R,Q}$, whose determinant $P(x)$ is a polynomial with rational coefficients of degree at most $|R\cap Q|$, and $P(\xi)=\det(\omega\,\Lw_F[R,Q])$. If $|\xi-p/q|$ is very small, $P(p/q)$ is very close to $P(\xi)$, which is tiny; on the other hand $q^{|R\cap Q|}\den(P)\,P(p/q)$ is an integer. If it is not zero we get a contradiction as soon as \[ \underbrace{\log\den P}_{\text{content}}+|R\cap Q|\log q\ <\ \underbrace{-\log|P(p/q)|}_{\text{decay}} . \] Three estimates are therefore needed: an upper bound for the \emph{content} $\log\den P$, an upper bound for $|P(x)|$ near $\xi$ (the \emph{decay}), and \emph{nonvanishing} of $P(p/q)$ for a size that can be chosen in terms of $q$. We use rectangular geometries, with $R\neq Q$, and all three estimates are new for these constants. \subsection{New idea 1: rectangular (hybrid) frames} We take a long common block $C$ of $r$ nodes, which carries the variable $x$, and two short interleaved blocks of $m\approx r/8$ nodes, \[ \begin{gathered} C=[0,r),\qquad X'=\{r,r+2,\dots,r+2m-2\}\ \text{(rows only)},\\ Y'=\{r+1,r+3,\dots,r+2m-1\}\ \text{(columns only)}, \end{gathered} \] so that $R=C\sqcup X'$ and $Q=C\sqcup Y'$ (a second ``member'' adds one more common node $r+2m$). The determinant $P(x)=\det\Phi(x)$ still has degree $\le r$ (or $r+1$), so the integrality loss $|R\cap Q|\log q$ is that of $r$ nodes, but the matrix has size $r+m$ and its decay is that of a configuration of $(1+\alpha)r$ nodes, $\alpha=m/r$. The content grows too, but less: the extra rows and columns never meet the diagonal. With $\alpha=\frac18$ the content and decay constants become (for $\lambda$) \[ \begin{gathered} \Lambda=3.70343\quad(\text{square frame: }313/105=2.98095),\\ D=3.9028\quad(\text{square frame: }3.1114), \end{gathered} \] and the margin $\eta=D-\Lambda$ rises from $0.1304$ to $0.1994$. The interleaving of $X'$ and $Y'$ is essential: it keeps the two Cauchy determinants in Andr\'eief's formula comparable (\S\ref{sec:decay}) and it gives the reduction modulo $\ell$ the bordered structure of \S\ref{sec:nonvanishing}. \subsection{New idea 2: content by $p$-adic assignment problems and rank deficits} For a prime $p$ let $v$ be the Gauss valuation on $\Q[x]$ (the minimum of the $p$-adic valuations of the coefficients); it is multiplicative. Expanding $\det\Phi(x)$ by Leibniz, $-v(\det\Phi)$ is at most the value $\tau_p$ of the \emph{assignment problem} with weights $W_{ab}=\max(0,-v_p(M[a,b]))$, i.e. the maximum of $\sum_aW_{a\sigma(a)}$ over bijections $\sigma:R\to Q$. By LP duality, any \emph{potentials} $u_a,v_b$ with $W_{ab}\le u_a+v_b$ certify $\tau_p\le\sum u_a+\sum v_b$. We give explicit potentials for every prime power $p^e$ (they depend only on $p^e/r$ and on $p\bmod 4$ or $p\bmod 6$), and sum over primes with the prime number theorem in arithmetic progressions. This gives a ``tropical'' content $\Lambda_{\rm trop}=3.74993$ for $\lambda$. The tropical bound is not sharp. If $(u,v)$ is an optimal dual solution, the scaled matrix $B=p^{u}\Phi p^{v}$ has entries in the valuation ring $\cO$ of $v$, and $v(\det\Phi)=-\tau_p+v(\det B)\ge-\tau_p+\corank(B\bmod p)$. So every unit of corank of the reduction of $B$ modulo $p$ over $\F_p(x)$ saves one factor of $p$. We compute this corank in several ranges of primes, using the block structure of the reduction (residue classes modulo $p$), Schur complements, the identity $H_{p-1-n}\equiv H_n\pmod p$ for harmonic numbers, an antisymmetry of Cauchy-type sums, and the Frobenius--K\"onig theorem. The savings lower the content from $3.74993$ to $3.70343$; with the decay constant below this lowers the exponent from about $50.0$ to $38.34$. \subsection{New idea 3: nonvanishing through a commuting Jacobi matrix} Fix a prime $\ell$ in a suitable residue class with $\ell\nmid q$. After scaling by $\ell$ the rows and columns of nodes beyond a threshold $K\approx\ell/4$, the matrix $\Phi(x)$ reduces modulo $\ell$ to a \emph{bordered Cauchy--Gram} matrix: \[ \begin{gathered} \ell^{2h}\det\Phi(x)\equiv\text{unit}\times\det\begin{pmatrix}yI_K+N_S&W_{Y}\\ W_X^{\top}&0\end{pmatrix}\pmod\ell, \\ y=\text{affine function of }x, \end{gathered} \] where $N_S=\sum_{j=1}^{S}c_jc_j^{\top}$ is a sum of rank-one Gram terms of Cauchy vectors $c_j=(1/(a+j))_{0\le ar$ & $(N-k)_+$ & $0$ on $C$, $\mathbf 1[z\ge k]$ on the zone\\ \bottomrule \end{tabular} \end{center} ($\|\cdot\|$ is the distance to the nearest integer.) \end{proposition} \begin{proof}[Proof sketch] In each range one writes down potentials and checks $w\le u+v$ entrywise, using two facts: two distinct indices not congruent modulo $q$ have $w\le1$, and two zone nodes are never congruent once $q\ge2m$. For example, for $q\ge N$ and $k\le r$, give the common nodes the potential $\mathbf 1[c\ge k]$ and the zone nodes the potential $1$: there are no congruences, so $w\le1$ off the diagonal, and the diagonal cells (only at $c\in C$) are covered. For $q<2m$ the potentials are $\frac12,\frac32,1$ on rows and $\frac32,\frac12,1$ on columns of a residue class $\varrho$, according as $X'$ has more, fewer or as many nodes in $\varrho$ as $Y'$; since the zone alternates between $X'$ and $Y'$, the imbalance is at most one per class and the number of unbalanced classes is $2q\|m/q\|$. The certificates for $2m\le q\le r$ start from the square-frame potential on $C$ and raise the potential of low zone nodes (first certificate), or move half a unit between rows and columns in the residue classes of high zone nodes (second certificate). All cases are checked in the formal proof. \end{proof} \begin{remark} The certificates are sharp: the exact assignment value computed by the Hungarian algorithm agrees with $\delta_A+E$ for all odd $q$ and all tested $(r,m)$. Sharpness is not used. \end{remark} \subsection{The tropical content} Put $\theta=q/r$, $\alpha=m/r$. Proposition~\ref{prop:dual} gives $\tau(w^{(q)})\le r\,f_j(\theta;\alpha)+O(1)$ for an explicit continuous piecewise linear function $f_j$ supported in $[0,4(1+2\alpha)/j]$. Summing over primes in the two classes modulo $4$ with the prime number theorem in arithmetic progressions, $\frac1r\sum_{p\equiv a\,(4)}f(p/r)\log p\to\frac12\int_0^\infty f$ for bounded Riemann-integrable $f$ of compact support (see \cite[Ch.~20]{Davenport} for the prime number theorem in progressions), one finds \[ \begin{gathered} \sum_p\tau_p\log p\le(\Lambda_{\rm trop}(\alpha)+o(1))r^2,\\ \Lambda_{\rm trop}(\alpha)=\frac{313}{105}+\frac{554}{105}\alpha+\Bigl(\frac{118}{21}+2\log2\Bigr)\alpha^2 \end{gathered} \] for $\alpha\le\frac18$ (the term $2\alpha^2\log 2$ comes from the sawtooth $q\|m/q\|$ in the range $q<2m$). At $\alpha=\frac18$, $\Lambda_{\rm trop}=3.7499347\ldots$; for $\alpha=0$ it is the square-frame value $313/105$. \subsection{Rank deficits} The assignment bound is sharp for the matrix of weights, but not for $\det\Phi$: cancellation in the Leibniz expansion makes $\den P$ smaller. We capture it by the following principle. \begin{lemma}[rank deficit]\label{lem:rank} Let $(u,v)$ be integer-valued potentials feasible for the weights of $\Phi$ at $p$, of value $\tau'$. Then $B=\operatorname{diag}(p^{u})\,\Phi\,\operatorname{diag}(p^{v})$ has entries in $\cO$, and \[ v_p(\den P_{\mathcal G})\le\tau'-\corank_{\F_p(x)}(B\bmod p). \] \end{lemma} \begin{proof} $v(\det\Phi)=-\tau'+v(\det B)$, and over the discrete valuation ring $\cO$ the Smith normal form shows $v(\det B)\ge\corank(B\bmod p)$. (The formal proof avoids the Smith form: if $B\bmod p$ has rank $\rho$, an explicit rank witness and a change of basis over $\cO$ exhibit $|I|-\rho$ rows divisible by $p$.) \end{proof} Write $\delta_p$ for the corank obtained in this way with an optimal dual (so $v_p(\den P)\le\tau_p-\delta_p$). We use five families of primes. In all of them $p^2>4N$, so only the level $e=1$ matters; the reduction $B\bmod p$ has a block structure governed by the singular indices $k\in S_p$ below $N$, which cut $[0,N)$ into blocks on which the leading coefficients ($\operatorname{lead}_{-1}$ of the partial sums of $1/(4k(4k-1))$ and $\operatorname{lead}_{-2}$ of the diagonal sums) are constant. \begin{theorem}[rank deficits for $\lambda$]\label{thm:deficits} Let $\mathcal G=\mathcal G(r,m,e)$ be admissible and $r$ large. Then $v_p(\den P_{\mathcal G})\le\tau_p-\delta_p+O(1)$, with $\delta_p$ as follows, for all primes $p$ except $p\in\{139,1009\}$: \begin{center} \begin{tabular}{p{0.30\textwidth}ll} \toprule primes & $\delta_p$ & mechanism\\ \midrule $p\equiv3\ (4)$, $\frac58rS+K+m$ (all its prime factors are at most $S+K+m$). \end{lemma} \begin{proof}[Proof sketch] Let $U$ and $V'$ be the Lagrange bases of $\ker W_X^{\top}$ and $\ker W_Y^{\top}$, $H=V'^{\top}U$ and $H_c=V'^{\top}N_{S-1}U$; both are symmetric. Then $\Pi=UH^{-1}V'^{\top}$, hence $\Pi N_{S-1}U=UB$ with $B=H^{-1}H_c$, and $B$ is self-adjoint for $H$, which turns the row-Krylov matrix into the column-Krylov matrix up to the factors $(c_X/c_Y)^n$ and $\det H$, where $c_X=\Pi_X(S)/\prod_a(\theta+a+S)$ and $c_Y$ is the same with $\Pi_Y$. Two block-determinant identities, $\det[W_X\,|\,V']\det[W_Y\,|\,U]=\Delta\det H$ and $\det[W_Y\,|\,C]\det[W_X\,|\,V']=\Delta\det(C^{\top}V')$ with $C=[c_1,\dots,c_n]$, eliminate $\det H$ and $\Delta$. By Lagrange interpolation $C^{\top}V'$ is a diagonal matrix times a Vandermonde matrix, and $\det[W_Y\,|\,C]$ is a Cauchy determinant; this gives the stated $\nu$, whose only $\theta$-dependence is $\prod_{a0$, with integers $e_c$ and a nonzero rational $\varkappa$ whose prime factors are at most $B$. \end{definition} Good functions with bound $B$ form a group under multiplication. The point of the definition is that a good function with $B<\ell$ is continuous at $\theta=0$ and its value there is an $\ell$-adic unit. \begin{theorem}[good form]\label{thm:good} Assume $1\le m0$ (this is the only range used, and it is proved over $\Q$), if $W's+X\Pi Rt=0$, then $s=0$ (apply $W_{X'}^{\top}$ and $X\Pi=\Pi'X$), so $y=\Pi Rt$ lies in $V\cap\ker X$; the range of $X^{\top}$ is contained in the span of $[R\,|\,W_X]$ (the row chain at the border points) and both have dimension $K-1$, so they are equal and $R^{\top}y=0$, i.e.\ $(R^{\top}\Pi R)t=0$. Finally $\det(R^{\top}\Pi R)\cdot\Delta=\det([R\,|\,W_X]^{\top}[R\,|\,W_Y])$ by a Schur complement. For two families of $m'$ distinct shifts $x$, $y$ with $a+x_i>0$ and $a+y_i>0$ for all nodes $a$, Cauchy--Binet gives \[ \det(C_x^{\top}C_y)=V(x)V(y)\sum_{P}V(P)^2\prod_{a\in P}\prod_{i}\frac1{(a+x_i)(a+y_i)}, \] the sum over $m'$-subsets $P$ of the nodes, with $V$ the Vandermonde product. The sum is positive and $V(x)V(y)\neq0$, so the determinant is nonzero. This applies to $\Delta$ and to $[R\,|\,W_X]^{\top}[R\,|\,W_Y]$, hence $\det(R^{\top}\Pi R)\ne0$ and $t=0$. \end{enumerate} Every factor in the displayed identity is now good except the products over $l(-j)=-\tau(-\theta+j)$ and the Pochhammer denominator of $\mathcal G$, which contain factors $\theta-j-1$ with negative shift; these two sets of factors coincide and cancel. The values $\kappa(\tilde T',w')$ and $\kappa(\tilde T,\cdot)$ are chain products by (K3) and nonzero. Combining with the diagonal step at $(K,m,n-1)$, (K1) and (K2), one obtains \[ u(m,n,n;\theta-1)=u(m,n-1,n;\theta)\cdot(\text{good factor}). \] Since $u(m,n-1,n)$ is good by the induction hypothesis (as $n\ge n-1$), so is $u(m,n,n)$, and the diagonal steps give all $S\ge n$. All bases stay in $[1,B]$ and all constants have prime factors at most $B$. This proves Theorem~\ref{thm:good}. \qed \subsection{The mirror constant and $L(2,\chi_{-3})$}\label{ssec:nvother} \emph{The mirror constant.} For $\lambda'$ one takes primes $\ell\equiv1\pmod4$ and $K=(\ell+3)/4$. The only $\ell$-singular factor is again $4K-3=\ell$, and the reduction gives the same pair of bordered matrices (with the opposite sign of the shift). Everything else is unchanged. \emph{$L(2,\chi_{-3})$: three levels of nodes.} Let $\ell=6t+1$ be prime, $K=(\ell+2)/3=2t+1$, $T=(\ell+1)/2=3t+1$, and $m_0=3t$. Now there are two $\ell$-singular indices among $1,\dots,\ell-1$, namely $K$ (where $3K-2=\ell$) and $T$ (where $2T-1=\ell$); the factor $k$ in $d(k)$ is a unit. Accordingly the nodes are \emph{low} $[0,K)$, \emph{middle} $[K,m_0]$ and \emph{top} $[T,\ell-1]$. The geometries are tied to $\ell$: we take $r+2m=m_0$, so all nodes of $\mathcal G_e$ are low or middle, the extra node of the second member is $m_0$, and $K\le r$ is the condition $2m+1\le t$. With the scaling $1$ on low and $\ell$ on middle and top nodes, a window identity for sliding sums of $1/u$ modulo $\ell$, \[ \sum_{ac/\eta$, and suppose $|\xi-p/q|0$ with $\nu>c(1+\delta)/\eta$, let $r=\lceil(1+\delta)L/\eta\rceil$ and choose $m$ with $r\le8m\le r+8$. \emph{Choice of $\ell$.} By the prime number theorem in progressions, the primes $\ell\equiv3\pmod4$ in $[\frac43(r+m)+1,4r-1]$ have product $\exp((\frac54+o(1))r)$ (as $m\le\frac r8+1$), which exceeds $q=e^L$ since $r\gg L$. So one of them does not divide $q$. By Theorem~\ref{thm:nv} with $x_0=p/q$, there is $e\in\{0,1\}$ with $P_{\mathcal G_e}(p/q)\ne0$, where $\mathcal G_e=\mathcal G(r,m,e)$. \emph{Lower bound.} By Lemma~\ref{lem:integrality}, $|d_{\mathcal G_e}P_{\mathcal G_e}(p/q)|\ge q^{-(r+1)}=e^{-(r+1)L}$. \emph{Upper bound.} Write $p/q=\xi+t$ with $|t|c(1/\eta+\frac45)$, and choose $\delta$ small. The primes $\ell\equiv1\pmod 6$ in an interval $(Y,Y+(2+\delta)L]$ with $Y=\frac52(1+\delta)L/\eta$ have product $e^{(1+\delta/2+o(1))L}>q$, so one of them, $\ell$, does not divide $q$. The corresponding scale satisfies \[ (1+\delta)L/\eta-O(1)\le r\le\tfrac25\bigl(Y+(2+\delta)L\bigr)+O(1)=\Bigl(\frac{1+\delta}\eta+\frac{2(2+\delta)}5\Bigr)L+O(1), \] so $cr<\nu L$ for $\delta$ small, and the comparison above, with $|C|\le r+1$, gives a contradiction. Hence \[ \mu\bigl(\tfrac14L(2,\chi_{-3})\bigr)\le c\Bigl(\frac1\eta+gs\Bigr),\qquad g=\tfrac25,\ s=2, \] and $6.6510\,(1/0.3595401+0.8)=23.8194\ldots<23.82$. This completes the proof of Theorem~\ref{thm:main}. \qed \begin{remark}[relation to linear independence criteria] The deduction is a one-dimensional version of the familiar scheme behind the criteria of Nesterenko \cite{Nesterenko85} and their use by Ball and Rivoal \cite{BallRivoal01}: the nonzero integer $q^{|C|}d_{\mathcal G}P_{\mathcal G}(p/q)$ plays the role of a small linear form with integer coefficients. The difference is that the lower bound for the form comes from an arithmetic nonvanishing statement (Theorem~\ref{thm:nv}) rather than from an analytic asymptotic, and that the size $r$ of the determinant is chosen in terms of $q$. \end{remark} \begin{remark}[where the constants enter] For $\lambda$, $\partial\mu/\partial D=-c/\eta^2\approx-192$, so the third decimal of $D$ matters. The rank deficits of \S\ref{sec:content} lower the exponent from $50.0$ to $38.34$, and the free choice of $\ell$ (Theorem~\ref{thm:nv} for all $S$ in a range) removes a term $c\,g\,s$ which would otherwise be about $5.1$. For $L(2,\chi_{-3})$ the term $c\,g\,s=5.32$ is still present; a version of Theorem~\ref{thm:nv} that also covers primes dividing $q$ to the first power would halve it. \end{remark} %% ===================================================================== \section{Formalization}\label{sec:lean} \raggedbottom All results of this paper are formalized in Lean~4 \cite{Lean4} with Mathlib \cite{Mathlib}. The development is available at \begin{center} \FormalizationLink \end{center} and combines analytic and arithmetic proofs with generated rational data and kernel checks for the dual certificates of Section~\ref{sec:content} and the decay certificates of Section~\ref{sec:decay}; numerical computations alone are not used as proof. The constants are written out as series, so the main statements use no definitions of the development: $G$ is $\sum_j(-1)^j/(2j+1)^2$ and $L(2,\chi_{-3})$ is $\sum_k\bigl((3k+1)^{-2}-(3k+2)^{-2}\bigr)$. The main statements are stated in \lean{ChallengeHybrid.lean} and proved in \lean{SolutionHybrid.lean} (namespace \lean{CatalanHybridChallenge}): \begin{itemize} \item \lean{lam_hybrid_measure}: for every $e>0$, all sufficiently large $q\in\N$ and all $p\in\Z$ coprime to $q$, $q^{-(38.35+e)}<|G-5\pi^2/48-p/q|$ (Theorem~\ref{thm:main}); it is \lean{lam_hyb_measure_final}; \item \lean{mir_hybrid_measure}: the same for $G+5\pi^2/48$; it is \lean{mir_hyb_measure_final}; \item \lean{chi3_hybrid_measure}: the same for $L(2,\chi_{-3})$ with exponent $23.82$; it is \lean{chi3_hybrid_measure_wide}; \item \lean{nv_hyb_nonvanishing_gen}: Theorem~\ref{thm:nv} and its analogues in \S\ref{ssec:nvother}; \item \lean{hyb_primal_false} and \lean{primal_pair}: the end of the nonvanishing chain and Lemma~\ref{lem:primal}; \item \lean{lam_hybrid_decay}, \lean{p6_hybrid_decay}: Theorem~\ref{thm:decay} for $\lambda$ and $L(2,\chi_{-3})$; \item \lean{lam_both_eps4}, \lean{p6_content}: Theorem~\ref{thm:content} for $\lambda$ and $L(2,\chi_{-3})$. \end{itemize} The solution has no \lean{sorry} and no \lean{native_decide}, and the command \texttt{\#print axioms} reports only the three standard axioms \lean{propext}, \lean{Classical.choice} and \lean{Quot.sound}. The file \lean{comparator-hybrid.json} is a configuration for \lean{lake comparator} stating that \lean{SolutionHybrid} proves the statements of \lean{ChallengeHybrid} with these axioms only. We have not run Comparator, which requires Linux; the axiom check above was done with \texttt{\#print axioms}. The prime number theorem in arithmetic progressions (moduli $4$ and $6$) enters the content asymptotics and the selection of the prime $\ell$. The formal source for it is the PNT+ project \cite{PNTPlus}, through OpenAI's workspace and compatibility additions, whose Wiener--Ikehara theorem we use. \begingroup \noindent The following file groups implement the indicated parts of the proof.\par\medskip \noindent \lean{CatalanCore/Rect}\par Geometries, the matrices $\Phi_{\mathcal G}$, Lemma~\ref{lem:integrality}, pair families and admissible relations.\par\medskip \noindent \lean{CatalanCore/Arith/Hybrid}\par Gauss valuations, Lemma~\ref{lem:trop}, the level majorant, Proposition~\ref{prop:dual}, prime sums over linear pieces, the rank-deficit interface (Lemma~\ref{lem:rank}) and bordering.\par\medskip \noindent \lean{CatalanFrames/Lambda/Hyb*}, \lean{CatalanFrames/LambdaMirrorHybrid}, \lean{CatalanFrames/P6Hybrid}\par Theorem~\ref{thm:content} and Theorem~\ref{thm:deficits} for the three constants.\par\medskip \noindent \lean{CatalanFrames/LambdaHybrid/NV}\par Proposition~\ref{prop:red} and its three-level analogue, Lemma~\ref{lem:primal} (\lean{Primal}), Theorem~\ref{thm:nv} (\lean{FinalNV}).\par\medskip \noindent \lean{CatalanCore/Star/Leonard}\par Proposition~\ref{prop:delta}, Proposition~\ref{prop:bispectral}, (K1)--(K5), the diagonal and Darboux steps, the positivity argument, Lemma~\ref{lem:bridge}, Theorem~\ref{thm:good} and the specialisation $\theta\to0$.\par\medskip \noindent \lean{CatalanCore/Decay/Rect}, \lean{CatalanCore/Cert/SigmaHyb}, \lean{CatalanCore/Cert/SigmaP6H}\par The contour identity, the two-family Andr\'eief bound, Lemma~\ref{lem:cpd}, node removal, and the certificates of Proposition~\ref{prop:cert} and \S\ref{ssec:chicert}.\par\medskip \noindent \lean{CatalanCore/Measure}, \lean{CatalanFrames/*/Assembly*}\par The deduction of Section~\ref{sec:proof}.\par\medskip \endgroup The proofs were checked with Lean \texttt{v4.35.0-rc2} and the matching Mathlib release. The vendored files from OpenAI's repository and from the PNT+ project were converted to Lean's module system and ported to the current toolchain; the repository's README and provenance documents describe the changes. \section*{Disclosure of AI use} The development was produced by the AI systems Claude Opus~5.5 and Claude Sonnet~5.5 (Anthropic): the mathematics, including the rectangular frames, the content bounds and rank deficits, the nonvanishing argument and the decay certificates, and all proofs; the Lean formalization; the numerical computations and the certificate generators; the literature search; and the text of this paper. Claude worked in a series of conversations at the request of the author, who posed the problem, directed the work, and is responsible for this submission. The repository infrastructure, vendored formalizations and certificate tooling of the companion project \cite{Litsey2026}, which this work reuses, were developed with OpenAI Codex as described there. The underlying determinant method and the irrationality proof for $G$ are OpenAI's \cite{OpenAI2026}. We use Lean~4 \cite{Lean4}, Mathlib \cite{Mathlib}, the PNT+ project \cite{PNTPlus}, and Arb \cite{Arb} (through \texttt{python-flint}) for interval arithmetic in generating certificate data, which Lean re-checks. The formal verification in Lean is intended as an independent check of every step of the argument above. % Bibliography generated by BibTeX (amsplain) from refs.bib; inlined for upload. \providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace} \providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR } % \MRhref is called by the amsart/book/proc definition of \MR. \providecommand{\MRhref}[2]{% \href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2} } \providecommand{\href}[2]{#2} \begin{thebibliography}{10} \bibitem{AAR99} George~E. Andrews, Richard Askey, and Ranjan Roy, \emph{Special functions}, Encyclopedia of Mathematics and its Applications, vol.~71, Cambridge University Press, Cambridge, 1999. \bibitem{BallRivoal01} Keith Ball and Tanguy Rivoal, \emph{Irrationalit\'e d'une infinit\'e de valeurs de la fonction z\^eta aux entiers impairs}, Invent. Math. \textbf{146} (2001), no.~1, 193--207. \bibitem{Beukers79} Frits Beukers, \emph{A note on the irrationality of $\zeta(2)$ and $\zeta(3)$}, Bull. London Math. Soc. \textbf{11} (1979), no.~3, 268--272. \bibitem{Brown26} Francis Brown, \emph{Mellin transforms, transfinite diameter and rational approximations of integrals}, 2026, Preprint, 22 April 2026. \bibitem{CDT2024} Frank Calegari, Vesselin Dimitrov, and Yunqing Tang, \emph{The linear independence of $1$, $\zeta(2)$, and $l(2,\chi_{-3})$}, 2024. \bibitem{CDT2025} \bysame, \emph{Arithmetic holonomy bounds and effective {D}iophantine approximation}, 2025, Theorem 5.1 gives $\mu(L(2,\chi_{-3}))\le 24781$ (checked at the source by S.~Litsey). \bibitem{Carreira2026} Marcos Costa Santos~Carreira, \emph{General designs and an irrationality exponent for {C}atalan's constant}, Preprint v1, October 12, 2026, \href{https://doi.org/10.5281/zenodo.23326325}{doi:10.5281/zenodo.23326325}; sources at \url{https://github.com/MarcosCarreira/catalan-designs}, 2026. \bibitem{Davenport} Harold Davenport, \emph{Multiplicative number theory}, third ed., Graduate Texts in Mathematics, vol.~74, Springer, New York, 2000, Revised and with a preface by H.~L.~Montgomery. \bibitem{Lean4} Leonardo de~Moura and Sebastian Ullrich, \emph{The {L}ean 4 theorem prover and programming language}, Automated Deduction -- CADE 28, Lecture Notes in Computer Science, vol. 12699, Springer, 2021, pp.~625--635. \bibitem{Eskandari2026} Payman Eskandari, \emph{Improved rational approximations to {C}atalan's constant}, 2026, Preprint, 22 September 2026. \bibitem{EMN2025} Payman Eskandari, Kumar Murty, and Yusuke Nemoto, \emph{Mixed motives and linear forms in the {C}atalan constant}, 2025, Preprint, October 2025 (v3: 29 August 2026). \bibitem{Fauzan2026} Aabir Fauzan, \emph{$\zeta(5)$ is irrational}, Preprint v1, September 17, 2026, Zenodo, \href{https://doi.org/10.5281/zenodo.22826419}{doi:10.5281/zenodo.22826419}, 2026. \bibitem{Forrester2018Andreief} Peter~J. Forrester, \emph{Meet {A}ndr\'eief, {B}ordeaux 1886, and {A}ndreev, {K}harkov 1882--83}, 2018. \bibitem{Giraudin26} David~Niedbala Giraudin, \emph{A new upper bound for the irrationality exponent of $\zeta(2)$}, 2026, Preprint, 2 October 2026. \bibitem{GruenbaumHaine97} F.~Alberto Gr\"unbaum and Luc Haine, \emph{Bispectral {D}arboux transformations: an extension of the {K}rall polynomials}, Int. Math. Res. Not. (1997), no.~8, 359--392. \bibitem{GruenbaumYakimov02} F.~Alberto Gr\"unbaum and Milen Yakimov, \emph{Discrete bispectral {D}arboux transformations from {J}acobi operators}, Pacific J. Math. \textbf{204} (2002), no.~2, 395--431. \bibitem{Jha2026} R.~K. Jha, \emph{A finite irrationality measure for {C}atalan's constant}, Preprint v1, October 8, 2026, \href{https://doi.org/10.5281/zenodo.23237269}{doi:10.5281/zenodo.23237269}; Lean sources at \url{https://github.com/rohitkrjha/catalan-measure}, 2026. \bibitem{Arb} Fredrik Johansson, \emph{Arb: efficient arbitrary-precision midpoint-radius interval arithmetic}, IEEE Trans. Comput. \textbf{66} (2017), no.~8, 1281--1292. \bibitem{KLS} Roelof Koekoek, Peter~A. Lesky, and Ren\'e~F. Swarttouw, \emph{Hypergeometric orthogonal polynomials and their $q$-analogues}, Springer Monographs in Mathematics, Springer, Berlin, 2010. \bibitem{Kratt99} Christian Krattenthaler, \emph{Advanced determinant calculus}, S\'em. Lothar. Combin. \textbf{42} (1999), Art. B42q, 67 pp. \bibitem{Kratt05} \bysame, \emph{Advanced determinant calculus: a complement}, Linear Algebra Appl. \textbf{411} (2005), 68--166. \bibitem{KrattRivoal08} Christian Krattenthaler and Tanguy Rivoal, \emph{On a linear form for {C}atalan's constant}, South East Asian J. Math. Math. Sci. \textbf{6} (2008), no.~2, 3--15. \bibitem{KrattZudilin19} Christian Krattenthaler and Wadim Zudilin, \emph{Hypergeometry inspired by irrationality questions}, Kyushu J. Math. \textbf{73} (2019), no.~1, 189--203. \bibitem{Lai2026} Li~Lai, \emph{The linear independence of $1$, $\zeta(3)$, and $\zeta(4)$}, 2026, Preprint, 5 October 2026 (v2: 15 October 2026). \bibitem{Litsey2026} Sean Litsey, \emph{An irrationality measure for {C}atalan's constant}, Hexagon preprint hexagon:2610.00187v4, \url{https://hexagonmath.org/2610.00187v4}, 2026. \bibitem{LiuJiangZhang26} Jingwen Liu, Kai Jiang, and Pingwen Zhang, \emph{Irrationality exponents of logarithms of positive rational numbers}, 2026, Preprint, 7 October 2026. \bibitem{LZZ25} Junqi Liu, Jujian Zhang, and Lihong Zhi, \emph{A formal proof of the irrationality of $\zeta(3)$ in {L}ean 4}, 2025. \bibitem{Loewner34} Karl L\"owner, \emph{\"{U}ber monotone {M}atrixfunktionen}, Math. Z. \textbf{38} (1934), 177--216. \bibitem{Marcovecchio09} Raffaele Marcovecchio, \emph{The {R}hin--{V}iola method for $\log 2$}, Acta Arith. \textbf{139} (2009), no.~2, 147--184. \bibitem{Nesterenko85} Yu.~V. Nesterenko, \emph{On the linear independence of numbers}, Vestnik Moskov. Univ. Ser. I Mat. Mekh. (1985), no.~1, 46--49, In Russian; English translation: Moscow Univ. Math. Bull. 40 (1985), no. 1, 69--74. \bibitem{NikishinSorokin91} E.~M. Nikishin and V.~N. Sorokin, \emph{Rational approximations and orthogonality}, Translations of Mathematical Monographs, vol.~92, American Mathematical Society, Providence, RI, 1991. \bibitem{OpenAI2026} {OpenAI}, \emph{Catalan's constant is irrational}, Preprint (September 24, 2026), with a Lean formalization, available at \href{https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Catalans-constant-is-irrational-September-24-2026/paper.pdf}{the original paper PDF} and \href{https://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/OAI/NumberTheory/Catalan}{the Lean formalization} (repository commit \texttt{fd4aeeb}, October 7, 2026), 2026. \bibitem{OpenAIPi2026} \bysame, \emph{The irrationality exponent of $\pi$ is 2}, Preprint (September 24, 2026), \url{https://github.com/openai/math/tree/main/preprints/The-irrationality-exponent-of-pi-is-2-September-24-2026}, 2026. \bibitem{RhinViola96} Georges Rhin and Carlo Viola, \emph{On a permutation group related to $\zeta(2)$}, Acta Arith. \textbf{77} (1996), no.~1, 23--56. \bibitem{RhinViola01} \bysame, \emph{The group structure for $\zeta(3)$}, Acta Arith. \textbf{97} (2001), no.~3, 269--293. \bibitem{RivoalZudilin2003} Tanguy Rivoal and Wadim Zudilin, \emph{Diophantine properties of numbers related to {C}atalan's constant}, Math. Ann. \textbf{326} (2003), no.~4, 705--721. \bibitem{SaffTotik} Edward~B. Saff and Vilmos Totik, \emph{Logarithmic potentials with external fields}, Grundlehren der mathematischen Wissenschaften, vol. 316, Springer, Berlin, 1997. \bibitem{SpiridonovZhedanov97} Vyacheslav Spiridonov and Alexei Zhedanov, \emph{Spectral transformations, self-similar reductions and orthogonal polynomials}, J. Phys. A \textbf{30} (1997), no.~21, 7621--7637. \bibitem{Sun2026} Zhi-Wei Sun, \emph{Catalan's constant is irrational}, 2026. \bibitem{Mathlib} {The mathlib Community}, \emph{The {L}ean mathematical library}, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), 2020, pp.~367--381. \bibitem{PNTPlus} {The PrimeNumberTheoremAnd contributors}, \emph{The {PNT+} project: a {L}ean formalization of the prime number theorem and related results}, \url{https://github.com/AlexKontorovich/PrimeNumberTheoremAnd}, The vendored compatibility additions used here are recorded in the repository's \texttt{NOTICE} and \texttt{PORTING.md}. \bibitem{Wachs2026} Dane Wachs, \emph{A note on a recent claimed proof of the irrationality of {C}atalan's constant}, 2026. \bibitem{ZeilbergerZudilin20} Doron Zeilberger and Wadim Zudilin, \emph{The irrationality measure of $\pi$ is at most $7.103205334137\ldots$}, Mosc. J. Comb. Number Theory \textbf{9} (2020), no.~4, 407--419. \bibitem{Zhedanov97} Alexei Zhedanov, \emph{Rational spectral transformations and orthogonal polynomials}, J. Comput. Appl. Math. \textbf{85} (1997), no.~1, 67--86. \bibitem{Zudilin02Cheb} Wadim Zudilin, \emph{A few remarks on linear forms involving {C}atalan's constant}, Chebyshevskii Sb. \textbf{3} (2002), no.~2(4), 60--70, In Russian. \bibitem{Zudilin2003} \bysame, \emph{An {A}p\'ery-like difference equation for {C}atalan's constant}, Electron. J. Combin. \textbf{10} (2003), Research Paper 14. \bibitem{Zudilin} \bysame, \emph{A determinantal approach to irrationality}, Constr. Approx. \textbf{45} (2017), no.~2, 301--310. \bibitem{Zudilin19Survey} \bysame, \emph{Arithmetic of {C}atalan's constant and its relatives}, Abh. Math. Semin. Univ. Hambg. \textbf{89} (2019), no.~1, 45--53. \end{thebibliography} \end{document}