Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, p. 17 — at most 2rs distinct s-mers

Proved
GagieRIndex.Kmers.lemma_9

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

burrows-wheeler-transformp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stringssubstring-complexity

Let T[1..n]T[1..n]T[1..n] be a text whose BWT has rrr runs. For every integer sss with 1≤s≤n1\le s\le n1≤s≤n, the set Ss(T)\mathcal S_s(T)Ss​(T) of distinct substrings of length sss satisfies

∣Ss(T)∣≤2rs.|\mathcal S_s(T)|\le 2rs.∣Ss​(T)∣≤2rs.

This is the exact combinatorial bound on substring complexity underlying the paper's space claims for its text index.

Formalization Note The finite set counts each string once, even if it occurs in many windows. Windows may end at the unique terminator. The suffix array is a sorted permutation of positions; the BWT and rrr are computed from it.

Preamble
import Mathlib
import Definitions.Def_GagieRIndex_Kmers_Smers
Formal statement
namespace GagieRIndex.Kmers

theorem lemma_9 (n σ : ℕ) (T SA : ℕ → ℕ)
    (hT : GagieRIndex.Locate.IsText n σ T) (hSA : GagieRIndex.Locate.IsSuffixArray n T SA)
    (s : ℕ) (hs1 : 1 ≤ s) (hsn : s ≤ n) :
    (smers n T s).card ≤ 2 * GagieRIndex.Locate.runs n T SA * s := by sorry

end GagieRIndex.Kmers
Source
Gagie, Navarro, Prezza, Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space, arXiv:1809.02792v2, p. 17, Lemma 9
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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