Matrix.opNorm_reindex_proven
theoremverifiedformalizationimported Lean
Matrix.opNorm_reindex_proven
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ m n : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] [Fintype m] [Fintype n] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] [DecidableEq m] [DecidableEq n] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace Kronecker Matrix in open scoped MatrixOrder ComplexOrder in open scoped MatrixOrder in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in theorem Matrix.opNorm_reindex_proven {l m n p : Type*} [Fintype l] [Fintype m] [Fintype n] [Fintype p] [DecidableEq l] [DecidableEq m] [DecidableEq n] [DecidableEq p] (e : m ≃ l) (f : n ≃ p) (A : Matrix m n 𝕜) : Matrix.opNorm (A.reindex e f) = Matrix.opNorm A
- Formalizes
- QuantumInfo, `Matrix.opNorm_reindex_proven`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 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.opNorm_reindex_proven← Matrix.opNorm_reindex_proven (QuantumInfo/Entropy/SSA.lean:254): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Matrix.opNormThe operator norm of a matrix, with respect to the Euclidean norm (l2 norm) on the domain and codomain.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ m n : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] [Fintype m] [Fintype n] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] [DecidableEq m] [DecidableEq n] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace Kronecker Matrix in open scoped MatrixOrder ComplexOrder in open scoped MatrixOrder in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in theorem Matrix.opNorm_reindex_proven {l m n p : Type*} [Fintype l] [Fintype m] [Fintype n] [Fintype p] [DecidableEq l] [DecidableEq m] [DecidableEq n] [DecidableEq p] (e : m ≃ l) (f : n ≃ p) (A : Matrix m n 𝕜) : Matrix.opNorm (A.reindex e f) = Matrix.opNorm A := by refine' le_antisymm _ _; · refine' csInf_le _ _; · exact ⟨ 0, fun c hc => hc.1 ⟩; · refine' ⟨ norm_nonneg _, fun x => _ ⟩; convert ContinuousLinearMap.le_opNorm ( LinearMap.toContinuousLinearMap ( Matrix.toEuclideanLin A ) ) (WithLp.toLp 2 ( fun i => x ( f i ) )) using 1; · simp [ Matrix.toEuclideanLin, EuclideanSpace.norm_eq ]; rw [ ← Equiv.sum_comp e.symm ] ; aesop; · simp [ EuclideanSpace.norm_eq, Matrix.opNorm ]; exact Or.inl ( by rw [ ← Equiv.sum_comp f ] ); · refine' ContinuousLinearMap.opNorm_le_bound _ _ fun a => _; · exact ContinuousLinearMap.opNorm_nonneg _; · convert ContinuousLinearMap.le_opNorm ( LinearMap.toContinuousLinearMap ( toEuclideanLin ( Matrix.reindex e f A ) ) ) (WithLp.toLp 2 ( fun i => a ( f.symm i ) )) using 1; · simp [ EuclideanSpace.norm_eq, Matrix.toEuclideanLin ]; rw [ ← Equiv.sum_comp e.symm ] simp [ Matrix.mulVec, dotProduct ] ; · congr! 2; simp [ EuclideanSpace.norm_eq] conv_lhs => rw [ ← Equiv.sum_comp f.symm ] ;