Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 4–5 β€” properties (1)–(3) of 𝒰(X) = (Xρ_A^{βˆ’1/2} βŠ— I_B)ρ_AB^{1/2}: 𝒰†Δ_AB𝒰 = Ξ”_A, 𝒰(ρ_A^{1/2}) = ρ_AB^{1/2}, 𝒰†𝒰 = ℐ_A, and its adjoint

Proved
SimpleSSA.Monotone.petz_map_properties

by mikedeng1 Β· Oct 22, 2026 Β· Mathlib 0df444a (Lean v4.33.1)

isometryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrelative-modular-operator

Let ρAB\rho_{AB}ρAB​ and ΟƒAB\sigma_{AB}ΟƒAB​ be invertible density matrices on a composite finite-dimensional system ABABAB, with reduced density matrices ρA=tr⁑BρAB\rho_A = \operatorname{tr}_B\rho_{AB}ρA​=trB​ρAB​ and ΟƒA=tr⁑BΟƒAB\sigma_A = \operatorname{tr}_B\sigma_{AB}ΟƒA​=trB​σAB​. Let Ξ”AB(X)=ΟƒABXρABβˆ’1\Delta_{AB}(X) = \sigma_{AB}X\rho_{AB}^{-1}Ξ”AB​(X)=ΟƒAB​XρABβˆ’1​ and Ξ”A(X)=ΟƒAXρAβˆ’1\Delta_A(X) = \sigma_A X\rho_A^{-1}Ξ”A​(X)=ΟƒA​XρAβˆ’1​ be the relative modular operators on M(AB)M(AB)M(AB) and M(A)M(A)M(A), and define the linear map U:M(A)β†’M(AB)\mathcal U : M(A)\to M(AB)U:M(A)β†’M(AB) by

U(X)=(XρAβˆ’1/2βŠ—IB) ρAB1/2.\mathcal U(X) = (X\rho_A^{-1/2}\otimes I_B)\,\rho_{AB}^{1/2}.U(X)=(XρAβˆ’1/2β€‹βŠ—IB​)ρAB1/2​.

With adjoints taken for the Hilbert–Schmidt inner products ⟨X,Y⟩=tr⁑(X†Y)\langle X,Y\rangle = \operatorname{tr}(X^\dagger Y)⟨X,Y⟩=tr(X†Y):

  1. U†ΔAB U=Ξ”A\mathcal U^\dagger\Delta_{AB}\,\mathcal U = \Delta_AU†ΔAB​U=Ξ”A​;
  2. U(ρA1/2)=ρAB1/2\mathcal U(\rho_A^{1/2}) = \rho_{AB}^{1/2}U(ρA1/2​)=ρAB1/2​;
  3. U†U=IA\mathcal U^\dagger\mathcal U = \mathcal I_AU†U=IA​, the identity map of M(A)M(A)M(A), i.e. U\mathcal UU is an isometry from M(A)M(A)M(A) to M(AB)M(AB)M(AB);
  4. the map U†(Y)=tr⁑B(YρAB1/2(ρAβˆ’1/2βŠ—IB))\mathcal U^\dagger(Y) = \operatorname{tr}_B\big(Y\rho_{AB}^{1/2}(\rho_A^{-1/2}\otimes I_B)\big)U†(Y)=trB​(YρAB1/2​(ρAβˆ’1/2β€‹βŠ—IB​)) is the adjoint of U\mathcal UU: ⟨U†(Y),X⟩=⟨Y,U(X)⟩\langle\mathcal U^\dagger(Y),X\rangle = \langle Y,\mathcal U(X)\rangle⟨U†(Y),X⟩=⟨Y,U(X)⟩ for all X∈M(A)X\in M(A)X∈M(A), Y∈M(AB)Y\in M(AB)Y∈M(AB).

These are the properties (1)–(3) that the proof of monotonicity (4) requires of U\mathcal UU (p. 4), together with the explicit adjoint stated on p. 5. With them, Lemma 2 applied to the isometry U\mathcal UU and Lemma 1 give βˆ’ln⁑(U†ΔABU)β‰€βˆ’U†ln⁑(Ξ”AB)U-\ln(\mathcal U^\dagger\Delta_{AB}\mathcal U)\le-\mathcal U^\dagger\ln(\Delta_{AB})\mathcal Uβˆ’ln(U†ΔAB​U)β‰€βˆ’U†ln(Ξ”AB​)U, the key step (10).

