Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary IV.1: squared C-spectral-norm bound

Proved
QAlgorithms.Papers.Independent.Advance50.P38.cSpectralNormTransferBound

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For N1,N2>0N_1,N_2>0N1​,N2​>0 and A,C∈CN1×N2A,C\in\mathbb C^{N_1\times N_2}A,C∈CN1​×N2​, write x=vec⁡A,y=vec⁡Cx=\operatorname{vec}A,y=\operatorname{vec}Cx=vecA,y=vecC in column order and define

∥A∥C2=max⁡V∈U(N1), W∈U(N2)∣tr⁡(C†VAW†)∣2.\|A\|_C^2=\max_{V\in\mathrm U(N_1),\,W\in\mathrm U(N_2)}|\operatorname{tr}(C^\dagger VAW^\dagger)|^2.∥A∥C2​=V∈U(N1​),W∈U(N2​)max​∣tr(C†VAW†)∣2.

Both this real-valued maximum and the local special-unitary transfer maximum are attained. The latter is at most ∥A∥C2\|A\|_C^2∥A∥C2​. The modulus and square are essential; no maximum of complex numbers is used.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P38
Formal statement
namespace QAlgorithms.Papers.Independent.Advance50.P38

open scoped BigOperators Topology Manifold ContDiff

noncomputable section

/-- Corollary IV.1, PDF p.27: the real modulus-square maximum bounds
local transfer. Attainment guards the real supremum definition. -/
theorem cSpectralNormTransferBound {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (A C : Matrix (Fin a) (Fin b) ℂ) :
    IsGreatest {r | ∃ V : Matrix.unitaryGroup (Fin a) ℂ,
      ∃ W : Matrix.unitaryGroup (Fin b) ℂ,
        r = Complex.normSq (Matrix.trace (C.conjTranspose * (V : (Matrix (Fin a) (Fin a) ℂ)) * A *
          (W : (Matrix (Fin b) (Fin b) ℂ)).conjTranspose))} (cSpectralSq A C) ∧
    ∃ r, IsGreatest {r | ∃ V : Matrix.specialUnitaryGroup (Fin a) ℂ,
      ∃ W : Matrix.specialUnitaryGroup (Fin b) ℂ,
        r = pureStateTransfer (colVec A) (colVec C) (Matrix.kronecker (W : (Matrix (Fin b) (Fin b) ℂ)) (V : (Matrix (Fin a) (Fin a) ℂ)))} r ∧
      r ≤ cSpectralSq A C := by sorry

end

end QAlgorithms.Papers.Independent.Advance50.P38
Source
Gradient Flows for Optimisation and Quantum Control: Foundations and Applications, arXiv:0802.4195v2, PDF p. 27, Corollary IV.1: squared C-spectral-norm bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all positive natural numbers a,ba,ba,b and arbitrary complex a×ba\times ba×b matrices A,CA,CA,C, let

S={∣tr⁡(C∗VAW∗)∣2:V∈U(a), W∈U(b)},s=sup⁡S,S=\left\{\left|\operatorname{tr}(C^*VAW^*)\right|^2:V\in U(a),\ W\in U(b)\right\}, \qquad s=\sup S,S={∣tr(C∗VAW∗)∣2:V∈U(a), W∈U(b)},s=supS,

where M∗M^*M∗ denotes conjugate transpose; this sss is the quantity defined as cSpectralSq(A,C)\mathrm{cSpectralSq}(A,C)cSpectralSq(A,C). For a rectangular matrix BBB, define its column vectorization by cB(j,i)=Bijc_B(j,i)=B_{ij}cB​(j,i)=Bij​, and for a complex vector uuu, write RuR_uRu​ for the matrix with entries (Ru)pq=upuq‾(R_u)_{pq}=u_p\overline{u_q}(Ru​)pq​=up​uq​​. The statement asserts both that sss is a greatest element of SSS, so it belongs to SSS and bounds every element of SSS above, and that there exists a real number rrr which is a greatest element of

{Re⁡tr⁡ ⁣(RcA(W⊗V)RcC(W⊗V)∗):V∈SU(a), W∈SU(b)}\left\{\operatorname{Re}\operatorname{tr}\!\left(R_{c_A}(W\otimes V)R_{c_C}(W\otimes V)^*\right): V\in SU(a),\ W\in SU(b)\right\}{Retr(RcA​​(W⊗V)RcC​​(W⊗V)∗):V∈SU(a), W∈SU(b)}

and satisfies r≤sr\le sr≤s. No normalization or nonzero assumption is imposed on AAA or CCC.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me