AFTD Auto-Formalizing Theoretical Domains

prioritized_borel_dual_game

def

The dual game exchanges the owners of every position and complements each winning branch set while leaving states, edges, and priorities unchanged.

Statement

def prioritized_borel_dual_game {Q : Type} {k : ℕ} (G : PrioritizedBorelGame Q k) : PrioritizedBorelGame Q k
Source
arXiv:2611.10136, Definitions 18 and 19; swap the players and complement the branch sets
Verified
12 Nov 2026
Axioms
none listed
Built on 2
  • PrioritizedBorelGameA structure PrioritizedBorelGame (Q : Type*) (k : ℕ) representing a prioritized Borel game with state space Q and k priorities, with…
  • BorelGamePlayerThe two players in a prioritized Borel game, Eve and Adam.

Lean source view module on GitHub

def prioritized_borel_dual_game {Q : Type} {k : ℕ} (G : PrioritizedBorelGame Q k) : PrioritizedBorelGame Q k := { owner := fun p => match G.owner p with | BorelGamePlayer.Eve => BorelGamePlayer.Adam | BorelGamePlayer.Adam => BorelGamePlayer.Eve, init_state := G.init_state, edges := G.edges, edges_outgoing := G.edges_outgoing, winning_sets := fun i => (G.winning_sets i)ᶜ, winning_measurable := fun i => (G.winning_measurable i).compl }
See it in the graphDiscuss this resultChallenge it