dice_graph
def
For an explicit parameter n : ℕ, dice_graph n is the bundled Digraph on Die n whose adjacency relation Adj x y holds if and only if beat_score x y = minimal_advantage n.
Statement
def dice_graph (n : ℕ) : Digraph (Die n)- Defined in
- arXiv:2610.40321 Sec 2
- Verified
- 31 Oct 2026
- Axioms
- none listed
- Built on 3
- DieThe type of non-standard n-sided dice with face values in Fin n, represented as non-decreasing functions from Fin n to Fin n.
- beat_scoreThe beat score of die x against die y, defined as the sum over all face indices i and j in Fin n of 1 if x(i) > y(j) and 0 otherwise.
- minimal_advantageThe minimal winning advantage threshold for an n-sided die: n^2 / 2 + 1 if n is even, and (n^2 + 1) / 2 if n is odd.
- Used by 4
- op744_dice6_has_cycle_sixThe relation (dice_graph 6).Adj has a directed simple cycle of length 6, has_directed_cycle (dice_graph 6).Adj 6.
- op744_dice11_has_directed_cycle_ge_twelveThere exists an integer k ≥ 12 such that has_directed_cycle (dice_graph 11).Adj k holds.
- op744_dice3_no_cycle_threeThe relation (dice_graph 3).Adj contains no directed simple cycle of length 3, that is, ¬ has_directed_cycle (dice_graph 3).Adj 3.
- op744_dice7_has_cycle_fourteenThe relation (dice_graph 7).Adj has a directed simple cycle of length 14, has_directed_cycle (dice_graph 7).Adj 14.
Read back from the Lean
For a natural number n, dice_graph n is the directed graph (Digraph) whose vertices are Die n, where there is a directed edge from vertex x to vertex y if and only if beat_score x y is equal to minimal_advantage n.
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
/-- Bundled Digraph on Die n with edges defined by minimal winning advantage. -/ def dice_graph (n : ℕ) : Digraph (Die n) where Adj x y := beat_score x y = minimal_advantage n