Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, p. 388 — with H − T a forest, f extends to an isometry of H iff H has a representation in G; then C* is the greatest representation

Proved
MetricGenerators.IsometryExt.theorem_4

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

graph-isometrygraph-theoryisometric-embeddingmetric-generatorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH and GGG be finite connected graphs, let TTT be a strong metric generator of HHH such that H−TH-TH−T (the subgraph of HHH induced on V(H)∖TV(H)\setminus TV(H)∖T) is a forest, and let f:(T,μH∣T)→Gf:(T,\mu_H|_T)\to Gf:(T,μH​∣T​)→G be an isometry. Then:

  1. there exists an isometry fˉ:V(H)→V(G)\bar f:V(H)\to V(G)fˉ​:V(H)→V(G) from HHH to GGG extending fff if and only if there exist sets CuC_uCu​ (u∈V(H)u\in V(H)u∈V(H)) that represent HHH in GGG with respect to TTT;
  2. if such an isometry exists, the sets Cu∗C^*_uCu∗​ (u∈V(H)u\in V(H)u∈V(H)) produced by the candidate procedure are the unique inclusionwise maximal sets that represent HHH in GGG with respect to TTT: they form a representation, and
Cu⊆Cu∗(u∈V(H))for every representation (Cu)u∈V(H).C_u\subseteq C^*_u\quad(u\in V(H))\qquad\text{for every representation } (C_u)_{u\in V(H)}.Cu​⊆Cu∗​(u∈V(H))for every representation (Cu​)u∈V(H)​.

The theorem gives a good characterization of the extendability of an isometry given on a strong metric generator, under the forest condition; Figure 2 of the paper shows the characterization fails when H−TH-TH−T contains a triangle.

Formalization Note "Unique inclusionwise maximal" is encoded as "C∗C^*C∗ is a representation containing every representation", i.e. a greatest element for componentwise inclusion, which is in particular the unique maximal one. An isometry here preserves all distances, not just adjacency.

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, p. 388, **Theorem 4** (both paragraphs). Let `H` and `G` be finite connected graphs,
`T` a strong metric generator of `H` such that `H − T` (the subgraph of `H` induced on
`V(H) ∖ T`) is a forest, and `f : (T, μ_H|T) → G` an isometry. Then
1. there is an isometry from `H` to `G` extending `f` if and only if there exist sets `C_u`
   (`u ∈ V(H)`) that represent `H` in `G` with respect to `T`;
2. if such an isometry exists, the sets `C*_u` represent `H` in `G` with respect to `T` and
   contain every representation (`C_u ⊆ C*_u` for all `u`).

Formalization Note: "the sets `C*_u` are the unique inclusionwise maximal sets that represent
`H`" is encoded as "`C*` is a representation that contains every representation" (a greatest
element of the representations under componentwise inclusion). A greatest element is the unique
maximal element; this is also what the paper's proof establishes. -/
theorem theorem_4 {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)
    (hforest : (H.induce ((↑T : Set VH)ᶜ)).IsAcyclic)
    (f : ↥T → VG) (hf : IsIsometryOn H G T f) :
    ((∃ φ : VH → VG, IsIsometry H G φ ∧ Extends T f φ) ↔
      (∃ C : VH → Set VG, Represents H G T f C)) ∧
    ((∃ φ : VH → VG, IsIsometry H G φ ∧ Extends T f φ) →
      Represents H G T f (cStar H G T f) ∧
      ∀ C : VH → Set VG, 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, Theorem 4
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