ZeroSumChance.GameTree
inductiveimported Lean
A finite binary game tree for a 2-player zero-sum game with Nature. * Leaf val — terminal node; val is A's payoff (B gets -val). * Pnode p L R — player p's decision node; player chooses L or R. * Nnode prob L R — Nature's chance node; Nature picks L with probability prob ∈ [0,1] and R with probability 1 - prob.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in inductive ZeroSumChance.GameTree : Type
- Defined in
- EconCSLib, `ZeroSumChance.GameTree`
- 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.ZeroSumChance.GameTree← ZeroSumChance.GameTree (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:89): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- ZeroSumChance.PlayerThe two players in a zero-sum game: A is the maximizer, B is the minimizer.
- Used by 8
- ZeroSumChance.GameTree.size_posEvery game tree has positive size.
- ZeroSumChance.GameTree.outcomeThe realized payoff for player A when A plays
SAand B playsSB. Nature's moves are resolved by their fixed probabilities. - ZeroSumChance.GameTree.value_propSoundness of
DStrategy: the backward-induction value is a lower bound on the outcome A achieves by followingDStrategy, regardless… - ZeroSumChance.instInhabitedGameTreeZeroSumChance.instInhabitedGameTree
- ZeroSumChance.GameTree.valueThe backward-induction value of the game tree for player A. * A-node: A maximizes, so we take the max of both children's values. * B-node:…
- ZeroSumChance.GameTree.sizeStructural size of a game tree (used internally for well-founded reasoning).
- ZeroSumChance.GameTree.StrategyA pure strategy is a function that, given a player's decision node, selects one of the two branches.…
- ZeroSumChance.GameTree.DStrategyA's dominant strategy: at each A-node, move to whichever child has the higher value; ties go left.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A finite binary game tree for a 2-player zero-sum game with Nature. * `Leaf val` — terminal node; `val` is A's payoff (B gets `-val`). * `Pnode p L R` — player `p`'s decision node; player chooses L or R. * `Nnode prob L R` — Nature's chance node; Nature picks L with probability `prob ∈ [0,1]` and R with probability `1 - prob`. -/ inductive ZeroSumChance.GameTree : Type | Leaf (val : ℚ) : GameTree | Pnode (p : Player) (L R : GameTree) : GameTree | Nnode (prob : Set.Icc (0 : ℚ) 1) (L R : GameTree) : GameTree deriving Repr, DecidableEq