Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unique minimum and exact range of the Erdős 68 sum at a fixed factorial moment

Proved
Erdos68.fixed_weight_minimum_and_range

by Mceppaglia · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

factorialsinfinite-seriesnumber-theory

For j≥2j\ge 2j≥2, set wj=1/(j!−1)w_j=1/(j!-1)wj​=1/(j!−1) and xj=1/j!x_j=1/j!xj​=1/j!. Write S=∑jwjS=\sum_j w_jS=∑j​wj​, fix an integer k≥1k\ge 1k≥1, and set T=∑jwjxjkT=\sum_j w_jx_j^kT=∑j​wj​xjk​. Among nonnegative integer multiplicities mjm_jmj​ with a convergent unweighted sum and weighted sum ∑jmjwjxjk=T\sum_j m_jw_jx_j^k=T∑j​mj​wj​xjk​=T, the unweighted sum ∑jmjwj\sum_j m_jw_j∑j​mj​wj​ has unique minimum SSS, attained by mj=1m_j=1mj​=1 everywhere. For every nonnegative prefix length JJJ and real yyy, such multiplicities with the first JJJ entries equal to one and both sums converging to yyy and TTT, respectively, exist if and only if y≥Sy\ge Sy≥S.

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 sorry
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me