Unique minimum and exact range of the Erdős 68 sum at a fixed factorial moment
ProvedErdos68.fixed_weight_minimum_and_rangefactorialsinfinite-seriesnumber-theory
For , set and . Write , fix an integer , and set . Among nonnegative integer multiplicities with a convergent unweighted sum and weighted sum , the unweighted sum has unique minimum , attained by everywhere. For every nonnegative prefix length and real , such multiplicities with the first entries equal to one and both sums converging to and , respectively, exist if and only if .
Preamble
import Mathlib
Formal statement
theorem Erdos68.fixed_weight_minimum_and_range (k : ℕ) (hk : 1 ≤ k) :
let w : ℕ → ℝ := fun i => 1 / ((i + 2).factorial - 1 : ℝ)
let x : ℕ → ℝ := fun i => 1 / ((i + 2).factorial : ℝ)
let S : ℝ := ∑' i, w i
let T : ℝ := ∑' i, w i * x i ^ k
(∀ m : ℕ → ℕ, Summable (fun i => (m i : ℝ) * w i) →
(∑' i, (m i : ℝ) * w i * x i ^ k) = T →
(∃ i, m i ≠ 1) → S < ∑' i, (m i : ℝ) * w i) ∧
(∀ (J : ℕ) (y : ℝ),
(∃ m : ℕ → ℕ, (∀ i < J, m i = 1) ∧
HasSum (fun i => (m i : ℝ) * w i) y ∧
HasSum (fun i => (m i : ℝ) * (w i * x i ^ k)) T) ↔ S ≤ y) := by sorrySource
Erdős problem 68, https://www.erdosproblems.com/68. Related background on the irrationality question includes Will Cook, Integer Linear Forms for a Factorial Reciprocal Series, https://github.com/wcook04/plectis-erdos/blob/main/docs/papers/full-text/erdos-68-factorial-denominator-irrationality.md, and Open Proof Network, https://openproofnetwork.org/problems/erdos-68/. Matt directed the investigation. OpenAI Codex (Astra) developed this construction and Lean proof using Mathlib.