AFTD Auto-Formalizing Theoretical Domains

PrioritizedBorelStrategyWins

def

A strategy wins for its player if every legal play from the initial position consistent with its memory update and choices is won by that player according to the maximal recurring priority and the corresponding branch set. The memory type need not be finite.

Statement

def PrioritizedBorelStrategyWins {Q : Type} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) {M : Type} (strat : FiniteMemoryStrategy G pl M) : Prop
Source
arXiv:2611.10136, Definitions 18 and 19; arbitrary-memory strategy predicate
Verified
12 Nov 2026
Axioms
none listed
Built on 4
  • PrioritizedBorelGameA structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with…
  • FiniteMemoryStrategyA structure FiniteMemoryStrategy {Q : Type*} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) (M : Type*) representing a…
  • TreeGameEdgeA structure TreeGameEdge (Q : Type*) (k : ℕ) representing an edge in a binary tree game arena with state space Q and k priorities, with…
  • BorelGamePlayerThe two players in a prioritized Borel game, Eve and Adam.
Used by 5

Lean source view module on GitHub

def PrioritizedBorelStrategyWins {Q : Type} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) {M : Type} (strat : FiniteMemoryStrategy G pl M) : Prop := ∀ play : ℕ → TreeGameEdge Q k, (∀ n, play n ∈ G.edges) → (play 0).source_node = [] ∧ (play 0).source_state = G.init_state → (∀ n, (play (n+1)).source_node = (play n).source_node ++ [(play n).dir] ∧ (play (n+1)).source_state = (play n).target_state) → (∃ mem : ℕ → M, mem 0 = strat.init_mem ∧ (∀ n, mem (n+1) = strat.update (mem n) (play n)) ∧ (∀ n, G.owner ((play n).source_node, (play n).source_state) = pl → play n = strat.choice (mem n) (play n).source_node (play n).source_state)) → match pl with | BorelGamePlayer.Eve => ∃ p : Fin k, Filter.Frequently (fun n => (play n).prio = p) Filter.atTop ∧ (∀ q : Fin k, p < q → ¬ Filter.Frequently (fun n => (play n).prio = q) Filter.atTop) ∧ (fun n => (play n).dir) ∈ G.winning_sets p | BorelGamePlayer.Adam => ¬ ∃ p : Fin k, Filter.Frequently (fun n => (play n).prio = p) Filter.atTop ∧ (∀ q : Fin k, p < q → ¬ Filter.Frequently (fun n => (play n).prio = q) Filter.atTop) ∧ (fun n => (play n).dir) ∈ G.winning_sets p
See it in the graphDiscuss this resultChallenge it