AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.BehaviorStrategy.liftReachableSubgame

defimported Lean

Lift a reachable-subgame behavior strategy to the original game, preserving the baseline strategy outside the reachable subgame.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
def ExtensiveGame.BehaviorStrategy.liftReachableSubgame {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {i : iota} {root : G.State}
    [(s : G.State) -> Decidable (Arena.Reachable G.toArena root s)]
    (base : G.BehaviorStrategy i)
    (beta : (G.reachableSubgameAt root).BehaviorStrategy i) :
    G.BehaviorStrategy i
Defined in
EconCSLib, `ExtensiveGame.BehaviorStrategy.liftReachableSubgame`
Lean proof
By xbei, Lazyfill (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 11
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
/-- Lift a reachable-subgame behavior strategy to the original game, preserving the baseline strategy outside the reachable subgame. -/
def ExtensiveGame.BehaviorStrategy.liftReachableSubgame {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {i : iota} {root : G.State}
    [(s : G.State) -> Decidable (Arena.Reachable G.toArena root s)]
    (base : G.BehaviorStrategy i)
    (beta : (G.reachableSubgameAt root).BehaviorStrategy i) :
    G.BehaviorStrategy i :=
  fun s h hnonterminal =>
    if hs : Arena.Reachable G.toArena root s then
      beta ⟨s, hs⟩ h hnonterminal
    else
      base s h hnonterminal
See it in the graphDiscuss this resultChallenge it