Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 387 — a representation has C_t = {f(t)} for t ∈ T and pairwise disjoint C_u

Proved
MetricGenerators.IsometryExt.represents_singleton_disjoint

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

graph-isometrygraph-theorymetric-generatorp2o-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) a 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

Ct={f(t)}  (t∈T)andCu∩Cv=∅  (u≠v).C_t=\{f(t)\}\ \ (t\in T)\qquad\text{and}\qquad C_u\cap C_v=\emptyset\ \ (u\ne v).Ct​={f(t)}  (t∈T)andCu​∩Cv​=∅  (u=v).

Condition (i) of a representation alone forces the vertices of TTT to their prescribed images and keeps the candidate sets of distinct vertices apart.

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): since `T` is a metric generator in `H` and `f` is an isometry on
`T`, if the sets `C_u` represent `H` in `G` with respect to `T`, then `C_t = {f(t)}` for all
`t ∈ T`, and `C_u ∩ C_v = ∅` whenever `u ≠ v`.

Formalization Note: `H` and `G` are finite and connected (standing assumption, p. 383). The
nonemptiness built into `Represents` is what gives `C_t = {f(t)}` rather than `C_t ⊆ {f(t)}`. -/
theorem represents_singleton_disjoint {VH VG : Type*} [Fintype VH] [Fintype VG]
    (H : SimpleGraph VH) (G : SimpleGraph VG) (hH : H.Connected) (hG : G.Connected)
    (T : Finset VH) (hT : IsMetricGenerator H T) (f : ↥T → VG) (hf : IsIsometryOn H G T f)
    (C : VH → Set VG) (hC : Represents H G T f C) :
    (∀ t : ↥T, C t = {f t}) ∧ (∀ u v : VH, u ≠ v → Disjoint (C u) (C v)) := 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 definition of a representation)
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