Corollary 3: simplified Gram-multiplier normal form
OpenQAlgorithms.Papers.Independent.Gap48.P45.pureFamilyRecovery_gramNormalFormAll 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. 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 unit vectors , write . Assume either or , and let be a complete pure family with its computed component projections. Then
The vectors have norm one. In the dual-injective case every coefficient is nonzero.
This result reduces the tensor normal form to a scalar Gram multiplier in the two stated regimes.
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)
/-- Corollary 3, PDF pp.17–18: dual injectivity OR equal finite dimensions.
Gram order is <psi_l|psi_k>; no-zero entries only when the dual is injective.
Proof typo: printed m(Phi)=1; p.7 gives m(Phi)=0 and effective multiplicity one. -/
theorem pureFamilyRecovery_gramNormalForm
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (hRegime : SimplifiedRegime Phi.val)
(S : Set (State I)) (hPure : S ⊆ pureStates I) (hComplete : CompleteFamily S) :
ReversibleOn Phi.val S ↔
HasGramNormalForm Phi.val (componentProjection S) (DualInjective Phi.val) := 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 sets and . Call a coefficient matrix nuclear if with . A state is a nuclear matrix with real nonnegative quadratic forms on every finite coordinate set and summable real diagonal of sum . A channel preserves nuclear matrices, is additive and complex homogeneous on them, and preserves states after entrywise amplification by every finite identity. Let be a channel. Write , let be a chosen bounded operator with coefficient matrix , or zero if none exists, and define
Assume either implies for every bounded operator on , or have equal finite cardinality. Let be a set of states of the form with , and suppose the ranges of , , have dense linear span . Partition into its distinct finite-chain components: two states belong to the same component if a finite chain in connects them with for each consecutive pair, including zero-length chains. For each component , let be the orthogonal projection onto the closed span of the ranges , . Then there is a channel recovering every state in after if and only if there exist a countable nonempty set , unit vectors , and a surjective linear isometry such that
is a channel and, for every nuclear ,
In addition, the vectors must satisfy for every if holds; when that injectivity property fails, this nonzero-inner-product requirement imposes no restriction. Infinite sums in these definitions are total sums, zero in normed spaces when not summable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.