Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 6.7

Open
QAlgorithms.Papers.Independent.Support50.P12.remark_6_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.

In Theorem 5.1's supported setting, assume Φ\PhiΦ is also two-positive. Then

Sα(Φ(A)∥Φ(B))=Sα(A∥B) for some 0<α<1 ⟹ ΦB∗(Φ(A))=AS_\alpha(\Phi(A)\Vert\Phi(B))=S_\alpha(A\Vert B)\text{ for some }0<\alpha<1\ \Longrightarrow\ \Phi_B^*(\Phi(A))=ASα​(Φ(A)∥Φ(B))=Sα​(A∥B) for some 0<α<1 ⟹ ΦB∗​(Φ(A))=A

and one stochastic map recovers both AAA and BBB. At α=0\alpha=0α=0, the explicit pair and map of Example 6.6 have preservation without recovery. Thus the interior condition has mathematical content.

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 6.7, PDF p.31: interior Rényi preservation implies the Petz identity
and reversibility; zero order fails for the explicit Example 6.6 pair. -/
theorem remark_6_7 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
    (hp : Substochastic A B Phi) (h2 : AlgebraKPositive A Phi 2)
    (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) :
    ((∃ a ∈ Ioo (0 : ℝ) 1, petzRenyi a (Phi X) (Phi Y) = petzRenyi a X Y) →
      petz Y Phi (Phi X) = X ∧ Reversible A B Phi X Y) ∧
    (petzRenyi 0 (merge exampleRho) (merge exampleSigma) = petzRenyi 0 exampleRho exampleSigma ∧
      ¬ Reversible (diagonalAlgebra (Fin 3)) (diagonalAlgebra (Fin 3)) merge exampleRho exampleSigma) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 31, Remark 6.7
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)A\subseteq M_I(\mathbb C)A⊆MI​(C), B⊆MJ(C)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. Assume that Φ\PhiΦ maps every matrix into BBB, its Hilbert–Schmidt adjoint Φ†\Phi^\daggerΦ† maps every matrix into AAA, and Φ†\Phi^\daggerΦ† is positive on BBB and satisfies (Φ†Z)†Φ†Z≤Φ†(Z†Z)(\Phi^\dagger Z)^\dagger\Phi^\dagger Z\le\Phi^\dagger(Z^\dagger Z)(Φ†Z)†Φ†Z≤Φ†(Z†Z) for every Z∈BZ\in BZ∈B. Assume also that applying Φ\PhiΦ blockwise to any positive semidefinite 2×22\times22×2 block matrix whose blocks lie in AAA preserves positive semidefiniteness. Let X,Y∈AX,Y\in AX,Y∈A be positive semidefinite, assume ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and assume Re⁡Tr⁡(ΦY)=Re⁡Tr⁡Y\operatorname{Re}\operatorname{Tr}(\Phi Y)=\operatorname{Re}\operatorname{Tr}YReTr(ΦY)=ReTrY. For 0≤a<10\le a<10≤a<1, define

Da(Z,W)=ℓ(Re⁡Tr⁡(Z[a]W[1−a]))a−1,D_a(Z,W)=\frac{\ell(\operatorname{Re}\operatorname{Tr}(Z^{[a]}W^{[1-a]}))}{a-1},Da​(Z,W)=a−1ℓ(ReTr(Z[a]W[1−a]))​,

where Z[a]Z^{[a]}Z[a] is the spectral power with value 000 at zero for every exponent and ℓ(q)=ln⁡q\ell(q)=\ln qℓ(q)=lnq for q>0q>0q>0, −∞-\infty−∞ otherwise. If Da(ΦX,ΦY)=Da(X,Y)D_a(\Phi X,\Phi Y)=D_a(X,Y)Da​(ΦX,ΦY)=Da​(X,Y) for some a∈(0,1)a\in(0,1)a∈(0,1), then

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

and there exists a complex-linear recovery map Ψ:MJ(C)→MI(C)\Psi:M_J(\mathbb C)\to M_I(\mathbb C)Ψ:MJ​(C)→MI​(C) with Ψ(ΦX)=X\Psi(\Phi X)=XΨ(ΦX)=X, Ψ(ΦY)=Y\Psi(\Phi Y)=YΨ(ΦY)=Y, whose range lies in AAA, whose adjoint’s range lies in BBB, which preserves trace on BBB, and whose adjoint is positive on AAA and satisfies its Schwarz inequality there. Independently, for ρ0=diag⁡(2/3,1/3,0)\rho_0=\operatorname{diag}(2/3,1/3,0)ρ0​=diag(2/3,1/3,0), σ0=diag⁡(1/6,1/3,1/2)\sigma_0=\operatorname{diag}(1/6,1/3,1/2)σ0​=diag(1/6,1/3,1/2), and μ(Z)=diag⁡(Z00+Z11,0,Z22)\mu(Z)=\operatorname{diag}(Z_{00}+Z_{11},0,Z_{22})μ(Z)=diag(Z00​+Z11​,0,Z22​), one has D0(μρ0,μσ0)=D0(ρ0,σ0)D_0(\mu\rho_0,\mu\sigma_0)=D_0(\rho_0,\sigma_0)D0​(μρ0​,μσ0​)=D0​(ρ0​,σ0​), but no recovery map satisfying those algebra-extension, trace-preservation, positivity and adjoint Schwarz conditions for the diagonal 3×33\times33×3 algebra recovers both states. No trace-one hypothesis is imposed on the general matrices 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