Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6: comparison with entanglement of creation

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntanglement_le_formation

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.

Define the creation/formation roof by Ec(σ)=inf⁡σ=∑ipi∣ψi⟩⟨ψi∣∑ipiS(Tr⁡A∣ψi⟩⟨ψi∣)E_c(\sigma)=\inf_{\sigma=\sum_i p_i|\psi_i\rangle\langle\psi_i|}\sum_i p_i S(\operatorname{Tr}_A|\psi_i\rangle\langle\psi_i|)Ec​(σ)=infσ=∑i​pi​∣ψi​⟩⟨ψi​∣​∑i​pi​S(TrA​∣ψi​⟩⟨ψi​∣), over finite ensembles of unit vectors with nonnegative weights summing to one. Then

ER(σ)≤Ec(σ).E_R(\sigma)\le E_c(\sigma).ER​(σ)≤Ec​(σ).

This compares static functionals; it does not identify a one-copy roof with an asymptotic operational cost.

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 6, PDF p.16, corrected by Eq.(6) and proof (40)–(41): E_R ≤ E_c.
The printed identification of E_c with min S is erroneous; creation is the pure-state roof. -/
theorem relativeEntanglement_le_formation {I J : Type} [Fintype I] [Fintype J]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
    (sigma : Matrix (I × J) (I × J) ℂ) (hsigma : IsDensityMatrix sigma) :
    relativeEntanglementNats sigma ≤ formationNats sigma := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 16, Theorem 6: comparison with entanglement of creation
Read-back

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

For finite nonempty types I,JI,JI,J with decidable equality and every positive semidefinite matrix σ\sigmaσ on I×JI\times JI×J of trace 111, let E(σ)=inf⁡ω separableD(σ∥ω)E(\sigma)=\inf_{\omega\text{ separable}}D(\sigma\Vert\omega)E(σ)=infω separable​D(σ∥ω), 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) when ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, and +∞+\infty+∞ otherwise, using functional calculus, f(u)=ulog⁡uf(u)=u\log uf(u)=ulogu, and log⁡0=0\log0=0log0=0. For a matrix PPP on I×JI\times JI×J, write 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′)) and H(PJ)=−Re⁡tr⁡f(PJ)H(P_J)=-\operatorname{Re}\operatorname{tr}f(P_J)H(PJ​)=−Retrf(PJ​). Then

E(σ)≤inf⁡{∑k=0m−1wkH((ψkψk†)J):m∈N,wk≥0,∑kwk=1,ψk∈CI×J,∥ψk∥=1,σ=∑kwkψkψk†},E(\sigma)\le \inf\left\{ \sum_{k=0}^{m-1}w_kH\bigl((\psi_k\psi_k^\dagger)_J\bigr): \begin{array}{l} m\in\mathbb N,\quad w_k\ge0,\quad \sum_k w_k=1,\\ \psi_k\in\mathbb C^{I\times J},\quad \|\psi_k\|=1,\\ \sigma=\sum_k w_k\psi_k\psi_k^\dagger \end{array} \right\},E(σ)≤inf⎩⎨⎧​k=0∑m−1​wk​H((ψk​ψk†​)J​):m∈N,wk​≥0,∑k​wk​=1,ψk​∈CI×J,∥ψk​∥=1,σ=∑k​wk​ψk​ψk†​​⎭⎬⎫​,

where the infimum and inequality are in the extended reals. Zero weights are allowed; m=0m=0m=0 cannot meet the weight-sum condition.

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