Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.7 — isometric dimension as minimum implementing rank

Proved
GeometryOfGraphs.Cube.theorem_5_7

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

graph-dimensionmatrix-rankp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite connected graph. Among all real matrices MMM that implement GGG, with the number of columns allowed to vary, its isometric dimension is the smallest matrix rank:

dim⁡(G)=min⁡{rank⁡(M):M implements G}.\dim(G)=\min\{\operatorname{rank}(M): M\text{ implements }G\}.dim(G)=min{rank(M):M implements G}.

This characterizes the geometric invariant by linear algebra and is used for lower bounds such as the even-cycle calculation.

Formalization Note The implementation condition uses coordinatewise bounds plus attainment, so a zero-column matrix is permitted for a one-vertex graph.

Preamble
import Definitions.Def_GeometryOfGraphs_Cube_IsometricDimension
import Definitions.Def_GeometryOfGraphs_Cube_Implements

set_option autoImplicit false
Formal statement
namespace GeometryOfGraphs.Cube

/-- Theorem 5.7: isometric dimension is the least rank of an implementing matrix. -/
theorem theorem_5_7 {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (hG : G.Connected) :
    isoDim G = sInf {k : ℕ | ∃ (r : ℕ) (M : Matrix V (Fin r) ℝ),
      Implements G M ∧ M.rank = k} := 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. 232, Theorem 5.7; 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