truncation_local_states_define_strong_coloring
The local states (c, h), with c h : V → E → Ω, define a strong edge-colouring of the truncation multigraph_truncation ends: there is χ : Sym2 {p : V × E // p.1 ∈ ends p.2} → Ω such that (1) simple_graph_is_strong_edge_coloring (multigraph_truncation ends) χ; (2) for distinct ports p ≠ q on the same edge of G (p.1.2 = q.1.2, an external edge), χ s(p, q) = c p.1.1 p.1.2, the external colour prescribed at the port p (stated for both orders, so the two ends must prescribe the same colour); (3) for three pairwise distinct ports p, q, r at the same vertex of G (p.1.1 = q.1.1 and p.1.1 = r.1.1), the internal edge s(p, q) gets χ s(p, q) = h r.1.1 r.1.2, the colour prescribed for the internal edge opposite the port r.
Statement
def truncation_local_states_define_strong_coloring {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω) : Prop
- Defined in
- arXiv:2610.41950 (Strong edge-colourings of truncations of cubic graphs), Section 2 / Lemma 2.1: 'these states define a strong edge-colouring of T(G)'
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Built on 2
- simple_graph_is_strong_edge_coloringFor a simple graph G on W and a colour map χ : Sym2 W → Ω (a colour for each unordered pair; only its values on edges of G matter), χ is a…
- multigraph_truncationThe truncation T(G) of a multigraph G with vertex type V and edge type E, the multigraph given by its endpoint map ends : E → Sym2 V…
- Used by 1
- truncation_local_states_strong_coloring_iffLemma 2.1 of arXiv:2610.41950. Let G be a loopless cubic multigraph, given by ends : E → Sym2 V (no Fintype or Finite instance on V or E…
Read back from the Lean
Given types V, E, Ω, an incidence function ends : E → Sym2 V, and functions c, h : V → E → Ω, truncation_local_states_define_strong_coloring asserts the existence of an edge-coloring χ : Sym2 {p : V × E // p.1 ∈ ends p.2} → Ω of the multigraph truncation such that: 1. χ is a strong edge coloring of multigraph_truncation ends (every two distinct edges of the truncation graph that share a vertex or are joined by an edge in the truncation graph receive different colors under χ); 2. For all distinct flags p, q sharing the same edge (p ≠ q and p.1.2 = q.1.2), χ s(p, q) = c p.1.1 p.1.2; 3. For all pairwise distinct flags p, q, r sharing the same vertex (p ≠ q, p ≠ r, q ≠ r, and p.1.1 = q.1.1 = r.1.1), χ s(p, q) = h r.1.1 r.1.2.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
def truncation_local_states_define_strong_coloring {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω) : Prop := ∃ χ : Sym2 {p : V × E // p.1 ∈ ends p.2} → Ω, simple_graph_is_strong_edge_coloring (multigraph_truncation ends) χ ∧ (∀ p q : {p : V × E // p.1 ∈ ends p.2}, p ≠ q → p.1.2 = q.1.2 → χ s(p, q) = c p.1.1 p.1.2) ∧ (∀ p q r : {p : V × E // p.1 ∈ ends p.2}, p ≠ q → p ≠ r → q ≠ r → p.1.1 = q.1.1 → p.1.1 = r.1.1 → χ s(p, q) = h r.1.1 r.1.2)