Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered pure-state corollary of Proposition 4, Eq. (10)

Open
QAlgorithms.Papers.Independent.Support50.P16.pure_state_regularized_values

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ψAB\psi_{AB}ψAB​ be a normalized pure-state density matrix on nonzero finite-dimensional registers, and let S(ψA)=−Tr⁡ψAlog⁡2ψAS(\psi_A)=-\operatorname{Tr}\psi_A\log_2\psi_AS(ψA​)=−TrψA​log2​ψA​ with ψA=Tr⁡BψAB\psi_A=\operatorname{Tr}_B\psi_{AB}ψA​=TrB​ψAB​. For each measurement class M∈{LO,1-LOCC,LOCC,SEP,PPT}\mathcal M\in\{\mathrm{LO},1\text{-LOCC},\mathrm{LOCC},\mathrm{SEP},\mathrm{PPT}\}M∈{LO,1-LOCC,LOCC,SEP,PPT}, define Er,ME_{r,\mathcal M}Er,M​ by minimizing the optimized measured relative entropy over separable states; one-way communication is from AAA to BBB. Then the following actual limits exist:

lim⁡n→∞1nEr,M(ψAB⊗n)=Er,M∞(ψAB)=S(ψA)for every such M.\lim_{n\to\infty}\frac1n E_{r,\mathcal M}(\psi_{AB}^{\otimes n})=E_{r,\mathcal M}^\infty(\psi_{AB})=S(\psi_A) \quad\text{for every such }\mathcal M.n→∞lim​n1​Er,M​(ψAB⊗n​)=Er,M∞​(ψAB​)=S(ψA​)for every such M.

Each laboratory holds all its copies. The LO case is included; no equality between the single-copy value and the marginal entropy is asserted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P16
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P16

noncomputable section

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

local notation "tau" => QAlgorithms.Papers.Independent.Information100.P76.maximallyMixed

local notation "RE" => QAlgorithms.Papers.Independent.Information100.P54.relativeEntanglement

local notation "RER" => QAlgorithms.Papers.Independent.Information100.P54.regularizedEntanglement

local notation "SQ" => QAlgorithms.Papers.Independent.Dependency50.P19.squashed

local notation "CMI" => QAlgorithms.Papers.Independent.Dependency50.P19.conditionalMutual

local notation "MI" => QAlgorithms.Papers.Independent.Dependency50.P19.mutualInformation

local notation "LOCC" => QAlgorithms.Papers.Independent.Information100.P21.FiniteLOCC

local notation "power" => QAlgorithms.Papers.Independent.Dependency50.P42.dimensionedPower

local notation "index" => QAlgorithms.Papers.Independent.Dependency50.P42.copyIndex

-- Accepted matrix coordinates (not P50.Bipartite, which is a vector space).

local notation "Bipartite" => QAlgorithms.Papers.Independent.Dependency50.P50.BipartiteMat

-- Positive outcome counts follow already from a POVM on a nonzero register.

local notation "FiniteMeasurement" => QAlgorithms.Papers.Independent.Information100.P04.Measurement

local notation "relative" =>
  ((fun _ _ rho => RE rho) : ExtendedEntanglementFunctional)

-- Reuse the accepted operational/variational quantity through a typed notation.

local notation "squashed" =>
  ((fun _ _ rho => ENNReal.ofReal (SQ rho)) : ExtendedEntanglementFunctional)

local notation "originalMarginal" => QAlgorithms.Papers.Independent.Information100.P04.principalMarginal

-- Exact accepted partial trace of the same AA'BB' extension.

local notation "ancillaryMarginal" => QAlgorithms.Papers.Independent.Information100.P04.ancillaryMarginal

local notation "distillable" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Gap48.P32.twoWayDistillable rho)) : ExtendedEntanglementFunctional)

local notation "cost" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Dependency50.P42.alternativeCost
    (fun _ _ X Y => traceNorm (X-Y)) rho)) : ExtendedEntanglementFunctional)

