Exact primitive normalization and classification of integer scalings
ProvedEulerMascheroni.P2.primitive_normalizationformalizationirrationalitynumber-theory
Fix with . Let be reduced with , and put . Then
Moreover, whenever is real and , are integers, there is a nonzero integer such that
This identifies every integer normalization of this rational approximation. In particular, changing the initially chosen common denominator cannot improve upon the primitive multiplier.
Preamble
import Definitions.Def_eulerMascheroni_p2PrimitiveNormalization open Filter Topology open EulerMascheroni.P2
Formal statement
theorem EulerMascheroni.P2.primitive_normalization (n : ℕ) (hQ : 0 < Q n) :
0 < primitiveQ n ∧ 0 < primitiveScale n ∧
(primitiveQ n : ℝ) = primitiveScale n * (Q n : ℝ) ∧
(primitiveP n : ℝ) = primitiveScale n * (P n : ℝ) ∧
(∀ (c : ℝ), c ≠ 0 → ∀ p q : ℤ,
(p : ℝ) = c * (P n : ℝ) → (q : ℝ) = c * (Q n : ℝ) →
∃ m : ℤ, m ≠ 0 ∧ p = m * primitiveP n ∧
q = m * (primitiveQ n : ℤ) ∧ c = (m : ℝ) * primitiveScale n) := 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.