AFTD Auto-Formalizing Theoretical Domains

Die

def

The type of non-standard n-sided dice with face values in Fin n, represented as non-decreasing functions from Fin n to Fin n.

Statement

def Die (n : ℕ) : Type
Defined in
arXiv:2610.40321 Def 1
Verified
31 Oct 2026
Axioms
none listed
Built on 2
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 6
  • dice_graphFor 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…
  • 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.
  • 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.

Read back from the Lean

Die n is defined for any natural number n : ℕ as the type of monotone endofunctions on Fin n; specifically, the subtype of functions d : Fin n → Fin n such that for all a, b : Fin n, if a ≤ b then d a ≤ d b.

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

/-- Non-standard n-sided dice represented as non-decreasing tuples in Fin n. -/
def Die (n : ℕ) : Type := { d : Fin n → Fin n // Monotone d }
See it in the graphDiscuss this resultChallenge it