PrioritizedBorelForkValid
inductive
Blockwise histories: every history may stay for an arbitrary visible bit, or take a hidden excursion only when the strategy chooses that bit.
Statement
inductive PrioritizedBorelForkValid (color : List Bool → List Bool → Bool) : List Bool → List Bool → Prop | root : PrioritizedBorelForkValid color [] [] | stay {u h} (bit : Bool) : PrioritizedBorelForkValid color u h → PrioritizedBorelForkValid color (u ++ [bit]) (h ++ [false]) | exit {u h} : PrioritizedBorelForkValid color u h → PrioritizedBorelForkValid color (u ++ [color u h]) (h ++ [true])
- 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 11
- 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_exponential_historiesFor every history-dependent excursion response and every n, some common n-block output has at least (3/2)^n compatible hidden histories.
- 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_valid_lengthsIn each compatible block history the visible and hidden histories have equal length.
- prioritized_borel_fork_prefix_chainFor every n, there is a visible n-block word such that every prefix of length k admits at least k+1 compatible hidden histories.
- 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_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_memory_fiber_unboundedFor every history-dependent response and every finite-memory assignment, arbitrarily many compatible hidden histories can reach one common…
- prioritized_borel_fork_one_branch_memory_fibersFor any finite-memory assignment, one infinite visible sequence has prefixes with arbitrarily large compatible hidden-history fibers at…
- prioritized_borel_fork_fixed_branch_memory_fibersFor any finite-memory assignment, one infinite visible sequence and one fixed memory value have arbitrarily large compatible…
- prioritized_borel_fork_one_infinite_branchFor every history-dependent fork response, one infinite visible block sequence has prefixes with arbitrarily many compatible hidden…
Lean source view module on GitHub
inductive PrioritizedBorelForkValid (color : List Bool → List Bool → Bool) : List Bool → List Bool → Prop | root : PrioritizedBorelForkValid color [] [] | stay {u h} (bit : Bool) : PrioritizedBorelForkValid color u h → PrioritizedBorelForkValid color (u ++ [bit]) (h ++ [false]) | exit {u h} : PrioritizedBorelForkValid color u h → PrioritizedBorelForkValid color (u ++ [color u h]) (h ++ [true])