Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered: relative entropy yields E1–E3

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntropy_measure_conditions

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.

The functional ERE_RER​ vanishes exactly on separable states, is invariant under local unitary conjugation, and satisfies expected monotonicity for every complete product-Kraus family Vi=Ai⊗BiV_i=A_i\otimes B_iVi​=Ai​⊗Bi​. With pi=Tr⁡(ViσVi†)p_i=\operatorname{Tr}(V_i\sigma V_i^\dagger)pi​=Tr(Vi​σVi†​),

∑i:pi>0piER ⁣(ViσVi†pi)≤ER(σ).\sum_{i:p_i>0}p_i E_R\!\left(\frac{V_i\sigma V_i^\dagger}{p_i}\right)\le E_R(\sigma).i:pi​>0∑​pi​ER​(pi​Vi​σVi†​​)≤ER​(σ).

These are E1–E3 in the source’s explicit Eq.(1) operational idealization.

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

/-- PDF pp.11–12: relative entropy's concrete measure satisfies E1,E2,E3.
This does not assert the defective printed all-projector F1–F5 package. -/
theorem relativeEntropy_measure_conditions {I J : Type} [Fintype I] [Fintype J]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] :
    MeasureConditions (relativeEntanglementNats (I := I) (J := J)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 11, Unnumbered: relative entropy yields E1–E3
Read-back

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

For every pair of nonempty finite types I,JI,JI,J with decidable equality, define the extended real valued function

E(σ)=inf⁡ρ separableS(σ∥ρ),S(σ∥ρ)={Re⁡tr⁡ ⁣[(σlog⁡σ)−σlog⁡ρ],ker⁡ρ⊆ker⁡σ,+∞,otherwise.E(\sigma)=\inf_{\rho\ \mathrm{separable}}S(\sigma\Vert\rho), \qquad S(\sigma\Vert\rho)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\left[ (\sigma\log\sigma)-\sigma\log\rho\right], &\ker\rho\subseteq\ker\sigma,\\ +\infty,&\text{otherwise}. \end{cases}E(σ)=ρ separableinf​S(σ∥ρ),S(σ∥ρ)={Retr[(σlogσ)−σlogρ],+∞,​kerρ⊆kerσ,otherwise.​

Here the kernels are those of matrix multiplication, σlog⁡σ\sigma\log\sigmaσlogσ means applying x↦xlog⁡xx\mapsto x\log xx↦xlogx by continuous functional calculus, log⁡ρ\log\rhologρ uses the same calculus with the total natural logarithm, and “separable” means admitting a finite decomposition ρ=∑ℓ=0q−1wℓAℓ⊗Bℓ\rho=\sum_{\ell=0}^{q-1}w_\ell A_\ell\otimes B_\ellρ=∑ℓ=0q−1​wℓ​Aℓ​⊗Bℓ​ with wℓ≥0w_\ell\ge0wℓ​≥0, ∑ℓwℓ=1\sum_\ell w_\ell=1∑ℓ​wℓ​=1, and all Aℓ,BℓA_\ell,B_\ellAℓ​,Bℓ​ positive semidefinite with complex trace 111. The assertion is that: for every density matrix σ\sigmaσ, E(σ)=0E(\sigma)=0E(σ)=0 if and only if σ\sigmaσ is separable; for every such σ\sigmaσ and unitaries UUU on III and VVV on JJJ,

E((U⊗V)σ(U⊗V)†)=E(σ);E((U\otimes V)\sigma(U\otimes V)^\dagger)=E(\sigma);E((U⊗V)σ(U⊗V)†)=E(σ);

and for every finite type KKK, every pair of local matrix families LkL_kLk​ on III, RkR_kRk​ on JJJ satisfying

∑k(Lk⊗Rk)†(Lk⊗Rk)=I,\sum_k(L_k\otimes R_k)^\dagger(L_k\otimes R_k)=I,k∑​(Lk​⊗Rk​)†(Lk​⊗Rk​)=I,

and every density matrix σ\sigmaσ, writing Wk=Lk⊗RkW_k=L_k\otimes R_kWk​=Lk​⊗Rk​ and pk=Re⁡tr⁡(WkσWk†)p_k=\operatorname{Re}\operatorname{tr}(W_k\sigma W_k^\dagger)pk​=Retr(Wk​σWk†​), one has

∑k{pk E(pk−1WkσWk†),pk>0,0,pk≤0≤E(σ).\sum_k \begin{cases} p_k\,E(p_k^{-1}W_k\sigma W_k^\dagger),&p_k>0,\\ 0,&p_k\le0 \end{cases} \le E(\sigma).k∑​{pk​E(pk−1​Wk​σWk†​),0,​pk​>0,pk​≤0​≤E(σ).

The sums, products, infimum, and inequalities involving EEE use extended real arithmetic; zero probability branches contribute 000.

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