Loomis.colOffset_mix
theoremverifiedformalizationimported Lean
Convex combination linearity for colOffset 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.colOffset_mix (A B : I → J → ℝ) (lam : ℝ) (x y : stdSimplex ℝ I) (t : ℝ) (ht₀ : 0 ≤ t) (ht₁ : t ≤ 1) (j : J) : colOffset A B lam (stdSimplex.mix t ht₀ ht₁ x y) j = t * colOffset A B lam x j + (1 - t) * colOffset A B lam y j
- Formalizes
- EconCSLib, `Loomis.colOffset_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.colOffset_mix← Loomis.colOffset_mix (EconCSLib/Math/Minimax/Loomis.lean:403): 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,… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.colOffsetLinearised column constraint:
colOffset A B λ x j = (xA)_j - λ · (xB)_j. Note that… - 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… - Loomis.colOffset_eq_wsum
colOffsetis awsumofA i j - λ B i joveri. - 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 `colOffset` in the simplex argument. -/theorem Loomis.colOffset_mix (A B : I → J → ℝ) (lam : ℝ) (x y : stdSimplex ℝ I) (t : ℝ) (ht₀ : 0 ≤ t) (ht₁ : t ≤ 1) (j : J) : colOffset A B lam (stdSimplex.mix t ht₀ ht₁ x y) j = t * colOffset A B lam x j + (1 - t) * colOffset A B lam y j := by simp only [colOffset_eq_wsum] exact wsum_mix t ht₀ ht₁ x y _