Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, classical HBCL for arbitrary laws

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.arbitraryClassicalHBCL

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

prove2quantum

For arbitrary finite probability laws p,qp,qp,q, the full HBCL achievability and strict converse hold with the extended exponent defined by (42). In particular,

0≤r<−log⁡ψ1⟹e(r)=+∞,0\le r<-\log\psi_1\Longrightarrow e(r)=+\infty,0≤r<−logψ1​⟹e(r)=+∞,

where ψ1=q(supp⁡p∩supp⁡q)\psi_1=q(\operatorname{supp}p\cap\operatorname{supp}q)ψ1​=q(suppp∩suppq) and −log⁡0=+∞-\log0=+\infty−log0=+∞. Infinite exponents at r>0r>0r>0 are achievable with identically zero type-I error. Orthogonal laws require no conditional distribution on an empty overlap.

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.24,25: Theorem 4, classical HBCL for arbitrary laws. -/
theorem arbitraryClassicalHBCL (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q) :
    ClassicalHBCL p q ∧
    (∀ r : ℝ, 0 ≤ r → (r : EReal) < -logNonnegativeExtended (overlapMass q p) →
      classicalExponent p q r=⊤) ∧
    (∀ r : ℝ, 0 < r → classicalExponent p q r=⊤ →
      ∃ f : ClassicalTestSequence I, ∃ b : EReal,
        (∀ k, alphaSeq p f k=0) ∧ HasRate (betaSeq q f) b ∧ (r : EReal) ≤ b) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 24, Theorem 4, classical HBCL for arbitrary laws
Read-back

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

Let III be a finite type with decidable equality, and let p,q:I→Rp,q:I\to\mathbb Rp,q:I→R be nonnegative laws of total mass one. Set L(z)=log⁡zL(z)=\log zL(z)=logz for z>0z>0z>0 and L(z)=−∞L(z)=-\inftyL(z)=−∞ otherwise, and define

Ep,q(r)=sup⁡0≤s<1−rs−L ⁣(∑ipi 1−sqi s)1−s,E_{p,q}(r)=\sup_{0\le s<1} \frac{-rs-L\!\left(\sum_i p_i^{\,1-s}q_i^{\,s}\right)}{1-s},Ep,q​(r)=0≤s<1sup​1−s−rs−L(∑i​pi1−s​qis​)​,

using extended-real arithmetic and real powers with 00=10^0=100=1. A test sequence is a family fk:Ik+1→[0,1]f_k:I^{k+1}\to[0,1]fk​:Ik+1→[0,1], with errors αk=∑x(∏j=0kpxj)fk(x)\alpha_k=\sum_x(\prod_{j=0}^{k}p_{x_j})f_k(x)αk​=∑x​(∏j=0k​pxj​​)fk​(x) and βk=∑x(∏j=0kqxj)(1−fk(x))\beta_k=\sum_x(\prod_{j=0}^{k}q_{x_j})(1-f_k(x))βk​=∑x​(∏j=0k​qxj​​)(1−fk​(x)); a sequence zkz_kzk​ has rate ccc when −L(zk)/(k+1)→c-L(z_k)/(k+1)\to c−L(zk​)/(k+1)→c in the extended reals. The declaration asserts that, for every r>0r>0r>0, some test sequence has α\alphaα-rate Ep,q(r)E_{p,q}(r)Ep,q​(r) and β\betaβ-rate b≥rb\ge rb≥r, and that every test sequence having rates a,ba,ba,b satisfies a≤Ep,q(r)a\le E_{p,q}(r)a≤Ep,q​(r) whenever r>0r>0r>0 and r<br<br<b. It also asserts, with v=∑{i:pi>0, qi>0}qiv=\sum_{\{i:p_i>0,\ q_i>0\}}q_iv=∑{i:pi​>0, qi​>0}​qi​, that Ep,q(r)=+∞E_{p,q}(r)=+\inftyEp,q​(r)=+∞ for every real r≥0r\ge0r≥0 satisfying r<−L(v)r<-L(v)r<−L(v), and that whenever r>0r>0r>0 and Ep,q(r)=+∞E_{p,q}(r)=+\inftyEp,q​(r)=+∞, there exists a test sequence with αk=0\alpha_k=0αk​=0 for every kkk and with a β\betaβ-rate b≥rb\ge rb≥r. There is no positive-overlap hypothesis: v=0v=0v=0 is included, in which case −L(v)=+∞-L(v)=+\infty−L(v)=+∞ and the stated threshold condition holds for every finite r≥0r\ge0r≥0.

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