Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.5, finite-block bounds (49)–(52)

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.finiteBlockBounds

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For density operators ρ,σ\rho,\sigmaρ,σ, n≥1n\ge1n≥1, x∈Rx\in\mathbb Rx∈R, and 0<s<10<s<10<s<1, let PnP_nPn​ project onto the range of (e−nxσ⊗n−ρ⊗n)+(e^{-nx}\sigma^{\otimes n}-\rho^{\otimes n})_+(e−nxσ⊗n−ρ⊗n)+​. Then

βn(Pn)≤enx(1−s)Qsn,αn(Pn)≤e−nxsQsn,\beta_n(P_n)\le e^{nx(1-s)}Q_s^n,\qquad\alpha_n(P_n)\le e^{-nxs}Q_s^n,βn​(Pn​)≤enx(1−s)Qsn​,αn​(Pn​)≤e−nxsQsn​,

where Qs=Tr⁡(ρ1−sσs)Q_s=\operatorname{Tr}(\rho^{1-s}\sigma^s)Qs​=Tr(ρ1−sσs). These product forms include Qs=0Q_s=0Qs​=0. The test is tied to the displayed threshold; no finite-block optimization over unrelated parameters is asserted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

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

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

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

/-- arXiv:0708.4282v1, PDF pp.29,30: §5.5, finite-block bounds (49)–(52). Source correction: PDF p.30 optimizes a fixed-s test over other s without justification. Retain actual (51)--(52); Theorem 5 separately states full asymptotic existence. Independent moderation required. -/
theorem finiteBlockBounds (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (s x : ℝ) (hs0 : 0 < s) (hs1 : s < 1) (n : ℕ) (hn : 0 < n) :
    let P := positiveProjection (((Real.exp (-(n : ℝ)*x) : ℝ) : ℂ) • copies n sigma-copies n rho)
    IsProjection P ∧ IsEffect P ∧
    typeIIError (copies n sigma) P ≤ Real.exp ((n : ℝ)*x*(1-s)) * (chernoffOverlap rho sigma s)^n ∧
    typeIError (copies n rho) P ≤ Real.exp (-(n : ℝ)*x*s) * (chernoffOverlap rho sigma s)^n := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 29, §5.5, finite-block bounds (49)–(52)
Read-back

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

Let III be a finite type with decidable equality, let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex I×II\times II×I matrices of trace one, let s,x∈Rs,x\in\mathbb Rs,x∈R satisfy 0<s<10<s<10<s<1, and let nnn be a strictly positive natural number. For a matrix AAA, let A+A_+A+​ be its continuous functional calculus under t↦max⁡(t,0)t\mapsto\max(t,0)t↦max(t,0), and let PPP be the orthogonal projection onto the operator range of (e−nxσ⊗n−ρ⊗n)+(e^{-nx}\sigma^{\otimes n}-\rho^{\otimes n})_+(e−nxσ⊗n−ρ⊗n)+​, where the tensor-power entries are (A⊗n)u,v=∏j=0n−1Auj,vj(A^{\otimes n})_{u,v}=\prod_{j=0}^{n-1}A_{u_j,v_j}(A⊗n)u,v​=∏j=0n−1​Auj​,vj​​. Put Qs=Re⁡tr⁡(ρ 1−sσs)Q_s=\operatorname{Re}\operatorname{tr}(\rho^{\,1-s}\sigma^s)Qs​=Retr(ρ1−sσs), with matrix powers defined by continuous functional calculus for real powers. The declaration asserts that PPP is Hermitian and idempotent, that both PPP and 1−P1-P1−P are positive semidefinite, and that

Re⁡tr⁡((1−P)σ⊗n)≤enx(1−s)Qs n,Re⁡tr⁡(Pρ⊗n)≤e−nxsQs n.\operatorname{Re}\operatorname{tr}((1-P)\sigma^{\otimes n}) \le e^{nx(1-s)}Q_s^{\,n}, \qquad \operatorname{Re}\operatorname{tr}(P\rho^{\otimes n}) \le e^{-nxs}Q_s^{\,n}.Retr((1−P)σ⊗n)≤enx(1−s)Qsn​,Retr(Pρ⊗n)≤e−nxsQsn​.

The real xxx is unrestricted, singular density matrices are allowed, and the cases n=0n=0n=0, s=0s=0s=0, and s=1s=1s=1 are excluded.

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