Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Direct pinched tests with finite-block type-II bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P05.direct_pinched_tests

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ and σ\sigmaσ be arbitrary density operators on the same finite-dimensional complex Hilbert space. Use the support-aware Umegaki relative entropy D(ρ∥σ)D(\rho\|\sigma)D(ρ∥σ) in nats, equal to +∞+\infty+∞ when the support of ρ\rhoρ is not contained in that of σ\sigmaσ. For a real a<D(ρ∥σ)a<D(\rho\|\sigma)a<D(ρ∥σ), set

Sˉn(a)={Eσ⊗n(ρ⊗n)−enaσ⊗n>0},\bar S_n(a)=\{\mathcal E_{\sigma^{\otimes n}}(\rho^{\otimes n})-e^{na}\sigma^{\otimes n}>0\},Sˉn​(a)={Eσ⊗n​(ρ⊗n)−enaσ⊗n>0},

where braces denote the strict positive spectral projection. These are valid effects and satisfy

lim⁡n→∞αn(Sˉn(a))=0,βn(Sˉn(a))≤e−nafor every n≥1.\lim_{n\to\infty}\alpha_n(\bar S_n(a))=0,\qquad \beta_n(\bar S_n(a))\le e^{-na}\quad\text{for every }n\ge1.n→∞lim​αn​(Sˉn​(a))=0,βn​(Sˉn​(a))≤e−nafor every n≥1.

Here αn(T)=Tr⁡[ρ⊗n(I−T)]\alpha_n(T)=\operatorname{Tr}[\rho^{\otimes n}(I-T)]αn​(T)=Tr[ρ⊗n(I−T)] and βn(T)=Tr⁡[σ⊗nT]\beta_n(T)=\operatorname{Tr}[\sigma^{\otimes n}T]βn​(T)=Tr[σ⊗nT]. Every finite real aaa is permitted when the entropy is infinite. This assertion identifies a particular sequence of tests and retains a bound at each positive blocklength.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P05

open scoped Matrix ComplexConjugate ComplexOrder BigOperators

open Filter Topology QAlgorithms

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

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)

open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)

open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]

/-- PDF p.9, (52),(54),(56): the specific sigma-pinched strict spectral tests
have vanishing type-I error for a < D(rho||sigma), and the type-II bound at
EVERY positive length. Support mismatch gives D=+infinity. Lemma 4's unpinned
negative powers are not added as assumptions or used in the statement. -/
theorem direct_pinched_tests (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (a : ℝ) (ha : (a : EReal) <
      (QuantumLoss.umegakiEntropy rho sigma hrho hsigma : EReal)) :
    Tendsto (fun k : ℕ => typeI rho (k + 1) (pinchedTest rho sigma (k + 1) a))
      atTop (𝓝 0) ∧
    (∀ n : ℕ, 1 ≤ n →
      IsEffect (pinchedTest rho sigma n a) ∧
      accept sigma n (pinchedTest rho sigma n a) ≤ Real.exp (-(n : ℝ) * a)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P05

end
Source
A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory, arXiv:quant-ph/0208139v1, PDF p. 9, Appendix B, (52),(54),(56)
Read-back

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

For every finite type III with decidable equality, let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices on III, each of trace 111. Define D∈[0,+∞]D\in[0,+\infty]D∈[0,+∞] as follows: if ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ, then

D=max⁡ ⁣{0, Re⁡Tr⁡(f(ρ)−ρlog⁡σ)},f(t)=tlog⁡t,D=\max\!\left\{0,\, \operatorname{Re}\operatorname{Tr} \bigl(f(\rho)-\rho\log\sigma\bigr)\right\}, \qquad f(t)=t\log t,D=max{0,ReTr(f(ρ)−ρlogσ)},f(t)=tlogt,

where both matrix functions use continuous functional calculus and the real logarithm has its total value log⁡0=0\log0=0log0=0; otherwise D=+∞D=+\inftyD=+∞. Let a∈Ra\in\mathbb Ra∈R satisfy a<Da<Da<D, with this comparison made in the extended real numbers. For each n≥1n\ge1n≥1, define ρn(u,v)=∏i=0n−1ρ(ui,vi)\rho_n(u,v)=\prod_{i=0}^{n-1}\rho(u_i,v_i)ρn​(u,v)=∏i=0n−1​ρ(ui​,vi​) and σn(u,v)=∏i=0n−1σ(ui,vi)\sigma_n(u,v)=\prod_{i=0}^{n-1}\sigma(u_i,v_i)σn​(u,v)=∏i=0n−1​σ(ui​,vi​), let ρ^n=∑ℓPℓρnPℓ\widehat\rho_n=\sum_\ell P_\ell\rho_nP_\ellρ​n​=∑ℓ​Pℓ​ρn​Pℓ​, summing over the distinct eigenvalues of σn\sigma_nσn​ with their spectral projections, and let TnT_nTn​ be the orthogonal projection onto the range of the positive part of ρ^n−enaσn\widehat\rho_n-e^{na}\sigma_nρ​n​−enaσn​. Then

Re⁡Tr⁡(ρk+1(1−Tk+1))⟶0(k→∞),\operatorname{Re}\operatorname{Tr}\bigl(\rho_{k+1}(\mathbf1-T_{k+1})\bigr) \longrightarrow0 \quad(k\to\infty),ReTr(ρk+1​(1−Tk+1​))⟶0(k→∞),

and, for every natural number n≥1n\ge1n≥1, both TnT_nTn​ and 1−Tn\mathbf1-T_n1−Tn​ are positive semidefinite and

Re⁡Tr⁡(σnTn)≤e−na.\operatorname{Re}\operatorname{Tr}(\sigma_nT_n)\le e^{-na}.ReTr(σn​Tn​)≤e−na.

No support inclusion is assumed: when it fails, the threshold hypothesis holds for every finite real aaa. The theorem makes no assertion at block length 000.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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