AFTD Auto-Formalizing Theoretical Domains

FiniteMemoryStrategy

structure

A structure FiniteMemoryStrategy {Q : Type*} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) (M : Type*) representing a finite-memory strategy with memory set M for player pl in game G, with initial memory init_mem : M, update function update : M → TreeGameEdge Q k → M, choice function choice : M → List Bool → Q → TreeGameEdge Q k, and choice_edge asserting that at any pl-owned position (v, q), choice m v q is an edge in G.edges with source_node v and source_state q.

Statement

structure FiniteMemoryStrategy {Q : Type*} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) (M : Type*)
Defined in
arXiv:2611.10136, Sec. 4.1
Verified
10 Nov 2026
Axioms
none listed
Built on 3
  • 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…
  • PrioritizedBorelGameA structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with…
Used by 13

Read back from the Lean

A structure parameterized by a state type 'Q', a priority bound 'k : ℕ', a prioritized Borel game 'G : PrioritizedBorelGame Q k', a player 'pl : BorelGamePlayer', and a memory type 'M : Type*', consisting of: 1. 'init_mem': an initial memory element of type 'M'. 2. 'update': a memory transition function of type 'M → TreeGameEdge Q k → M'. 3. 'choice': an edge-selection function of type 'M → List Bool → Q → TreeGameEdge Q k'. 4. 'choice_edge': a proof that for all memory states 'm : M', tree nodes 'v : List Bool', and game states 'q : Q', if 'G.owner (v, q) = pl', then the edge 'e = choice m v q' satisfies 'e ∈ G.edges', 'e.source_node = v', and 'e.source_state = 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

/-- A finite-memory strategy in a prioritized Borel game. -/
structure FiniteMemoryStrategy {Q : Type*} {k : ℕ} (G : PrioritizedBorelGame Q k) (pl : BorelGamePlayer) (M : Type*) where
  init_mem : M
  update : M → TreeGameEdge Q k → M
  choice : M → List Bool → Q → TreeGameEdge Q k
  choice_edge : ∀ (m : M) (v : List Bool) (q : Q), G.owner (v, q) = pl → choice m v q ∈ G.edges ∧ (choice m v q).source_node = v ∧ (choice m v q).source_state = q
See it in the graphDiscuss this resultChallenge it