AFTD Auto-Formalizing Theoretical Domains

bestColumn

defimported Lean

Given a game $G$ and a mixed row strategy $p$, bestColumn is the pure column $j^* \in \mathrm{Fin}\,N$ that minimises $\mathrm{payoffVsPure}(G, p, \cdot)$, chosen via the classical axiom of choice from the finite minimiser.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
noncomputable def bestColumn {M N : ℕ} [NeZero N] (G : ZeroSumGame M N)
    (p : MixedStrategy M) : Fin N
Defined in
TCSlib, `bestColumn`
Lean proof
By Karim Abdel Sadek, Mark Bedaywi, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Karim Abdel Sadek and Mark Bedaywi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Built on 3
  • MixedStrategyA mixed strategy over $n$ actions is a record consisting of a weight function $w : \mathrm{Fin}\,n \to \mathbb{R}$ together with…
  • ZeroSumGameA finite two-player zero-sum game with $M$ row actions and $N$ column actions is a record consisting of a payoff matrix…
  • payoffVsPureGiven a game $G$, a mixed row strategy $p$, and a pure column $j$, the expected payoff against column $j$ is…
Used by 3
  • hedgeResponseNat_isBestResponseOnline column response is a best response. Let $G$ be a finite zero-sum game with $M \ge 1$ row actions and $N \ge 1$ column actions, let…
  • hedgeResponseNatThe sequence of column best responses generated online against Hedge: at time $t$, given the history $a_0, \dots, a_{t-1}$ of prior column…
  • bestColumn_specOptimality of the column best response. Let $G$ be a finite two-player zero-sum game with $M$ row actions and $N \ge 1$ column actions,…

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
/-- A pure column best response to the row mixed strategy `p`: a column `j` minimizing the expected payoff `payoffVsPure G p j`. [FS99, §2 (best response)]. Finiteness lets us choose an actual minimizer, not just an infimum. -/
noncomputable def bestColumn {M N : ℕ} [NeZero N] (G : ZeroSumGame M N)
    (p : MixedStrategy M) : Fin N :=
  Classical.choose (Finite.exists_min (payoffVsPure G p))
See it in the graphDiscuss this resultChallenge it