AFTD Auto-Formalizing Theoretical Domains

TreeGameEdge

structure

A structure TreeGameEdge (Q : Type*) (k : ℕ) representing an edge in a binary tree game arena with state space Q and k priorities, with five fields: source_node of type List Bool (the current tree node), source_state of type Q, dir of type Bool (the binary child direction), prio of type Fin k (the priority), and target_state of type Q.

Statement

structure TreeGameEdge (Q : Type*) (k : ℕ)
Defined in
arXiv:2611.10136, Def. 1 and Def. 18
Verified
10 Nov 2026
Axioms
none listed
Used by 19

Read back from the Lean

TreeGameEdge Q k is a structure parameterized by a type Q and a natural number k, consisting of five fields: 1. source_node: a list of booleans (List Bool), 2. source_state: an element of Q, 3. dir: a boolean (Bool), 4. prio: an element of Fin k (a natural number strictly less than k), and 5. target_state: an element of Q.

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

/-- An edge in a tree-like game arena. -/
structure TreeGameEdge (Q : Type*) (k : ℕ) where
  source_node : List Bool
  source_state : Q
  dir : Bool
  prio : Fin k
  target_state : Q
See it in the graphDiscuss this resultChallenge it