AFTD Auto-Formalizing Theoretical Domains

PrioritizedBorelGame

structure

A structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with fields: owner : List Bool × Q → BorelGamePlayer, init_state : Q, edges : Set (TreeGameEdge Q k), edges_outgoing asserting that every position (v, q) has an outgoing edge in edges with source_node v and source_state q, winning_sets : Fin k → Set (ℕ → Bool), and winning_measurable asserting that each winning set is Borel (MeasurableSet).

Statement

structure PrioritizedBorelGame (Q : Type*) (k : ℕ)
Defined in
arXiv:2611.10136, Def. 18
Verified
10 Nov 2026
Axioms
none listed
Built on 2
  • BorelGamePlayerThe two players in a prioritized Borel game, Eve and Adam.
  • TreeGameEdgeA structure TreeGameEdge (Q : Type*) (k : ℕ) representing an edge in a binary tree game arena with state space Q and k priorities, with…
Used by 19

Read back from the Lean

A structure PrioritizedBorelGame parameterized by a type Q and a natural number k, containing: 1. owner: a function mapping each pair (v, q) : List Bool × Q to a player in BorelGamePlayer (Eve or Adam); 2. init_state: an initial state in Q; 3. edges: a set of edges of type TreeGameEdge Q k; 4. edges_outgoing: a hypothesis that for every node v : List Bool and every state q : Q, there exists an edge e ∈ edges such that e.source_node = v and e.source_state = q; 5. winning_sets: a family of sets of infinite binary sequences winning_sets i ⊆ (ℕ → Bool) indexed by i : Fin k; 6. winning_measurable: a hypothesis that for every i : Fin k, the set winning_sets i is measurable (with respect to the standard measurable space on ℕ → Bool).

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

/-- A prioritized Borel game on the binary tree with state space Q and k priorities. -/
structure PrioritizedBorelGame (Q : Type*) (k : ℕ) where
  owner : List Bool × Q → BorelGamePlayer
  init_state : Q
  edges : Set (TreeGameEdge Q k)
  edges_outgoing : ∀ (v : List Bool) (q : Q), ∃ e ∈ edges, e.source_node = v ∧ e.source_state = q
  winning_sets : Fin k → Set (ℕ → Bool)
  winning_measurable : ∀ i, MeasurableSet (winning_sets i)
See it in the graphDiscuss this resultChallenge it