math.NT — Number Theory
An Irrationality Measure for Catalan's Constant
uilding on OpenAI's recent proof that Catalan's constant is irrational, we prove that \[ \left|G-\frac ab\right|>b^{-8\,127} \] for all integers and all sufficiently large integers . Thus the irrationality exponent of is at most ; without the prime number theorem in the final step the same argument gives . The previous best bound, due to Jha, is . The new ingredient is a perturbation estimate for OpenAI's determinant, viewed as a polynomial in the constant: on the interval the polynomial moves by no more than OpenAI's bound for . It is proved by a quadrature formula for the coefficient of the constant, an Andr\'eief identity with fixed columns, a generalized Vandermonde bound, and OpenAI's energy method rerun for configurations with fewer points. We also give a new certificate, with re-optimized trial sequences, for one of the two cases of OpenAI's logarithmic-energy dual; it raises the margin of the argument by a factor of almost eight. Every step, including the final theorem, is formalized in Lean~4 on top of OpenAI's formalization, without \texttt{sorry} and with only the standard axioms.