Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (7), p. 2 — d² tr_{A3B3}(ρ_{A3B3} P_{A2A3} P_{B2B3}) = ρ^T_{A2B2}

Proved
EntanglingOps.BinaryPhase.eq_7

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

choi-jamiolkowskimaximally-entangled-statep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let d≥1d\ge1d≥1 and let A2,A3,B2,B3A_2,A_3,B_2,B_3A2​,A3​,B2​,B3​ each be Cd\mathbb C^dCd with the basis S={∣i⟩}i=1dS=\{|i\rangle\}_{i=1}^dS={∣i⟩}i=1d​. Let P=∣Φ⟩⟨Φ∣P=|\Phi\rangle\langle\Phi|P=∣Φ⟩⟨Φ∣ with ∣Φ⟩=d−1/2∑i∣i⟩∣i⟩|\Phi\rangle=d^{-1/2}\sum_i|i\rangle|i\rangle∣Φ⟩=d−1/2∑i​∣i⟩∣i⟩ (Eq. (5)), placed on A2A3A_2A_3A2​A3​ and on B2B3B_2B_3B2​B3​. For every operator ρ\rhoρ on A3B3A_3B_3A3​B3​,

d2 tr⁡A3B3 ⁣(ρA3B3 PA2A3PB2B3)=ρA2B2T,d^2\,\operatorname{tr}_{A_3B_3}\!\big(\rho_{A_3B_3}\,P_{A_2A_3}P_{B_2B_3}\big)=\rho^T_{A_2B_2},d2trA3​B3​​(ρA3​B3​​PA2​A3​​PB2​B3​​)=ρA2​B2​T​,

where ρA2B2T\rho^T_{A_2B_2}ρA2​B2​T​ is the same operator moved to A2B2A_2B_2A2​B2​ and transposed in the basis SA2⊗SB2S_{A_2}\otimes S_{B_2}SA2​​⊗SB2​​.

This is the step of the paper's proof of Eq. (6): a joint projection onto maximally entangled states moves an operator from one pair of systems to another, transposed.

Differences from the source:

  • generalization: ρ_{A3B3} a state → every complex matrix ρ; reason: Eq. (7) is linear in ρ; states are a special case
  • encoding: operators on ℋ_{A2}⊗ℋ_{B2}⊗ℋ_{A3}⊗ℋ_{B3}, basis |1⟩,…,|d⟩ → matrices indexed ((a2,b2),(a3,b3)) over Fin d; ρ_{A3B3} = 𝟙 ⊗ₖ ρ; tr_{A3B3} = partialTraceRight; reason: Lean carrier convention; same operators
  • encoding: dimension d = dim ℋ with basis |1⟩,…,|d⟩ → hypothesis 0 < d on d : ℕ; reason: nondegeneracy only; a Hilbert space with the page's basis S has d ≥ 1, and at d = 0 every matrix is empty
Preamble
import Mathlib
import Definitions.Def_EntanglingOps_BinaryPhase_Model
Formal statement
namespace EntanglingOps.BinaryPhase

open Matrix
open scoped Kronecker

/-- Eq. (7), p. 2: `d² tr_{A₃B₃}(ρ_{A₃B₃} P_{A₂A₃} P_{B₂B₃}) = ρ^T_{A₂B₂}`. The carrier is indexed
`((a₂, b₂), (a₃, b₃))`; `ρ_{A₃B₃}` is `𝟙_{A₂B₂} ⊗ ρ`, `P_{A₂A₃} P_{B₂B₃}` is `projPhiPair d`,
`tr_{A₃B₃}` is `partialTraceRight`, and `ρᵀ` is the transpose in the product basis
`S_{A₂} ⊗ S_{B₂}`. Stated for every matrix `ρ`. -/
theorem eq_7 (d : ℕ) (hd : 0 < d) (ρ : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) :
    ((d : ℂ) ^ 2) • WildeQIT.partialTraceRight
      (((1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) ⊗ₖ ρ) * projPhiPair d) = ρᵀ := by sorry

end EntanglingOps.BinaryPhase
Source
Cirac, Dür, Kraus, Lewenstein, Entangling operations and their implementation using a small amount of entanglement, arXiv:quant-ph/0007057v1, p. 2, Eq. (7)
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