Theorem 5: unambiguous pure-ensemble block classification
OpenQAlgorithms.Papers.Independent.Gap48.P45.generalizedPureHolevoEquality_blockClassificationAll 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. Write for the closed span of all output supports, , , and ; dimensions retain infinity. An OND family admits no partition into two nonempty mutually orthogonal subfamilies. Its components are obtained by finite chains of nonorthogonal pure states, and projects onto the closed span of component . For vectors with and when , define on . Here has dimension , including countable infinity. Let be a Borel ensemble concentrated on pure states, with faithful average and preserved finite Holevo quantity. Let and use its canonical OND projections , with . They form a countable nonzero orthogonal resolution, and all four classification conditions hold:
Here , each is a state, and . The computed resolution is the finest nonzero one with this almost-everywhere block property.
This result translates preserved pure-ensemble information into the full block classification.
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)
/-- Theorem 5 pure-state clause, PDF p.20 n.11: all four classification clauses
and almost-everywhere pinching. The finest nonzero resolution is computed from
OND components of the pure support, not chosen as the vacuous one-block resolution. -/
theorem generalizedPureHolevoEquality_blockClassification
{I J E : Type} [Countable I] [Countable J] [Countable E]
[Nonempty I] [Nonempty J] [Nonempty E]
(Phi : Channel I J) (Psi : Channel I E) (hComp : Complementary Phi Psi)
(mu : GeneralizedEnsemble I)
(hPure : ∀ᵐ rho ∂(mu : Measure (State I)), rho ∈ pureStates I)
(hFullRank : FullRank (averageCoefficients mu))
(hFinite : ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu < ⊤)
(hEquality : ensembleHolevo Phi.val mu = ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu) :
let S := (mu : Measure (State I)).support
(componentSets S).Countable ∧ OrthogonalResolution (componentProjection S) ∧
ReversibleOn Phi.val S ∧ ReversibleOn Phi.val (blockDiagonalStates (componentProjection S)) ∧
HasBlockCQForm Psi.val (componentProjection S) (rankMultiplicity Phi.val 1) ∧
HasBlockNormalForm Phi.val (componentProjection S) (rankMultiplicity Phi.val 1) ∧
(∀ᵐ rho ∂(mu : Measure (State I)), rho ∈ blockDiagonalStates (componentProjection S)) := 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 . A coefficient matrix is trace class if it admits with ; denote the infimum of these sums by , taking the empty infimum to be . States additionally have real, nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum ; their topology is generated by -balls, with the Borel measurable structure. A pure state has coefficients with . Channels preserve trace class, are additive and complex homogeneous there, and preserve states under blockwise amplification by each finite-dimensional identity. Suppose channels and arise from one complex linear isometry by summing, respectively, the - and -diagonals of
Let be a Borel probability measure on states of , almost every member of which is pure, and set . For any matrix , let be a chosen bounded operator with coordinate matrix , or if no such operator exists. Assume is injective. Define as the supremum over finite coordinate sets of
where and , and assume
Put . Two states are called orthogonal here when . For , its component consists of the states connected to by a finite chain in whose successive states are not orthogonal, allowing a chain of length zero. Let be the set of these distinct components, and let be the orthogonal projection onto the closed span of all with . For the remaining assertions, write to mean that and every are trace-class coefficient matrices, that , every finite sum , and its difference from admit nuclear expansions converging in operator norm with , and that the real infimum of these norm-product sums for the difference tends to zero as increases. Define
Let be the closed span of over all input states, with projection , and define
where replaces every infinite algebraic dimension by , and . The conclusion is that is countable; the are nonzero self-adjoint idempotents, satisfy for , and satisfy in norm for every ; there is a channel recovering every state in , and there is a channel recovering every state in , these two recovery channels not being required to coincide; there exist states on , each with , such that
and there exist a countable, nonempty type and vectors , , with and for , such that the map
is a channel and is isometrically equivalent to : there is a bounded with for which
for every trace-class . Finally, for -almost every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.