/-- Pure-state corollary, Eq.(10), PDF p.5; proof pp.12--13.
This asserts the actual limits for all five classes, including LO. -/
theorem pure_state_regularized_values {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho)
    (hpure : QAlgorithms.Papers.Independent.Information100.P08.IsPure rho) :
    ∀ c : MeasurementKind, Regularizes (measuredEntanglement c) rho ∧
      regularized (measuredEntanglement c) rho = ENNReal.ofReal (vnEntropy (traceRight rho)) := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 5, Unnumbered pure-state corollary of Proposition 4, Eq. (10)
Read-back

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

For positive integers a,ba,ba,b, let ρ\rhoρ be a positive semidefinite trace-one matrix on the pair index of dimensions a,ba,ba,b, and additionally assume that ρuv=vuvv‾\rho_{uv}=v_u\overline{v_v}ρuv​=vu​vv​​ for some complex vector vvv of Euclidean norm 111. For each measurement kind c∈{LO,oneWay,LOCC,SEP,PPT}c\in\{\mathrm{LO},\mathrm{oneWay},\mathrm{LOCC},\mathrm{SEP},\mathrm{PPT}\}c∈{LO,oneWay,LOCC,SEP,PPT}, define Ec(ω)=inf⁡ζ separable densitysup⁡M∈McD2(pωM∥pζM)E_c(\omega)=\inf_{\zeta\ \mathrm{separable\ density}}\sup_{M\in\mathcal M_c}D_2(p^M_\omega\|p^M_\zeta)Ec​(ω)=infζ separable density​supM∈Mc​​D2​(pωM​∥pζM​), where separable densities are finite convex combinations of products of density matrices and pωM(x)=Re⁡tr⁡(Mxω)p^M_\omega(x)=\operatorname{Re}\operatorname{tr}(M_x\omega)pωM​(x)=Retr(Mx​ω). Here D2D_2D2​ is +∞+\infty+∞ if px>0p_x>0px​>0 but qx≤0q_x\le0qx​≤0 for some outcome, otherwise ofReal⁡∑xpx(log⁡2px−log⁡2qx)\operatorname{ofReal}\sum_xp_x(\log_2p_x-\log_2q_x)ofReal∑x​px​(log2​px​−log2​qx​). The five classes consist respectively of grouped product POVMs, grouped Alice-to-Bob conditional POVMs, POVMs implemented by the code’s LOCC predicate, POVMs with effects expressible as finite nonnegative sums of products of density matrices, and POVMs with positive semidefinite partial transposes; all POVMs have positive semidefinite effects summing to the identity. The definition of that LOCC predicate is not supplied. Writing ρ⊗n\rho^{\otimes n}ρ⊗n with all copies of each party grouped together, the assertion is

Ec(ρ⊗(r+1))r+1⟶lim inf⁡r→∞Ec(ρ⊗(r+1))r+1=ofReal⁡ ⁣(−Re⁡tr⁡[f(ρA)]),f(x)=xlog⁡2x,\frac{E_c(\rho^{\otimes(r+1)})}{r+1} \longrightarrow \liminf_{r\to\infty}\frac{E_c(\rho^{\otimes(r+1)})}{r+1} =\operatorname{ofReal}\!\left( -\operatorname{Re}\operatorname{tr}\bigl[f(\rho_A)\bigr]\right), \qquad f(x)=x\log_2x,r+1Ec​(ρ⊗(r+1))​⟶r→∞liminf​r+1Ec​(ρ⊗(r+1))​=ofReal(−Retr[f(ρA​)]),f(x)=xlog2​x,

where (ρA)i,i′=∑jρ(i,j),(i′,j)(\rho_A)_{i,i'}=\sum_j\rho_{(i,j),(i',j)}(ρA​)i,i′​=∑j​ρ(i,j),(i′,j)​, and f(ρA)f(\rho_A)f(ρA​) is evaluated by continuous functional calculus. Thus only positive copy counts r+1r+1r+1 occur.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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