Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4: the decision operators (11) satisfy ∑uXu≤I\sum_uX_u\le I∑u​Xu​≤I

Open
HolevoCQ.decoder_subPOVM

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theoryp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-information

Let B1,…,BNB_1,\dots,B_NB1​,…,BN​ be positive operators on a finite-dimensional Hilbert space and put

Xu=(∑u′=1NBu′)−1/2Bu(∑u′=1NBu′)−1/2,X_u=\Big(\sum_{u'=1}^NB_{u'}\Big)^{-1/2}B_u\Big(\sum_{u'=1}^NB_{u'}\Big)^{-1/2},Xu​=(u′=1∑N​Bu′​)−1/2Bu​(u′=1∑N​Bu′​)−1/2,

where Y−1/2Y^{-1/2}Y−1/2 is the generalized inverse of Y1/2Y^{1/2}Y1/2 (zero on Ker Y\mathrm{Ker}\,YKerY). Then every XuX_uXu​ is positive and

∑u=1NXu≤I.\sum_{u=1}^NX_u\le I .u=1∑N​Xu​≤I.

With Bu=PPuPB_u=PP_uPBu​=PPu​P this says that Holevo's decision rule (11) is a code in the sense of p.2.

Differences from the source:

  • generalization: Bu=PPuPB_u=PP_uPBu​=PPu​P with PPP from (6) and PuP_uPu​ from (8) → arbitrary positive semidefinite BuB_uBu​ on an arbitrary finite-dimensional space; reason: the paper's PPuPPP_uPPPu​P are positive operators on H⊗n\mathcal H^{\otimes n}H⊗n, so the Lean statement contains the paper's case
  • generalization: conclusion ∑uXu≤I\sum_uX_u\le I∑u​Xu​≤I → conclusion also asserts Xu≥0X_u\ge0Xu​≥0 for every uuu (IsSubPOVM); reason: positivity of each XuX_uXu​ is required for (11) to be a code (p.2) and is immediate; Lean asserts more than the printed sentence
  • encoding: generalized inverse of X1/2X^{1/2}X1/2 → cfc of x↦(x)−1x\mapsto(\sqrt x)^{-1}x↦(x​)−1 with (0)−1=0(\sqrt0)^{-1}=0(0​)−1=0; reason: equal to 000 on the kernel and (X1/2)−1(X^{1/2})^{-1}(X1/2)−1 on its orthogonal complement, the paper's definition
Preamble
import Mathlib
import Definitions.Def_HolevoCQ_IsSubPOVM
import Definitions.Def_HolevoCQ_sqrtMeas

open scoped ComplexOrder
Formal statement
namespace HolevoCQ

/-- Holevo, *The Capacity of Quantum Channel with General Signal States*,
arXiv:quant-ph/9611023v1, §4, p.4: the operators
`X_u = (Σ_{u'} B_{u'})^{−1/2} B_u (Σ_{u'} B_{u'})^{−1/2}` of (11), with `X^{−1/2}` the generalized
inverse of `X^{1/2}`, are positive and satisfy `Σ_{u=1}^N X_u ≤ I`.

**Formalization Note.** Stated for arbitrary positive semidefinite `B_u` on any finite-dimensional
space; the paper's case is `B_u = P P_u P`. Positivity of each `X_u` (needed for a code) is part of
the conclusion `IsSubPOVM`. -/
theorem decoder_subPOVM {ι : Type} [Fintype ι] [DecidableEq ι] {N : ℕ}
    (B : Fin N → Matrix ι ι ℂ) (hB : ∀ k, (B k).PosSemidef) :
    IsSubPOVM (sqrtMeas B) := by sorry

end HolevoCQ
Source
Holevo, The Capacity of Quantum Channel with General Signal States, arXiv:quant-ph/9611023v1, §4, p.4
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 30, 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