EconCSLib.LinearAlgebra.xA_idMat
theoremverifiedformalizationimported Lean
EconCSLib.LinearAlgebra.xA_idMat
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Loomis in set_option linter.unusedSectionVars false in variable {n : ℕ} [NeZero n] in theorem EconCSLib.LinearAlgebra.xA_idMat (x : stdSimplex ℝ (Fin n)) (j : Fin n) : Loomis.xA idMat x j = x.val j
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.xA_idMat`
- 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.EconCSLib.LinearAlgebra.xA_idMat← EconCSLib.LinearAlgebra.xA_idMat (EconCSLib/Math/LinearAlgebra/PerronFrobenius.lean:56): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.xARow-vector product
(xA)_j = ∑ᵢ xᵢ Aᵢⱼ. - EconCSLib.LinearAlgebra.idMatThe identity matrix on
Fin n.
- Used by 1
- EconCSLib.LinearAlgebra.perron_frobeniusPerron-Frobenius for positive matrices [MFoGT, Section 2.8, Exercise 1(2)]. A square matrix with strictly positive entries has a…
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 Loomis inset_option linter.unusedSectionVars false invariable {n : ℕ} [NeZero n] intheorem EconCSLib.LinearAlgebra.xA_idMat (x : stdSimplex ℝ (Fin n)) (j : Fin n) : Loomis.xA idMat x j = x.val j := by classical show ∑ i, x.val i * (if i = j then (1 : ℝ) else 0) = x.val j simp only [mul_ite, mul_one, mul_zero, Fintype.sum_ite_eq']