prioritized_borel_fork_three_step_block
def
A three-edge stay or excursion with common output directions false, false, then the supplied bit.
Statement
def prioritized_borel_fork_three_step_block (b exit : 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 1
- PrioritizedBorelForkEdgeOne edge of the three-state fork arena, recording source, direction, target, and priority.
- Used by 9
- prioritized_borel_fork_expand_directionsExpanding equally long block histories has directions false, false, then the visible bit in each 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_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_expand_runEvery expanded sequence of paired blocks is a legal run from q back to q.
- 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_stay_consistentA stay block is consistent with every p-owned choice function.
- 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
def prioritized_borel_fork_three_step_block (b exit : Bool) : List PrioritizedBorelForkEdge := if exit then [⟨0, false, 1, 0⟩, ⟨1, false, 2, 0⟩, ⟨2, b, 0, if b then 1 else 2⟩] else [⟨0, false, 0, 0⟩, ⟨0, false, 0, 0⟩, ⟨0, b, 0, 0⟩]