Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Connectivity of permissible box paths

Open
QAlgorithms.Papers.Independent.Intakenext100.P41.boxPathConnectivity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥2N\ge2N≥2, ℓ≥1\ell\ge1ℓ≥1, and 1≤k≤N1\le k\le N1≤k≤N. A permissible signature is a weakly decreasing integral NNN-tuple with largest-minus-smallest entry at most ℓ\ellℓ. Fix signatures f,gf,gf,g and two length-kkk paths from fff to ggg, each step adding one box to one row and every intermediate signature permissible. Two paths are adjacent when exactly one interior signature changes. Then

there is a finite chain of adjacent paths from the first path to the second.\text{there is a finite chain of adjacent paths from the first path to the second.}there is a finite chain of adjacent paths from the first path to the second.

All paths in the chain have the same endpoints and length. Signatures are kept unnormalized until any final common-shift equivalence; at k=1k=1k=1 the chain can have length zero.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
Formal statement
noncomputable section

open scoped BigOperators

open MeasureTheory Set

namespace QAlgorithms.Papers.Independent.Intakenext100.P41

/-- §32, final combinatorial argument, PDF p.42: paths with the same endpoints
and length are connected by single-intermediate-signature changes. All vertices
are actual permissible signatures, not independently normalized representatives. -/
theorem boxPathConnectivity (N ell k : ℕ) (hN : 2 ≤ N) (hell : 1 ≤ ell)
    (hk : 1 ≤ k) (hkN : k ≤ N) (f g : IntegerSignature N)
    (P Q : BoxPath ell k f g) :
    Relation.ReflTransGen AdjacentPaths P Q := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P41

end
Source
Operator Algebras and Conformal Field Theory III. Fusion of positive energy representations of LSU(N) using bounded operators, arXiv:math/9806031v1, PDF p. 42, §32: We complete the proof by showing by induction on k
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers N,ℓ,kN,\ell,kN,ℓ,k satisfying 2≤N2\leq N2≤N, 1≤ℓ1\leq\ell1≤ℓ, and 1≤k≤N1\leq k\leq N1≤k≤N, all integer vectors f,gf,gf,g indexed by IN={0,…,N−1}I_N=\{0,\ldots,N-1\}IN​={0,…,N−1}, and all paths P,QP,QP,Q from fff to ggg having kkk steps, the following holds. Here each path has k+1k+1k+1 vertices, every vertex xxx satisfies xj≤xix_j\leq x_ixj​≤xi​ whenever i≤ji\leq ji≤j and xi−xj≤ℓx_i-x_j\leq\ellxi​−xj​≤ℓ for every i,ji,ji,j, and each step increases exactly one coordinate by 111. There exists a finite sequence of such paths from PPP to QQQ in which consecutive paths differ at exactly one vertex with index strictly between 000 and kkk, agreeing at every other vertex. The sequence may have zero transitions, in which case P=QP=QP=Q. For k=1k=1k=1, adjacency is impossible, so the conclusion requires P=QP=QP=Q; for endpoints admitting no such paths, the universal assertion about P,QP,QP,Q is vacuous.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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