PrioritizedBorelForkRun
inductive
A finite path in the fork arena whose edges are legal and have matching endpoints.
Statement
inductive PrioritizedBorelForkRun : Fin 3 → List PrioritizedBorelForkEdge → Fin 3 → Prop | nil (q : Fin 3) : PrioritizedBorelForkRun q [] q | cons {q s : Fin 3} {e : PrioritizedBorelForkEdge} {es : List PrioritizedBorelForkEdge} : prioritized_borel_fork_is_legal e → e.src = q → PrioritizedBorelForkRun e.dst es s → PrioritizedBorelForkRun q (e :: es) s
- Source
- arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 2
- PrioritizedBorelForkEdgeOne edge of the three-state fork arena, recording source, direction, target, and priority.
- 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.
- Used by 7
- prioritized_borel_fork_strategy_fixed_branchFor any history-dependent strategy and finite-memory assignment in the three-state fork arena, there are one infinite visible block…
- prioritized_borel_fork_run_appendTwo finite legal fork runs can be concatenated when their intermediate states agree.
- prioritized_borel_fork_block_runEach three-edge stay or excursion is a legal run from q back to q.
- prioritized_borel_fork_strategy_obstructionFor any history-dependent strategy and any finite-memory assignment, arbitrarily many distinct legal strategy-consistent runs return to q…
- prioritized_borel_fork_expand_runEvery expanded sequence of paired blocks is a legal run from q back to q.
- prioritized_borel_fork_unbounded_same_memoryFor any history-dependent excursion choice and finite-memory assignment, arbitrarily many distinct legal runs from q to q share their…
- 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
inductive PrioritizedBorelForkRun : Fin 3 → List PrioritizedBorelForkEdge → Fin 3 → Prop | nil (q : Fin 3) : PrioritizedBorelForkRun q [] q | cons {q s : Fin 3} {e : PrioritizedBorelForkEdge} {es : List PrioritizedBorelForkEdge} : prioritized_borel_fork_is_legal e → e.src = q → PrioritizedBorelForkRun e.dst es s → PrioritizedBorelForkRun q (e :: es) s