Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 5.7

Open
QAlgorithms.Papers.Independent.Support50.P12.remark_5_7

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.

The ten-condition result of Theorem 5.1 holds for co-substochastic maps with co-stochastic/co-substochastic recoveries, after replacing its cocycle by

B0Φ∗(Φ(A)zΦ(B)−z)=B−zAz.B^0\Phi^*(\Phi(A)^z\Phi(B)^{-z})=B^{-z}A^z.B0Φ∗(Φ(A)zΦ(B)−z)=B−zAz.

The quantifiers are all complex zzz, one real z∈(0,2)∖{1}z\in(0,2)\setminus\{1\}z∈(0,2)∖{1}, or all z=itz=itz=it, in conditions (vi)–(viii), respectively. All other conditions and the asymmetric implication chain remain as stated there; two-copositivity supplies the recovery converse. Recovery may retain each given copositivity level or complete copositivity. The proof's adjoint slips are not adopted.

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.7, PDF p.26: co-version of the full chain, with reversed products in
(vi)–(viii) and a 2-copositive converse. The proof's Phi/Phi* slips are not copied. -/
theorem remark_5_7 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
    (hp : CoSubstochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
    (hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y) :
    let c := pairConditions true A B Phi X Y
    (Supports X Y → PairChain c) ∧ (c 1 → c 2) ∧
    (Supports X Y → KCoPositive A Phi 2 → c 9 → c 0) ∧
    (Supports X Y → c 0 →
      (∀ n, KCoPositive A Phi n → ∃ Psi : MatrixMap J I, CoStochastic B A Psi ∧
        KCoPositive B Psi n ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y) ∧
      ((∀ n, KCoPositive A Phi n) → ∃ Psi : MatrixMap J I, CoStochastic B A Psi ∧
        (∀ n, KCoPositive B Psi n) ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 26, Remark 5.7
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​. Call a complex-linear FFF co-substochastic from AAA to BBB when its entire range lies in BBB, the entire range of F†F^\daggerF† lies in AAA, F†F^\daggerF† is positive on positive elements of BBB, and (F†Z)∗F†Z⪯F†(ZZ∗)(F^\dagger Z)^*F^\dagger Z\preceq F^\dagger(ZZ^*)(F†Z)∗F†Z⪯F†(ZZ∗) for every Z∈BZ\in BZ∈B; call it co-stochastic if, additionally, Tr⁡FZ=Tr⁡Z\operatorname{Tr}FZ=\operatorname{Tr}ZTrFZ=TrZ for every Z∈AZ\in AZ∈A. Assume Φ\PhiΦ is co-substochastic and X,Y∈AX,Y\in AX,Y∈A are positive semidefinite with tr⁡ΦY=tr⁡Y\operatorname{tr}\Phi Y=\operatorname{tr}YtrΦY=trY. Define Z0sZ_0^sZ0s​ by functional calculus with value zero at zero and xsx^sxs otherwise, supp⁡Z=Z00\operatorname{supp}Z=Z_0^0suppZ=Z00​, and Z[z]Z^{[z]}Z[z] by the scalar function zero at zero and ezlog⁡xe^{z\log x}ezlogx elsewhere when ZZZ is Hermitian, with value zero for a non-Hermitian matrix. Let sp⁡(Z)\operatorname{sp}(Z)sp(Z) be the distinct Hermitian spectrum and the empty set otherwise, and Pλ(Z)P_\lambda(Z)Pλ​(Z) the orthogonal eigenspace projection. Define

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

using extended real values, the total selected-limit operation, and zero for division by zero. A permitted generator ggg is continuous on (0,∞)(0,\infty)(0,∞), has g(x)/xg(x)/xg(x)/x converging in the extended real line at infinity, and is operator convex on positive semidefinite matrices in every size. Let SA(Z,W)\mathcal S_A(Z,W)SA​(Z,W) be the set of ratios λ/μ\lambda/\muλ/μ, with λ∈sp⁡(Z)\lambda\in\operatorname{sp}(Z)λ∈sp(Z), μ∈sp⁡(W)\mu\in\operatorname{sp}(W)μ∈sp(W), for which some nonzero H∈AH\in AH∈A satisfies ZHW0−1=(λ/μ)HZHW_0^{-1}=(\lambda/\mu)HZHW0−1​=(λ/μ)H, and let d0=∣SA(X,Y)∪SB(ΦX,ΦY)∣d_0=|\mathcal S_A(X,Y)\cup\mathcal S_B(\Phi X,\Phi Y)|d0​=∣SA​(X,Y)∪SB​(ΦX,ΦY)∣. A generator is rich here when its selected representing measure μg\mu_gμg​ on (0,∞)(0,\infty)(0,∞) has support cardinality at least d0d_0d0​; this is the measure selected, when possible, to satisfy for some real aaa, b≥0b\ge0b≥0,

gc(x)=gc(0)+ax+bx2+∫(0,∞)(x1+t−xx+t)dμg(t)(x≥0),g_c(x)=g_c(0)+ax+bx^2+\int_{(0,\infty)} \left(\frac{x}{1+t}-\frac{x}{x+t}\right)d\mu_g(t)\quad(x\ge0),gc​(x)=gc​(0)+ax+bx2+∫(0,∞)​(1+tx​−x+tx​)dμg​(t)(x≥0),

with ∫(1+t)−2 dμg<∞\int(1+t)^{-2}\,d\mu_g<\infty∫(1+t)−2dμg​<∞ and integrable displayed kernels for every x≥0x\ge0x≥0, where gc=gg_c=ggc​=g away from zero and gc(0)g_c(0)gc​(0) is its selected right limit; the measure choice remains total if no representation exists. Define CzcoC_z^{\mathrm{co}}Czco​ by

supp⁡Y Φ† ⁣[(ΦX)[z](ΦY)[−z]]=Y[−z]X[z],\operatorname{supp}Y\,\Phi^\dagger\!\left[(\Phi X)^{[z]}(\Phi Y)^{[-z]}\right] =Y^{[-z]}X^{[z]},suppYΦ†[(ΦX)[z](ΦY)[−z]]=Y[−z]X[z],

and R(Z)=Y01/2Φ†((ΦY)0−1/2Z(ΦY)0−1/2)Y01/2\mathcal R(Z)=Y_0^{1/2}\Phi^\dagger((\Phi Y)_0^{-1/2}Z(\Phi Y)_0^{-1/2})Y_0^{1/2}R(Z)=Y01/2​Φ†((ΦY)0−1/2​Z(ΦY)0−1/2​)Y01/2​. Let c0,…,c9c_0,\ldots,c_9c0​,…,c9​ mean, respectively: existence of a co-stochastic recovery of both X,YX,YX,Y; existence of a co-substochastic recovery of both; divergence equality for every permitted generator; equality for some rich permitted generator; equality for gt(x)=−x/(x+t)g_t(x)=-x/(x+t)gt​(x)=−x/(x+t) for all ttt in some subset of (0,∞)(0,\infty)(0,∞) of cardinality at least d0d_0d0​; CzcoC_z^{\mathrm{co}}Czco​ for every complex zzz; CacoC_a^{\mathrm{co}}Caco​ for some 0<a<20<a<20<a<2, a≠1a\ne1a=1; CitcoC_{it}^{\mathrm{co}}Citco​ for every real ttt;

supp⁡Y Φ† ⁣[log⁡(ΦX)−log⁡(ΦY)supp⁡(ΦX)]=log⁡X−log⁡Ysupp⁡X;\operatorname{supp}Y\,\Phi^\dagger\!\left[\log(\Phi X)-\log(\Phi Y)\operatorname{supp}(\Phi X)\right] =\log X-\log Y\operatorname{supp}X;suppYΦ†[log(ΦX)−log(ΦY)supp(ΦX)]=logX−logYsuppX;

and R(ΦX)=X\mathcal R(\Phi X)=XR(ΦX)=X. Under ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, the theorem asserts

c0⇒c1⇒c2⇒c3,c3⟺c4⟺c5⟺c6⟺c7⟺c8⇒c9,c_0\Rightarrow c_1\Rightarrow c_2\Rightarrow c_3,\qquad c_3\Longleftrightarrow c_4\Longleftrightarrow c_5 \Longleftrightarrow c_6\Longleftrightarrow c_7 \Longleftrightarrow c_8\Rightarrow c_9,c0​⇒c1​⇒c2​⇒c3​,c3​⟺c4​⟺c5​⟺c6​⟺c7​⟺c8​⇒c9​,

and it asserts c1⇒c2c_1\Rightarrow c_2c1​⇒c2​ without support inclusion. Define nnn-co-positivity on AAA to mean that, whenever a positive semidefinite n×nn\times nn×n block matrix has each transposed block in AAA, applying Z↦Φ(ZT)Z\mapsto\Phi(Z^{\mathsf T})Z↦Φ(ZT) to each block produces a positive semidefinite matrix. Support inclusion, 222-co-positivity, and c9c_9c9​ imply c0c_0c0​. Support inclusion and c0c_0c0​ further imply that every nnn for which Φ\PhiΦ is nnn-co-positive admits a co-stochastic recovery B→AB\to AB→A that is nnn-co-positive and recovers both X,YX,YX,Y; if Φ\PhiΦ is nnn-co-positive for every natural nnn, one co-stochastic recovery has this property for every nnn and recovers both. The quantifiers include n=0n=0n=0, and no nonzero or normalization assumption is imposed on X,YX,YX,Y.

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