§III.D: C-numerical-radius bound
ProvedQAlgorithms.Papers.Independent.Advance50.P38.numericalRadiusBoundFor and arbitrary complex by matrices , let . This maximum is attained, and
Equality holds exactly when and are complex linearly dependent for some . Linear dependence includes either zero matrix. The norms are Frobenius norms.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P38
namespace QAlgorithms.Papers.Independent.Advance50.P38
open scoped BigOperators Topology Manifold ContDiff
noncomputable section
/-- C-numerical-radius bound and equality criterion, PDF p.21. -/
theorem numericalRadiusBound {n : ℕ} (hn : 0 < n) (A C : (Matrix (Fin n) (Fin n) ℂ)) :
(∃ U : Matrix.specialUnitaryGroup (Fin n) ℂ,
numericalRadius A C =
‖Matrix.trace (C.conjTranspose * ((U : (Matrix (Fin n) (Fin n) ℂ)) * A * (U : (Matrix (Fin n) (Fin n) ℂ)).conjTranspose))‖) ∧
numericalRadius A C ≤ QAlgorithms.frobNorm A * QAlgorithms.frobNorm C ∧
(numericalRadius A C = QAlgorithms.frobNorm A * QAlgorithms.frobNorm C ↔
∃ U : Matrix.specialUnitaryGroup (Fin n) ℂ,
ComplexCollinear ((U : (Matrix (Fin n) (Fin n) ℂ)) * A * (U : (Matrix (Fin n) (Fin n) ℂ)).conjTranspose) C) := by sorry
end
end QAlgorithms.Papers.Independent.Advance50.P38
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number and every pair of complex matrices , let
where consists of unitary matrices with determinant , denotes conjugate transpose, and absolute values denote complex moduli. Then there exists such that ; moreover, ; and
No nonzero assumption is imposed on or ; if either is zero, both sides of the inequality are zero and the stated coefficient condition can be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.