AFTD Auto-Formalizing Theoretical Domains

GameTree.IsSubgamePerfectOn

defimported Lean

Root-scoped subgame perfection on the subtrees of a fixed root. IsSubgamePerfect σ is global over every GameTree N U. This predicate restricts the same no-profitable-deviation condition to subgames that occur inside the chosen root g.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
def GameTree.IsSubgamePerfectOn (σ : Strategy N U) (g : GameTree N U) : Prop
Defined in
EconCSLib, `GameTree.IsSubgamePerfectOn`
Lean proof
By xbei (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 13
Used by 7

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
/-- Root-scoped subgame perfection on the subtrees of a fixed root. `IsSubgamePerfect σ` is global over every `GameTree N U`. This predicate restricts the same no-profitable-deviation condition to subgames that occur inside the chosen root `g`. -/
def GameTree.IsSubgamePerfectOn (σ : Strategy N U) (g : GameTree N U) : Prop :=
  ∀ (s : GameTree N U), Subtree s g →
    ∀ (i : N) (σ' : Strategy N U),
      IVariant i σ σ' → outcome σ' s i ≤ outcome σ s i
See it in the graphDiscuss this resultChallenge it