AFTD Auto-Formalizing Theoretical Domains

EconCSLib.StrategicGame.antisymmetric_self_pairing_zero

theoremverifiedformalizationimported Lean

xᵀ B x = 0 for any mixed strategy x (when B is antisymmetric), where xᵀ B x = ∑ i, xx_i * (∑ j, B_ij * xx_j).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in
theorem EconCSLib.StrategicGame.antisymmetric_self_pairing_zero {B : I → I → ℝ}
    (hB : IsAntisymmetric B) (x : stdSimplex ℝ I) :
    ∑ i, x.val i * (∑ j, B i j * x.val j) = 0
Formalizes
EconCSLib, `EconCSLib.StrategicGame.antisymmetric_self_pairing_zero`
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 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in/-- `xᵀ B x = 0` for any mixed strategy `x` (when `B` is antisymmetric), where `xᵀ B x = ∑ i, xx_i * (∑ j, B_ij * xx_j)`. -/theorem EconCSLib.StrategicGame.antisymmetric_self_pairing_zero {B : I → I → ℝ}    (hB : IsAntisymmetric B) (x : stdSimplex ℝ I) :    ∑ i, x.val i * (∑ j, B i j * x.val j) = 0 := by  have hsplit : (∑ i, x.val i * (∑ j, B i j * x.val j))              = ∑ i, ∑ j, x.val i * B i j * x.val j := by    refine Finset.sum_congr rfl (fun i _ => ?_)    rw [Finset.mul_sum]    refine Finset.sum_congr rfl (fun j _ => ?_); ring  rw [hsplit]  exact hB.quadform_zero x.val
See it in the graphDiscuss this resultChallenge it