Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Data processing of Petz overlaps and their log moments

Open
QAlgorithms.Papers.Independent.Intakethird100.P04.petz_data_processing

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be arbitrary density operators on a complex Hilbert space HHH, and let E\mathcal EE be a trace-preserving completely positive linear map on trace-class operators, with arbitrary output Hilbert space. For 0≤s≤10\le s\le10≤s≤1 define

ms(ρ,σ)=Tr⁡(ρ1−sσs),φ(s∣ρ∥σ)=log⁡ms(ρ,σ).m_s(\rho,\sigma)=\operatorname{Tr}(\rho^{1-s}\sigma^s),\qquad \varphi(s\mid\rho\Vert\sigma)=\log m_s(\rho,\sigma).ms​(ρ,σ)=Tr(ρ1−sσs),φ(s∣ρ∥σ)=logms​(ρ,σ).

Powers of exponent zero are the identity. The fractional-power product is trace class; its trace is nonnegative, and the logarithm is extended with log⁡0=−∞\log0=-\inftylog0=−∞. For every s∈[0,1]s\in[0,1]s∈[0,1],

ms(ρ,σ)≤ms(E(ρ),E(σ)),φ(s∣ρ∥σ)≤φ(s∣E(ρ)∥E(σ)).m_s(\rho,\sigma)\le m_s(\mathcal E(\rho),\mathcal E(\sigma)),\qquad \varphi(s\mid\rho\Vert\sigma)\le\varphi(s\mid\mathcal E(\rho)\Vert\mathcal E(\sigma)).ms​(ρ,σ)≤ms​(E(ρ),E(σ)),φ(s∣ρ∥σ)≤φ(s∣E(ρ)∥E(σ)).

At either endpoint the overlaps equal one. The paper credits Uhlmann and Petz for earlier proofs and presents these inequalities as a consequence of its operational approach; their statements do not require its conversion formula as a hypothesis.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P04
Formal statement
noncomputable section

open Filter

open scoped ENNReal NNReal BigOperators ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P04

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State operatorTrace relativeEntropy)

open QAlgorithms.Papers.Independent.Support50.P20
  (Effect traceAcceptance IsHilbertCPTP BlockHilbert blockBasis)

open QAlgorithms.Papers.Independent.Frontier18.P18 (boundedOperator)

variable {H K : Type*}

variable [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]

/-- Remark 2, PDF p.7, (31)--(32): both overlap and extended log-moment
inequalities on [0,1]. Ordinary A^0=I makes endpoints equalities, also for singular
states. Source credits Uhlmann [14] and Petz [15], claiming a new proof. -/
theorem petz_data_processing {I J : Type*}
    (b : HilbertBasis I ℂ H) (d : HilbertBasis J ℂ K)
    (rho sigma : State b)
    (Phi : (H →L[ℂ] H) → (K →L[ℂ] K)) (hPhi : IsHilbertCPTP b d Phi)
    (s : ℝ) (hs : 0 ≤ s) (hs1 : s ≤ 1) :
    ENNReal.ofReal (traceAcceptance b
        (CFC.rpow rho.val.val (1 - s)) (CFC.rpow sigma.val.val s)) ≤
        ENNReal.ofReal (traceAcceptance d
          (CFC.rpow (Phi rho.val.val) (1 - s)) (CFC.rpow (Phi sigma.val.val) s)) ∧
      logMoment b rho.val.val sigma.val.val s ≤
        logMoment d (Phi rho.val.val) (Phi sigma.val.val) s := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P04

end
Source
The Converse Part of The Theorem for Quantum Hoeffding Bound, arXiv:quant-ph/0611289v1, PDF p. 7, Remark 2, (31)–(32)
Read-back

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

Let H,KH,KH,K be complete complex inner-product spaces with Hilbert bases b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ and d=(dj)j∈Jd=(d_j)_{j\in J}d=(dj​)j∈J​, where I,JI,JI,J are arbitrary types, and define Tr⁡bA=∑i′⟨bi,Abi⟩\operatorname{Tr}_b A=\sum'_i\langle b_i,A b_i\rangleTrb​A=∑i′​⟨bi​,Abi​⟩, and similarly for ddd. Let ρ,σ\rho,\sigmaρ,σ be trace-class operators on HHH, meaning that each admits a representation Ax=∑n′⟨vn,x⟩unAx=\sum'_n\langle v_n,x\rangle u_nAx=∑n′​⟨vn​,x⟩un​ with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞; assume each is self-adjoint, satisfies Re⁡⟨x,Ax⟩≥0\operatorname{Re}\langle x,Ax\rangle\ge0Re⟨x,Ax⟩≥0 for every xxx, and has complex trace 111. Let Φ\PhiΦ be a function on bounded operators from HHH to bounded operators on KKK, additive and complex homogeneous on trace-class operators, mapping them to trace-class operators with Tr⁡d(ΦA)=Tr⁡bA\operatorname{Tr}_d(\Phi A)=\operatorname{Tr}_b ATrd​(ΦA)=Trb​A. Assume also that for every n≥0n\ge0n≥0 and every trace-class operator block (Aij)i,j<n(A_{ij})_{i,j<n}(Aij​)i,j<n​, reality and nonnegativity of ∑i,j⟨xi,Aijxj⟩\sum_{i,j}\langle x_i,A_{ij}x_j\rangle∑i,j​⟨xi​,Aij​xj​⟩ for every tuple (xi)(x_i)(xi​) imply the corresponding reality and nonnegativity after applying Φ\PhiΦ to every block entry. For every real sss with 0≤s≤10\le s\le10≤s≤1, define AtA^tAt using the continuous-functional-calculus real power appearing in the statement, and put

mb(ρ,σ;s)=max⁡ ⁣{0,Re⁡Tr⁡b ⁣(ρ 1−sσs)}.m_b(\rho,\sigma;s)= \max\!\left\{0,\operatorname{Re}\operatorname{Tr}_b\!\left(\rho^{\,1-s}\sigma^s\right)\right\}.mb​(ρ,σ;s)=max{0,ReTrb​(ρ1−sσs)}.

The theorem asserts both

mb(ρ,σ;s)≤md(Φρ,Φσ;s)andlog⁡mb(ρ,σ;s)≤log⁡md(Φρ,Φσ;s).m_b(\rho,\sigma;s)\le m_d(\Phi\rho,\Phi\sigma;s) \quad\text{and}\quad \log m_b(\rho,\sigma;s)\le\log m_d(\Phi\rho,\Phi\sigma;s).mb​(ρ,σ;s)≤md​(Φρ,Φσ;s)andlogmb​(ρ,σ;s)≤logmd​(Φρ,Φσ;s).

The quantities mb,mdm_b,m_dmb​,md​ are regarded as extended nonnegative reals, and the logarithms are extended natural logarithms, taking value −∞-\infty−∞ at zero and +∞+\infty+∞ at infinity. Thus the first inequality explicitly uses the nonnegative truncation of the real trace, and the second is the expanded meaning of the two logarithmic moments. Both endpoints s=0,1s=0,1s=0,1 are included, with no invertibility assumption on either state. No countability, separability, or nonzero-dimension assumption is imposed; the trace sums use total summation, returning zero for nonsummable families, and the hypotheses have no instances when normalized states do not exist.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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