FiniteMemoryStrategy
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
- PrioritizedBorelStrategyHistoryAn encoded finite history follows legal edges from the initial position and agrees with the chosen strategy at its player's positions.…
- prioritized_borel_fork_all_winning_strategyA memoryless strategy choosing the true-direction edge at the p-owned state of the all-winning fork game.
- prioritized_borel_eventually_visible_determined_positionalA determined prioritized tree game has a memoryless winner if, along every legal play, all but finitely many moves are uniquely determined…
- prioritized_borel_fork_all_winning_memorylessThe all-winning fork game has a winning strategy using one memory state.
- has_winning_strategy_in_mem_monoIn any prioritized Borel game G with k priorities on state space Q, if a player has a winning strategy using at most m1 memory states, and…
- prioritized_borel_deterministic_opponent_memorylessIf every position controlled by Adam in a prioritized Borel game has at most one legal outgoing edge, then one of the players has a…
- HasWinningStrategyInMemThe proposition HasWinningStrategyInMem G m_bound asserts that for a prioritized Borel game G with state space Q and k priorities, there…
- prioritized_borel_reverse_edge_deterministic_positionalIf the current node and target state uniquely determine the previous state, and the node, source state, direction and target state…
- prioritized_borel_fork_game_strategy_fixed_branchFor every finite-memory Eve strategy in the all-winning three-state fork game, one infinite visible block sequence and one fixed memory…
- prioritized_borel_finite_hidden_opponent_choices_positionalFix a winning strategy in a prioritized tree game, with an arbitrary state type. Suppose that on every legal play, all but finitely many…
- PrioritizedBorelStrategyWinsA strategy wins for its player if every legal play from the initial position consistent with its memory update and choices is won by that…
- prioritized_borel_reverse_deterministic_finite_hidden_priorities_positionalConsider a prioritized tree game. Assume that any two legal edges at the same source node with the same direction and target state have…
- prioritized_borel_bounded_opponent_branching_compressionFix a winning strategy, possibly using infinite memory, in a finite-state prioritized tree game with k priorities. If along every legal…
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