Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Attained quantum variational exponent dominates the Petz bound

Open
QAlgorithms.Papers.Independent.Gap48.P41.quantum_variational_comparison

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

prove2quantum

Let III be a nonempty finite orthonormal basis, and let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices of trace one with supp⁡ρ⊆supp⁡σ\operatorname{supp}\rho\subseteq\operatorname{supp}\sigmasuppρ⊆suppσ. For a positive integer nnn, an arbitrary effect 0≤An≤I0\le A_n\le I0≤An​≤I accepts the null state ρ⊗n\rho^{\otimes n}ρ⊗n. Write αn(An)=Tr⁡[ρ⊗n(I−An)]\alpha_n(A_n)=\operatorname{Tr}[\rho^{\otimes n}(I-A_n)]αn​(An​)=Tr[ρ⊗n(I−An​)] and βn(An)=Tr⁡[σ⊗nAn]\beta_n(A_n)=\operatorname{Tr}[\sigma^{\otimes n}A_n]βn​(An​)=Tr[σ⊗nAn​]. All logarithms are natural, with log⁡0=−∞\log0=-\inftylog0=−∞ in rates. Write D(ρ∥σ)=Tr⁡[ρ(log⁡ρ−log⁡σ)]D(\rho\Vert\sigma)=\operatorname{Tr}[\rho(\log\rho-\log\sigma)]D(ρ∥σ)=Tr[ρ(logρ−logσ)], using support-restricted spectral logarithms inside the trace.

Put ψ(s)=log⁡Tr⁡(ρ1+sσ−s)\psi(s)=\log\operatorname{Tr}(\rho^{1+s}\sigma^{-s})ψ(s)=logTr(ρ1+sσ−s) and ϕ(λ)=max⁡0≤s≤1{λs−ψ(s)}\phi(\lambda)=\max_{0\le s\le1}\{\lambda s-\psi(s)\}ϕ(λ)=max0≤s≤1​{λs−ψ(s)}. Spectral powers vanish on the kernel, including at zero and negative orders.

For a finite real r>D(ρ∥σ)r>D(\rho\Vert\sigma)r>D(ρ∥σ), define u(r)=max⁡0≤s≤1(sr−ψ(s))/(1+s)u(r)=\max_{0\le s\le1}(sr-\psi(s))/(1+s)u(r)=max0≤s≤1​(sr−ψ(s))/(1+s) and λ∗=r−u(r)\lambda_*=r-u(r)λ∗​=r−u(r). The variational infimum over all density matrices θ\thetaθ is attained, and

min⁡θ: D(θ∥σ)≤r{D(θ∥ρ)+r−D(θ∥σ)}≥ϕ(λ∗).\min_{\theta:\,D(\theta\Vert\sigma)\le r} \{D(\theta\Vert\rho)+r-D(\theta\Vert\sigma)\} \ge\phi(\lambda_*).θ:D(θ∥σ)≤rmin​{D(θ∥ρ)+r−D(θ∥σ)}≥ϕ(λ∗​).

The constraint makes the subtracted divergence finite, while D(θ∥ρ)D(\theta\Vert\rho)D(θ∥ρ) may be infinite. This is the explicit comparison (22), with no claim of achievability or optimality of the quantum bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P41

open scoped Matrix ComplexOrder BigOperators

open Filter QAlgorithms

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

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

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

open QAlgorithms.Papers.Independent.Dependency50.P28
  (tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
    scaled logNonnegativeExtended)

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

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

attribute [local instance] Classical.propDecidable Classical.decEq

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

variable {X : Type} [Fintype X]

/-- PDF p.8, (22): the attained quantum variational minimum dominates the
paper's bound. No log-Euclidean moment or unbounded maximum is assumed, and no
trial density is excluded for having infinite divergence to rho. -/
theorem quantum_variational_comparison [Nonempty I]
    (rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (hsupp : SupportLE rho sigma) (r : ℝ) (hr : relativeEntropy rho sigma < (r : EReal)) :
    IsLeast (quantumValues rho sigma r) (quantumMinimum rho sigma r) ∧
    (petzPhi rho sigma (crossing rho sigma r) : EReal) ≤ quantumMinimum rho sigma r := by sorry

end QAlgorithms.Papers.Independent.Gap48.P41

end
Source
Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing, arXiv:quant-ph/9906090v1, PDF p. 8, §5, (22): variational quantum exponent dominates the paper’s bound
Read-back

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

Let III be a finite, nonempty index set with decidable equality, and let ρ,σ\rho,\sigmaρ,σ be complex matrices indexed by III, both positive semidefinite with trace 111. Suppose ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ. For density matrices θ,ω\theta,\omegaθ,ω, define

D(θ∥ω)={Re⁡Tr⁡ ⁣(θ(log⁡θ−log⁡ω)),ker⁡ω⊆ker⁡θ,+∞,otherwise,D(\theta\|\omega)= \begin{cases} \operatorname{Re}\operatorname{Tr}\!\bigl(\theta(\log\theta-\log\omega)\bigr), &\ker\omega\subseteq\ker\theta,\\ +\infty,&\text{otherwise}, \end{cases}D(θ∥ω)={ReTr(θ(logθ−logω)),+∞,​kerω⊆kerθ,otherwise,​

where matrix logarithms use spectral functional calculus with the real natural logarithm, whose value at zero is 000. Let r∈Rr\in\mathbb Rr∈R satisfy D(ρ∥σ)<rD(\rho\|\sigma)<rD(ρ∥σ)<r, and define Vr={D(θ∥ρ)+r−D(θ∥σ):θ is positive semidefinite, Tr⁡θ=1, D(θ∥σ)≤r}\mathcal V_r=\{D(\theta\|\rho)+r-D(\theta\|\sigma):\theta\text{ is positive semidefinite},\ \operatorname{Tr}\theta=1,\ D(\theta\|\sigma)\le r\}Vr​={D(θ∥ρ)+r−D(θ∥σ):θ is positive semidefinite, Trθ=1, D(θ∥σ)≤r} and mr=inf⁡Vrm_r=\inf\mathcal V_rmr​=infVr​, using extended-real arithmetic. For positive semidefinite CCC, let C[z]C^{[z]}C[z] apply x↦xzx\mapsto x^zx↦xz at nonzero eigenvalues and send zero eigenvalues to 000, including for zero and negative exponents. Set ψ(z)=log⁡(Re⁡Tr⁡(ρ[1+z]σ[−z]))\psi(z)=\log\bigl(\operatorname{Re}\operatorname{Tr}(\rho^{[1+z]}\sigma^{[-z]})\bigr)ψ(z)=log(ReTr(ρ[1+z]σ[−z])), E(r)=sup⁡0≤z≤1(zr−ψ(z))/(1+z)E(r)=\sup_{0\le z\le1}(zr-\psi(z))/(1+z)E(r)=sup0≤z≤1​(zr−ψ(z))/(1+z), and λr=r−E(r)\lambda_r=r-E(r)λr​=r−E(r). Then mrm_rmr​ belongs to Vr\mathcal V_rVr​ and is its least element, and

sup⁡0≤z≤1(λrz−ψ(z))≤mr,\sup_{0\le z\le1}\bigl(\lambda_r z-\psi(z)\bigr)\le m_r,0≤z≤1sup​(λr​z−ψ(z))≤mr​,

where the real supremum on the left is embedded in the extended reals. Singular density matrices are included; the kernel conditions specify exactly when the displayed relative entropies take the value +∞+\infty+∞.

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

    Confirmed by the moderator at approval.

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