Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary II.13: If nu commutes with rho and Pi_nu^n≠0: (n+1)^(-d)2^(−nD(nu||rho))≤Tr(rho^n Pi_nu^n)≤2^(−nD(nu||rho)).

Proved
QAlgorithms.Papers.Independent.Renew46.P43.exactTypeProbability

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.

Πνn≠0⟹(n+1)−d2−nD(ν∥ρ)≤Tr⁡(ρ⊗nΠνn)≤2−nD(ν∥ρ).\Pi_\nu^n\ne0\Longrightarrow(n+1)^{-d}2^{-nD(\nu\Vert\rho)}\le\operatorname{Tr}(\rho^{\otimes n}\Pi_\nu^n)\le2^{-nD(\nu\Vert\rho)}.Πνn​=0⟹(n+1)−d2−nD(ν∥ρ)≤Tr(ρ⊗nΠνn​)≤2−nD(ν∥ρ).

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

/-- Corollary II.13, PDF p.31: the nonzero exact-type projector guard is explicit.
A simultaneous fine basis represents every commuting pair, including degeneracies;
unsupported nu has divergence +infinity and contributes zero. -/
theorem exactTypeProbability {d : ℕ} (rho : FineResolution d) (nu : PMF (Fin d))
    (n : ℕ) (hn : 0 < n)
    (hrealizable : varianceProjector (changeSpectrum rho nu) n 0 ≠ 0) :
    let Pi := varianceProjector (changeSpectrum rho nu) n 0
    let tail := divergenceTail n (relativeBits (changeSpectrum rho nu).state rho.state)
    (n + 1 : ℝ)^(-(d : ℤ)) * tail ≤ effectProb (copies n rho.state) Pi ∧
    effectProb (copies n rho.state) Pi ≤ tail := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 31, Corollary II.13
Read-back

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

For every natural number ddd, let the spectral resolution ρ\rhoρ have nonnegative weights pjp_jpj​, 0≤j<d0\le j<d0≤j<d, summing to 111, and unitary basis matrix UUU, so its state is R=Udiag⁡(pj)U†R=U\operatorname{diag}(p_j)U^\daggerR=Udiag(pj​)U†. Let ν\nuν be any probability mass function on {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}, write qj=(ν(j)).toRealq_j=(\nu(j)).\mathrm{toReal}qj​=(ν(j)).toReal, and let Σ=Udiag⁡(qj)U†\Sigma=U\operatorname{diag}(q_j)U^\daggerΣ=Udiag(qj​)U†, the state obtained by replacing the weights while retaining UUU. For every natural number n>0n>0n>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)​ and

Π=∑z:{0,…,n−1}→{0,…,d−1}∀j, ∣{k:z(k)=j}∣=nqjvzvz†,\Pi=\sum_{\substack{z:\{0,\ldots,n-1\}\to\{0,\ldots,d-1\}\\ \forall j,\ |\{k:z(k)=j\}|=nq_j}}v_zv_z^\dagger,Π=z:{0,…,n−1}→{0,…,d−1}∀j, ∣{k:z(k)=j}∣=nqj​​∑​vz​vz†​,

and assume Π≠0\Pi\ne0Π=0; thus the distribution qqq must be realized exactly by a word of length nnn. Define the extended nonnegative number DDD to be +∞+\infty+∞ if ker⁡R⊈ker⁡Σ\ker R\not\subseteq\ker\SigmakerR⊆kerΣ, and otherwise to be

D=max⁡ ⁣{0,Re⁡tr⁡(f(Σ)−Σlog⁡R)}log⁡2,f(t)=tlog⁡t,D=\frac{\max\!\left\{0,\operatorname{Re}\operatorname{tr} \bigl(f(\Sigma)-\Sigma\log R\bigr)\right\}}{\log 2}, \qquad f(t)=t\log t,D=log2max{0,Retr(f(Σ)−ΣlogR)}​,f(t)=tlogt,

where the matrix functions use spectral functional calculus and the real logarithm has value 000 at 000. Set τ=0\tau=0τ=0 when D=+∞D=+\inftyD=+∞, and τ=2−nD\tau=2^{-nD}τ=2−nD otherwise. Then, writing R⊗n(y,y′)=∏k=0n−1Ry(k),y′(k)R^{\otimes n}(y,y')=\prod_{k=0}^{n-1}R_{y(k),y'(k)}R⊗n(y,y′)=∏k=0n−1​Ry(k),y′(k)​,

(n+1)−dτ≤Re⁡tr⁡(R⊗nΠ)≤τ.(n+1)^{-d}\tau \le \operatorname{Re}\operatorname{tr}(R^{\otimes n}\Pi) \le \tau.(n+1)−dτ≤Retr(R⊗nΠ)≤τ.

Zero probabilities are allowed in either distribution. If D=+∞D=+\inftyD=+∞, both bounds force the middle quantity to be zero. The supplied spectral resolution and probability mass function exclude d=0d=0d=0.

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