Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered E3*: product input expected monotonicity

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.product_expected_monotonicity

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 σ1,…,σn\sigma_1,\ldots,\sigma_nσ1​,…,σn​ be bipartite density matrices, possibly on different local dimensions, and put Σ=⨂jσj\Sigma=\bigotimes_j\sigma_jΣ=⨂j​σj​, grouping all Alice factors against all Bob factors. For every complete product-Kraus family Vi=Ai⊗BiV_i=A_i\otimes B_iVi​=Ai​⊗Bi​ across that cut, let pi=Tr⁡(ViΣVi†)p_i=\operatorname{Tr}(V_i\Sigma V_i^\dagger)pi​=Tr(Vi​ΣVi†​). Then

∑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​(Σ).

The input remains the entanglement of the whole product; no additivity is assumed.

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.11, E3*, Eq.(24): expected monotonicity for a product of input states,
without replacing the input's entanglement by a sum of individual values. -/
theorem product_expected_monotonicity {n : ℕ} {I J : Fin n → Type}
    [∀ t, Fintype (I t)] [∀ t, Fintype (J t)]
    [∀ t, DecidableEq (I t)] [∀ t, DecidableEq (J t)]
    [∀ t, Nonempty (I t)] [∀ t, Nonempty (J t)]
    (sigma : ∀ t, Matrix (I t × J t) (I t × J t) ℂ)
    (hsigma : ∀ t, IsDensityMatrix (sigma t))
    {K : Type} [Fintype K]
    (L : K → Matrix (∀ t, I t) (∀ t, I t) ℂ)
    (R : K → Matrix (∀ t, J t) (∀ t, J t) ℂ) (hcomplete : ProductComplete L R) :
    let input := groupedStateProduct sigma
    let V := fun k => Matrix.kronecker (L k) (R k)
    (∑ k, if 0 < rectangularKrausProbability V input k then
      (rectangularKrausProbability V input k : EReal) * relativeEntanglementNats (normalizedBranch V input k)
      else 0) ≤ relativeEntanglementNats input := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 11, Unnumbered E3*: product input expected monotonicity
Read-back

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

For every natural number nnn, every pair of families of finite nonempty types It,JtI_t,J_tIt​,Jt​, indexed by t=0,…,n−1t=0,\ldots,n-1t=0,…,n−1, with decidable equality on each type, and every family of positive semidefinite matrices σt\sigma_tσt​ on It×JtI_t\times J_tIt​×Jt​ with trace 111, form the matrix Σ\SigmaΣ on (∏tIt)×(∏tJt)(\prod_t I_t)\times(\prod_t J_t)(∏t​It​)×(∏t​Jt​) whose entries are Σ(i,j),(i′,j′)=∏t(σt)(it,jt),(it′,jt′)\Sigma_{(i,j),(i',j')}=\prod_t(\sigma_t)_{(i_t,j_t),(i'_t,j'_t)}Σ(i,j),(i′,j′)​=∏t​(σt​)(it​,jt​),(it′​,jt′​)​. For every finite type KKK and families of square complex matrices LkL_kLk​ on ∏tIt\prod_t I_t∏t​It​ and RkR_kRk​ on ∏tJt\prod_t J_t∏t​Jt​, put Vk=Lk⊗RkV_k=L_k\otimes R_kVk​=Lk​⊗Rk​ and assume ∑kVk†Vk=1\sum_k V_k^\dagger V_k=1∑k​Vk†​Vk​=1. Define Bk=VkΣVk†B_k=V_k\Sigma V_k^\daggerBk​=Vk​ΣVk†​ and pk=Re⁡tr⁡Bkp_k=\operatorname{Re}\operatorname{tr}B_kpk​=RetrBk​. For a bipartite matrix AAA, let E(A)=inf⁡ω separableD(A∥ω)E(A)=\inf_{\omega\text{ separable}}D(A\Vert\omega)E(A)=infω separable​D(A∥ω), where “separable” means that ω\omegaω is a finite sum ∑jwjAj⊗Bj\sum_j w_j A_j\otimes B_j∑j​wj​Aj​⊗Bj​ with nonnegative real weights summing to 111 and positive semidefinite trace-one factors Aj,BjA_j,B_jAj​,Bj​, and where

D(A∥B)={Re⁡tr⁡ ⁣(f(A)−Alog⁡B),ker⁡B⊆ker⁡A,+∞,otherwise,f(u)=ulog⁡u,D(A\Vert B)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\left(f(A)-A\log B\right),& \ker B\subseteq\ker A,\\ +\infty,&\text{otherwise}, \end{cases} \qquad f(u)=u\log u,D(A∥B)={Retr(f(A)−AlogB),+∞,​kerB⊆kerA,otherwise,​f(u)=ulogu,

with matrix functions interpreted by continuous functional calculus and the total real logarithm satisfying log⁡0=0\log0=0log0=0. Then, in the extended real numbers,

∑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 quantification includes n=0n=0n=0, when both product index types are singletons and the empty product defining Σ\SigmaΣ is 111. An empty KKK cannot satisfy the completeness hypothesis 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