Positive Laguerre Padé remainder and explicit rational lower bound
ProvedEulerMascheroni.Arithmetic.pade_positive_remainder_and_lower_boundLet be the integer Laguerre Padé sequences for the Euler–Gompertz constant . Their remainder satisfies
For every positive integer , it has the explicit rational lower bound
For the identity, set . These nonnegative kernels are integrable and tend to zero at infinity, by comparison with . The derivative identity
and the fundamental theorem of calculus on the positive half-line give the recurrence for . The initial values are and , the latter from . This identifies the integral sequence with by induction. Positivity follows from strict positivity of the kernel for .
To obtain the lower bound, restrict the integral to . On this interval the three factors are bounded below by , , and . The inequality makes the bound rational. No unproved irrationality assertion or analytic remainder identity is imported.
Combined with the exact Padé gcd formula, this supplies a rigorous way to test whether integer normalization destroys the apparent analytic smallness of the approximation.
import Definitions.Def_eulerMascheroni_padeTransform open MeasureTheory Set EulerMascheroni.Arithmetic
theorem EulerMascheroni.Arithmetic.pade_positive_remainder_and_lower_bound (n : ℕ) :
((padeQ n:ℝ)*EulerMascheroni.gompertzConstant-(padeP n:ℝ) =
(n.factorial:ℝ)*(∫ s in Ioi (0:ℝ), (s/(1+s))^n * Real.exp (-s)/(1+s))) ∧
0 < (padeQ n:ℝ)*EulerMascheroni.gompertzConstant-(padeP n:ℝ) ∧
∀ K : ℕ, 0 < K →
(n.factorial:ℝ)*(K:ℝ)^n / (((K:ℝ)+1)^n * 3^(K+1) * ((K:ℝ)+2)) ≤
(padeQ n:ℝ)*EulerMascheroni.gompertzConstant-(padeP n:ℝ) := by sorry