AFTD Auto-Formalizing Theoretical Domains

GameTree.outcome

defimported Lean

The outcome (terminal payoff vector) of playing strategy σ starting from game tree g. Walks down the tree, using σ to pick a child at each Node, until a Leaf is reached.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
noncomputable def GameTree.outcome (σ : Strategy N U) : GameTree N U → (N → U)
Defined in
EconCSLib, `GameTree.outcome`
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 10
Used by 17

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
/-- The outcome (terminal payoff vector) of playing strategy `σ` starting from game tree `g`. Walks down the tree, using `σ` to pick a child at each `Node`, until a `Leaf` is reached. -/
noncomputable def GameTree.outcome (σ : Strategy N U) : GameTree N U → (N → U)
  | Leaf p => p
  | Node m h t => outcome σ (σ m h t).val
termination_by g => g.size
decreasing_by
  have hmem := (σ m h t).property
  exact size_mem_children_lt m h t (by simpa [children] using hmem)
See it in the graphDiscuss this resultChallenge it