prioritized_borel_fork_hidden_decode
def
Recover the hidden stay-or-excursion choices from the first edge of each three-edge block.
Statement
def prioritized_borel_fork_hidden_decode : List PrioritizedBorelForkEdge → List Bool- 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 3
- 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_decode_expandExpanding equally long visible and hidden block histories and decoding the result recovers the hidden history.
- 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…
Lean source view module on GitHub
def prioritized_borel_fork_hidden_decode : List PrioritizedBorelForkEdge → List Bool | a :: _ :: _ :: rest => decide (a.dst = 1) :: prioritized_borel_fork_hidden_decode rest | _ => []