Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition: explicit Schmidt-diagonal minimizer

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.pure_minimizer

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.

For an orthonormal Schmidt expansion ∣ψ⟩=∑kpk∣ukvk⟩|\psi\rangle=\sum_k\sqrt{p_k}|u_kv_k\rangle∣ψ⟩=∑k​pk​​∣uk​vk​⟩, with pk≥0p_k\ge0pk​≥0 summing to one, put σ=∣ψ⟩⟨ψ∣\sigma=|\psi\rangle\langle\psi|σ=∣ψ⟩⟨ψ∣ and ρ∗=∑kpk∣ukvk⟩⟨ukvk∣\rho_*=\sum_kp_k|u_kv_k\rangle\langle u_kv_k|ρ∗​=∑k​pk​∣uk​vk​⟩⟨uk​vk​∣. The constructed ρ∗\rho_*ρ∗​ is separable, and

S(σ∥ρ∗)=−∑kpkln⁡pk≤S(σ∥ρ)(ρ∈Sep).S(\sigma\Vert\rho_*)=-\sum_kp_k\ln p_k\le S(\sigma\Vert\rho)\quad(\rho\in\mathrm{Sep}).S(σ∥ρ∗​)=−k∑​pk​lnpk​≤S(σ∥ρ)(ρ∈Sep).

This is the explicit minimizing-state certificate supporting Theorem 3.

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

/-- Proposition and its proof, PDF pp.13–14: explicit Schmidt-diagonal minimizer
certificate, supporting the entropy equality of Theorem 3. -/
theorem pure_minimizer {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] (s : FiniteSchmidtExpansion I J K) :
    IsMinimizer (pureDensity (finiteSchmidtVector s)) (schmidtDiagonal s) ∧
      relativeEntropy (pureDensity (finiteSchmidtVector s)) (schmidtDiagonal s) =
        (finiteSchmidtEntropyNats s : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 14, Proposition: explicit Schmidt-diagonal minimizer
Read-back

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

Let I,J,KI,J,KI,J,K be finite types, with decidable equality on I,JI,JI,J, and with I,JI,JI,J nonempty. Suppose sss specifies nonnegative real weights wkw_kwk​ summing to 111 and orthonormal families ak∈CIa_k\in\mathbb C^Iak​∈CI, bk∈CJb_k\in\mathbb C^Jbk​∈CJ. Put

ψ(i,j)=∑kwk ak(i)bk(j),P=ψψ†,S=∑kwk(akak†)⊗(bkbk†).\psi(i,j)=\sum_k\sqrt{w_k}\,a_k(i)b_k(j),\qquad P=\psi\psi^\dagger,\qquad S=\sum_k w_k(a_ka_k^\dagger)\otimes(b_kb_k^\dagger).ψ(i,j)=k∑​wk​​ak​(i)bk​(j),P=ψψ†,S=k∑​wk​(ak​ak†​)⊗(bk​bk†​).

Here D(A∥B)D(A\Vert B)D(A∥B) is Re⁡tr⁡(f(A)−Alog⁡B)\operatorname{Re}\operatorname{tr}(f(A)-A\log B)Retr(f(A)−AlogB) when ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, and +∞+\infty+∞ otherwise, where f(u)=ulog⁡uf(u)=u\log uf(u)=ulogu, matrix functions use functional calculus, and log⁡0=0\log0=0log0=0. The matrix SSS is separable, meaning a finite convex combination of tensor products of positive semidefinite trace-one matrices; for every separable matrix TTT, D(P∥S)≤D(P∥T)D(P\Vert S)\le D(P\Vert T)D(P∥S)≤D(P∥T); and

D(P∥S)=−∑kwklog⁡wkD(P\Vert S)=-\sum_k w_k\log w_kD(P∥S)=−k∑​wk​logwk​

as an equality of extended real numbers. Zero weights are permitted, but an empty KKK cannot support weights summing to 111.

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