Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.3, p. 17 — a path visits k_n(γ)+1 vertices and k_n(γ)+k_r(γ) edges

Proved
SBMThreshold.Main.claim_4_3

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

combinatoricsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pathsstochastic-block-model

Let γ=(u0,…,uk)\gamma=(u_0,\dots,u_k)γ=(u0​,…,uk​) be a path (consecutive vertices distinct) and let kn(γ)k_n(\gamma)kn​(γ) and kr(γ)k_r(\gamma)kr​(γ) be its numbers of new and returning steps (Definition 4.1). Then

∣V(γ)∣=kn(γ)+1,∣E(γ)∣=kn(γ)+kr(γ).|V(\gamma)|=k_n(\gamma)+1,\qquad |E(\gamma)|=k_n(\gamma)+k_r(\gamma).∣V(γ)∣=kn​(γ)+1,∣E(γ)∣=kn​(γ)+kr​(γ).

Every new step adds one vertex and one edge, a returning step adds one edge, and an old step adds neither. The claim converts the edge-type counts into the sizes of the path's vertex and edge sets, which is how the path counts of §4 are turned into powers of nnn.

Preamble
import Mathlib
import Definitions.Def_SBMThreshold_Main_Setting
import Definitions.Def_SBMThreshold_Main_Paths
open Filter Topology Finset
Formal statement
namespace SBMThreshold.Main

/-- Claim 4.3 (p. 17): a path visits `k_n(γ) + 1` vertices and `k_n(γ) + k_r(γ)` edges. -/
theorem claim_4_3 {n k : ℕ} (γ : Fin (k + 1) → Fin n) (hγ : IsPath γ) :
    (pathVertices γ).card = kNew γ + 1 ∧ (pathEdges γ).card = kNew γ + kRet γ := by sorry

end SBMThreshold.Main
Source
Mossel, Neeman and Sly, A Proof of the Block Model Threshold Conjecture, arXiv:1311.4115v4, p. 17, Claim 4.3
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