Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(8), p. 3, second line — Tr((ρ_Λ ⊗ 𝟙_Λᶜ)(ρ_Λ′ ⊗ 𝟙_Λ′ᶜ)) = (∏_{j∈(Λ∪Λ′)ᶜ} dⱼ) Tr ρ²_{Λ∩Λ′}

Proved
WHAdditivity.Renyi.trace_marginal_product

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1partial-tracepurityreduced-density-matrix

Let N∈NN\in\mathbb NN∈N, let d1,…,dNd_1,\dots,d_Nd1​,…,dN​ be dimensions, and let ρ\rhoρ be any complex matrix on ⨂j=1NCdj\bigotimes_{j=1}^N\mathbb C^{d_j}⨂j=1N​Cdj​. For Λ⊂{1,…,N}\Lambda\subset\{1,\dots,N\}Λ⊂{1,…,N} write ρΛ=Tr⁡Λcρ\rho_\Lambda = \operatorname{Tr}_{\Lambda^{\mathrm c}}\rhoρΛ​=TrΛc​ρ for its reduced matrix on the sites in Λ\LambdaΛ, and ρΛ⊗1Λc\rho_\Lambda\otimes\mathbb 1_{\Lambda^{\mathrm c}}ρΛ​⊗1Λc​ for its tensor product with the identity on the other sites. Then for all Λ,Λ′⊂{1,…,N}\Lambda,\Lambda'\subset\{1,\dots,N\}Λ,Λ′⊂{1,…,N}

Tr⁡((ρΛ⊗1Λc)(ρΛ′⊗1Λ′c))=(∏j∈(Λ∪Λ′)cdj)Tr⁡ρΛ∩Λ′2.\operatorname{Tr}\Bigl(\bigl(\rho_\Lambda\otimes\mathbb 1_{\Lambda^{\mathrm c}}\bigr)\bigl(\rho_{\Lambda'}\otimes\mathbb 1_{\Lambda'^{\mathrm c}}\bigr)\Bigr) = \Bigl(\prod_{j\in(\Lambda\cup\Lambda')^{\mathrm c}} d_j\Bigr)\operatorname{Tr}\rho_{\Lambda\cap\Lambda'}^2 .Tr((ρΛ​⊗1Λc​)(ρΛ′​⊗1Λ′c​))=(j∈(Λ∪Λ′)c∏​dj​)TrρΛ∩Λ′2​.

In the paper ρ\rhoρ is ∣Ωˉ⟩⟨Ωˉ∣|\bar\Omega\rangle\langle\bar\Omega|∣Ωˉ⟩⟨Ωˉ∣, and this identity, summed over Λ,Λ′\Lambda,\Lambda'Λ,Λ′ with the signs (−1)∣Λ∣+∣Λ′∣(-1)^{|\Lambda|+|\Lambda'|}(−1)∣Λ∣+∣Λ′∣, is the step from the first to the second line of the computation (8) of Tr⁡XN(Ω)2\operatorname{Tr}X_N(\Omega)^2TrXN​(Ω)2.

Formalization Note. The complement Λc\Lambda^{\mathrm c}Λc is taken in {1,…,N}\{1,\dots,N\}{1,…,N} (the Finset complement in Fin N). The product over the empty set is 111, and ρ∅\rho_\emptysetρ∅​ is the 1×11\times11×1 matrix (Tr⁡ρ)(\operatorname{Tr}\rho)(Trρ).

Differences from the source:

  • generalization: ρ_Λ the reduced density matrix of |Ω̄⟩⟨Ω̄| for a unit vector Ω → ρ_Λ the reduced matrix of an arbitrary complex matrix ρ; reason: the identity holds for every ρ, and ρ = |Ω̄⟩⟨Ω̄| is the paper's case.
  • generalization: N ≥ 1 implicitly, d_j ≥ 2 → every N ∈ ℕ and every d_j; reason: the identity holds for all dimensions; it specializes to the paper's.
  • encoding: sites 1, …, N → sites Fin N from 0, tensor factors in site order; reason: relabelling only.
Preamble
import Mathlib
import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi

theorem trace_marginal_product (N : ℕ) (d : Fin N → ℕ) (ρ : Matrix (Config d) (Config d) ℂ)
    (Λ Λ' : Finset (Fin N)) :
    (tensorIdentity d Λ (reducedMatrix d Λ ρ) * tensorIdentity d Λ' (reducedMatrix d Λ' ρ)).trace =
      (∏ j ∈ (Λ ∪ Λ')ᶜ, (d j : ℂ)) * (reducedMatrix d (Λ ∩ Λ') ρ ^ 2).trace := by sorry

end WHAdditivity.Renyi
Source
Alicki, Fannes, Note on multiple additivity of minimal Renyi entropy output of the Werner–Holevo channels, arXiv:quant-ph/0407033v2, p. 3, (8), first and second lines
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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