prioritized_borel_fork_is_legal
def
The legal edges of the three-state fork subarena, including both q self-loop directions and the q-to-hat-to-p-to-q excursion.
Statement
def prioritized_borel_fork_is_legal (e : PrioritizedBorelForkEdge) : Prop
- Source
- arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- PrioritizedBorelForkEdgeOne edge of the three-state fork arena, recording source, direction, target, and priority.
- Used by 6
- 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_fork_run_appendTwo finite legal fork runs can be concatenated when their intermediate states agree.
- PrioritizedBorelForkRunA finite path in the fork arena whose edges are legal and have matching endpoints.
- prioritized_borel_fork_block_runEach three-edge stay or excursion is a legal run from q back to q.
- prioritized_borel_fork_all_winning_gameThe three-state fork arena with every priority branch set equal to the full branch space.
- 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…
Lean source view module on GitHub
def prioritized_borel_fork_is_legal (e : PrioritizedBorelForkEdge) : Prop := (e.src = 0 ∧ e.dst = 0 ∧ e.prio = 0) ∨ (e.src = 0 ∧ e.dir = false ∧ e.dst = 1 ∧ e.prio = 0) ∨ (e.src = 1 ∧ e.dir = false ∧ e.dst = 2 ∧ e.prio = 0) ∨ (e.src = 2 ∧ e.dst = 0 ∧ ((e.dir = true ∧ e.prio = 1) ∨ (e.dir = false ∧ e.prio = 2)))