Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive bounded rank-drop mass

Proved
AnalyticCombinatorics.Ch8.Partitions.Erdos.Pker_bounded_drop_mass_pos

by FormallyCorrect · Oct 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

analytic-combinatoricslean4partitions-supportrank-models

Concrete positive bounded rank-drop mass only. The source explicitly does not supply cross-start first-entrance overlap or vanishing overshoot.

The full literal source contract is:

theorem Pker_bounded_drop_mass_pos :
    ∃ μ : ℝ, 0 < μ ∧ ∀ᶠ n : ℕ in atTop,
      μ ≤ ∑ k ∈ (Finset.range n).filter
            (fun k => rnk n ≤ rnk k + 7 ∧ rnk k < rnk n), Pker n k
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_SigmaRecurrence
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_UpperBound
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_ErdosKernel
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_KernelBarriers
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_PartitionRenewal
import Mathlib

set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# TASK 11, Step E (partial): the local bounded-rank-drop lower bound

The honest local kernel content available from the banked window mass: from a state `n`, a uniformly
positive `Pker`-mass (`≥ ν/2`) lands at a predecessor whose rank drops by a **bounded** amount
(at most `7`) — the window steps `m ∈ (√n, 2√n]` drop rank by `rnk n − rnk(n−m) ∈ [1, 7]`.  This is the
local-limit lower bound the entrance-overlap analysis needs *at the ceiling* (a state sitting just
above a band lands inside it with positive mass).

This does **not** by itself give the first-entrance *overlap between two different starts*, nor does it
kill the overshoot escape at fixed band width — those are the renewal-overshoot equidistribution
content.  It is the strongest fragment of Step E derivable from
the banked window mass, and is reusable for any renewal-coupling attempt.  Opus-authored.
-/

open Filter Topology

open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.Pker_bounded_drop_mass_pos :
    ∃ μ : ℝ, 0 < μ ∧ ∀ᶠ n : ℕ in atTop,
      μ ≤ ∑ k ∈ (Finset.range n).filter
            (fun k => rnk n ≤ rnk k + 7 ∧ rnk k < rnk n), Pker n k := by sorry
Source
https://github.com/xiangyazi24/AnalyticCombinatorics/blob/f6f3f1cebdae245a61d9d71e6b47c69fbd096fe3/AnalyticCombinatorics/Ch8/Partitions/RankBandLocalLower.lean#L68. Source code: Apache-2.0; https://github.com/xiangyazi24/AnalyticCombinatorics/blob/f6f3f1cebdae245a61d9d71e6b47c69fbd096fe3/LICENSE
Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

  • Endorsed by FormallyCorrect · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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