GameTree.profileStrategy_deviate_variant
theoremverifiedformalizationimported Lean
Replacing player i's normal-form contingent plan produces an i-variant global tree strategy.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} in variable [DecidableEq N] in theorem GameTree.profileStrategy_deviate_variant (σ : N → PlayerStrategy N U) (i : N) (s' : PlayerStrategy N U) : IVariant i (profileStrategy σ) (profileStrategy (Function.update σ i s'))
- Formalizes
- EconCSLib, `GameTree.profileStrategy_deviate_variant`
- 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.GameTree.profileStrategy_deviate_variant← GameTree.profileStrategy_deviate_variant (EconCSLib/GameTheory/ExtensiveGame/GameTreeStrategicForm.lean:54): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 11
- GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.profileStrategyCombine a normal-form profile into the global
GameTree.Strategyused by the game-tree evaluator. At each node, the mover's contingent… - GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.IVariantTwo strategies are
i-variants if they agree on all nodes NOT owned byi. I.e.,σ'is obtained fromσby changing only playeri's… - GameTree.PlayerStrategyA single player's pure strategy in the normal form of a
GameTree: a complete contingent plan choosing a child at every possible node. - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list. - GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen GameTree invariable {N U : Type*} invariable [DecidableEq N] in/-- Replacing player `i`'s normal-form contingent plan produces an `i`-variant global tree strategy. -/theorem GameTree.profileStrategy_deviate_variant (σ : N → PlayerStrategy N U) (i : N) (s' : PlayerStrategy N U) : IVariant i (profileStrategy σ) (profileStrategy (Function.update σ i s')) := by intro m h t hmi simp [profileStrategy, hmi]