Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 5.10 — path distance matrix is nonsingular

Proved
GeometryOfGraphs.Cube.path_distance_matrix_nonsingular

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

determinantsdistance-matricesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let m≥2m\geq2m≥2 and index a path's vertices by 0,…,m−10,\ldots,m-10,…,m−1. Its distance matrix DDD, with Drs=∣r−s∣D_{rs}=|r-s|Drs​=∣r−s∣, has nonzero determinant:

det⁡(∣r−s∣)0≤r,s<m≠0.\det\bigl(|r-s|\bigr)_{0\leq r,s<m}\ne0.det(∣r−s∣)0≤r,s<m​=0.

The paper cites this fact in the rank lower bound for even cycles. The m=1m=1m=1 matrix is zero and is excluded.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace GeometryOfGraphs.Cube

/-- The distance matrix of a path with at least two vertices is nonsingular. -/
theorem path_distance_matrix_nonsingular (m : ℕ) (hm : 2 ≤ m) :
    (Matrix.of (fun r s : Fin m =>
      |((r : ℕ) : ℝ) - ((s : ℕ) : ℝ)|)).det ≠ 0 := by sorry

end GeometryOfGraphs.Cube
Source
N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995), p. 233, proof of Proposition 5.10, citing [44] pp. 64–65; https://doi.org/10.1007/BF01200757
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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