AFTD Auto-Formalizing Theoretical Domains

GameTree.value

defimported Lean

GameTree.value

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in
mutual
def GameTree.value : GameTree N U → (N → U)
Defined in
EconCSLib, `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
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
  • List.argMaxOnA chosen maximizer of f on the non-empty list head :: tail, computed by a left fold that keeps the running maximizer (ties keep…
Used by 26

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in
mutual
def GameTree.value : GameTree N U → (N → U)
    | Leaf p => p
    | Node m h t =>
        let hv := value h
        let tv := valueList t
        List.argMaxOn (fun v => v m) hv tv
def GameTree.valueList : List (GameTree N U) → List (N → U)
    | [] => []
    | x :: xs => value x :: valueList xs
end
See it in the graphDiscuss this resultChallenge it