Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of Theorem 4, p. 388 — every representation satisfies C_u ⊆ C*_u

Proved
MetricGenerators.IsometryExt.represents_subset_cStar

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, TTT a strong metric generator of HHH, f:(T,μH∣T)→Gf:(T,\mu_H|_T)\to Gf:(T,μH​∣T​)→G an isometry, and let the sets CuC_uCu​ (u∈V(H)u\in V(H)u∈V(H)) represent HHH in GGG with respect to TTT. Then

Cu⊆Cu∗for every u∈V(H),C_u\subseteq C^*_u\qquad\text{for every } u\in V(H),Cu​⊆Cu∗​for every u∈V(H),

where Cu∗=Cu(∣V(G)∣)C^*_u=C^{(|V(G)|)}_uCu∗​=Cu(∣V(G)∣)​ is the output of the candidate procedure.

The procedure therefore never discards a vertex that some representation uses; this is the maximality half of the second paragraph of Theorem 4. No forest hypothesis is needed.

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, proof of Theorem 4, p. 388 (unnumbered): if the sets `C_u` represent `H` in `G`
with respect to `T`, then by (i) `C_u ⊆ C^(0)_u`, `C_u ⊆ C^(i)_u` implies `C_u ⊆ C^(i+1)_u`, and
therefore `C_u ⊆ C*_u` for every `u ∈ V(H)`.

Formalization Note: `H` and `G` are finite and connected (p. 383); `T` is a strong metric
generator and `f` an isometry on `T`, the standing data of §2. The generator property is needed:
the recursion for `C^(i+1)` tests every `u'` with `x ∈ C^(i)_u'`, and the disjointness of the
sets `C^(0)_u` is what forces `u' = u`. There is no forest hypothesis. -/
theorem represents_subset_cStar {VH VG : Type*} [Fintype VH] [Fintype VG]
    (H : SimpleGraph VH) (G : SimpleGraph VG) (hH : H.Connected) (hG : G.Connected)
    (T : Finset VH) (hT : IsStrongMetricGenerator H T) (f : ↥T → VG)
    (hf : IsIsometryOn H G T f) (C : VH → Set VG) (hC : Represents H G T f C) :
    ∀ u : VH, C u ⊆ cStar H G T f 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. 388, §2, proof of Theorem 4 (unnumbered, first paragraph)
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