Minimax.skew_optimal
theoremverifiedformalizationimported Lean
SkewSymmetric.optimal transported to an arbitrary nonempty finite index.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {π : Type*} [Field π] [LinearOrder π] [IsStrictOrderedRing π] in theorem Minimax.skew_optimal {K : Type*} [Fintype K] [DecidableEq K] [Nonempty K] (S : K β K β π) (hS : β k l, S k l = - S l k) : β z : K β π, (β k, 0 β€ z k) β§ (β k, z k = 1) β§ (β l, 0 β€ β k, z k * S k l)
- Formalizes
- EconCSLib, `Minimax.skew_optimal`
- 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.Minimax.skew_optimal← Minimax.skew_optimal (EconCSLib/Math/Minimax/Minimax.lean:28): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- Used by 1
- Minimax.minimax_posMinimax for a strictly positive game.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators invariable {π : Type*} [Field π] [LinearOrder π] [IsStrictOrderedRing π] in/-- `SkewSymmetric.optimal` transported to an arbitrary nonempty finite index. -/theorem Minimax.skew_optimal {K : Type*} [Fintype K] [DecidableEq K] [Nonempty K] (S : K β K β π) (hS : β k l, S k l = - S l k) : β z : K β π, (β k, 0 β€ z k) β§ (β k, z k = 1) β§ (β l, 0 β€ β k, z k * S k l) := by classical let e : K β Fin (Fintype.card K) := Fintype.equivFin K haveI : NeZero (Fintype.card K) := β¨Fintype.card_ne_zeroβ© set S' : Fin (Fintype.card K) β Fin (Fintype.card K) β π := fun a b => S (e.symm a) (e.symm b) with hS' obtain β¨z', hz'_nn, hz'_sum, hz'_colβ© := SkewSymmetric.optimal S' (fun a b => hS _ _) refine β¨fun k => z' (e k), fun k => hz'_nn _, ?_, ?_β© Β· rw [Equiv.sum_comp e z']; exact hz'_sum Β· intro l have h := hz'_col (e l) have heq : (β k, z' (e k) * S k l) = β a, z' a * S' a (e l) := by rw [β Equiv.sum_comp e (fun a => z' a * S' a (e l))] refine Finset.sum_congr rfl (fun k _ => ?_) simp only [hS', Equiv.symm_apply_apply] rw [heq]; exact h