Proposition 3: generalized Holevo equality, all four equivalent conditions
OpenQAlgorithms.Papers.Independent.Gap48.P45.generalizedHolevoEquality_fourConditionsAll physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Let be a Borel probability law on the trace-norm state space with , where is computed from . With the explicitly extended Petz channel , the four conditions are equivalent:
One common recovery channel precedes the almost-everywhere quantifier; no countable domination hypothesis is added.
This result extends the equality and common-recovery criterion to Borel ensembles.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap48.P45
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P18
(operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
IsParsevalFrame IsKrausRepresentation)
open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)
open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
/-- Proposition 3, PDF p.20: all four conditions with computed barycenter and
explicit Petz extension. One recovery precedes almost every state; no countable
mixture dominating the barycenter is assumed. -/
theorem generalizedHolevoEquality_fourConditions
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (mu : GeneralizedEnsemble I)
(hFinite : ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu < ⊤) :
((ensembleHolevo Phi.val mu = ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu) ↔
(∀ᵐ rho ∂(mu : Measure (State I)),
extendedRelativeEntropyNats (Phi.val rho.coefficients) (Phi.val (averageCoefficients mu)) =
extendedRelativeEntropyNats rho.coefficients (averageCoefficients mu))) ∧
((∀ᵐ rho ∂(mu : Measure (State I)),
extendedRelativeEntropyNats (Phi.val rho.coefficients) (Phi.val (averageCoefficients mu)) =
extendedRelativeEntropyNats rho.coefficients (averageCoefficients mu)) ↔
(∀ᵐ rho ∂(mu : Measure (State I)),
rho.coefficients = petzRecovery Phi.val (averageCoefficients mu) (Phi.val rho.coefficients))) ∧
((∀ᵐ rho ∂(mu : Measure (State I)),
rho.coefficients = petzRecovery Phi.val (averageCoefficients mu) (Phi.val rho.coefficients)) ↔
∃ Theta : Channel J I, ∀ᵐ rho ∂(mu : Measure (State I)),
Theta.val (Phi.val rho.coefficients) = rho.coefficients) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable, nonempty types, , and the coordinate vectors. A coefficient matrix is trace class if it admits with . A state additionally has real, nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum . Let be the infimum of over these expansions, with empty infimum ; states carry the topology generated by sets , , and its Borel measurable structure. Let preserve trace class, be additive and complex homogeneous there, and preserve states under blockwise amplification by the identity on every finite auxiliary coordinate space. Let be a Borel probability measure on the state space and set , using the total complex integral, which is zero when its integrand is not integrable. Define , where
, and the logarithms use continuous functional calculus with . Put and , with extended nonnegative integrals, and assume . The recovery map appearing below is defined as follows: let be a chosen bounded operator with coordinate matrix , or if none exists; let , , and be the orthogonal projection onto the closure of the range of . Write . For a bounded operator on , choose an operator on satisfying
if one exists, and take otherwise; set
where is the matrix unit in row , column . The declaration asserts the conjunction of these three equivalences:
The channel on the last line is one common channel; the equalities are almost-everywhere statements.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.