Loomis.Ay
defimported Lean
Column-vector product (Ay)_i = ∑ⱼ Aᵢⱼ yⱼ.
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 noncomputable def Loomis.Ay (A : I → J → ℝ) (y : stdSimplex ℝ J) (i : I) : ℝ
- Defined in
- EconCSLib, `Loomis.Ay`
- 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.Loomis.Ay← Loomis.Ay (EconCSLib/Math/Minimax/Loomis.lean:79): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- wsumWeighted sum of
- Used by 14
- Loomis.rowRatio.continuousEach row ratio
(Ay)_i / (By)_iis continuous onΔ(J). - Loomis.muB.aux_lt_of_rowOffset_pos
muB.aux A B yis strictly belowmuiff every offsetrowOffsetis strictly positive aty. - EconCSLib.LinearAlgebra.perron_frobeniusPerron-Frobenius for positive matrices [MFoGT, Section 2.8, Exercise 1(2)]. A square matrix with strictly positive entries has a…
- Loomis.rowOffsetLinearised row constraint:
rowOffset A B μ y i = μ · (By)_i - (Ay)_i. - Loomis.loomis_value_eq_auxLoomis induction:
lamB0 A B = muB0 A Bfor any finite positive-Bmatrix pair with2 ≤ |I| + |J|, by strong induction on the… - Loomis.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0. - Loomis.rowOffset_eq_wsum
rowOffsetis awsumofμ B i j - A i joverj. - Loomis.rowRatio_oneLoomis.rowRatio_one
- Loomis.loomis_value_IJ_2Base case of the Loomis induction: a 1×1 matrix pair has the single ratio
A i₀ j₀ / B i₀ j₀as the common Loomis value. - Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices
A B : I → J → ℝwithBentrywise positive, there exist mixed… - Loomis.rowRatioColumn player's per-row Loomis ratio
(Ay)_i / (By)_i. - Loomis.exists_yy_muB0Attainment of
muB0: there exists a mixed strategyyywith(Ay yy)_i ≤ muB0 · (By yy)_ifor every row. - Loomis.Ay_extendDropColumnExtending
y' ∈ Δ(J')toΔ(J)by zero atj₀recovers the same row aggregates fromA(andB). - EconCSLib.LinearAlgebra.Ay_idMatEconCSLib.LinearAlgebra.Ay_idMat
- Loomis.rowRatio.continuousEach row ratio
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 /-- Column-vector product `(Ay)_i = ∑ⱼ Aᵢⱼ yⱼ`. -/ noncomputable def Loomis.Ay (A : I → J → ℝ) (y : stdSimplex ℝ J) (i : I) : ℝ := wsum y (fun j => A i j)