pyranim_gamma
For a finite set of chips X : Finset (ℕ × ℕ), pyranim_gamma X is the simple graph with vertex set given by the subtype {i : ℕ // (i, i) ∈ X} where two distinct vertices u, v are adjacent if and only if (min u.val v.val, max u.val v.val) ∈ X.
Statement
def pyranim_gamma (X : Finset (ℕ × ℕ)) : SimpleGraph {i : ℕ // (i, i) ∈ X}- Defined in
- arXiv:2611.16153 Def. 2.4
- Verified
- 13 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a finite set X of pairs of natural numbers, pyranim_gamma X is the simple graph whose vertex type is the subtype {i : ℕ // (i, i) ∈ X} of natural numbers i such that (i, i) ∈ X, and whose edge relation is obtained via SimpleGraph.fromRel from the relation sending u and v to (min u.1 v.1, max u.1 v.1) ∈ X. That is, two vertices u and v are adjacent if and only if u ≠ v and (min u.1 v.1, max u.1 v.1) ∈ X.
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
/-- The unit interval graph Gamma(X) associated to a Pyranim position X. -/ def pyranim_gamma (X : Finset (ℕ × ℕ)) : SimpleGraph {i : ℕ // (i, i) ∈ X} := SimpleGraph.fromRel (fun u v => (min u.1 v.1, max u.1 v.1) ∈ X)