Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 6.10

Open
QAlgorithms.Papers.Independent.Support50.P12.corollary_6_10

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 Φ\PhiΦ is substochastic, Tr⁡Φ(B)=Tr⁡B\operatorname{Tr}\Phi(B)=\operatorname{Tr}BTrΦ(B)=TrB, A0=B0A^0=B^0A0=B0, and Tr⁡A=Tr⁡B\operatorname{Tr}A=\operatorname{Tr}BTrA=TrB. Then

C(Φ(A)∥Φ(B))=C(A∥B)⟹ΦB∗(Φ(A))=A.C(\Phi(A)\Vert\Phi(B))=C(A\Vert B)\quad\Longrightarrow\quad\Phi_B^*(\Phi(A))=A.C(Φ(A)∥Φ(B))=C(A∥B)⟹ΦB∗​(Φ(A))=A.

This replaces, rather than inherits, the interior-preservation disjunction. The zero pair is included.

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]

/-- Corollary 6.10, PDF p.32: equal supports and traces replace the interior
hypothesis; the zero pair is included. -/
theorem corollary_6_10 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
    (hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
    (hXp : X.PosSemidef) (hYp : Y.PosSemidef) (hs : supp X = supp Y)
    (htrace : tr X = tr Y) (htr : tr (Phi Y) = tr Y)
    (heq : chernoff (Phi X) (Phi Y) = chernoff X Y) :
    petz Y Phi (Phi X) = X := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 32, Corollary 6.10
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, let A⊆MI(C)\mathcal A\subseteq M_I(\mathbb C)A⊆MI​(C) and B⊆MJ(C)\mathcal B\subseteq M_J(\mathbb C)B⊆MJ​(C) be unital complex star subalgebras, and let Φ:MI(C)→MJ(C)\Phi:M_I(\mathbb C)\to M_J(\mathbb C)Φ:MI​(C)→MJ​(C) be complex linear. Write Φ∗\Phi^*Φ∗ for its Hilbert–Schmidt adjoint and tr⁡RZ=Re⁡Tr⁡Z\operatorname{tr}_{\mathbb R}Z=\operatorname{Re}\operatorname{Tr}ZtrR​Z=ReTrZ. Assume that Φ(Z)∈B\Phi(Z)\in\mathcal BΦ(Z)∈B for every matrix ZZZ, that Φ∗(W)∈A\Phi^*(W)\in\mathcal AΦ∗(W)∈A for every matrix WWW, and that Φ∗\Phi^*Φ∗ is positive on B\mathcal BB and satisfies

Φ∗(W)†Φ∗(W)≤Φ∗(W†W)(W∈B),\Phi^*(W)^\dagger\Phi^*(W)\le \Phi^*(W^\dagger W)\qquad(W\in\mathcal B),Φ∗(W)†Φ∗(W)≤Φ∗(W†W)(W∈B),

where matrix inequalities mean that the difference is positive semidefinite. For a positive semidefinite matrix ZZZ, write Z[t]Z^{[t]}Z[t] for functional calculus with the scalar function equal to xtx^txt when x≠0x\ne0x=0 and equal to 000 at x=0x=0x=0; thus Z[0]Z^{[0]}Z[0] is its support projection. Define

C(Z,W)=sup⁡0≤a<1[−log⁡+tr⁡R ⁣(Z[a]W[1−a])],log⁡+u={log⁡u,u>0,−∞,u≤0.\mathcal C(Z,W)= \sup_{0\le a<1} \left[-\log_+\operatorname{tr}_{\mathbb R}\!\left(Z^{[a]}W^{[1-a]}\right)\right], \qquad \log_+u= \begin{cases}\log u,&u>0,\\-\infty,&u\le0.\end{cases}C(Z,W)=0≤a<1sup​[−log+​trR​(Z[a]W[1−a])],log+​u={logu,−∞,​u>0,u≤0.​

If X,Y∈AX,Y\in\mathcal AX,Y∈A are positive semidefinite, have equal support projections and equal real traces, satisfy tr⁡RΦ(Y)=tr⁡RY\operatorname{tr}_{\mathbb R}\Phi(Y)=\operatorname{tr}_{\mathbb R}YtrR​Φ(Y)=trR​Y, and satisfy C(Φ(X),Φ(Y))=C(X,Y)\mathcal C(\Phi(X),\Phi(Y))=\mathcal C(X,Y)C(Φ(X),Φ(Y))=C(X,Y), then

Y[1/2]Φ∗ ⁣(Φ(Y)[−1/2]Φ(X)Φ(Y)[−1/2])Y[1/2]=X.Y^{[1/2]}\Phi^*\!\left( \Phi(Y)^{[-1/2]}\Phi(X)\Phi(Y)^{[-1/2]} \right)Y^{[1/2]}=X.Y[1/2]Φ∗(Φ(Y)[−1/2]Φ(X)Φ(Y)[−1/2])Y[1/2]=X.

There is no trace-one or nonzero hypothesis on X,YX,YX,Y; in particular, their simultaneous zero case is 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