Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 387 — C^(0) ⊇ C^(1) ⊇ ⋯ stabilizes after at most |V(G)| steps

Proved
MetricGenerators.IsometryExt.candidates_stabilize

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

graph-isometrygraph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH and GGG be finite connected graphs, T⊆V(H)T\subseteq V(H)T⊆V(H) and f:T→V(G)f:T\to V(G)f:T→V(G), and let C(i)C^{(i)}C(i), Cu(i)C^{(i)}_uCu(i)​ be the candidate procedure. Then the sequences are decreasing,

C(i+1)⊆C(i),Cu(i+1)⊆Cu(i)(i≥0, u∈V(H)),C^{(i+1)}\subseteq C^{(i)},\qquad C^{(i+1)}_u\subseteq C^{(i)}_u\quad(i\ge 0,\ u\in V(H)),C(i+1)⊆C(i),Cu(i+1)​⊆Cu(i)​(i≥0, u∈V(H)),

and they stabilize after at most n:=∣V(G)∣n:=|V(G)|n:=∣V(G)∣ steps: for every k≥nk\ge nk≥n,

C(k)=C(n)andCu(k)=Cu(n)  (u∈V(H)).C^{(k)}=C^{(n)}\quad\text{and}\quad C^{(k)}_u=C^{(n)}_u\ \ (u\in V(H)).C(k)=C(n)andCu(k)​=Cu(n)​  (u∈V(H)).

This justifies taking C∗:=C(n)C^*:=C^{(n)}C∗:=C(n) as the final output of the procedure.

Preamble
import Mathlib
import Definitions.Def_MetricGenerators_IsometryExt_Basic
import Definitions.Def_MetricGenerators_IsometryExt_Representation
Formal statement
namespace MetricGenerators.IsometryExt

/-- Sebő and Tannier, *On Metric Generators of Graphs*, Math. Oper. Res. 29(2):383–393 (2004),
DOI 10.1287/moor.1030.0070, §2, p. 387 (unnumbered): the sequence `C^(0) ⊇ C^(1) ⊇ ⋯` is decreasing (and so is
each sequence `C^(i)_u`), and the procedure is stabilized after at most `n := |V(G)|` steps:
`C^(k) = C^(n)` and `C^(k)_u = C^(n)_u` for every `k ≥ n` and every `u ∈ V(H)`.

Formalization Note: `H` and `G` are finite and connected (standing assumption, p. 383); the
statement holds for every `T` and `f`. -/
theorem candidates_stabilize {VH VG : Type*} [Fintype VH] [Fintype VG]
    (H : SimpleGraph VH) (G : SimpleGraph VG) (hH : H.Connected) (hG : G.Connected)
    (T : Finset VH) (f : ↥T → VG) :
    (∀ i : ℕ, candSet H G T f (i + 1) ⊆ candSet H G T f i ∧
      ∀ u : VH, cand H G T f (i + 1) u ⊆ cand H G T f i u) ∧
    (∀ k : ℕ, Fintype.card VG ≤ k →
      candSet H G T f k = candSet H G T f (Fintype.card VG) ∧
      ∀ u : VH, cand H G T f k u = cand H G T f (Fintype.card VG) u) := by sorry

end MetricGenerators.IsometryExt
Source
Sebő and Tannier, On Metric Generators of Graphs, Math. Oper. Res. 29(2):383–393 (2004), DOI 10.1287/moor.1030.0070, p. 387, §2 (unnumbered, after the recursive definition of C^(i))
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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