Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 9, p. 17 — at most 2r sampled positions

Proved
GagieRIndex.Kmers.sampled_card

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

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

Let rrr be the number of runs in the BWT of TTT, and let Sampled⁡(T)\operatorname{Sampled}(T)Sampled(T) be the set of text positions corresponding to the first or last character of a run. Then

∣Sampled⁡(T)∣≤2r.|\operatorname{Sampled}(T)|\le 2r.∣Sampled(T)∣≤2r.

This count is used with Lemma 8 to bound the number of distinct length-sss substrings.

Formalization Note The set is an image of run-boundary BWT cells under the wrapped predecessor-position map. Repeated text positions are counted once.

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

theorem sampled_card (n σ : ℕ) (T SA : ℕ → ℕ)
    (hT : GagieRIndex.Locate.IsText n σ T) (hSA : GagieRIndex.Locate.IsSuffixArray n T SA) :
    (GagieRIndex.Locate.sampled n T SA).card ≤ 2 * GagieRIndex.Locate.runs n T SA := 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, proof of Lemma 9, second sentence
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