MinimaxLoomis.extendDropColumn
defimported Lean
Extend a mixed strategy on J' = {j // j ≠ j₀} to a mixed strategy on J by putting zero mass on j₀.
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 MinimaxLoomis.extendDropColumn [DecidableEq J] (j₀ : J) (y' : stdSimplex ℝ {j : J // j ≠ j₀}) : stdSimplex ℝ J
- Defined in
- EconCSLib, `MinimaxLoomis.extendDropColumn`
- 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.MinimaxLoomis.extendDropColumn← MinimaxLoomis.extendDropColumn (EconCSLib/Math/Minimax/MinimaxLoomis.lean:242): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- MinimaxLoomis.sum_split_atSum-splitting lemma: any function on
Jdecomposes as the value atj₀plus the sum over{j // j ≠ j₀}.
- MinimaxLoomis.sum_split_atSum-splitting lemma: any function on
- Used by 5
- Loomis.By_extendDropColumnLoomis.By_extendDropColumn
- MinimaxLoomis.extendDropRowDual: extend a mixed strategy on
I' = {i // i ≠ i₀}to one onI. - 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… - MinimaxLoomis.wsum_extendDropColumn
wsum (extendDropColumn j₀ y') fequals thewsumofy'restricted to the corresponding sub-function on{j // j ≠ j₀}. - Loomis.Ay_extendDropColumnExtending
y' ∈ Δ(J')toΔ(J)by zero atj₀recovers the same row aggregates fromA(andB).
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 /-- Extend a mixed strategy on `J' = {j // j ≠ j₀}` to a mixed strategy on `J` by putting zero mass on `j₀`. -/ noncomputable def MinimaxLoomis.extendDropColumn [DecidableEq J] (j₀ : J) (y' : stdSimplex ℝ {j : J // j ≠ j₀}) : stdSimplex ℝ J := by refine ⟨fun j => if h : j = j₀ then 0 else y'.val ⟨j, h⟩, ?_, ?_⟩ · intro j by_cases h : j = j₀ · simp [h] · simp [h]; exact y'.property.1 ⟨j, h⟩ · rw [sum_split_at j₀] have h0 : (if h : (j₀ : J) = j₀ then (0 : ℝ) else y'.val ⟨j₀, h⟩) = 0 := by simp rw [h0, zero_add] have : ∀ j' : {j : J // j ≠ j₀}, (if h : j'.val = j₀ then (0 : ℝ) else y'.val ⟨j'.val, h⟩) = y'.val j' := by intro j'; simp [j'.property] simp_rw [this] exact y'.property.2