Loomis.rowOffset_mix
theoremverifiedformalizationimported Lean
Convex combination linearity for rowOffset in the simplex argument.
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.rowOffset_mix (A B : I → J → ℝ) (mu : ℝ) (x y : stdSimplex ℝ J) (t : ℝ) (ht₀ : 0 ≤ t) (ht₁ : t ≤ 1) (i : I) : rowOffset A B mu (stdSimplex.mix t ht₀ ht₁ x y) i = t * rowOffset A B mu x i + (1 - t) * rowOffset A B mu y i
- Formalizes
- EconCSLib, `Loomis.rowOffset_mix`
- 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.rowOffset_mix← Loomis.rowOffset_mix (EconCSLib/Math/Minimax/Loomis.lean:411): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - Loomis.rowOffsetLinearised row constraint:
rowOffset A B μ y i = μ · (By)_i - (Ay)_i. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.rowOffset_eq_wsum
rowOffsetis awsumofμ B i j - A i joverj. - wsum_mixBilinearity of
wsumoverstdSimplex.mix:wsum (mix α x y) f = α · wsum x f + (1-α) · wsum y f. - stdSimplex.mixConvex combination of two simplex points:
mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for… - stdSimplex.mix_applystdSimplex.mix_apply
- wsumWeighted sum of
- Used by 1
- 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.loomis_value_eq_auxLoomis induction:
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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/-- Convex combination linearity for `rowOffset` in the simplex argument. -/theorem Loomis.rowOffset_mix (A B : I → J → ℝ) (mu : ℝ) (x y : stdSimplex ℝ J) (t : ℝ) (ht₀ : 0 ≤ t) (ht₁ : t ≤ 1) (i : I) : rowOffset A B mu (stdSimplex.mix t ht₀ ht₁ x y) i = t * rowOffset A B mu x i + (1 - t) * rowOffset A B mu y i := by simp only [rowOffset_eq_wsum] exact wsum_mix t ht₀ ht₁ x y _