AFTD Auto-Formalizing Theoretical Domains

prioritized_borel_fork_all_winning_game

def

The three-state fork arena with every priority branch set equal to the full branch space.

Statement

def prioritized_borel_fork_all_winning_game : PrioritizedBorelGame (Fin 3) 3 where
  owner
Source
arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
Verified
12 Nov 2026
Axioms
none listed
Built on 5
  • 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.
  • PrioritizedBorelGameA structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with…
  • TreeGameEdgeA structure TreeGameEdge (Q : Type*) (k : ℕ) representing an edge in a binary tree game arena with state space Q and k priorities, with…
  • BorelGamePlayerThe two players in a prioritized Borel game, Eve and Adam.
  • PrioritizedBorelForkEdgeOne edge of the three-state fork arena, recording source, direction, target, and priority.
Used by 3

Lean source view module on GitHub

def prioritized_borel_fork_all_winning_game : PrioritizedBorelGame (Fin 3) 3 where
  owner := fun pos => if pos.2 = 2 then BorelGamePlayer.Eve else BorelGamePlayer.Adam
  init_state := 0
  edges := {e | prioritized_borel_fork_is_legal ⟨e.source_state, e.dir, e.target_state, e.prio⟩}
  edges_outgoing := by
    intro v q
    fin_cases q
    · exact ⟨⟨v, 0, false, 0, 0⟩, by norm_num [prioritized_borel_fork_is_legal], rfl, rfl⟩
    · exact ⟨⟨v, 1, false, 0, 2⟩, by norm_num [prioritized_borel_fork_is_legal], rfl, rfl⟩
    · exact ⟨⟨v, 2, true, 1, 0⟩, by norm_num [prioritized_borel_fork_is_legal], rfl, rfl⟩
  winning_sets := fun _ => Set.univ
  winning_measurable := by intro i; exact MeasurableSet.univ
See it in the graphDiscuss this resultChallenge it