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)).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.exactTypeProbabilityLet finite input and output sizes be , let , and choose fine spectral resolutions. The input word has its actual empirical law ; . In conditional variance bounds, , and , where . A shadow is an effect with state mass at least . Exact-type statements use a simultaneous fine basis of the commuting states , and require the indicated projector to be nonzero. Entropy-threshold projectors use finite sums of realizable count types, with arbitrary real threshold ; empty infima are and exponential tails at infinity are zero.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let the spectral resolution have nonnegative weights , , summing to , and unitary basis matrix , so its state is . Let be any probability mass function on , write , and let , the state obtained by replacing the weights while retaining . For every natural number , define and
and assume ; thus the distribution must be realized exactly by a word of length . Define the extended nonnegative number to be if , and otherwise to be
where the matrix functions use spectral functional calculus and the real logarithm has value at . Set when , and otherwise. Then, writing ,
Zero probabilities are allowed in either distribution. If , both bounds force the middle quantity to be zero. The supplied spectral resolution and probability mass function exclude .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.