PrioritizedBorelForkEdge
structure
One edge of the three-state fork arena, recording source, direction, target, and priority.
Statement
structure PrioritizedBorelForkEdge where src : Fin 3 dir : Bool dst : Fin 3 prio : Fin 3 deriving DecidableEq
- Source
- arXiv:2611.10136, Section 5.3.2, smallest lower-bound arena; three-move fork obstruction
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Used by 22
- prioritized_borel_fork_expand_directionsExpanding equally long block histories has directions false, false, then the visible bit in each block.
- prioritized_borel_fork_consistent_appendConsistency of concatenated histories splits into consistency before and after the cut, with the preceding history passed to the second…
- 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_valid_consistentEvery valid hidden block history expands to an edge history consistent with the actual history-dependent p-owned choice function.
- prioritized_borel_fork_consistentA finite edge history is consistent with a history-dependent choice function when every p-owned edge uses the direction the function…
- PrioritizedBorelForkRunA finite path in the fork arena whose edges are legal and have matching endpoints.
- 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.
- prioritized_borel_fork_block_runEach three-edge stay or excursion is a legal run from q back to q.
- prioritized_borel_fork_decode_expandExpanding equally long visible and hidden block histories and decoding the result recovers the hidden history.
- 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_all_winning_gameThe three-state fork arena with every priority branch set equal to the full branch space.
- 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_expandExpand equally indexed visible bits and hidden stay-or-excursion choices into three-edge blocks.
- prioritized_borel_fork_expand_snocAppending a visible bit and hidden decision appends the corresponding three-edge block to the expanded history.
- prioritized_borel_fork_setupThe first two forced edges of a fork excursion.
- prioritized_borel_fork_three_step_blockA three-edge stay or excursion with common output directions false, false, then the supplied bit.
- prioritized_borel_fork_stay_consistentA stay block is consistent with every p-owned choice function.
- 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_fork_hidden_decodeRecover the hidden stay-or-excursion choices from the first edge of each three-edge block.
- prioritized_borel_fork_exit_consistentAn excursion block is consistent when its last direction is the function's choice after the first two edges.
Lean source view module on GitHub
structure PrioritizedBorelForkEdge where src : Fin 3 dir : Bool dst : Fin 3 prio : Fin 3 deriving DecidableEq