Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Equations (59),(60): Hall alternative accessible-information bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.hallMeasurementBound

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For any finite normalized PSD ensemble E\mathcal EE with average ρ\rhoρ and any finite POVM M={Eb}\mathcal M=\{E_b\}M={Eb​}, set τb=Tr⁡(Ebρ)\tau_b=\operatorname{Tr}(E_b\rho)τb​=Tr(Eb​ρ) and, only when τb>0\tau_b>0τb​>0, σb=τb−1ρEbρ\sigma_b=\tau_b^{-1}\sqrt\rho E_b\sqrt\rhoσb​=τb−1​ρ​Eb​ρ​. Then

I(E,M)≤S(ρ)−∑b:τb>0τbS(σb)=∑b:τb>0τbH(σb,ρ).I(\mathcal E,\mathcal M)\le S(\rho)-\sum_{b:\tau_b>0}\tau_bS(\sigma_b)=\sum_{b:\tau_b>0}\tau_bH(\sigma_b,\rho).I(E,M)≤S(ρ)−b:τb​>0∑​τb​S(σb​)=b:τb​>0∑​τb​H(σb​,ρ).

The average may be singular; the active dual states are supported on its support. This is Hall’s alternative bound, with the probability factor retained in both sums.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate Matrix.Norms.L2Operator

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Intakethird100.P51

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact interfaces from the frozen accepted library; no local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy holevo IsLaw)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy marginalAB channelAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)

open QAlgorithms.Papers.Independent.Gap48.P33 (measurementInformation)

section Statements

variable {A B C D J K O : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype J] [Fintype K] [Fintype O]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

variable [DecidableEq J] [DecidableEq K] [DecidableEq O]

/-- Section 7.4, equations (59)–(60), PDF p.21: Hall's bound with the tau_b
factor and only active normalization. The average may be singular. -/
theorem hallMeasurementBound [Nonempty A] [Nonempty J] [Nonempty O] (w : J → ℝ) (hw : IsLaw w)
    (sigma : J → Mat A) (hs : ∀ j, IsDensityMatrix (sigma j)) (E : O → Mat A) (hE : IsPOVM E) :
    (Real.log 2 * measurementInformation w sigma E) ≤ hallBound (average w sigma) E ∧
      hallBound (average w sigma) E = hallRelative (average w sigma) E := by sorry

end Statements

end QAlgorithms.Papers.Independent.Intakethird100.P51

end
Source
Inequalities for Quantum Entropy: A Review with Conditions for Equality, arXiv:quant-ph/0205064v2, PDF p. 21, Equations (59),(60): Hall alternative accessible-information bound
Read-back

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

For finite nonempty index types A,J,OA,J,OA,J,O, with decidable equality as required for matrix operations, let wj≥0w_j\ge0wj​≥0 with ∑jwj=1\sum_jw_j=1∑j​wj​=1, let every σj\sigma_jσj​ be positive semidefinite of trace one, and let EbE_bEb​ be positive semidefinite effects summing to IAI_AIA​. Set ρ=∑jwjσj\rho=\sum_jw_j\sigma_jρ=∑j​wj​σj​, pb∣j=Re⁡tr⁡(Ebσj)p_{b|j}=\operatorname{Re}\operatorname{tr}(E_b\sigma_j)pb∣j​=Retr(Eb​σj​), pb=Re⁡tr⁡(Ebρ)p_b=\operatorname{Re}\operatorname{tr}(E_b\rho)pb​=Retr(Eb​ρ), Tb=ρ1/2Ebρ1/2T_b=\rho^{1/2}E_b\rho^{1/2}Tb​=ρ1/2Eb​ρ1/2, and τb=pb−1Tb\tau_b=p_b^{-1}T_bτb​=pb−1​Tb​, using scalar inversion with 0−1=00^{-1}=00−1=0. With H2(p)=−∑bpblog⁡2pbH_2(p)=-\sum_bp_b\log_2p_bH2​(p)=−∑b​pb​log2​pb​ and S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)], f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx applied by continuous functional calculus, one has

(ln⁡2)[H2((pb)b)−∑jwjH2((pb∣j)b)]≤S(ρ)−∑b∈Opb>0pbS(τb)=∑b∈Opb>0pbDR(τb∥ρ).(\ln2)\left[H_2((p_b)_b)-\sum_jw_jH_2((p_{b|j})_b)\right] \le S(\rho)-\sum_{\substack{b\in O\\p_b>0}}p_bS(\tau_b) =\sum_{\substack{b\in O\\p_b>0}}p_bD_{\mathbb R}(\tau_b\Vert\rho).(ln2)[H2​((pb​)b​)−j∑​wj​H2​((pb∣j​)b​)]≤S(ρ)−b∈Opb​>0​∑​pb​S(τb​)=b∈Opb​>0​∑​pb​DR​(τb​∥ρ).

Here D(X∥Y)=Re⁡tr⁡[f(X)−Xlog⁡Y]D(X\Vert Y)=\operatorname{Re}\operatorname{tr}[f(X)-X\log Y]D(X∥Y)=Retr[f(X)−XlogY] when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise; real conversion to DRD_{\mathbb R}DR​ sends +∞+\infty+∞ to zero. Logarithms use value zero at zero. The average ρ\rhoρ may be singular, weights and effects may vanish, and both sums restricted by pb>0p_b>0pb​>0 assign zero to the omitted terms.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me