AFTD Auto-Formalizing Theoretical Domains

MatrixGame.AdmissibleSequence.mu

defimported Lean

Cumulative duality gap μ(t) := max_i β^i(t) - min_j α^j(t).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {A : MatrixGame I J ℝ} in
noncomputable def MatrixGame.AdmissibleSequence.mu (s : AdmissibleSequence A) (t : ℕ) : ℝ
Defined in
EconCSLib, `MatrixGame.AdmissibleSequence.mu`
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 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {A : MatrixGame I J ℝ} in
/-- Cumulative duality gap `μ(t) := max_i β^i(t) - min_j α^j(t)`. -/
noncomputable def MatrixGame.AdmissibleSequence.mu (s : AdmissibleSequence A) (t : ℕ) : ℝ :=
  Finset.univ.sup' Finset.univ_nonempty (s.β t)
    - Finset.univ.inf' Finset.univ_nonempty (s.α t)
See it in the graphDiscuss this resultChallenge it