Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark (2-decomposable special case) 5.8

Open
QAlgorithms.Papers.Independent.Support50.P12.remark_5_8

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

prove2quantum

Let A1⊆B(H1)\mathcal A_1\subseteq B(H_1)A1​⊆B(H1​) and A2⊆B(H2)\mathcal A_2\subseteq B(H_2)A2​⊆B(H2​) be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let Φ:A1→A2\Phi:\mathcal A_1\to\mathcal A_2Φ:A1​→A2​ be complex linear. The adjoint is for ⟨X,Y⟩HS=Tr⁡X∗Y\langle X,Y\rangle_{\rm HS}=\operatorname{Tr}X^*Y⟨X,Y⟩HS​=TrX∗Y. A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let A,B∈A1,+A,B\in\mathcal A_{1,+}A,B∈A1,+​. Powers are zero on kernels and traces are not normalized. Write Sα(A∥B)S_\alpha(A\Vert B)Sα​(A∥B) for the unnormalized Petz Rényi entropy, ψA,B(α)=log⁡Tr⁡AαB1−α\psi_{A,B}(\alpha)=\log\operatorname{Tr}A^\alpha B^{1-\alpha}ψA,B​(α)=logTrAαB1−α, C(A∥B)=sup⁡0≤α<1−ψA,B(α)C(A\Vert B)=\sup_{0\le\alpha<1}-\psi_{A,B}(\alpha)C(A∥B)=sup0≤α<1​−ψA,B​(α), and Hr(A∥B)=sup⁡0≤α<1[−αr−ψA,B(α)]/(1−α)H_r(A\Vert B)=\sup_{0\le\alpha<1}[-\alpha r-\psi_{A,B}(\alpha)]/(1-\alpha)Hr​(A∥B)=sup0≤α<1​[−αr−ψA,B​(α)]/(1−α). Logarithms are natural and log⁡0=−∞\log0=-\inftylog0=−∞. The Petz map is ΦB∗(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2\Phi_B^*(Y)=B^{1/2}\Phi^*(\Phi(B)^{-1/2}Y\Phi(B)^{-1/2})B^{1/2}ΦB∗​(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2.

Assume A0≤B0A^0\le B^0A0≤B0, Tr⁡Φ(B)=Tr⁡B\operatorname{Tr}\Phi(B)=\operatorname{Tr}BTrΦ(B)=TrB, and Φ\PhiΦ is a convex combination of two trace non-increasing maps, one two-positive and one two-copositive. Then

ΦB∗(Φ(A))=A⟹Sf(Φ(A)∥Φ(B))=Sf(A∥B)for every operator convex f.\Phi_B^*(\Phi(A))=A\quad\Longrightarrow\quad S_f(\Phi(A)\Vert\Phi(B))=S_f(A\Vert B)\quad\text{for every operator convex }f.ΦB∗​(Φ(A))=A⟹Sf​(Φ(A)∥Φ(B))=Sf​(A∥B)for every operator convex f.

Only this expressly asserted two-decomposable special case is claimed; the wider Schwarz-decomposability question is left open.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P12

open Filter MeasureTheory Set

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

open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Next46.P23 (Supports)

open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)

open QAlgorithms (spectralProjector)

open QAlgorithms.Learning (IsDistribution)

open QAlgorithms.Papers.Independent.Information100.P04 (absOp)

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker

attribute [local instance] Classical.propDecidable Classical.decEq

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

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

/-- Remark 5.8, PDF p.27: ONLY the asserted 2-decomposable special case;
the surrounding general decomposability question remains open. -/
theorem remark_5_8 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
    (Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi)
    (hd : ∃ (t : ℝ) (Phi1 Phi2 : MatrixMap I J), t ∈ Icc 0 1 ∧
      AlgebraExtension A B Phi1 ∧ AlgebraExtension A B Phi2 ∧ AlgebraTraceNonincreasing A Phi1 ∧ AlgebraTraceNonincreasing A Phi2 ∧
      AlgebraKPositive A Phi1 2 ∧ KCoPositive A Phi2 2 ∧
      Phi = ((1 - t : ℝ) : ℂ) • Phi1 + (t : ℂ) • Phi2)
    (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A) (hXp : X.PosSemidef) (hYp : Y.PosSemidef)
    (hs : Supports X Y) (htr : tr (Phi Y) = tr Y) (hr : petz Y Phi (Phi X) = X) :
    ∀ f, DivergenceGenerator f → SemidefiniteOperatorConvex f → div f (Phi X) (Phi Y) = div f X Y := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 27, Remark (2-decomposable special case) 5.8
Read-back

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

Let I,JI,JI,J be nonempty finite index types with decidable equality, A⊆MI(C)A\subseteq M_I(\mathbb C)A⊆MI​(C), B⊆MJ(C)B\subseteq M_J(\mathbb C)B⊆MJ​(C) unital complex star subalgebras, and Φ:MI(C)→MJ(C)\Phi:M_I(\mathbb C)\to M_J(\mathbb C)Φ:MI​(C)→MJ​(C) complex linear. Write tr⁡Z=Re⁡Tr⁡Z\operatorname{tr}Z=\operatorname{Re}\operatorname{Tr}ZtrZ=ReTrZ, and (F†Z)ij=∑k,lF(Eij)kl‾Zkl(F^\dagger Z)_{ij}=\sum_{k,l}\overline{F(E_{ij})_{kl}}Z_{kl}(F†Z)ij​=∑k,l​F(Eij​)kl​​Zkl​. Assume that Φ\PhiΦ maps all ambient matrices into BBB and Φ†\Phi^\daggerΦ† maps all ambient matrices into AAA. Assume there exist t∈[0,1]t\in[0,1]t∈[0,1] and complex-linear Φ1,Φ2:MI(C)→MJ(C)\Phi_1,\Phi_2:M_I(\mathbb C)\to M_J(\mathbb C)Φ1​,Φ2​:MI​(C)→MJ​(C), each having those same range properties, such that Φ=(1−t)Φ1+tΦ2\Phi=(1-t)\Phi_1+t\Phi_2Φ=(1−t)Φ1​+tΦ2​, each Φi\Phi_iΦi​ satisfies tr⁡ΦiZ≤tr⁡Z\operatorname{tr}\Phi_i Z\le\operatorname{tr}ZtrΦi​Z≤trZ for positive semidefinite Z∈AZ\in AZ∈A, the 2×22\times22×2 block amplification of Φ1\Phi_1Φ1​ preserves positivity for positive block matrices with all blocks in AAA, and applying Z↦Φ2(ZT)Z\mapsto\Phi_2(Z^{\mathsf T})Z↦Φ2​(ZT) to the blocks preserves positivity whenever the original 2×22\times22×2 block matrix is positive and every transposed block lies in AAA. Let X,Y∈AX,Y\in AX,Y∈A be positive semidefinite, with ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX and tr⁡ΦY=tr⁡Y\operatorname{tr}\Phi Y=\operatorname{tr}YtrΦY=trY, and assume

Y01/2Φ† ⁣[(ΦY)0−1/2(ΦX)(ΦY)0−1/2]Y01/2=X,Y_0^{1/2}\Phi^\dagger\!\left[(\Phi Y)_0^{-1/2}(\Phi X)(\Phi Y)_0^{-1/2}\right]Y_0^{1/2}=X,Y01/2​Φ†[(ΦY)0−1/2​(ΦX)(ΦY)0−1/2​]Y01/2​=X,

where Z0sZ_0^sZ0s​ is spectral functional calculus using value zero at zero and xsx^sxs otherwise. For every f:R→Rf:\mathbb R\to\mathbb Rf:R→R continuous on (0,∞)(0,\infty)(0,∞), with f(x)/xf(x)/xf(x)/x converging in the extended real line at infinity, and operator convex on positive semidefinite matrices in every finite size, one has Df(ΦX,ΦY)=Df(X,Y)D_f(\Phi X,\Phi Y)=D_f(X,Y)Df​(ΦX,ΦY)=Df​(X,Y), where, with sp⁡(Z)\operatorname{sp}(Z)sp(Z) the distinct Hermitian spectrum and empty otherwise and Pλ(Z)P_\lambda(Z)Pλ​(Z) its orthogonal eigenspace projection,

Qf(Z,W)=Re⁡Tr⁡ ⁣[(W01/2)∗∑λ∈sp⁡(Z)∑μ∈sp⁡(W)f(λ/μ)Pλ(Z)W01/2Pμ(W)],Df(Z,W)={Qf(Z,W),ker⁡W⊆ker⁡Z,lim⁡e↓0selectedQf(Z,W+e1),otherwise.Q_f(Z,W)=\operatorname{Re}\operatorname{Tr}\!\left[(W_0^{1/2})^* \sum_{\lambda\in\operatorname{sp}(Z)}\sum_{\mu\in\operatorname{sp}(W)} f(\lambda/\mu)P_\lambda(Z)W_0^{1/2}P_\mu(W)\right], \qquad D_f(Z,W)= \begin{cases} Q_f(Z,W),&\ker W\subseteq\ker Z,\\ \displaystyle\operatorname{lim}_{e\downarrow0}^{\mathrm{selected}}Q_f(Z,W+e1),&\text{otherwise}. \end{cases}Qf​(Z,W)=ReTr​(W01/2​)∗λ∈sp(Z)∑​μ∈sp(W)∑​f(λ/μ)Pλ​(Z)W01/2​Pμ​(W)​,Df​(Z,W)={Qf​(Z,W),lime↓0selected​Qf​(Z,W+e1),​kerW⊆kerZ,otherwise.​

Here real values are embedded in the extended real line, division by zero is zero, and the second branch is the total selected-limit operation. The endpoints t=0,1t=0,1t=0,1 and zero or unnormalized X,YX,YX,Y are included.

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