AFTD Auto-Formalizing Theoretical Domains

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.
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

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it