Matrix.opNorm_mul_le
theoremverifiedformalizationimported Lean
The operator norm of a matrix product is at most the product of the operator norms.
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_mul_le {l m n 𝕜 : Type*} [Fintype l] [Fintype m] [Fintype n] [DecidableEq l] [DecidableEq m] [DecidableEq n] [RCLike 𝕜] (A : Matrix l m 𝕜) (B : Matrix m n 𝕜) : Matrix.opNorm (A * B) ≤ Matrix.opNorm A * Matrix.opNorm B
- Formalizes
- QuantumInfo, `Matrix.opNorm_mul_le`
- 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_mul_le← Matrix.opNorm_mul_le (QuantumInfo/Entropy/SSA.lean:244): 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 /-- The operator norm of a matrix product is at most the product of the operator norms. -/ theorem Matrix.opNorm_mul_le {l m n 𝕜 : Type*} [Fintype l] [Fintype m] [Fintype n] [DecidableEq l] [DecidableEq m] [DecidableEq n] [RCLike 𝕜] (A : Matrix l m 𝕜) (B : Matrix m n 𝕜) : Matrix.opNorm (A * B) ≤ Matrix.opNorm A * Matrix.opNorm B := by have h_comp : Matrix.toEuclideanLin (A * B) = Matrix.toEuclideanLin A ∘ₗ Matrix.toEuclideanLin B := by ext; simp [toEuclideanLin] simp only [Matrix.opNorm, h_comp] exact ContinuousLinearMap.opNorm_comp_le (LinearMap.toContinuousLinearMap (Matrix.toEuclideanLin A)) (LinearMap.toContinuousLinearMap (Matrix.toEuclideanLin B))