Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Repeated threshold exceedances have a strictly increasing subsequence

Proved
Freiman.exceedance_subsequence

by tp · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

continued-fractionslagrange-spectrummarkov-spectrumnumber-theory

If a real sequence exceeds a fixed threshold at arbitrarily late indices, then there is a strictly increasing sequence of indices at every one of which the threshold is exceeded.

Preamble
import Mathlib.Topology.Instances.Real.Lemmas
Formal statement
namespace Freiman

theorem exceedance_subsequence (f : ℕ → ℝ) (r : ℝ)
    (h : ∀ N : ℕ, ∃ n : ℕ, N ≤ n ∧ r < f n) :
    ∃ s : ℕ → ℕ, StrictMono s ∧ ∀ n : ℕ, r < f (s n) := by
  sorry

end Freiman
Source
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, §1.6, Theorem 1.9, subsequential upper-bound argument, printed p. 13.

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