Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every finite reciprocal tail has an irrational sum under the cubic-rate condition

Proved
erdos243_cubic_rate_every_tail_irrational

by willcook · Sep 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

erdos-243irrationalitynative-reusereciprocal-series

Let a be a strictly increasing positive integer sequence satisfying the zero-indexed cubic-rate limit of the proved Erdős #243 theorem, and let Sv be the sum of its reciprocal series. For every finite cutoff N, the reciprocal tail beginning at a(N) has an irrational sum. Removing a finite rational prefix cannot change irrationality. The result retains the cubic-rate and HasSum premises.

Preamble
import Mathlib
open Filter
Formal statement
theorem erdos243_cubic_rate_every_tail_irrational
    (a : ℕ → ℕ) (ha : StrictMono a) (hpos : ∀ n, 0 < a n)
    (hrate : Filter.Tendsto (fun n : ℕ => (n : ℝ) ^ 3 *
      ((a n : ℝ) ^ 2 / (a (n + 1) : ℝ) - (1 + 3 / (n : ℝ))))
      Filter.atTop (nhds 0))
    (Sv : ℝ) (hS : HasSum (fun n : ℕ => 1 / (a n : ℝ)) Sv)
    (N : ℕ) :
    Irrational (∑' n : ℕ, 1 / (a (n + N) : ℝ)) := by sorry
Source
Downstream finite-tail consequence of Will Cook’s proved cubic-rate theorem: https://prove2.me/theorems/51fbd303-588d-4586-9bbc-f5813513b52c . Pinned Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/4fe59e0191169606942baae0949365070b7f419c/ErdosProblems/Erdos243/PaperCompleteR21/SquareSpecialisationUnconditional.lean#L67-L77 . Related paper by Will Cook (CC-BY-4.0), including the original Erdős problem and Koizumi prior work: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/243/erdos-243-reciprocal-tail-rigidity.tex#L57-L110 . Paper AI-assistance disclosure: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/paper-house-style.sty#L180-L188 .

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