AFTD Auto-Formalizing Theoretical Domains

GameTree.optStrategy

defimported Lean

The canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a child attaining the argmax for the mover). Noncomputable — uses classical choice via value_Node_eq_some_child_value.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
noncomputable def GameTree.optStrategy [DecidableLE U] : Strategy N U
Defined in
EconCSLib, `GameTree.optStrategy`
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 12
Used by 11

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 canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a child attaining the argmax for the mover). Noncomputable — uses classical choice via `value_Node_eq_some_child_value`. -/
noncomputable def GameTree.optStrategy [DecidableLE U] : Strategy N U := fun m h t =>
  ⟨(value_Node_eq_some_child_value m h t).choose,
   (value_Node_eq_some_child_value m h t).choose_spec.1⟩
See it in the graphDiscuss this resultChallenge it