prioritized_borel_fork_all_winning_strategy
def
A memoryless strategy choosing the true-direction edge at the p-owned state of the all-winning fork game.
Statement
def prioritized_borel_fork_all_winning_strategy : FiniteMemoryStrategy prioritized_borel_fork_all_winning_game BorelGamePlayer.Eve Unit where init_mem
- Source
- arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 6
- prioritized_borel_fork_all_winning_gameThe three-state fork arena with every priority branch set equal to the full branch space.
- prioritized_borel_fork_is_legalThe legal edges of the three-state fork subarena, including both q self-loop directions and the q-to-hat-to-p-to-q excursion.
- 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…
- PrioritizedBorelGameA structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with…
- BorelGamePlayerThe two players in a prioritized Borel game, Eve and Adam.
- Used by 1
- prioritized_borel_fork_all_winning_memorylessThe all-winning fork game has a winning strategy using one memory state.
Lean source view module on GitHub
def prioritized_borel_fork_all_winning_strategy : FiniteMemoryStrategy prioritized_borel_fork_all_winning_game BorelGamePlayer.Eve Unit where init_mem := () update := fun _ _ => () choice := fun _ v q => ⟨v, q, true, 1, 0⟩ choice_edge := by intro m v q howner have hq : q = 2 := by have : (if q = 2 then BorelGamePlayer.Eve else BorelGamePlayer.Adam) = BorelGamePlayer.Eve := howner split_ifs at this with h · exact h subst q exact ⟨by norm_num [prioritized_borel_fork_all_winning_game, prioritized_borel_fork_is_legal], rfl, rfl⟩