AFTD Auto-Formalizing Theoretical Domains

Loomis.xBy_swap

theoremverifiedformalizationimported Lean

The bilinear pairing xBy and its symmetric variants.

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
theorem Loomis.xBy_swap (B : I → J → ℝ)
    (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) :
    wsum x (fun i => By B y i) = wsum y (fun j => xB B x j)
Formalizes
EconCSLib, `Loomis.xBy_swap`
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 5
  • Loomis.ByColumn-vector product (By)_i = ∑ⱼ Bᵢⱼ yⱼ.
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Loomis.xBRow-vector product (xB)_j = ∑ᵢ xᵢ Bᵢⱼ.
  • wsum_wsum_commExchange order of double weighted sums.
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 J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- The bilinear pairing `xBy` and its symmetric variants. -/theorem Loomis.xBy_swap (B : I → J → ℝ)    (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) :    wsum x (fun i => By B y i) = wsum y (fun j => xB B x j) := by  unfold xB By  exact wsum_wsum_comm x y B
See it in the graphDiscuss this resultChallenge it