Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 5.4, affine case 5.4-affine

Proved
QAlgorithms.Papers.Independent.Support50.P12.remark_5_4_affine

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.

Assume Φ\PhiΦ is substochastic, A0≤B0A^0\le B^0A0≤B0, and Tr⁡Φ(B)=Tr⁡B\operatorname{Tr}\Phi(B)=\operatorname{Tr}BTrΦ(B)=TrB. For every real a,ba,ba,b, let f(x)=b+axf(x)=b+axf(x)=b+ax. Then Tr⁡Φ(A)=Tr⁡A\operatorname{Tr}\Phi(A)=\operatorname{Tr}ATrΦ(A)=TrA and

Sf(Φ(A)∥Φ(B))=bTr⁡Φ(B)+aTr⁡Φ(A)=bTr⁡B+aTr⁡A=Sf(A∥B).S_f(\Phi(A)\Vert\Phi(B))=b\operatorname{Tr}\Phi(B)+a\operatorname{Tr}\Phi(A)=b\operatorname{Tr}B+a\operatorname{Tr}A=S_f(A\Vert B).Sf​(Φ(A)∥Φ(B))=bTrΦ(B)+aTrΦ(A)=bTrB+aTrA=Sf​(A∥B).

Affine preservation is automatic and imposes no reversibility conclusion.

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.4 (affine case), PDF p.25: affine equality is automatic on a supported
pair, including the displayed trace formula. No reversibility conclusion is imposed. -/
theorem remark_5_4_affine [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) (htr : tr (Phi Y) = tr Y)
    (hs : Supports X Y) (a b : ℝ) :
    tr (Phi X) = tr X ∧
    div (fun x => b + a * x) (Phi X) (Phi Y) = ((b * tr (Phi Y) + a * tr (Phi X) : ℝ) : EReal) ∧
    div (fun x => b + a * x) (Phi X) (Phi Y) = div (fun x => b + a * x) X Y ∧
    div (fun x => b + a * x) X Y = ((b * tr Y + a * tr X : ℝ) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 25, Remark 5.4, affine case 5.4-affine
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. Assume that Φ\PhiΦ maps all ambient matrices into BBB, its Hilbert–Schmidt adjoint (Φ†Z)ij=∑k,lΦ(Eij)kl‾Zkl(\Phi^\dagger Z)_{ij}=\sum_{k,l}\overline{\Phi(E_{ij})_{kl}}Z_{kl}(Φ†Z)ij​=∑k,l​Φ(Eij​)kl​​Zkl​ maps all ambient matrices into AAA, this adjoint is positive on positive elements of BBB, and (Φ†Z)∗Φ†Z⪯Φ†(Z∗Z)(\Phi^\dagger Z)^*\Phi^\dagger Z\preceq\Phi^\dagger(Z^*Z)(Φ†Z)∗Φ†Z⪯Φ†(Z∗Z) for every Z∈BZ\in BZ∈B. Let X,Y∈AX,Y\in AX,Y∈A be positive semidefinite, with tr⁡ΦY=tr⁡Y\operatorname{tr}\Phi Y=\operatorname{tr}YtrΦY=trY and ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and let a,b∈Ra,b\in\mathbb Ra,b∈R be arbitrary. For g(x)=b+axg(x)=b+axg(x)=b+ax, 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.​

Here powers vanish at eigenvalue zero, sp⁡\operatorname{sp}sp is the distinct spectrum for a Hermitian matrix and is empty otherwise, PλP_\lambdaPλ​ is the orthogonal eigenspace projection, division by zero is zero, and the second branch is the total extended real selected limit. Then

tr⁡ΦX=tr⁡X,Dg(ΦX,ΦY)=b tr⁡ΦY+a tr⁡ΦX=Dg(X,Y)=b tr⁡Y+a tr⁡X,\operatorname{tr}\Phi X=\operatorname{tr}X,\qquad D_g(\Phi X,\Phi Y)=b\,\operatorname{tr}\Phi Y+a\,\operatorname{tr}\Phi X =D_g(X,Y)=b\,\operatorname{tr}Y+a\,\operatorname{tr}X,trΦX=trX,Dg​(ΦX,ΦY)=btrΦY+atrΦX=Dg​(X,Y)=btrY+atrX,

with each real expression embedded into the extended real line. Singular, zero, and unnormalized X,YX,YX,Y are included, and no signs are imposed on a,ba,ba,b.

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