Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5, overlap and threshold identities

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.overlapThresholdIdentities

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

prove2quantum

For a nonorthogonal density pair and its spectral laws p,qp,qp,q, let Pρ,PσP_\rho,P_\sigmaPρ​,Pσ​ be support projections. Then

ψ0=Tr⁡(ρPσ),ψ1=Tr⁡(σPρ),\psi_0=\operatorname{Tr}(\rho P_\sigma),\quad\psi_1=\operatorname{Tr}(\sigma P_\rho),ψ0​=Tr(ρPσ​),ψ1​=Tr(σPρ​), H(p~∥q)=Sσ(ρ∥σ),H(q~∥p)=Sρ(σ∥ρ).H(\widetilde p\|q)=S_\sigma(\rho\|\sigma),\quad H(\widetilde q\|p)=S_\rho(\sigma\|\rho).H(p​∥q)=Sσ​(ρ∥σ),H(q​∥p)=Sρ​(σ∥ρ).

Here Sσ(ρ∥σ)=Re⁡Tr⁡[(ρ/ψ0)(log⁡(ρ/ψ0)−log⁡σ)Pσ]S_\sigma(\rho\|\sigma)=\operatorname{Re}\operatorname{Tr}[(\rho/\psi_0)(\log(\rho/\psi_0)-\log\sigma)P_\sigma]Sσ​(ρ∥σ)=ReTr[(ρ/ψ0​)(log(ρ/ψ0​)−logσ)Pσ​], with the swapped definition for SρS_\rhoSρ​. Conditional laws are extended by zero. The multiplication order and positive overlap normalization are retained.

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.25,26: Lemma 5, overlap and threshold identities. Source correction: the last proof line on PDF p.26 swaps rho/psi0 with sigma/psi1; the defining displays and eigenvalue sum determine the stated orientation. Independent moderation required. -/
theorem overlapThresholdIdentities (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (D : SpectralPair rho sigma)
    (h0 : 0 < overlapMass (spectralP D) (spectralQ D))
    (h1 : 0 < overlapMass (spectralQ D) (spectralP D)) :
    overlapMass (spectralP D) (spectralQ D)=(rho*support sigma).trace.re ∧
    overlapMass (spectralQ D) (spectralP D)=(sigma*support rho).trace.re ∧
    kl (fun i => if 0 < spectralP D i ∧ 0 < spectralQ D i then
      spectralP D i / overlapMass (spectralP D) (spectralQ D) else 0) (spectralQ D) =
      ((supportConditionalEntropy rho sigma : ℝ) : EReal) ∧
    kl (fun i => if 0 < spectralP D i ∧ 0 < spectralQ D i then
      spectralQ D i / overlapMass (spectralQ D) (spectralP D) else 0) (spectralP D) =
      ((supportConditionalEntropy sigma rho : ℝ) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 25, Lemma 5, overlap and threshold identities
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, and let a spectral pair provide unitary U,VU,VU,V, nonnegative real λi,μi\lambda_i,\mu_iλi​,μi​, and decompositions ρ=Udiag⁡(λ)U∗\rho=U\operatorname{diag}(\lambda)U^*ρ=Udiag(λ)U∗, σ=Vdiag⁡(μ)V∗\sigma=V\operatorname{diag}(\mu)V^*σ=Vdiag(μ)V∗. Define pij=λi∣(U∗V)ij∣2p_{ij}=\lambda_i|(U^*V)_{ij}|^2pij​=λi​∣(U∗V)ij​∣2, qij=μj∣(U∗V)ij∣2q_{ij}=\mu_j|(U^*V)_{ij}|^2qij​=μj​∣(U∗V)ij​∣2, C={(i,j):pij>0, qij>0}C=\{(i,j):p_{ij}>0,\ q_{ij}>0\}C={(i,j):pij​>0, qij​>0}, u=∑Cpiju=\sum_Cp_{ij}u=∑C​pij​, and v=∑Cqijv=\sum_Cq_{ij}v=∑C​qij​, and assume u,v>0u,v>0u,v>0. For a matrix YYY, let SYS_YSY​ be the orthogonal projection onto its operator range. For matrices A,BA,BA,B, define

ψA,B=Re⁡tr⁡(ASB),RA,B=ψA,B−1A,Hc(A,B)=Re⁡tr⁡ ⁣[RA,B(log⁡RA,B−log⁡B)SB],\psi_{A,B}=\operatorname{Re}\operatorname{tr}(AS_B),\qquad R_{A,B}=\psi_{A,B}^{-1}A,\qquad H_c(A,B)=\operatorname{Re}\operatorname{tr}\!\left[ R_{A,B}(\log R_{A,B}-\log B)S_B\right],ψA,B​=Retr(ASB​),RA,B​=ψA,B−1​A,Hc​(A,B)=Retr[RA,B​(logRA,B​−logB)SB​],

where matrix logarithms use continuous functional calculus with the total real logarithm, whose value at zero is zero, and scalar inversion is total, with 0−1=00^{-1}=00−1=0. Let pC,qCp^C,q^CpC,qC equal p/u,q/vp/u,q/vp/u,q/v on CCC, respectively, and zero outside CCC. With K(P∥Q)=∑Px>0Pxlog⁡(Px/Qx)K(P\Vert Q)=\sum_{P_x>0}P_x\log(P_x/Q_x)K(P∥Q)=∑Px​>0​Px​log(Px​/Qx​) if Px>0P_x>0Px​>0 always implies Qx>0Q_x>0Qx​>0, and +∞+\infty+∞ otherwise, the assertion is

u=Re⁡tr⁡(ρSσ),v=Re⁡tr⁡(σSρ),K(pC∥q)=Hc(ρ,σ),K(qC∥p)=Hc(σ,ρ).u=\operatorname{Re}\operatorname{tr}(\rho S_\sigma),\qquad v=\operatorname{Re}\operatorname{tr}(\sigma S_\rho),\qquad K(p^C\Vert q)=H_c(\rho,\sigma),\qquad K(q^C\Vert p)=H_c(\sigma,\rho).u=Retr(ρSσ​),v=Retr(σSρ​),K(pC∥q)=Hc​(ρ,σ),K(qC∥p)=Hc​(σ,ρ).

The last two equalities regard the real quantities on their right as extended-real values; zero spectral values and zero entries of p,qp,qp,q are permitted.

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