Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3: pure-state relative entropy of entanglement

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.pure_relativeEntanglement

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, 0ln⁡0=00\ln0=00ln0=0, and Umegaki relative entropy S(σ∥ρ)S(\sigma\Vert\rho)S(σ∥ρ) is +∞+\infty+∞ on failure of support inclusion. The relative entropy of entanglement is ER(σ)=inf⁡ρ∈SepS(σ∥ρ)E_R(\sigma)=\inf_{\rho\in\mathrm{Sep}}S(\sigma\Vert\rho)ER​(σ)=infρ∈Sep​S(σ∥ρ), where separability is across the specified Alice:Bob cut.

Let {uk}\{u_k\}{uk​} and {vk}\{v_k\}{vk​} be finite orthonormal local families, and let pk≥0p_k\ge0pk​≥0 sum to one. Put ∣ψ⟩=∑kpk∣ukvk⟩|\psi\rangle=\sum_k\sqrt{p_k}|u_kv_k\rangle∣ψ⟩=∑k​pk​​∣uk​vk​⟩, σ=∣ψ⟩⟨ψ∣\sigma=|\psi\rangle\langle\psi|σ=∣ψ⟩⟨ψ∣, and σB=Tr⁡Aσ\sigma_B=\operatorname{Tr}_A\sigmaσB​=TrA​σ. Then

ER(σ)=−∑kpkln⁡pk=−Tr⁡(σBln⁡σB).E_R(\sigma)=-\sum_kp_k\ln p_k=-\operatorname{Tr}(\sigma_B\ln\sigma_B).ER​(σ)=−k∑​pk​lnpk​=−Tr(σB​lnσB​).

This identifies pure-state relative entropy of entanglement with reduced entropy, including zero Schmidt weights and unequal local dimensions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Theorem 3, PDF pp.12–14: arbitrary finite-dimensional pure-state relative entropy
of entanglement equals its Schmidt entropy and its reduced von Neumann entropy. -/
theorem pure_relativeEntanglement {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] (s : FiniteSchmidtExpansion I J K) :
    relativeEntanglementNats (pureDensity (finiteSchmidtVector s)) = (finiteSchmidtEntropyNats s : EReal) ∧
    relativeEntanglementNats (pureDensity (finiteSchmidtVector s)) =
      (entropy (traceLeft (pureDensity (finiteSchmidtVector s))) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 12, Theorem 3: pure-state relative entropy of entanglement
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let I,J,KI,J,KI,J,K be finite types, with decidable equality on I,JI,JI,J, and with I,JI,JI,J nonempty. Suppose sss consists of nonnegative real weights wkw_kwk​ satisfying ∑kwk=1\sum_k w_k=1∑k​wk​=1, an orthonormal family ak∈CIa_k\in\mathbb C^Iak​∈CI, and an orthonormal family bk∈CJb_k\in\mathbb C^Jbk​∈CJ. Set ψ(i,j)=∑kwk ak(i)bk(j)\psi(i,j)=\sum_k\sqrt{w_k}\,a_k(i)b_k(j)ψ(i,j)=∑k​wk​​ak​(i)bk​(j), P=ψψ†P=\psi\psi^\daggerP=ψψ†, and PJ(j,j′)=∑iP((i,j),(i,j′))P_J(j,j')=\sum_iP((i,j),(i,j'))PJ​(j,j′)=∑i​P((i,j),(i,j′)). Define E(A)=inf⁡ω separableD(A∥ω)E(A)=\inf_{\omega\text{ separable}}D(A\Vert\omega)E(A)=infω separable​D(A∥ω), where separable matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices, and D(A∥B)=Re⁡tr⁡(f(A)−Alog⁡B)D(A\Vert B)=\operatorname{Re}\operatorname{tr}(f(A)-A\log B)D(A∥B)=Retr(f(A)−AlogB) if ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, and +∞+\infty+∞ otherwise, with f(u)=ulog⁡uf(u)=u\log uf(u)=ulogu, functional-calculus matrix functions, and log⁡0=0\log0=0log0=0. Then both equalities hold in the extended reals:

E(P)=−∑k∈Kwklog⁡wk,E(P)=−Re⁡tr⁡f(PJ).E(P)=-\sum_{k\in K}w_k\log w_k, \qquad E(P)=-\operatorname{Re}\operatorname{tr}f(P_J).E(P)=−k∈K∑​wk​logwk​,E(P)=−Retrf(PJ​).

Zero weights are allowed. Although KKK is not assumed nonempty, its weights cannot sum to 111 when KKK is empty.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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