Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, (25)–(27): finite-block spectral converse

Open
QAlgorithms.Papers.Independent.Intakenext100.P20.visible_spectral_converse

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

prove2quantum

Let Ξ\XiΞ be an arbitrary discrete label set and let H\mathcal HH be a nonzero finite-dimensional complex Hilbert space. The source consists of normalized pure states ρi\rho_iρi​ and probabilities pi≥0p_i\ge0pi​≥0 with ∑ipi=1\sum_i p_i=1∑i​pi​=1; write ρp=∑ipiρi\rho_p=\sum_i p_i\rho_iρp​=∑i​pi​ρi​. Each memory space is finite and nonzero. Blind encoders and decoders are CPTP; a visible encoder maps labels to normalized density operators. A blind encoder is fixed before its input label.

For any visible code let ϵ=∑ipi(1−Tr⁡(D(F(i))ρi))\epsilon=\sum_i p_i(1-\operatorname{Tr}(D(F(i))\rho_i))ϵ=∑i​pi​(1−Tr(D(F(i))ρi​)). For every real λ\lambdaλ, put P<={ρp−eλI<0}P_<=\{\rho_p-e^\lambda I<0\}P<​={ρp​−eλI<0} and P≥={ρp−eλI≥0}P_\ge=\{\rho_p-e^\lambda I\ge0\}P≥​={ρp​−eλI≥0}, the orthogonal spectral projectors including equality only in P≥P_\geP≥​. Then

ϵ+eλdim⁡K≥Tr⁡(ρpP<),1−ϵ≤eλdim⁡K+Tr⁡(ρpP≥).\epsilon+e^\lambda\dim\mathcal K\ge\operatorname{Tr}(\rho_pP_<),\qquad 1-\epsilon\le e^\lambda\dim\mathcal K+\operatorname{Tr}(\rho_pP_\ge).ϵ+eλdimK≥Tr(ρp​P<​),1−ϵ≤eλdimK+Tr(ρp​P≥​).

Moreover, for every s≥1s\ge1s≥1, with ψ(s)=log⁡Tr⁡ρps\psi(s)=\log\operatorname{Tr}\rho_p^sψ(s)=logTrρps​,

1−ϵ≤eλdim⁡K+exp⁡((1−s)λ+ψ(s)).1-\epsilon\le e^\lambda\dim\mathcal K+\exp((1-s)\lambda+\psi(s)).1−ϵ≤eλdimK+exp((1−s)λ+ψ(s)).

This converse applies at any finite block by substituting the product ensemble, without a full-rank assumption.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
Formal statement
noncomputable section

open scoped Matrix ENNReal ComplexOrder Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P20

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

open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)

open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)

open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)

open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)

attribute [local instance] Classical.propDecidable

/-- Lemma 4, PDF pp.5-6, (25)-(27): finite-block visible spectral converse,
including the equality threshold in the upper projector and every real lambda. -/
theorem visible_spectral_converse {L : Type*} {d : ℕ} (S : DiscretePureSource L d)
    (C : VisibleCode L (Fin d)) (lambda : ℝ) :
    let epsilon := averageLoss S.weight S.state (fun i => C.decode (C.encode i)) false
    epsilon + Real.exp lambda * C.memory ≥
      (S.average * thresholdProjection S.average lambda false).trace.re ∧
    1 - epsilon ≤ Real.exp lambda * C.memory +
      (S.average * thresholdProjection S.average lambda true).trace.re ∧
    ∀ s : ℝ, 1 ≤ s → 1 - epsilon ≤ Real.exp lambda * C.memory +
      Real.exp ((1 - s) * lambda + logPowerTrace S.average s) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P20

end
Source
Exponents of quantum fixed-length pure state source coding, arXiv:quant-ph/0202002v6, PDF p. 5, Lemma 4, (25)–(27): finite-block spectral converse
Read-back

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

Let LLL be any type, ddd a natural number, and SSS specify d>0d>0d>0, nonnegative summable weights wiw_iwi​ with ∑i′wi=1\sum'_iw_i=1∑i′​wi​=1, and density matrices ρi=vivi†\rho_i=v_iv_i^\daggerρi​=vi​vi†​ for unit vectors viv_ivi​, where a density matrix means a positive semidefinite matrix of trace 111. Let a visible code have positive integer memory dimension mmm, assigned memory density matrices FiF_iFi​, and a decoder D(X)=∑jKjXKj†D(X)=\sum_jK_jXK_j^\daggerD(X)=∑j​Kj​XKj†​ for a finite family with ∑jKj†Kj=Im\sum_jK_j^\dagger K_j=I_m∑j​Kj†​Kj​=Im​. For any real λ\lambdaλ, put

ρˉ=∑i′wiρi,ϵ=∑i′wi ⁣[1−Re⁡Tr⁡(D(Fi)ρi)].\bar\rho=\sum'_i w_i\rho_i, \qquad \epsilon=\sum'_i w_i\!\left[1-\operatorname{Re}\operatorname{Tr}(D(F_i)\rho_i)\right].ρˉ​=i∑′​wi​ρi​,ϵ=i∑′​wi​[1−ReTr(D(Fi​)ρi​)].

Define P<P_<P<​ and P≥P_\geP≥​ by applying respectively the scalar functions 1{x<eλ}\mathbf1_{\{x<e^\lambda\}}1{x<eλ}​ and 1{eλ≤x}\mathbf1_{\{e^\lambda\le x\}}1{eλ≤x}​ to ρˉ\bar\rhoρˉ​ through functional calculus. Then

ϵ+eλm≥Re⁡Tr⁡(ρˉP<),1−ϵ≤eλm+Re⁡Tr⁡(ρˉP≥),\epsilon+e^\lambda m\ge\operatorname{Re}\operatorname{Tr}(\bar\rho P_<), \qquad 1-\epsilon\le e^\lambda m+\operatorname{Re}\operatorname{Tr}(\bar\rho P_\ge),ϵ+eλm≥ReTr(ρˉ​P<​),1−ϵ≤eλm+ReTr(ρˉ​P≥​),

and, for every real s≥1s\ge1s≥1,

1−ϵ≤eλm+exp⁡ ⁣((1−s)λ+log⁡Re⁡Tr⁡(ρˉ s)),1-\epsilon\le e^\lambda m+ \exp\!\left((1-s)\lambda+ \log\operatorname{Re}\operatorname{Tr}(\bar\rho^{\,s})\right),1−ϵ≤eλm+exp((1−s)λ+logReTr(ρˉ​s)),

where ρˉ s\bar\rho^{\,s}ρˉ​s is defined by functional calculus using real scalar powers and log⁡\loglog is the natural logarithm. Eigenvalues equal to eλe^\lambdaeλ occur in P≥P_\geP≥​, and not in P<P_<P<​; LLL need not be finite or countable.

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