prioritized_borel_fork_expand
def
Expand equally indexed visible bits and hidden stay-or-excursion choices into three-edge blocks.
Statement
def prioritized_borel_fork_expand : List Bool → List Bool → List PrioritizedBorelForkEdge- 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_three_step_blockA three-edge stay or excursion with common output directions false, false, then the supplied bit.
- Used by 10
- prioritized_borel_fork_expand_directionsExpanding equally long block histories has directions false, false, then the visible bit in each block.
- 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_valid_consistentEvery valid hidden block history expands to an edge history consistent with the actual history-dependent p-owned choice function.
- 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_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_expand_snocAppending a visible bit and hidden decision appends the corresponding three-edge block to the expanded history.
- 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…
- longest_common_prefixThe longest common prefix of two lists is their maximal shared initial segment.
Lean source view module on GitHub
def prioritized_borel_fork_expand : List Bool → List Bool → List PrioritizedBorelForkEdge
| b :: u, c :: h => prioritized_borel_fork_three_step_block b c ++ prioritized_borel_fork_expand u h
| _, _ => []