Matrix.reindex_eq_conj
theoremverifiedformalizationimported Lean
Matrix.reindex_eq_conj
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped Matrix in variable {d d₂ d₃ R : Type*} in variable [Fintype d] [DecidableEq d] [Fintype d₂] [DecidableEq d₂] [Fintype d₃] [DecidableEq d₃] in variable [CommRing R] [StarRing R] in variable {𝕜 : Type*} [RCLike 𝕜] {A B : Matrix d d 𝕜} in omit [Fintype d₂] [DecidableEq d₂] [StarRing R] in theorem Matrix.reindex_eq_conj (A : Matrix d d R) (e : d ≃ d₂) : reindex e e A = (reindex (α := R) e (.refl d) 1) * A * (reindex (α := R) (.refl d) e 1)
- Formalizes
- QuantumInfo, `Matrix.reindex_eq_conj`
- 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_eq_conj← Matrix.reindex_eq_conj (QuantumInfo/ForMathlib/Isometry.lean:114): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped Matrix in variable {d d₂ d₃ R : Type*} in variable [Fintype d] [DecidableEq d] [Fintype d₂] [DecidableEq d₂] [Fintype d₃] [DecidableEq d₃] in variable [CommRing R] [StarRing R] in variable {𝕜 : Type*} [RCLike 𝕜] {A B : Matrix d d 𝕜} in omit [Fintype d₂] [DecidableEq d₂] [StarRing R] in theorem Matrix.reindex_eq_conj (A : Matrix d d R) (e : d ≃ d₂) : reindex e e A = (reindex (α := R) e (.refl d) 1) * A * (reindex (α := R) (.refl d) e 1) := by ext i j simp only [Matrix.mul_apply, Matrix.reindex] simp [Matrix.one_apply]