Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero-error testing divergence is order-zero Renyi divergence

Proved
QAlgorithms.Papers.Independent.Support50.P20.testingDivergence_orderZero

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ and σ\sigmaσ be normalized positive trace-class operators on the same complex Hilbert space. Let Πρ\Pi_\rhoΠρ​ be the orthogonal projection onto the closed support of ρ\rhoρ, equivalently the orthogonal complement of its kernel. Define DHϵD_H^\epsilonDHϵ​ by the binary testing infimum in (1), using base-two logarithms and the convention −log⁡20=+∞-\log_2 0=+\infty−log2​0=+∞. Then

DH0(ρ∥σ)=D0(ρ∥σ)=−log⁡2Tr⁡(Πρσ).D_H^0(\rho\|\sigma)=D_0(\rho\|\sigma)=-\log_2\operatorname{Tr}(\Pi_\rho\sigma).DH0​(ρ∥σ)=D0​(ρ∥σ)=−log2​Tr(Πρ​σ).

This identity identifies exact acceptance in hypothesis testing with the order-zero Renyi divergence, including state pairs with orthogonal supports. Neither invertibility nor support inclusion is assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P20
Formal statement
noncomputable section

open Filter

open scoped ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P20

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P13
  (IsTraceClass IsPositive operatorTrace State)

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- PDF p.2, paragraph after (1): zero-error testing divergence equals
order-zero Renyi divergence, including orthogonal supports and infinity. -/
theorem testingDivergence_orderZero {I : Type*} (b : HilbertBasis I ℂ H)
    (rho sigma : State b) :
    hilbertTestingDivergence b 0 rho.val.val sigma.val.val =
      orderZeroDivergence b rho.val.val sigma.val.val := by sorry

end QAlgorithms.Papers.Independent.Support50.P20

end
Source
One-Shot Classical-Quantum Capacity and Hypothesis Testing, arXiv:1007.5456v3, PDF p. 2, Unnumbered: zero-error testing divergence equals order-zero Renyi relative entropy
Read-back

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

Let HHH be a complete complex inner-product space, let III be any type, and let b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ be a Hilbert basis. Write tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{tr}_bT=\sum_i\langle b_i,Tb_i\rangletrb​T=∑i​⟨bi​,Tbi​⟩. Let ρ,σ\rho,\sigmaρ,σ be states, meaning bounded complex-linear operators that are self-adjoint, have nonnegative real quadratic forms and basis trace 111, and each admit a representation Tx=∑r=0∞⟨vr,x⟩urTx=\sum_{r=0}^\infty\langle v_r,x\rangle u_rTx=∑r=0∞​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞. An effect QQQ is a bounded operator such that QQQ and 1−Q1-Q1−Q are self-adjoint with nonnegative real quadratic forms. Put a(Q,T)=Re⁡tr⁡b(QT)a(Q,T)=\operatorname{Re}\operatorname{tr}_b(QT)a(Q,T)=Retrb​(QT), and let L:[0,∞]→[−∞,∞]L:[0,\infty]\to[-\infty,\infty]L:[0,∞]→[−∞,∞] be given by L(0)=+∞L(0)=+\inftyL(0)=+∞, L(+∞)=−∞L(+\infty)=-\inftyL(+∞)=−∞, and L(z)=−log⁡2zL(z)=-\log_2zL(z)=−log2​z for positive finite zzz. Let Πρ\Pi_\rhoΠρ​ be the orthogonal projection onto (ker⁡ρ)⊥(\ker\rho)^\perp(kerρ)⊥. The declaration asserts the extended-real equality

L ⁣(inf⁡Q an effecta(Q,ρ)≥1max⁡(a(Q,σ),0))=L ⁣(max⁡(a(Πρ,σ),0)),L\!\left(\inf_{\substack{Q\text{ an effect}\\a(Q,\rho)\ge1}}\max(a(Q,\sigma),0)\right) = L\!\left(\max(a(\Pi_\rho,\sigma),0)\right),L​Q an effecta(Q,ρ)≥1​inf​max(a(Q,σ),0)​=L(max(a(Πρ​,σ),0)),

where the infimum is taken in [0,∞][0,\infty][0,∞]. Thus the projection used on the right is onto the orthogonal complement of the kernel, including when the range of ρ\rhoρ is not closed; a zero argument of LLL gives +∞+\infty+∞. No finite-dimensionality or countability assumption is imposed.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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