Matrix.reindex_one_isometry
theoremverifiedformalizationimported Lean
Matrix.reindex_one_isometry
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₂] in theorem Matrix.reindex_one_isometry (e : d ≃ d₂) (f : d ≃ d₃) : (reindex (α := R) e f 1).Isometry
- Formalizes
- QuantumInfo, `Matrix.reindex_one_isometry`
- 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_one_isometry← Matrix.reindex_one_isometry (QuantumInfo/ForMathlib/Isometry.lean:95): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Matrix.IsometryAn isometry is a matrix
Asuch thatAAᴴ = 1. Compare with a unitary, which requiresAAᴴ = AᴴA = 1. It is common to claim that, in a…
- Matrix.IsometryAn isometry is a matrix
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₂] in theorem Matrix.reindex_one_isometry (e : d ≃ d₂) (f : d ≃ d₃) : (reindex (α := R) e f 1).Isometry := by -- Since $e$ and $f$ are bijections, the reindexing of the identity matrix by $e$ and $f$ is a permutation matrix, which is unitary. have h_perm : ∀ (e : d ≃ d₂) (f : d ≃ d₃), (Matrix.reindex e f (1 : Matrix d d R)).Isometry := by intro e f simp [Matrix.Isometry] exact h_perm e f