Transfer of winning through alternating game simulation
Lax369799.ParityGameSimulation · concepts/Lax369799/ParityGameSimulation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The simulation preserves owners and priorities, matching Eve's source choices and lifting Adam's target choices. Finite target determinacy then transfers a source winning strategy.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.ParityWinningRegions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Transfer of winning through alternating game simulation |
| 6 | type: theorem |
| 7 | --- |
| 8 | The simulation preserves owners and priorities, matching Eve's source |
| 9 | choices and lifting Adam's target choices. Finite target determinacy |
| 10 | then transfers a source winning strategy. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax369799.ParityGameSimulation |
| 14 | open FiniteParityGames |
| 15 | |
| 16 | structure Simulation {V W : Type} (G : Game V) (H : Game W) (R : V → W → Prop) where |
| 17 | owner : ∀ v w,R v w → (G.eve v ↔ H.eve w) |
| 18 | priority : ∀ v w,R v w → G.priority v = H.priority w |
| 19 | eve_step : ∀ v w,R v w → G.eve v → ∀ v',G.edge v v' → ∃ w',H.edge w w' ∧ R v' w' |
| 20 | adam_step : ∀ v w,R v w → ¬G.eve v → ∀ w',H.edge w w' → ∃ v',G.edge v v' ∧ R v' w' |
| 21 | |
| 22 | open ParityWinningRegions |
| 23 | |
| 24 | axiom winning {V W : Type} [Finite W] (G : Game V) (H : Game W) (R : V → W → Prop) |
| 25 | (s : Simulation G H R) (v : V) (w : W) (hR : R v w) |
| 26 | (h : Winning G true v) : Winning H true w |
| 27 | |
| 28 | end Lax369799.ParityGameSimulation |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments