AFTD Auto-Formalizing Theoretical Domains

ZeroSumChance.GameTree.value

defimported Lean

The 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: B minimizes, so we take the min of both children's values. * Nature node: probability-weighted average (rational arithmetic).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def ZeroSumChance.GameTree.value : GameTree → ℚ
Defined in
EconCSLib, `ZeroSumChance.GameTree.value`
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 3
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- The 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: B minimizes, so we take the min of both children's values. * Nature node: probability-weighted average (rational arithmetic). -/
def ZeroSumChance.GameTree.value : GameTree → ℚ
  | Leaf r      => r
  | Pnode p L R => match p with
    | .A => max L.value R.value
    | .B => min L.value R.value
  | Nnode prob L R => prob * L.value + (1 - prob) * R.value
See it in the graphDiscuss this resultChallenge it