Integer linear forms from phase-compatible primitive saving
ProvedEulerMascheroni.P2.int_linear_forms_of_primitive_savingformalizationirrationalitynumber-theory
Assume for every and the P2 oscillatory asymptotic
Write in lowest terms, , and . Suppose also that, for every and every , some has
Then there exist integer sequences , with , such that
This is a conditional theorem. It constructs the integer forms from reduced rational approximants on a selected subsequence; it does not assert the arithmetic-saving hypothesis. Phase noncancellation and small normalization must hold jointly, not merely on two unrelated infinite sets.
Preamble
import Definitions.Def_eulerMascheroni_p2PrimitiveNormalization open Filter Topology open EulerMascheroni.P2
Formal statement
theorem EulerMascheroni.P2.int_linear_forms_of_primitive_saving
(hQ : ∀ n, 0 < Q n)
(hnum : Tendsto (fun n : ℕ => F (n+1) / fModel (n+1) - Real.sin (phase (n+1)))
atTop (nhds 0))
(hsave : PrimitiveSaving) :
∃ p q : ℕ → ℤ, (∀ n, 0 < q n) ∧
(∀ n, (q n : ℝ) * Real.eulerMascheroniConstant - (p n : ℝ) ≠ 0) ∧
Tendsto (fun n => (q n : ℝ) * Real.eulerMascheroniConstant - (p n : ℝ))
atTop (nhds 0) := by sorrySource
Derived auxiliary results for the p=2, x=1 family in Van Assche–Wolfs, Rational approximation of Euler’s constant using multiple orthogonal polynomials, arXiv:2404.09799v3, Section 5, displayed binomial formula for F_(n;2)^(I|p), https://arxiv.org/html/2404.09799v3#S5. The reduced-fraction normalization and conditional subsequence criterion are elementary deductions supplied here, not named statements or arithmetic-saving claims in that paper.