toEuclideanLin_apply_eq_sum
theoremverifiedimported Lean
Coordinates of a matrix-vector product. Let $A\in\bbr^{k\times d}$ be a $k\times d$ real matrix, regarded as the linear map from the Euclidean space $\bbr^{d}$ to $\bbr^{k}$ that it induces, and let $x\in\bbr^{d}$. Then for each index $i\in\{1,\dots,k\}$, the $i$-th coordinate of the image $Ax$ is given by \[ (Ax)_i \;=\; \sum_{j} A_{ij}\,x_j . \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory Real NNReal Matrix Finset in variable {d k : ℕ} in lemma toEuclideanLin_apply_eq_sum (A : Matrix (Fin k) (Fin d) ℝ) (x : EuclideanSpace ℝ (Fin d)) (i : Fin k) : (A.toEuclideanLin x) i = ∑ j, A i j * x j
- Source
- TCSlib, `toEuclideanLin_apply_eq_sum`
- Lean proof
- By Ganesh Sankar, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Ganesh Sankar. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.toEuclideanLin_apply_eq_sum← toEuclideanLin_apply_eq_sum (TCSlib/LearningTheory/JohnsonLindenstrauss/RowDistribution.lean:226): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- jl_concentration_single_via_chi_squaredJohnson–Lindenstrauss concentration for a single vector. Let $k \ge 1$, and let $A$ be a random $k \times d$ real matrix on a probability…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory Real NNReal Matrix Finset in variable {d k : ℕ} in /-- The `i`-th coordinate of the image of `x` under the linear map of the matrix `A` is the row sum `∑ j, A i j * x j`; this holds by definition of `Matrix.toEuclideanLin`. -/ lemma toEuclideanLin_apply_eq_sum (A : Matrix (Fin k) (Fin d) ℝ) (x : EuclideanSpace ℝ (Fin d)) (i : Fin k) : (A.toEuclideanLin x) i = ∑ j, A i j * x j := rfl