AFTD Auto-Formalizing Theoretical Domains

GameTree.IVariant

defimported Lean

Two strategies are i-variants if they agree on all nodes NOT owned by i. I.e., σ' is obtained from σ by changing only player i's choices.

Statement

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

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
/-- Two strategies are `i`-variants if they agree on all nodes NOT owned by `i`. I.e., `σ'` is obtained from `σ` by changing only player `i`'s choices. -/
def GameTree.IVariant (i : N) (σ σ' : Strategy N U) : Prop :=
  ∀ (m : N) (h : GameTree N U) (t : List (GameTree N U)),
    m ≠ i → σ m h t = σ' m h t
See it in the graphDiscuss this resultChallenge it