Matrix.reindex_toEuclideanLin
theoremverifiedformalizationimported Lean
Matrix.reindex_toEuclideanLin
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ R 𝕜 : Type*} [RCLike 𝕜] in variable {R : Type*} [CommSemiring R] in variable [Fintype d] [DecidableEq d] in variable [Fintype d₂] [DecidableEq d₂] in theorem Matrix.reindex_toEuclideanLin (e : d₁ ≃ d₃) (f : d₂ ≃ d) (M : Matrix d₁ d₂ 𝕜) : (M.reindex e f).toEuclideanLin = (LinearEquiv.euclideanOfRelabel 𝕜 e.symm) ∘ₗ M.toEuclideanLin ∘ₗ (LinearEquiv.euclideanOfRelabel 𝕜 f)
- Formalizes
- QuantumInfo, `Matrix.reindex_toEuclideanLin`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Matrix.reindex_toEuclideanLin← Matrix.reindex_toEuclideanLin (QuantumInfo/ForMathlib/LinearEquiv.lean:100): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- LinearEquiv.ofRelabel_reflLinearEquiv.ofRelabel_refl
- LinearEquiv.euclideanOfRelabel_reflLinearEquiv.euclideanOfRelabel_refl
- LinearEquiv.euclideanOfRelabelThe
𝕜-linear equivalenceEuclideanSpace 𝕜 d₂ ≃ₗ[𝕜] EuclideanSpace 𝕜 dthat relabels the coordinates of a vector along an index…
- Used by 1
- HermitianMat.ker_reindexHermitianMat.ker_reindex
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ R 𝕜 : Type*} [RCLike 𝕜] in variable {R : Type*} [CommSemiring R] in variable [Fintype d] [DecidableEq d] in variable [Fintype d₂] [DecidableEq d₂] in theorem Matrix.reindex_toEuclideanLin (e : d₁ ≃ d₃) (f : d₂ ≃ d) (M : Matrix d₁ d₂ 𝕜) : (M.reindex e f).toEuclideanLin = (LinearEquiv.euclideanOfRelabel 𝕜 e.symm) ∘ₗ M.toEuclideanLin ∘ₗ (LinearEquiv.euclideanOfRelabel 𝕜 f) := by ext simp [mulVec, dotProduct, Equiv.piCongrLeft_apply]