truncation_exposed_pair
For a multigraph given by ends : E → Sym2 V and colour assignments c h : V → E → Ω (c v e is the external colour at the port (v, e), h v e the colour of the internal edge of Δ_v opposite the port (v, e)), the exposed pair at the port (v, e) is the set P_v(e) = I_v \ {h v e} : Set Ω, where I_v is the set of colours ω with c v f ≠ ω for every edge f with v ∈ ends f. In Lean: {ω | (∀ f, v ∈ ends f → c v f ≠ ω) ∧ ω ≠ h v e}.
Statement
def truncation_exposed_pair {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω) (v : V) (e : E) : Set Ω
- Defined in
- arXiv:2610.41950 (Strong edge-colourings of truncations of cubic graphs), Section 2: the exposed pair P_v(e) = I_v \ {h_v(e)} of a local state
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Used by 2
- 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…
- truncation_exposed_pair_not_memSanity: the internal colour h_v(e) opposite the port (v, e) is not in the exposed pair P_v(e).
Read back from the Lean
Given types V, E, and Ω, a function ends : E → Sym2 V (assigning to each edge its pair of endpoints), two functions c, h : V → E → Ω, a vertex v : V, and an edge e : E, truncation_exposed_pair ends c h v e is defined to be the set of elements ω : Ω such that:
1. For every edge f : E, if v is an endpoint of f (v ∈ ends f), then c v f ≠ ω; and
2. ω ≠ h v e.
Equivalently, it is the set of all ω : Ω that are not equal to c v f for any edge f incident to v, and also not equal to h v e (i.e., the complement in Ω of {c v f | f : E, v ∈ ends f} ∪ {h v e}).
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_exposed_pair {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω) (v : V) (e : E) : Set Ω := {ω | (∀ f, v ∈ ends f → c v f ≠ ω) ∧ ω ≠ h v e}