Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 27: exact CB norm for the three-eigenvalue example

Open
QAlgorithms.Papers.Independent.Intakenext100.P36.three_eigenvalue_example

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

prove2quantum

Let

U=diag⁡ ⁣(e5πi/4,eπi,e3πi/4),ϕ(X)=U†XU−X(X∈M3).U=\operatorname{diag}\!\left(e^{5\pi i/4},e^{\pi i},e^{3\pi i/4}\right),\qquad \phi(X)=U^\dagger XU-X\quad(X\in M_3).U=diag(e5πi/4,eπi,e3πi/4),ϕ(X)=U†XU−X(X∈M3​).

Then the completely bounded norm, defined from Euclidean operator norms and all positive finite amplifications, is

∥ϕ∥cb=2.\|\phi\|_{\rm cb}=\sqrt2.∥ϕ∥cb​=2​.

This is the exact mathematical value used to assess the numerical example. It makes no assertion that a particular finite random sample always returns a prescribed estimate or runtime.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P36
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P36

local notation "Mat" => QAlgorithms.Papers.Independent.Information100.P50.M

local notation "Map" => QAlgorithms.Papers.Independent.Information100.P50.Lin

open QAlgorithms.Papers.Independent.Dependency50.P49 (traceDual)

/-- Example 27, PDF p.19: reversed conjugation U-adjoint X U; the exact norm
is sqrt(2), independently of any empirical random-sampling output or timing. -/
theorem three_eigenvalue_example :
    extendedCBNorm (unitaryDifference exampleUnitaryᴴ) = ENNReal.ofReal (Real.sqrt 2) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P36

end
Source
Computing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded Maps, arXiv:0711.3636v1, PDF p. 19, Example 27: exact norm in the three-eigenvalue example
Read-back

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

Let U=diag⁡(e5πi/4,eπi,e3πi/4)U=\operatorname{diag}(e^{5\pi i/4},e^{\pi i},e^{3\pi i/4})U=diag(e5πi/4,eπi,e3πi/4), and define the complex-linear map Δ:M3(C)→M3(C)\Delta:M_3(\mathbb C)\to M_3(\mathbb C)Δ:M3​(C)→M3​(C) by Δ(X)=U†XU−X\Delta(X)=U^\dagger XU-XΔ(X)=U†XU−X, where †\dagger† denotes conjugate transpose. For each natural number mmm, its amplification acts on matrices indexed by {0,…,m−1}×{0,1,2}\{0,\ldots,m-1\}\times\{0,1,2\}{0,…,m−1}×{0,1,2} by applying Δ\DeltaΔ separately to each 3×33\times33×3 block: if XrsX_{rs}Xrs​ is the block with entries X(r,a),(s,b)X_{(r,a),(s,b)}X(r,a),(s,b)​, then the corresponding output block is U†XrsU−XrsU^\dagger X_{rs}U-X_{rs}U†Xrs​U−Xrs​. The declaration asserts

ofReal⁡ ⁣(sup⁡R{∥(id⁡m⊗Δ)(X)∥op: m∈N, ∥X∥op≤1})=ofReal⁡(2).\operatorname{ofReal}\!\left( \sup_{\mathbb R} \left\{ \|(\operatorname{id}_m\otimes\Delta)(X)\|_{\mathrm{op}} :\ m\in\mathbb N,\ \|X\|_{\mathrm{op}}\le1 \right\}\right) =\operatorname{ofReal}(\sqrt2).ofReal(Rsup​{∥(idm​⊗Δ)(X)∥op​: m∈N, ∥X∥op​≤1})=ofReal(2​).

Here ∥⋅∥op\|\cdot\|_{\mathrm{op}}∥⋅∥op​ is the operator norm for Euclidean norms, and ofReal⁡\operatorname{ofReal}ofReal sends a real number ttt to max⁡(t,0)\max(t,0)max(t,0) in the extended nonnegative reals. The supremum includes m=0m=0m=0, which contributes the zero-dimensional matrix and value zero; XXX ranges over all complex matrices satisfying the norm bound.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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