Geometric rank-one dependence makes a determinant affine in its parameter
ProvedEulerMascheroni.Arithmetic.geometric_rank_one_determinant_affinedeterminantseuler-constantlinear-algebra
Let be a commutative ring, an matrix over , and . There exist , independent of , such that
Subtracting times the first row from row removes the parameter from every row except the first; multilinearity then gives the assertion.
This is an obstruction to a naive higher-degree Hankel strategy for the Euler–Gompertz constant. Raw factorial remainders have the form , where . Their Hankel matrices have precisely the displayed form with , so increasing the determinant size still produces an affine expression in . The theorem does not rule out Hankel determinants of differently normalized or transformed Padé errors.
Preamble
import Mathlib
Formal statement
theorem EulerMascheroni.Arithmetic.geometric_rank_one_determinant_affine {R : Type*} [CommRing R] (n : ℕ)
(A : Matrix (Fin (n+1)) (Fin (n+1)) R) (r : R) :
∃ a b : R, ∀ t : R,
Matrix.det (fun i j => A i j + r^(i.val+j.val)*t) = a*t+b := by sorry
Source
Elementary determinant row operations. Application prompted by Matala-aho and Zudilin, Euler factorial series and global relations, https://arxiv.org/html/1703.02633, Section 4; no novelty is claimed for the rank-one determinant identity.