Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted-norm representation of the sandwiched radius

Open
QAlgorithms.Papers.Independent.Support50.P19.radius_norm

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N:A→B\mathcal N:A\to BN:A→B be a finite-dimensional channel with nonzero registers and let α>1\alpha>1α>1. For X≥0X\ge0X≥0 write ∥Z∥α,X=∥X1/2ZX1/2∥α\|Z\|_{\alpha,X}=\|X^{1/2}ZX^{1/2}\|_\alpha∥Z∥α,X​=∥X1/2ZX1/2∥α​, where ∥⋅∥α\|\cdot\|_\alpha∥⋅∥α​ is the Schatten alpha-norm. Let SN\mathcal S_{\mathcal N}SN​ consist of density centers σ\sigmaσ whose support contains every channel output support. Then

K~α(N)=min⁡σ∈SNmax⁡ραα−1log⁡2∥N(ρ)∥α,σ(1−α)/α=min⁡σ∈SNαα−1log⁡2max⁡ρ∥N(ρ)∥α,σ(1−α)/α.\widetilde K_\alpha(\mathcal N)=\min_{\sigma\in\mathcal S_{\mathcal N}}\max_\rho\frac\alpha{\alpha-1}\log_2\|\mathcal N(\rho)\|_{\alpha,\sigma^{(1-\alpha)/\alpha}}=\min_{\sigma\in\mathcal S_{\mathcal N}}\frac\alpha{\alpha-1}\log_2\max_\rho\|\mathcal N(\rho)\|_{\alpha,\sigma^{(1-\alpha)/\alpha}}.Kα​(N)=σ∈SN​min​ρmax​α−1α​log2​∥N(ρ)∥α,σ(1−α)/α​=σ∈SN​min​α−1α​log2​ρmax​∥N(ρ)∥α,σ(1−α)/α​.

Input optimizations range over density operators. Incompatible centers have infinite divergence and are excluded from this finite inverse-support expression; singular compatible centers remain allowed. This form links the radius to output-norm multiplicativity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.19, (16): both norm orders, using the finite inverse-support domain. -/
theorem radius_norm [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (N : Superop I J) (hN : IsChannel N) :
    informationRadius true a N = normRadiusBefore a N ∧
    normRadiusBefore a N = normRadiusAfter a N ∧ NormExtrema a N := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 19, normRadius
Read-back

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

Let I,JI,JI,J be finite nonempty index sets with decidable equality, let a>1a>1a>1 be real, and let NNN admit a finite Kraus representation N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​ for every XXX, with ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Let D(H)\mathcal D(H)D(H) be the positive semidefinite complex matrices indexed by HHH with trace one, and let

CN={σ∈D(J):ker⁡σ⊆ker⁡N(ρ) for every ρ∈D(I)}.\mathcal C_N=\{\sigma\in\mathcal D(J):\ker\sigma\subseteq\ker N(\rho)\text{ for every }\rho\in\mathcal D(I)\}.CN​={σ∈D(J):kerσ⊆kerN(ρ) for every ρ∈D(I)}.

For positive semidefinite X,YX,YX,Y, define qa(X,Y)=Re⁡tr⁡[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]]q_a(X,Y)=\operatorname{Re}\operatorname{tr}[(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]})^{[a]}]qa​(X,Y)=Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]], where spectral powers send zero eigenvalues to zero, and define wa(X,σ)=qa(X,σ)1/aw_a(X,\sigma)=q_a(X,\sigma)^{1/a}wa​(X,σ)=qa​(X,σ)1/a. Define Da(X∥Y)=+∞D_a(X\|Y)=+\inftyDa​(X∥Y)=+∞ if ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX, and otherwise Da(X∥Y)=L(qa(X,Y))/(a−1)D_a(X\|Y)=\mathcal L(q_a(X,Y))/(a-1)Da​(X∥Y)=L(qa​(X,Y))/(a−1), where L(t)=log⁡2t\mathcal L(t)=\log_2tL(t)=log2​t for t>0t>0t>0 and −∞-\infty−∞ otherwise. Then the following three extended-real quantities are equal:

inf⁡σ∈D(J)sup⁡ρ∈D(I)Da(N(ρ)∥σ)=inf⁡σ∈CNsup⁡ρ∈D(I)aa−1L(wa(N(ρ),σ))=inf⁡σ∈CNaa−1L ⁣(sup⁡ρ∈D(I)wa(N(ρ),σ)).\inf_{\sigma\in\mathcal D(J)}\sup_{\rho\in\mathcal D(I)}D_a(N(\rho)\|\sigma) = \inf_{\sigma\in\mathcal C_N}\sup_{\rho\in\mathcal D(I)} \frac{a}{a-1}\mathcal L(w_a(N(\rho),\sigma)) = \inf_{\sigma\in\mathcal C_N}\frac{a}{a-1} \mathcal L\!\left(\sup_{\rho\in\mathcal D(I)}w_a(N(\rho),\sigma)\right).σ∈D(J)inf​ρ∈D(I)sup​Da​(N(ρ)∥σ)=σ∈CN​inf​ρ∈D(I)sup​a−1a​L(wa​(N(ρ),σ))=σ∈CN​inf​a−1a​L(ρ∈D(I)sup​wa​(N(ρ),σ)).

The inner supremum inside the last logarithm is a supremum in R\mathbb RR. There exists σ∈CN\sigma\in\mathcal C_Nσ∈CN​ attaining the last infimum, and for every σ∈CN\sigma\in\mathcal C_Nσ∈CN​ there exists ρ∈D(I)\rho\in\mathcal D(I)ρ∈D(I) attaining sup⁡τ∈D(I)wa(N(τ),σ)\sup_{\tau\in\mathcal D(I)}w_a(N(\tau),\sigma)supτ∈D(I)​wa​(N(τ),σ). Compatible centers may be singular; their required kernel inclusion concerns every input density matrix.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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