Loomis.dropRow
defimported Lean
Drop the i₀-row of A and view as a matrix on {i // i ≠ i₀} × 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 Loomis.dropRow [DecidableEq I] (A : I → J → ℝ) (i₀ : I) : {i : I // i ≠ i₀} → J → ℝ
- Defined in
- EconCSLib, `Loomis.dropRow`
- 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.dropRow← Loomis.dropRow (EconCSLib/Math/Minimax/Loomis.lean:457): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 4
- Loomis.xB_extendDropRowLoomis.xB_extendDropRow
- Loomis.dropRow.IsPositiveDropping a row preserves entrywise positivity.
- Loomis.xA_extendDropRowLoomis.xA_extendDropRow
- 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…
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 /-- Drop the `i₀`-row of `A` and view as a matrix on `{i // i ≠ i₀} × J`. -/ noncomputable def Loomis.dropRow [DecidableEq I] (A : I → J → ℝ) (i₀ : I) : {i : I // i ≠ i₀} → J → ℝ := fun i' j => A i'.val j