Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma II.11: For delta>0 and x^n of type P, Tr(W_xn PiV,PW,delta sqrt(a))≥1−ad/delta².

Proved
QAlgorithms.Papers.Independent.Renew46.P43.averageChannelTypical

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

prove2quantum

Let finite input and output sizes be a,d>0a,d>0a,d>0, let n>0n>0n>0, and choose fine spectral resolutions. The input word xnx^nxn has its actual empirical law PPP; Wxn=⨂iWxiW_{x^n}=\bigotimes_iW_{x_i}Wxn​=⨂i​Wxi​​. In conditional variance bounds, δ>0\delta>0δ>0, h=H(W∣P)h=H(W\mid P)h=H(W∣P) and c=KVda δnc=K_Vd\sqrt a\,\delta\sqrt nc=KV​da​δn​, where KV=2log⁡2(e)/eK_V=2\log_2(e)/eKV​=2log2​(e)/e. A shadow BBB is an effect with state mass at least η\etaη. Exact-type statements use a simultaneous fine basis of the commuting states ν,ρ\nu,\rhoν,ρ, and require the indicated projector to be nonzero. Entropy-threshold projectors use finite sums of realizable count types, with arbitrary real threshold LLL; empty infima are +∞+\infty+∞ and exponential tails at infinity are zero.

Tr⁡(WxnΠV,PW,δan)≥1−ad/δ2.\operatorname{Tr}\bigl(W_{x^n}\Pi_{V,PW,\delta\sqrt a}^n\bigr)\ge1-ad/\delta^2.Tr(Wxn​ΠV,PW,δa​n​)≥1−ad/δ2.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

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

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)

attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace

/-- Lemma II.11, PDF pp.29-30. No commutativity is assumed among the channel states;
only the average state's own fine spectral resolution is chosen. -/
theorem averageChannelTypical {a d n : ℕ} (ha : 0 < a) (hn : 0 < n)
    (W : Fin a → Matrix (Fin d) (Fin d) ℂ) (hW : ∀ x, IsDensityMatrix (W x))
    (w : Fin n → Fin a) (average : FineResolution d)
    (haverage : average.state = ∑ x, (empiricalWeight w x : ℂ) • W x)
    (delta : ℝ) (hdelta : 0 < delta) :
    effectProb (wordTensor (fun k => W (w k))) (varianceProjector average n (delta * Real.sqrt a)) ≥
      1 - (a : ℝ) * d / delta^2 := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 29, Lemma II.11
Read-back

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

For natural numbers a,d,na,d,na,d,n with a>0a>0a>0 and n>0n>0n>0, let WxW_xWx​, 0≤x<a0\le x<a0≤x<a, be complex d×dd\times dd×d positive semidefinite matrices of trace 111, and let w:{0,…,n−1}→{0,…,a−1}w:\{0,\ldots,n-1\}\to\{0,\ldots,a-1\}w:{0,…,n−1}→{0,…,a−1} be any word. Let the given spectral resolution consist of nonnegative weights pjp_jpj​, 0≤j<d0\le j<d0≤j<d, summing to 111, and a unitary matrix UUU, and assume that its state satisfies

Udiag⁡(pj)U†=∑x=0a−1∣{k:w(k)=x}∣n Wx.U\operatorname{diag}(p_j)U^\dagger =\sum_{x=0}^{a-1}\frac{|\{k:w(k)=x\}|}{n}\,W_x.Udiag(pj​)U†=x=0∑a−1​n∣{k:w(k)=x}∣​Wx​.

For every real δ>0\delta>0δ>0, define vz(y)=∏k=0n−1Uy(k),z(k)v_z(y)=\prod_{k=0}^{n-1}U_{y(k),z(k)}vz​(y)=∏k=0n−1​Uy(k),z(k)​ for words y,z:{0,…,n−1}→{0,…,d−1}y,z:\{0,\ldots,n-1\}\to\{0,\ldots,d-1\}y,z:{0,…,n−1}→{0,…,d−1}, and set

Π=∑z∀j, ∣∣{k:z(k)=j}∣−npj∣≤δapj(1−pj)nvzvz†.\Pi=\sum_{\substack{z\\ \forall j,\ \left||\{k:z(k)=j\}|-np_j\right| \le \delta\sqrt a\,\sqrt{p_j(1-p_j)}\,\sqrt n}} v_zv_z^\dagger.Π=z∀j, ∣∣{k:z(k)=j}∣−npj​∣≤δa​pj​(1−pj​)​n​​∑​vz​vz†​.

If Ω\OmegaΩ is the matrix with entries Ω(y,y′)=∏k=0n−1(Ww(k))y(k),y′(k)\Omega(y,y')=\prod_{k=0}^{n-1}(W_{w(k)})_{y(k),y'(k)}Ω(y,y′)=∏k=0n−1​(Ww(k)​)y(k),y′(k)​, then

Re⁡tr⁡(ΩΠ)≥1−adδ2.\operatorname{Re}\operatorname{tr}(\Omega\Pi)\ge 1-\frac{ad}{\delta^2}.Retr(ΩΠ)≥1−δ2ad​.

Zero spectral weights are allowed and force their corresponding counts in the sum defining Π\PiΠ to be zero. Although d>0d>0d>0 is not an explicit hypothesis, the assumed density matrices and spectral resolution cannot exist when d=0d=0d=0. The stated lower bound can be nonpositive.

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

    Confirmed by the moderator at approval.

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