GameTree.IVariant.refl
theoremverifiedformalizationimported Lean
IVariant is reflexive: any strategy is an i-variant of itself.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in omit [TotalPreorder U] in theorem GameTree.IVariant.refl (i : N) (σ : Strategy N U) : IVariant i σ σ
- Formalizes
- EconCSLib, `GameTree.IVariant.refl`
- 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.IVariant.refl← GameTree.IVariant.refl (EconCSLib/GameTheory/ExtensiveGame/GameTreeSPE.lean:121): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 11
- GameTree.outcome_LeafGameTree.outcome_Leaf
- 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.StrategyA pure strategy for the entire game tree: at every possible node context
(mover, head, tail), specify one child (bundled with its… - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - 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
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in omit [TotalPreorder U] in /-- `IVariant` is reflexive: any strategy is an `i`-variant of itself. -/ theorem GameTree.IVariant.refl (i : N) (σ : Strategy N U) : IVariant i σ σ := fun _ _ _ _ => rfl