Formalization Note Invertibility of ρAB\rho_{AB}ρAB​ and ΟƒAB\sigma_{AB}ΟƒAB​ is the paper's Β§3 assumption (p. 3). Linear maps on matrices are matrices in the row-major vectorization vec⁑X=(Xij)(i,j)\operatorname{vec}X = (X_{ij})_{(i,j)}vecX=(Xij​)(i,j)​, in which the Hilbert–Schmidt inner product is the standard one; so U\mathcal UU is the matrix whose column (a,aβ€²)(a,a')(a,aβ€²) is vec⁑ U(Eaaβ€²)\operatorname{vec}\,\mathcal U(E_{aa'})vecU(Eaa′​), U†\mathcal U^\daggerU† in items 1 and 3 is its conjugate transpose, Ξ”AB=ΟƒABβŠ—(ρABβˆ’1)T\Delta_{AB} = \sigma_{AB}\otimes(\rho_{AB}^{-1})^TΞ”AB​=ΟƒABβ€‹βŠ—(ρABβˆ’1​)T, Ξ”A=ΟƒAβŠ—(ρAβˆ’1)T\Delta_A = \sigma_A\otimes(\rho_A^{-1})^TΞ”A​=ΟƒAβ€‹βŠ—(ρAβˆ’1​)T, and IA\mathcal I_AIA​ is the identity matrix on CAΓ—A\mathbb C^{A\times A}CAΓ—A. ρ±1/2\rho^{\pm1/2}ρ±1/2 are taken by functional calculus.

Preamble
import Mathlib
import Definitions.Def_SimpleSSA_Monotone_Basic

open scoped Matrix.Norms.L2Operator ComplexOrder Kronecker Matrix
Formal statement
namespace SimpleSSA.Monotone

open TroppMatrixConcentration QAlgorithms WildeQIT

/-- pp. 4–5: for invertible density matrices `ρ_AB`, `Οƒ_AB` (the Β§3 assumption, p. 3), the map
`𝒰(X) = (X ρ_A^{βˆ’1/2} βŠ— I_B) ρ_AB^{1/2}` satisfies (1) `𝒰†Δ_AB𝒰 = Ξ”_A`, (2) `𝒰(ρ_A^{1/2}) = ρ_AB^{1/2}`,
(3) `𝒰†𝒰 = ℐ_A` (an isometry `M(A) β†’ M(AB)`), and `𝒰†(Y) = tr_B(Y ρ_AB^{1/2}(ρ_A^{βˆ’1/2} βŠ— I_B))` is its
adjoint for the Hilbert–Schmidt inner product. -/
theorem petz_map_properties {A B : Type} [Fintype A] [DecidableEq A] [Nonempty A]
    [Fintype B] [DecidableEq B] [Nonempty B]
    (ρ Οƒ : Matrix (A Γ— B) (A Γ— B) β„‚) (hρ : IsDensityMatrix ρ) (hρ_inv : ρ.PosDef)
    (hσ : IsDensityMatrix σ) (hσ_inv : σ.PosDef) :
    (petzMatrix ρ)α΄΄ * modularOp ρ Οƒ * petzMatrix ρ =
        modularOp (partialTraceRight ρ) (partialTraceRight Οƒ) ∧
      petzMap ρ (sqrtM (partialTraceRight ρ)) = sqrtM ρ ∧
      (petzMatrix ρ)ᴴ * petzMatrix ρ = 1 ∧
      βˆ€ (X : Matrix A A β„‚) (Y : Matrix (A Γ— B) (A Γ— B) β„‚),
        hsInner (petzAdjoint ρ Y) X = hsInner Y (petzMap ρ X) := by sorry

end SimpleSSA.Monotone
Source
Nielsen & Petz, A simple proof of the strong subadditivity inequality, arXiv:quant-ph/0408130v3, p. 4, properties (1)–(3) of 𝒰; p. 5, definition of 𝒰, its adjoint 𝒰†, and "Direct calculation now shows that 𝒰†Δ_AB𝒰 = Ξ”_A and 𝒰†𝒰 = ℐ_A"
Human review
  • Endorsed by Shuze Chen Β· Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 Β· Oct 23, 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