GameTree.value_optStrategy_eq
theoremverifiedformalizationimported Lean
At a node, the optStrategy picks a child whose value equals the node's value.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in theorem GameTree.value_optStrategy_eq [DecidableLE U] (m : N) (h : GameTree N U) (t : List (GameTree N U)) : value (optStrategy m h t).val = value (Node m h t)
- Formalizes
- EconCSLib, `GameTree.value_optStrategy_eq`
- 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.value_optStrategy_eq← GameTree.value_optStrategy_eq (EconCSLib/GameTheory/ExtensiveGame/GameTreeSPE.lean:106): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 12
- GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.optStrategyThe canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.valueGameTree.value
- GameTree.value_Node_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
argMaxOn ... ∈ value h :: valueList t, so it equals… - 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
- Used by 2
- GameTree.optStrategy_isSubgamePerfectOptimality of
optStrategy: for every subtreeg, every playeri, and everyi-variant deviationσ', the deviating outcome is… - GameTree.outcome_optStrategy_eq_valueKey lemma: the outcome of the backward-induction strategy equals the backward-induction value vector at every game tree. This is the…
- GameTree.optStrategy_isSubgamePerfectOptimality of
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 /-- At a node, the `optStrategy` picks a child whose value equals the node's value. -/ theorem GameTree.value_optStrategy_eq [DecidableLE U] (m : N) (h : GameTree N U) (t : List (GameTree N U)) : value (optStrategy m h t).val = value (Node m h t) := ((value_Node_eq_some_child_value m h t).choose_spec.2).symm