Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2, (14)–(17): alternative error criteria

Open
QAlgorithms.Papers.Independent.Intakenext100.P20.alternative_error_criteria

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 positive block length nnn, the word probabilities and states are the independent products of the source probabilities and states. Admissible code sequences satisfy lim sup⁡nn−1log⁡dim⁡Kn≤R\limsup_n n^{-1}\log\dim\mathcal K_n\le Rlimsupn​n−1logdimKn​≤R. An error exponent is the supremum over admissible sequences of lim inf⁡n−n−1log⁡ϵn\liminf_n -n^{-1}\log\epsilon_nliminfn​−n−1logϵn​; a success exponent is the infimum of lim inf⁡n−n−1log⁡(1−ϵn)\liminf_n -n^{-1}\log(1-\epsilon_n)liminfn​−n−1log(1−ϵn​). Logarithms are natural, and −log⁡0=+∞-\log0=+\infty−log0=+∞.

For either coding model define ϵb=∑ipi(1−Tr⁡(D(F(i))ρi))\epsilon_b=\sum_i p_i(1-\sqrt{\operatorname{Tr}(D(F(i))\rho_i)})ϵb​=∑i​pi​(1−Tr(D(F(i))ρi​)​), interpreting F(i)=E(ρi)F(i)=E(\rho_i)F(i)=E(ρi​) in the blind case. Subscript bbb means the optimized exponent formed with this loss. Then

re,B,b(R)=re,B(R),re,V,b(R)=re,V(R),r_{e,B,b}(R)=r_{e,B}(R),\quad r_{e,V,b}(R)=r_{e,V}(R),re,B,b​(R)=re,B​(R),re,V,b​(R)=re,V​(R), re,B∗(R)≥re,B,b∗(R),re,V∗(R)≥re,V,b∗(R).r^*_{e,B}(R)\ge r^*_{e,B,b}(R),\quad r^*_{e,V}(R)\ge r^*_{e,V,b}(R).re,B∗​(R)≥re,B,b∗​(R),re,V∗​(R)≥re,V,b∗​(R).

Thus the square-root-overlap criterion preserves the optimal error exponent and gives the stated comparisons for success exponents.

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

/-- Remark 2, PDF p.3, (14)-(17), Appendix C pp.10-11: unchanged error
exponents and the stated one-sided success-exponent comparisons.
Printed blind-loss input: F(rho_i); changed to E(rho_i), because Section II
defines E as the blind quantum encoder and Appendix C uses that model. -/
theorem alternative_error_criteria {L : Type*} {d : ℕ} (S : DiscretePureSource L d) (R : ℝ) :
    blindExponent S R true false = blindExponent S R false false ∧
    visibleExponent S R true false = visibleExponent S R false false ∧
    blindExponent S R true true ≤ blindExponent S R false true ∧
    visibleExponent S R true true ≤ visibleExponent S R false true := 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. 3, Remark 2, (14)–(17): alternative error criteria
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 consist of d>0d>0d>0, nonnegative summable weights wiw_iwi​ with ∑i′wi=1\sum'_i w_i=1∑i′​wi​=1, and positive semidefinite trace-one matrices ρi=vivi†\rho_i=v_iv_i^\daggerρi​=vi​vi†​ for unit vectors viv_ivi​; no finiteness or countability of LLL is assumed. Let R∈RR\in\mathbb RR∈R. For each length n≥1n\ge1n≥1, source words u∈Lnu\in L^nu∈Ln have weights wu=∏jwujw_u=\prod_jw_{u_j}wu​=∏j​wuj​​ and states (ρu)x,y=∏j(ρuj)xj,yj(\rho_u)_{x,y}=\prod_j(\rho_{u_j})_{x_j,y_j}(ρu​)x,y​=∏j​(ρuj​​)xj​,yj​​. Visible codes assign each word a density matrix in a positive finite memory dimension and then apply a channel decoder; blind codes apply a channel encoder to ρu\rho_uρu​ followed by a channel decoder. Each channel is required to have a finite Kraus representation X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. For the reconstructed states ρ^u\widehat\rho_uρ​u​, define two losses

en(0)=∑u′wu ⁣[1−Re⁡Tr⁡(ρ^uρu)],en(1)=∑u′wu ⁣[1−Re⁡Tr⁡(ρ^uρu)].e_n^{(0)}=\sum'_u w_u\!\left[1-\operatorname{Re}\operatorname{Tr}(\widehat\rho_u\rho_u)\right], \qquad e_n^{(1)}=\sum'_u w_u\!\left[1-\sqrt{\operatorname{Re}\operatorname{Tr}(\widehat\rho_u\rho_u)}\right].en(0)​=u∑′​wu​[1−ReTr(ρ​u​ρu​)],en(1)​=u∑′​wu​[1−ReTr(ρ​u​ρu​)​].

For each code kind and each j∈{0,1}j\in\{0,1\}j∈{0,1}, restrict to sequences with positive memory dimensions mnm_nmn​ satisfying lim sup⁡nlog⁡(mn)/n≤R\limsup_n\log(m_n)/n\le Rlimsupn​log(mn​)/n≤R. Write E∙,jerrE_{\bullet,j}^{\mathrm{err}}E∙,jerr​ for the supremum of lim inf⁡nℓn(en(j))\liminf_n\ell_n(e_n^{(j)})liminfn​ℓn​(en(j)​), and E∙,jsuccE_{\bullet,j}^{\mathrm{succ}}E∙,jsucc​ for the infimum of lim inf⁡nℓn(1−en(j))\liminf_n\ell_n(1-e_n^{(j)})liminfn​ℓn​(1−en(j)​), where ℓn(0)=+∞\ell_n(0)=+\inftyℓn​(0)=+∞ and ℓn(q)=−log⁡(q)/n\ell_n(q)=-\log(q)/nℓn​(q)=−log(q)/n otherwise, with natural logarithms. Then

Eblind,1err=Eblind,0err,Evis,1err=Evis,0err,Eblind,1succ≤Eblind,0succ,Evis,1succ≤Evis,0succ.E_{\mathrm{blind},1}^{\mathrm{err}}=E_{\mathrm{blind},0}^{\mathrm{err}}, \qquad E_{\mathrm{vis},1}^{\mathrm{err}}=E_{\mathrm{vis},0}^{\mathrm{err}}, \qquad E_{\mathrm{blind},1}^{\mathrm{succ}}\le E_{\mathrm{blind},0}^{\mathrm{succ}}, \qquad E_{\mathrm{vis},1}^{\mathrm{succ}}\le E_{\mathrm{vis},0}^{\mathrm{succ}}.Eblind,1err​=Eblind,0err​,Evis,1err​=Evis,0err​,Eblind,1succ​≤Eblind,0succ​,Evis,1succ​≤Evis,0succ​.

The rate RRR is unrestricted, and all extrema are in the extended reals, with empty supremum −∞-\infty−∞ and empty infimum +∞+\infty+∞.

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