isometry_mul_conjTranspose_le_one
theoremverifiedformalizationimported Lean
isometry_mul_conjTranspose_le_one
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 isometry_mul_conjTranspose_le_one {m n : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] (V : Matrix m n ℂ) (hV : V.conjTranspose * V = 1) : V * V.conjTranspose ≤ 1
- Formalizes
- QuantumInfo, `isometry_mul_conjTranspose_le_one`
- 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.isometry_mul_conjTranspose_le_one← isometry_mul_conjTranspose_le_one (QuantumInfo/Entropy/SSA.lean:300): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- conjTranspose_isometry_mul_isometry_le_oneconjTranspose_isometry_mul_isometry_le_one
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 isometry_mul_conjTranspose_le_one {m n : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] (V : Matrix m n ℂ) (hV : V.conjTranspose * V = 1) : V * V.conjTranspose ≤ 1 := by have h_pos : (1 - V * Vᴴ) * (1 - V * Vᴴ) = 1 - V * Vᴴ := by simp [ sub_mul, mul_sub, ← Matrix.mul_assoc ]; simp [ Matrix.mul_assoc, hV ]; have h_pos : (1 - V * Vᴴ) = (1 - V * Vᴴ)ᴴ * (1 - V * Vᴴ) := by simp_all [ Matrix.conjTranspose_sub, Matrix.conjTranspose_one, Matrix.conjTranspose_mul ]; have h_pos : Matrix.PosSemidef (1 - V * Vᴴ) := by rw [ h_pos ] at *; apply Matrix.posSemidef_conjTranspose_mul_self; exact Matrix.le_iff.mpr h_pos /- If `A†A = I` and `B†B = I` (both isometries into the same space), then `||(A†B)|| ≤ 1`, equivalently `(A†B)†(A†B) ≤ I`. -/