AFTD Auto-Formalizing Theoretical Domains

EconCSLib.StrategicGame.MatrixGame.disp_Ei

theoremverifiedformalizationimported Lean

Row-side payoff under disp A: Ei i y = (Ay)_i − y_i.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in
theorem EconCSLib.StrategicGame.MatrixGame.disp_Ei (A : I → I → ℝ) (y : stdSimplex ℝ I) (i : I) :
    (⟨disp A⟩ : MatrixGame I I ℝ).Ei i y
      = (∑ j, A i j * y.val j) - y.val i
Formalizes
EconCSLib, `EconCSLib.StrategicGame.MatrixGame.disp_Ei`
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 8
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in/-- Row-side payoff under `disp A`: `Ei i y = (Ay)_i − y_i`. -/theorem EconCSLib.StrategicGame.MatrixGame.disp_Ei (A : I → I → ℝ) (y : stdSimplex ℝ I) (i : I) :    (⟨disp A⟩ : MatrixGame I I ℝ).Ei i y      = (∑ j, A i j * y.val j) - y.val i := by  show wsum y (fun j => disp A i j) = (∑ j, A i j * y.val j) - y.val i  show (∑ j, y.val j * (A i j - if i = j then 1 else 0))      = (∑ j, A i j * y.val j) - y.val i  rw [show (∑ j, y.val j * (A i j - if i = j then 1 else 0))        = (∑ j, y.val j * A i j) - (∑ j, y.val j * (if i = j then 1 else 0)) from by    rw [← Finset.sum_sub_distrib]; refine Finset.sum_congr rfl (fun j _ => ?_); ring]  rw [show (∑ j, y.val j * A i j) = ∑ j, A i j * y.val j from    Finset.sum_congr rfl (fun j _ => mul_comm _ _)]  congr 1  show ∑ j, y.val j * (if i = j then (1 : ℝ) else 0) = y.val i  simp [Fintype.sum_ite_eq, mul_ite]
See it in the graphDiscuss this resultChallenge it