Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered: indicator measure satisfies E1–E3

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.indicator_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.

Define Eind(σ)=0E_{\mathrm{ind}}(\sigma)=0Eind​(σ)=0 for separable states and 111 otherwise. This functional vanishes exactly on separable states, is invariant under local unitaries, and 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†​), obeys

∑i:pi>0piEind ⁣(ViσVi†pi)≤Eind(σ).\sum_{i:p_i>0}p_i E_{\mathrm{ind}}\!\left(\frac{V_i\sigma V_i^\dagger}{p_i}\right)\le E_{\mathrm{ind}}(\sigma).i:pi​>0∑​pi​Eind​(pi​Vi​σVi†​​)≤Eind​(σ).

It therefore satisfies all three source conditions E1–E3.

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 p.19: the indicator measure satisfies all three conditions, including expected E3. -/
theorem indicator_measure_conditions {I J : Type} [Fintype I] [Fintype J]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] :
    MeasureConditions (entanglementIndicator (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. 19, Unnumbered: indicator measure satisfies E1–E3
Read-back

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

For every pair of finite nonempty types I,JI,JI,J with decidable equality, define e(A)=0e(A)=0e(A)=0 if AAA is separable and e(A)=1e(A)=1e(A)=1 otherwise, as an extended-real-valued function on matrices on I×JI\times JI×J; separability means admitting a finite expression ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and positive semidefinite trace-one factors Aj,BjA_j,B_jAj​,Bj​. Three properties hold: for every positive semidefinite trace-one σ\sigmaσ, e(σ)=0e(\sigma)=0e(σ)=0 if and only if σ\sigmaσ is separable; for every such σ\sigmaσ and every pair of unitary matrices 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 family of square matrices LkL_kLk​ on III and RkR_kRk​ on JJJ satisfying ∑kWk†Wk=1\sum_k W_k^\dagger W_k=1∑k​Wk†​Wk​=1, where Wk=Lk⊗RkW_k=L_k\otimes R_kWk​=Lk​⊗Rk​, and every positive semidefinite trace-one σ\sigmaσ, putting Bk=WkσWk†B_k=W_k\sigma W_k^\daggerBk​=Wk​σWk†​ and pk=Re⁡tr⁡Bkp_k=\operatorname{Re}\operatorname{tr}B_kpk​=RetrBk​ gives

∑k∈K{pk e(pk−1Bk),pk>0,0,pk≤0≤e(σ).\sum_{k\in K} \begin{cases} p_k\,e(p_k^{-1}B_k),&p_k>0,\\ 0,&p_k\le0 \end{cases} \le e(\sigma).k∈K∑​{pk​e(pk−1​Bk​),0,​pk​>0,pk​≤0​≤e(σ).

The completeness condition cannot hold for empty KKK on these nonempty registers.

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