Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, eq. (21) — pathwidth identity [BBJ+25, Lemma 7]

Proved
SpaceReset.Hardness.eq_21

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1pathwidth

For a graph XXX on NNN vertices, let B(X)B(X)B(X) have vertex sets VVV and V′V'V′, each a clique, with uv′uv'uv′ an edge exactly when u=vu=vu=v or uv∈E(X)uv\in E(X)uv∈E(X). Then

pw⁡(B(X))=N+pw⁡(X).\operatorname{pw}(B(X))=N+\operatorname{pw}(X).pw(B(X))=N+pw(X).

This existing identity is the paper's classical input to the reduction.

Differences from the source:

  • encoding: pathwidth → GaussianSweep.pathwidth (ℤ-valued, −1 on the empty graph); reason: the standard pathwidth; at N = 0 both sides are −1
Preamble
import Mathlib
import Definitions.Def_GaussianSweep_pathwidth
import Definitions.Def_SpaceReset_Hardness_Graphs

set_option autoImplicit false
Formal statement
namespace SpaceReset.Hardness

/-- §3.2, eq. (21), p. 26: the pathwidth identity [BBJ+25, Lemma 7], `pw(B(X)) = N + pw(X)` for
a graph `X` on `N` vertices. -/
theorem eq_21 (N : ℕ) (X : SimpleGraph (Fin N)) :
    GaussianSweep.pathwidth (doubleGraph X) = (N : ℤ) + GaussianSweep.pathwidth X := by sorry

end SpaceReset.Hardness
Source
Rinka Miura, STOC 2027 submission #1715 (October 2026), §3.2, eq. (21), p. 26 (cited: [BBJ+25, Lemma 7])
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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