Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4: orthogonal-block conditional-min-entropy SDP bounds

Proved
QAlgorithms.Papers.Independent.Extend50.P03.orthogonal_block_sdp

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let P1,P2,QP_1,P_2,QP1​,P2​,Q be finite nonempty registers, m≥1m\ge1m≥1, and let Πi\Pi_iΠi​ be nonzero self-adjoint mutually orthogonal projectors on P1P_1P1​. Let ρi≥0\rho_i\ge0ρi​≥0 act on P2⊗QP_2\otimes QP2​⊗Q, with ρ=∑i=1mΠi⊗ρi\rho=\sum_{i=1}^m\Pi_i\otimes\rho_iρ=∑i=1m​Πi​⊗ρi​ a normalized state. The individual blocks need not be normalized. For s(X)=inf⁡{Tr⁡σ:σ≥0, IP⊗σ≥X}s(X)=\inf\{\operatorname{Tr}\sigma:\sigma\ge0,\ I_P\otimes\sigma\ge X\}s(X)=inf{Trσ:σ≥0, IP​⊗σ≥X}, with the appropriate unconditioned register PPP, one has

1m∑i=1ms(ρi)≤s(ρ)≤∑i=1ms(ρi).\frac1m\sum_{i=1}^m s(\rho_i)\le s(\rho)\le\sum_{i=1}^m s(\rho_i).m1​i=1∑m​s(ρi​)≤s(ρ)≤i=1∑m​s(ρi​).

No rank-one or completeness assumption is imposed on the projectors. Source correction: zero projectors must be omitted, as the printed proof divides by Tr⁡Πi\operatorname{Tr}\Pi_iTrΠi​; independent moderation is required.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P03
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.Elementwise

namespace QAlgorithms.Papers.Independent.Extend50.P03

open QAlgorithms.Papers.Independent.Support50.P23 (minEntropy)

attribute [local instance] Classical.propDecidable

attribute [local instance] QAlgorithms.Papers.Independent.Extend50.P03.matrixContinuousENorm

/-- Lemma 4, PDF p.19 (SDP on p.18): corrected support convention Pi_i≠0.
Printed: disjoint projectors. Changed: omit zero projectors, as the proof divides
by Tr(Pi_i). Blocks remain arbitrary PSD operators, without unit-trace assumptions.
This correction requires independent moderation. -/
theorem orthogonal_block_sdp {P1 P2 Q : Type*}
    [Fintype P1] [Fintype P2] [Fintype Q]
    [DecidableEq P1] [DecidableEq P2] [DecidableEq Q]
    [Nonempty P1] [Nonempty P2] [Nonempty Q]
    {m : ℕ} (hm : 1 ≤ m) (Pi : Fin m → Matrix P1 P1 ℂ)
    (rho : Fin m → Matrix (P2 × Q) (P2 × Q) ℂ)
    (hPi : ∀ i, (Pi i).IsHermitian ∧ Pi i * Pi i = Pi i ∧ Pi i ≠ 0)
    (horth : ∀ i j, i ≠ j → Pi i * Pi j = 0)
    (hrho : ∀ i, (rho i).PosSemidef)
    (hnorm : IsDensityMatrix (orthogonalBlockOperator Pi rho)) :
    (∑ i, minSdp (rho i)) / (m : ℝ) ≤ minSdp (orthogonalBlockOperator Pi rho) ∧
      minSdp (orthogonalBlockOperator Pi rho) ≤ ∑ i, minSdp (rho i) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P03

end
Source
Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes, arXiv:2102.11835v1, PDF p. 19, Lemma 4: orthogonal-block conditional-min-entropy SDP bounds
Read-back

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

Let P1,P2,QP_1,P_2,QP1​,P2​,Q be arbitrary finite nonempty index types, each equipped with decidable equality, let m≥1m\ge1m≥1, let Πi\Pi_iΠi​ be complex matrices on P1P_1P1​, and let ρi\rho_iρi​ be complex matrices on P2×QP_2\times QP2​×Q, for i=0,…,m−1i=0,\ldots,m-1i=0,…,m−1. Assume each Πi\Pi_iΠi​ is Hermitian, satisfies Πi2=Πi\Pi_i^2=\Pi_iΠi2​=Πi​, and is nonzero; assume ΠiΠj=0\Pi_i\Pi_j=0Πi​Πj​=0 whenever i≠ji\ne ji=j; and assume each ρi\rho_iρi​ is positive semidefinite. Define a matrix XXX on (P1×P2)×Q(P_1\times P_2)\times Q(P1​×P2​)×Q by

X((a,b),q),((a′,b′),q′)=∑i=0m−1(Πi)aa′(ρi)(b,q),(b′,q′),X_{((a,b),q),((a',b'),q')} =\sum_{i=0}^{m-1}(\Pi_i)_{aa'}(\rho_i)_{(b,q),(b',q')},X((a,b),q),((a′,b′),q′)​=i=0∑m−1​(Πi​)aa′​(ρi​)(b,q),(b′,q′)​,

and assume XXX is positive semidefinite with trace one. For a matrix YYY on a bipartite register L×QL\times QL×Q, define

s(Y)=inf⁡{Re⁡Tr⁡σ:σ is a positive semidefinite matrix on Q,IL⊗σ−Y is positive semidefinite}.s(Y)=\inf\left\{\operatorname{Re}\operatorname{Tr}\sigma: \sigma\text{ is a positive semidefinite matrix on }Q,\quad I_L\otimes\sigma-Y\text{ is positive semidefinite}\right\}.s(Y)=inf{ReTrσ:σ is a positive semidefinite matrix on Q,IL​⊗σ−Y is positive semidefinite}.

Then

1m∑i=0m−1s(ρi)≤s(X)≤∑i=0m−1s(ρi).\frac1m\sum_{i=0}^{m-1}s(\rho_i)\le s(X)\le\sum_{i=0}^{m-1}s(\rho_i).m1​i=0∑m−1​s(ρi​)≤s(X)≤i=0∑m−1​s(ρi​).

There is no requirement that the Πi\Pi_iΠi​ sum to the identity, that they have rank one, or that the individual ρi\rho_iρi​ have trace one.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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