Definitions for Reversibility conditions for quantum channels and their applications
DefinitionQAlgorithms_Papers_Independent_Gap48_P45The objects the formalized statements of Reversibility conditions for quantum channels and their applications (arXiv:1203.0262) are stated in. Each was checked against the paper by a blind read-back and a moderator.
dimensionCount: PDF pp.4,7: finite cardinality or infinity, never default-zero infinite finrank.operatorRank: PDF pp.5,7,10: operator range dimension, with every infinite dimension retained.generatedSpace: PDF pp.7,14: the closed span of the state supports; includes mixed states.CompleteFamily: Definition 5, PDF p.7: equivalent closed-support formulation of completeness.familyProjection: PDF pp.14–15: projection computed from the family's closed generated space.outputSpace: PDF p.7: actual output support, without imposing minimality on a dilation.outputProjection: PDF p.7: output-support projection constructed from Phi.boundedTracePair: PDF pp.3,6: Tr(BX). Form the actual bounded product before summing its diagonal.channelDual: PDF pp.6–7: normal dual determined by matrix-unit trace pairings.restrictedDualNullity: PDF p.7: m(Phi), the dual kernel restricted to operators supported on H_B^Phi. The defining set is a complex vector space; its span has exactly its dimension.rankMultiplicity: PDF pp.8,10: min(m(Phi)+r^2,dim H_B^Phi), including infinite values.BoundIndex: PDF p.12 n.7: m labels in finite dimension; countably many at infinity.coefficientTraceHasSum: PDF pp.4–5: coefficient adapter to the accepted bounded-operator TraceHasSum. The coefficient trace-class guards exclude an invalid-array zero fallback.PartiallyEntanglementBreaking: Definition 3, PDF pp.5–6: outputs lie in the trace-closed convex hull of normalized pure states with Schmidt rank at most r, for every separable ancilla.CountableSchmidtOutputs: The explanatory paragraph after Theorem 3, PDF p.8: every ancilla output has an actual countable pure Schmidt-rank-r decomposition, stronger than merely belonging to the closed Schmidt class. Zero weights include finite mixtures.HasBoundedRankKraus: PDF pp.8,20: actual countable Kraus representation, count and rank bounds.StatesOrthogonal: PDF pp.13–15: orthogonality of the state supports.OrthogonallyNondecomposable: Definition 6 as used in Lemmas 4–5, PDF pp.13–15: no two nonempty mutually orthogonal subfamilies partition S. Unused ambient subspaces do not split S.connectedComponent: Lemma 5 proof, PDF pp.14–15: states reachable by finite nonorthogonal chains.componentSets: PDF pp.14–15: canonical component collection; empty for the empty family.Component: PDF p.15: canonical nonempty-component labels.componentProjection: PDF p.15: component projections are computed from S, never freely supplied.IsONDPartition: Lemma 5, PDF pp.14–15: nonempty disjoint OND pieces, orthogonal across pieces. Set-valued partitions encode uniqueness up to relabeling.vectorStates: PDF pp.11–12: pure-state family of a vector system; phases are immaterial.OrthonormalBasisFamily: PDF pp.11–12: orthonormality plus strong Parseval completeness.OrthogonalResolution: PDF pp.12,15,20–21: nonzero orthogonal projections strongly summing to identity.blockDiagonalStates: PDF p.15(ii): all block-diagonal states, with trace-norm pinching sum.blockPureStates: PDF p.21, Corollary 4(i): all pure states within individual blocks.HasBlockCQForm: PDF pp.11,15: c-q/block measure-and-prepare form with normalized sigma_k, correct ranks and trace-norm output convergence on the entire trace class.NormalizedOrthogonalRows: PDF pp.11–12,15: rowwise orthogonality and squared norms summing to one. Zero vectors allow padding a smaller spectral decomposition to m labels.blockNormalMap: PDF p.15(iv): exactly <psi_t^l|psi_p^k>, in H_A tensor H_m coordinates.HasBlockNormalForm: PDF pp.11–12,15(iv): displayed CPTP normal form and both partial-isometry identities. The condition is a conclusion, not an extra source hypothesis.UnitarilyEquivalent: PDF pp.17–18: unitary equivalence on the entire output spaces.gramNormalMap: PDF pp.17–18: c_kl=<psi_l|psi_k>, retaining the source conjugation order.HasGramNormalForm: PDF p.17: Gram form; the no-zero-entry clause is conditional on dual injectivity.DualInjective: PDF p.17: ker Phi*={0} on all bounded operators.SimplifiedRegime: PDF p.17: the two advertised channel conditions are alternatives.PositiveLaw: PDF pp.8,17: arbitrary strictly positive normalized weights.vectorAverage: Equation (9), PDF p.8: computed barycenter, not an arbitrary free parameter.inverseRootImage: PDF p.8(9): inverse square root on its spectral domain, defined by its unique least-norm preimage. Off-domain fallback is zero; theorems assert domain membership through the defining equation, never as an additional input hypothesis.whitenedVector: PDF p.8(9): sqrt(pi_i rho_bar^{-1})v_i, with inverse exponent -1/2.HasWhitenedForm: PDF p.8(8): computed frame and orthogonal spectral rows, both output series in trace norm. The inverse equation explicitly excludes an off-domain fallback.orderedPartialSum: PDF pp.16–17,25: ordered partial sums, allowing conditional basis expansions.UniqueConvergentBasis: PDF pp.16–17,25: unique convergent-expansion basis; neither Hamel nor ONB.coefficientSupportProjection: PDF pp.6–7: support projection on arbitrary completed countable coordinates. The accepted Information100.P06 supportProjection returns a finite matrix and cannot represent this domain. This coefficient adapter uses Mathlib's closed-range projection.petzSupportedDual: PDF pp.6–7,23–24: the supported solution B of S_out B S_out = Phi(S_in A S_in). It is unique and bounded for CPTP Phi and a reference state, even when S_out has no bounded inverse. Off this domain the total fallback is zero. No recovery property is assumed in this definition.petzExtendedDual: PDF pp.6–7: explicit extension off output support; the predual prepares sigma from the trace outside that support. This makes the total map unital on the dual.petzRecovery: PDF pp.6–7,23–24: computed predual, specified by every matrix-unit pairing.DiscreteEnsemble: PDF p.18: finite or countable discrete ensemble; zero weights are allowed.discreteProbabilityLaw: PDF p.18: the actual probability mass function of the normalized weights.discreteAverageCoefficients: PDF p.18: coefficient adapter to the accepted operator barycenter. No independent average variable or new summation convention is introduced.discreteHolevo: PDF pp.18–19: relative-entropy Holevo functional in nats, including infinity. Zero weights times infinite relative entropy contribute zero.activeStates: PDF p.19: recovery family with zero-weight entries removed.FullRank: PDF pp.7,20,22: full rank means zero kernel, without a bounded inverse.finiteEntropyGain: PDF p.19: entropy gain, used only when both entropies are finite.separableConditionalEntropyNats: PDF p.22(21): conditional entropy in nats on arbitrary countable coordinates; discard the FIRST factor and retain B. The accepted Dependency50.P15 definition is for finite matrices in bits, so it cannot represent this source domain.ResolutionClassification: PDF p.21: all four explicit clauses of Theorem 4 for the resolution P. This predicate is a conclusion, never a premise substituting for the theorem.appendingMap: PDF p.13(13): append a fixed normalized mixed state on a completed tensor.IrreducibleUnitaryAction: PDF p.21: strongly continuous unitary group action, irreducible on the whole finite-dimensional Hilbert space, rather than just one commuting pair.tensorIdentityEffect: Equation (12), PDF p.12: P tensor identity, on completed tensor coordinates.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P01
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P18
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P16
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P31
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P42
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P46
/-!
Shirokov, arXiv:1203.0262v3. Countable nonempty coordinates represent every
nonzero separable complex Hilbert space, and products are completed tensors.
All new definitions are paper-local; imports are pinned accepted libraries.
Compilation and independent moderation are pending the batch handoff.
-/
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)
/-- PDF pp.4,7: finite cardinality or infinity, never default-zero infinite finrank. -/
def dimensionCount (I : Type) : ℕ∞ := Cardinal.toENat (Cardinal.mk I)
/-- PDF pp.5,7,10: operator range dimension, with every infinite dimension retained. -/
def operatorRank {I J : Type} (A : Hilbert I →L[ℂ] Hilbert J) : ℕ∞ :=
Cardinal.toENat (Module.rank ℂ (LinearMap.range A.toLinearMap))
/-- PDF pp.7,14: the closed span of the state supports; includes mixed states. -/
def generatedSpace {I : Type} (S : Set (State I)) : Submodule ℂ (Hilbert I) :=
(Submodule.span ℂ {v | ∃ rho ∈ S, ∃ w, boundedOperator rho.coefficients w = v}).topologicalClosure
/-- Definition 5, PDF p.7: equivalent closed-support formulation of completeness. -/
def CompleteFamily {I : Type} (S : Set (State I)) : Prop := generatedSpace S = ⊤
/-- PDF pp.14–15: projection computed from the family's closed generated space. -/
def familyProjection {I : Type} (S : Set (State I)) : Hilbert I →L[ℂ] Hilbert I :=
letI : CompleteSpace (generatedSpace S) :=
(show IsClosed (generatedSpace S : Set (Hilbert I)) from
Submodule.isClosed_topologicalClosure _).completeSpace_coe
(generatedSpace S).starProjection
/-- PDF p.7: actual output support, without imposing minimality on a dilation. -/
def outputSpace {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) : Submodule ℂ (Hilbert J) :=
(Submodule.span ℂ {v | ∃ rho : State I, ∃ w, boundedOperator (Phi rho.coefficients) w = v}).topologicalClosure
/-- PDF p.7: output-support projection constructed from Phi. -/
def outputProjection {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) :
Hilbert J →L[ℂ] Hilbert J :=
letI : CompleteSpace (outputSpace Phi) :=
(show IsClosed (outputSpace Phi : Set (Hilbert J)) from
Submodule.isClosed_topologicalClosure _).completeSpace_coe
(outputSpace Phi).starProjection
/-- PDF pp.3,6: Tr(BX). Form the actual bounded product before summing its diagonal. -/
def boundedTracePair {I : Type} (X : Matrix I I ℂ) (B : Hilbert I →L[ℂ] Hilbert I) : ℂ :=
∑' i, operatorCoeff (B.comp (boundedOperator X)) i i
/-- PDF pp.6–7: normal dual determined by matrix-unit trace pairings. -/
def channelDual {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(B : Hilbert J →L[ℂ] Hilbert J) : Hilbert I →L[ℂ] Hilbert I :=
boundedOperator (fun i j => boundedTracePair (Phi (Matrix.single j i (1 : ℂ))) B)
/-- PDF p.7: m(Phi), the dual kernel restricted to operators supported on H_B^Phi.
The defining set is a complex vector space; its span has exactly its dimension. -/
def restrictedDualNullity {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) : ℕ∞ :=
Cardinal.toENat (Module.rank ℂ (Submodule.span ℂ
{B : Hilbert J →L[ℂ] Hilbert J |
(outputProjection Phi).comp (B.comp (outputProjection Phi)) = B ∧ channelDual Phi B = 0}))
/-- PDF pp.8,10: min(m(Phi)+r^2,dim H_B^Phi), including infinite values. -/
def rankMultiplicity {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) (r : ℕ) : ℕ∞ :=
min (restrictedDualNullity Phi + (r : ℕ∞) ^ 2)
(Cardinal.toENat (Module.rank ℂ (outputSpace Phi)))
/-- PDF p.12 n.7: m labels in finite dimension; countably many at infinity. -/
abbrev BoundIndex (m : ℕ∞) := {n : ℕ // (n : ℕ∞) < m}
/-- PDF pp.4–5: coefficient adapter to the accepted bounded-operator TraceHasSum.
The coefficient trace-class guards exclude an invalid-array zero fallback. -/
def coefficientTraceHasSum {I K : Type} (X : K → Matrix I I ℂ) (Y : Matrix I I ℂ) : Prop :=
IsTraceClass Y ∧ (∀ k, IsTraceClass (X k)) ∧
QAlgorithms.Papers.Independent.Dependency50.P39.TraceHasSum
(fun k => boundedOperator (X k)) (boundedOperator Y)
/-- Definition 3, PDF pp.5–6: outputs lie in the trace-closed convex hull of
normalized pure states with Schmidt rank at most r, for every separable ancilla. -/
def PartiallyEntanglementBreaking {I J : Type}
(Phi : Matrix I I ℂ → Matrix J J ℂ) (r : ℕ) : Prop :=
∀ (K : Type) [Countable K] [Nonempty K] (rho : State (I × K)),
tensorApply Phi rho.coefficients ∈ traceClosure
(convexHull ℝ {X : Matrix (J × K) (J × K) ℂ |
∃ u : Hilbert (J × K), ‖u‖ = 1 ∧ tensorRankLE r u ∧ X = rankOne u})
/-- The explanatory paragraph after Theorem 3, PDF p.8: every ancilla output
has an actual countable pure Schmidt-rank-r decomposition, stronger than merely
belonging to the closed Schmidt class. Zero weights include finite mixtures. -/
def CountableSchmidtOutputs {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(r : ℕ) : Prop :=
∀ (K : Type) [Countable K] [Nonempty K] (rho : State (I × K)),
∃ (w : ℕ → ℝ) (u : ℕ → Hilbert (J × K)),
(∀ i, 0 ≤ w i) ∧ HasSum w 1 ∧ (∀ i, ‖u i‖ = 1 ∧ tensorRankLE r (u i)) ∧
coefficientTraceHasSum (fun i => (w i : ℂ) • rankOne (u i)) (tensorApply Phi rho.coefficients)
/-- PDF pp.8,20: actual countable Kraus representation, count and rank bounds. -/
def HasBoundedRankKraus {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(r : ℕ) (bound : ℕ∞) : Prop :=
∃ (K : Type) (_ : Countable K) (V : K → (Hilbert I →L[ℂ] Hilbert J)),
dimensionCount K ≤ bound ∧ IsKrausRepresentation Phi V ∧ ∀ k, operatorRank (V k) ≤ r
/-- PDF pp.13–15: orthogonality of the state supports. -/
def StatesOrthogonal {I : Type} (rho sigma : State I) : Prop :=
(boundedOperator rho.coefficients).comp (boundedOperator sigma.coefficients) = 0
/-- Definition 6 as used in Lemmas 4–5, PDF pp.13–15: no two nonempty mutually
orthogonal subfamilies partition S. Unused ambient subspaces do not split S. -/
def OrthogonallyNondecomposable {I : Type} (S : Set (State I)) : Prop :=
∀ T ⊆ S, T.Nonempty → (S \ T).Nonempty →
∃ rho ∈ T, ∃ sigma ∈ S \ T, ¬ StatesOrthogonal rho sigma
/-- Lemma 5 proof, PDF pp.14–15: states reachable by finite nonorthogonal chains. -/
def connectedComponent {I : Type} (S : Set (State I)) (rho : State I) : Set (State I) :=
{sigma | rho ∈ S ∧ sigma ∈ S ∧ Relation.ReflTransGen
(fun a b : State I => a ∈ S ∧ b ∈ S ∧ ¬ StatesOrthogonal a b) rho sigma}
/-- PDF pp.14–15: canonical component collection; empty for the empty family. -/
def componentSets {I : Type} (S : Set (State I)) : Set (Set (State I)) :=
{C | ∃ rho ∈ S, C = connectedComponent S rho}
/-- PDF p.15: canonical nonempty-component labels. -/
abbrev Component {I : Type} (S : Set (State I)) := {C // C ∈ componentSets S}
/-- PDF p.15: component projections are computed from S, never freely supplied. -/
def componentProjection {I : Type} (S : Set (State I)) (k : Component S) :
Hilbert I →L[ℂ] Hilbert I := familyProjection k.val
/-- Lemma 5, PDF pp.14–15: nonempty disjoint OND pieces, orthogonal across pieces.
Set-valued partitions encode uniqueness up to relabeling. -/
def IsONDPartition {I : Type} (S : Set (State I)) (parts : Set (Set (State I))) : Prop :=
⋃₀ parts = S ∧ (∀ C ∈ parts, C.Nonempty ∧ OrthogonallyNondecomposable C) ∧
(∀ C ∈ parts, ∀ D ∈ parts, C ≠ D → Disjoint C D ∧
∀ rho ∈ C, ∀ sigma ∈ D, StatesOrthogonal rho sigma)
/-- PDF pp.11–12: pure-state family of a vector system; phases are immaterial. -/
def vectorStates {I L : Type} (v : L → Hilbert I) : Set (State I) :=
{rho | ∃ i, rho.coefficients = rankOne (v i)}
/-- PDF pp.11–12: orthonormality plus strong Parseval completeness. -/
def OrthonormalBasisFamily {I L : Type} (v : L → Hilbert I) : Prop :=
Orthonormal ℂ v ∧ IsParsevalFrame v
/-- PDF pp.12,15,20–21: nonzero orthogonal projections strongly summing to identity. -/
def OrthogonalResolution {I K : Type} (P : K → (Hilbert I →L[ℂ] Hilbert I)) : Prop :=
(∀ k, (P k).adjoint = P k ∧ (P k).comp (P k) = P k ∧ P k ≠ 0) ∧
(∀ k l, k ≠ l → (P k).comp (P l) = 0) ∧ ∀ x, HasSum (fun k => P k x) x
/-- PDF p.15(ii): all block-diagonal states, with trace-norm pinching sum. -/
def blockDiagonalStates {I K : Type} (P : K → (Hilbert I →L[ℂ] Hilbert I)) : Set (State I) :=
{rho | coefficientTraceHasSum (fun k => conjugateCoeff (P k) rho.coefficients) rho.coefficients}
/-- PDF p.21, Corollary 4(i): all pure states within individual blocks. -/
def blockPureStates {I K : Type} (P : K → (Hilbert I →L[ℂ] Hilbert I)) : Set (State I) :=
{rho | rho ∈ pureStates I ∧ ∃ k, conjugateCoeff (P k) rho.coefficients = rho.coefficients}
/-- PDF pp.11,15: c-q/block measure-and-prepare form with normalized sigma_k,
correct ranks and trace-norm output convergence on the entire trace class. -/
def HasBlockCQForm {I E K : Type} (Psi : Matrix I I ℂ → Matrix E E ℂ)
(P : K → (Hilbert I →L[ℂ] Hilbert I)) (m : ℕ∞) : Prop :=
∃ sigma : K → State E, (∀ k, operatorRank (boundedOperator (sigma k).coefficients) ≤ m) ∧
∀ X, IsTraceClass X → coefficientTraceHasSum
(fun k => boundedTracePair X (P k) • (sigma k).coefficients) (Psi X)
/-- PDF pp.11–12,15: rowwise orthogonality and squared norms summing to one.
Zero vectors allow padding a smaller spectral decomposition to m labels. -/
def NormalizedOrthogonalRows {K M E : Type} (psi : K → M → Hilbert E) : Prop :=
(∀ k, HasSum (fun p => ‖psi k p‖ ^ 2) 1) ∧
∀ k p t, p ≠ t → inner ℂ (psi k t) (psi k p) = 0
/-- PDF p.15(iv): exactly <psi_t^l|psi_p^k>, in H_A tensor H_m coordinates. -/
def blockNormalMap {I K M E : Type} (P : K → (Hilbert I →L[ℂ] Hilbert I))
(psi : K → M → Hilbert E) (X : Matrix I I ℂ) : Matrix (I × M) (I × M) ℂ :=
fun a b => ∑' k, ∑' l,
operatorCoeff ((P k).comp ((boundedOperator X).comp (P l))) a.1 b.1 *
inner ℂ (psi l b.2) (psi k a.2)
/-- PDF pp.11–12,15(iv): displayed CPTP normal form and both partial-isometry
identities. The condition is a conclusion, not an extra source hypothesis. -/
def HasBlockNormalForm {I J K : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(P : K → (Hilbert I →L[ℂ] Hilbert I)) (m : ℕ∞) : Prop :=
∃ (E : Type) (_ : Countable E) (_ : Nonempty E) (psi : K → BoundIndex m → Hilbert E),
NormalizedOrthogonalRows psi ∧ IsTraceClassChannel (blockNormalMap P psi) ∧
IsometricallyEquivalent Phi (blockNormalMap P psi)
/-- PDF pp.17–18: unitary equivalence on the entire output spaces. -/
def UnitarilyEquivalent {I J K : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(Theta : Matrix I I ℂ → Matrix K K ℂ) : Prop :=
∃ U : Hilbert K ≃ₗᵢ[ℂ] Hilbert J, ∀ X, IsTraceClass X →
Phi X = conjugateCoeff U.toLinearIsometry.toContinuousLinearMap (Theta X)
/-- PDF pp.17–18: c_kl=<psi_l|psi_k>, retaining the source conjugation order. -/
def gramNormalMap {I K E : Type} (P : K → (Hilbert I →L[ℂ] Hilbert I))
(psi : K → Hilbert E) (X : Matrix I I ℂ) : Matrix I I ℂ :=
fun a b => ∑' k, ∑' l, inner ℂ (psi l) (psi k) *
operatorCoeff ((P k).comp ((boundedOperator X).comp (P l))) a b
/-- PDF p.17: Gram form; the no-zero-entry clause is conditional on dual injectivity. -/
def HasGramNormalForm {I J K : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(P : K → (Hilbert I →L[ℂ] Hilbert I)) (nonzero : Prop) : Prop :=
∃ (E : Type) (_ : Countable E) (_ : Nonempty E) (psi : K → Hilbert E),
(∀ k, ‖psi k‖ = 1) ∧ (nonzero → ∀ k l, inner ℂ (psi l) (psi k) ≠ 0) ∧
IsTraceClassChannel (gramNormalMap P psi) ∧ UnitarilyEquivalent Phi (gramNormalMap P psi)
/-- PDF p.17: ker Phi*={0} on all bounded operators. -/
def DualInjective {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) : Prop :=
∀ B, channelDual Phi B = 0 → B = 0
/-- PDF p.17: the two advertised channel conditions are alternatives. -/
def SimplifiedRegime {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) : Prop :=
DualInjective Phi ∨ (dimensionCount I = dimensionCount J ∧ dimensionCount I < ⊤)
/-- PDF pp.8,17: arbitrary strictly positive normalized weights. -/
def PositiveLaw {L : Type} (pi : L → ℝ) : Prop := (∀ i, 0 < pi i) ∧ HasSum pi 1
/-- Equation (9), PDF p.8: computed barycenter, not an arbitrary free parameter. -/
def vectorAverage {I L : Type} (pi : L → ℝ) (v : L → Hilbert I) : Matrix I I ℂ :=
fun a b => ∑' i, (pi i : ℂ) * rankOne (v i) a b
/-- PDF p.8(9): inverse square root on its spectral domain, defined by its unique
least-norm preimage. Off-domain fallback is zero; theorems assert domain membership
through the defining equation, never as an additional input hypothesis. -/
def inverseRootImage {I : Type} (X : Matrix I I ℂ) (v : Hilbert I) : Hilbert I :=
if h : ∃ u : Hilbert I, positiveSquareRoot (boundedOperator X) u = v ∧
u ∈ (LinearMap.ker (positiveSquareRoot (boundedOperator X)).toLinearMap)ᗮ then h.choose else 0
/-- PDF p.8(9): sqrt(pi_i rho_bar^{-1})v_i, with inverse exponent -1/2. -/
def whitenedVector {I L : Type} (pi : L → ℝ) (v : L → Hilbert I) (i : L) : Hilbert I :=
inverseRootImage (vectorAverage pi v) ((Real.sqrt (pi i) : ℂ) • v i)
/-- PDF p.8(8): computed frame and orthogonal spectral rows, both output series
in trace norm. The inverse equation explicitly excludes an off-domain fallback. -/
def HasWhitenedForm {I E L : Type} (Psi : Matrix I I ℂ → Matrix E E ℂ)
(pi : L → ℝ) (v : L → Hilbert I) (m : ℕ∞) : Prop :=
(∀ i, positiveSquareRoot (boundedOperator (vectorAverage pi v)) (whitenedVector pi v i) =
(Real.sqrt (pi i) : ℂ) • v i) ∧ IsParsevalFrame (whitenedVector pi v) ∧
∃ psi : L → BoundIndex m → Hilbert E, NormalizedOrthogonalRows psi ∧
∃ sigma : L → Matrix E E ℂ,
(∀ i, coefficientTraceHasSum (fun k => rankOne (psi i k)) (sigma i)) ∧
∀ X, IsTraceClass X → coefficientTraceHasSum (fun i => boundedTracePair X
(boundedOperator (rankOne (whitenedVector pi v i))) • sigma i) (Psi X)
/-- PDF pp.16–17,25: ordered partial sums, allowing conditional basis expansions. -/
def orderedPartialSum {I : Type} {n : ℕ∞} (v : BoundIndex n → Hilbert I)
(c : BoundIndex n → ℂ) (N : ℕ) : Hilbert I :=
∑ i ∈ Finset.range N, if h : (i : ℕ∞) < n then c ⟨i, h⟩ • v ⟨i, h⟩ else 0
/-- PDF pp.16–17,25: unique convergent-expansion basis; neither Hamel nor ONB. -/
def UniqueConvergentBasis {I : Type} {n : ℕ∞} (v : BoundIndex n → Hilbert I) : Prop :=
∀ x : Hilbert I, ∃! c : BoundIndex n → ℂ,
Tendsto (fun N => orderedPartialSum v c N) atTop (nhds x)
/-- PDF pp.6–7: support projection on arbitrary completed countable coordinates.
The accepted Information100.P06 supportProjection returns a finite matrix and
cannot represent this domain. This coefficient adapter uses Mathlib's closed-range projection. -/
def coefficientSupportProjection {I : Type} (X : Matrix I I ℂ) : Hilbert I →L[ℂ] Hilbert I :=
((LinearMap.range (boundedOperator X).toLinearMap).topologicalClosure).starProjection
/-- PDF pp.6–7,23–24: the supported solution B of S_out B S_out =
Phi(S_in A S_in). It is unique and bounded for CPTP Phi and a reference state,
even when S_out has no bounded inverse. Off this domain the total fallback is zero.
No recovery property is assumed in this definition. -/
def petzSupportedDual {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(sigma : Matrix I I ℂ) (A : Hilbert I →L[ℂ] Hilbert I) : Hilbert J →L[ℂ] Hilbert J :=
if h : ∃ B : Hilbert J →L[ℂ] Hilbert J,
(coefficientSupportProjection (Phi sigma)).comp (B.comp (coefficientSupportProjection (Phi sigma))) = B ∧
(positiveSquareRoot (boundedOperator (Phi sigma))).comp (B.comp (positiveSquareRoot (boundedOperator (Phi sigma)))) =
boundedOperator (Phi (operatorCoeff ((positiveSquareRoot (boundedOperator sigma)).comp
(A.comp (positiveSquareRoot (boundedOperator sigma)))))) then h.choose else 0
/-- PDF pp.6–7: explicit extension off output support; the predual prepares sigma
from the trace outside that support. This makes the total map unital on the dual. -/
def petzExtendedDual {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(sigma : Matrix I I ℂ) (A : Hilbert I →L[ℂ] Hilbert I) : Hilbert J →L[ℂ] Hilbert J :=
petzSupportedDual Phi sigma A + boundedTracePair sigma A •
(ContinuousLinearMap.id ℂ (Hilbert J) - coefficientSupportProjection (Phi sigma))
/-- PDF pp.6–7,23–24: computed predual, specified by every matrix-unit pairing. -/
def petzRecovery {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(sigma : Matrix I I ℂ) (X : Matrix J J ℂ) : Matrix I I ℂ :=
fun i j => boundedTracePair X (petzExtendedDual Phi sigma (boundedOperator (Matrix.single j i (1 : ℂ))))
/-- PDF p.18: finite or countable discrete ensemble; zero weights are allowed. -/
structure DiscreteEnsemble (I : Type) where
weight : ℕ → ℝ
nonneg : ∀ i, 0 ≤ weight i
probability : HasSum weight 1
state : ℕ → State I
/-- PDF p.18: the actual probability mass function of the normalized weights. -/
def discreteProbabilityLaw {I : Type} (e : DiscreteEnsemble I) : PMF ℕ := by
have hsum : ∑' i, ENNReal.ofReal (e.weight i) = 1 := by
rw [← ENNReal.ofReal_tsum_of_nonneg e.nonneg e.probability.summable,
e.probability.tsum_eq]
simp
exact ⟨fun i => ENNReal.ofReal (e.weight i), hsum ▸ ENNReal.summable.hasSum⟩
/-- PDF p.18: coefficient adapter to the accepted operator barycenter.
No independent average variable or new summation convention is introduced. -/
def discreteAverageCoefficients {I : Type} (e : DiscreteEnsemble I) : Matrix I I ℂ :=
operatorCoeff (QAlgorithms.Papers.Independent.Renew46.P46.discreteAverage
(fun i => boundedOperator (e.state i).coefficients) (discreteProbabilityLaw e))
/-- PDF pp.18–19: relative-entropy Holevo functional in nats, including infinity.
Zero weights times infinite relative entropy contribute zero. -/
def discreteHolevo {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(e : DiscreteEnsemble I) : ℝ≥0∞ :=
∑' i, ENNReal.ofReal (e.weight i) * extendedRelativeEntropyNats
(Phi (e.state i).coefficients) (Phi (discreteAverageCoefficients e))
/-- PDF p.19: recovery family with zero-weight entries removed. -/
def activeStates {I : Type} (e : DiscreteEnsemble I) : Set (State I) :=
{rho | ∃ i, 0 < e.weight i ∧ rho = e.state i}
/-- PDF pp.7,20,22: full rank means zero kernel, without a bounded inverse. -/
def FullRank {I : Type} (X : Matrix I I ℂ) : Prop :=
∀ x : Hilbert I, boundedOperator X x = 0 → x = 0
/-- PDF p.19: entropy gain, used only when both entropies are finite. -/
def finiteEntropyGain {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(X : Matrix I I ℂ) : ℝ :=
(extendedEntropyNats (Phi X)).toReal - (extendedEntropyNats X).toReal
/-- PDF p.22(21): conditional entropy in nats on arbitrary countable coordinates;
discard the FIRST factor and retain B. The accepted Dependency50.P15 definition
is for finite matrices in bits, so it cannot represent this source domain. -/
def separableConditionalEntropyNats {I J : Type} (X : Matrix (I × J) (I × J) ℂ) : ℝ :=
(extendedEntropyNats X).toReal - (extendedEntropyNats (traceFirst X)).toReal
/-- PDF p.21: all four explicit clauses of Theorem 4 for the resolution P.
This predicate is a conclusion, never a premise substituting for the theorem. -/
def ResolutionClassification {I J E K : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ)
(Psi : Matrix I I ℂ → Matrix E E ℂ) (P : K → (Hilbert I →L[ℂ] Hilbert I)) : Prop :=
ReversibleOn Phi (blockPureStates P) ∧ ReversibleOn Phi (blockDiagonalStates P) ∧
HasBlockCQForm Psi P (rankMultiplicity Phi 1) ∧ HasBlockNormalForm Phi P (rankMultiplicity Phi 1)
/-- PDF p.13(13): append a fixed normalized mixed state on a completed tensor. -/
def appendingMap {I K : Type} (sigma : State K) (X : Matrix I I ℂ) :
Matrix (I × K) (I × K) ℂ := productCoeff X sigma.coefficients
/-- PDF p.21: strongly continuous unitary group action, irreducible on the whole
finite-dimensional Hilbert space, rather than just one commuting pair. -/
def IrreducibleUnitaryAction {I G : Type} [Group G] [TopologicalSpace G]
(V : G → (Hilbert I ≃ₗᵢ[ℂ] Hilbert I)) : Prop :=
(∀ x, V 1 x = x) ∧ (∀ g h x, V (g * h) x = V g (V h x)) ∧
(∀ x, Continuous (fun g => V g x)) ∧
∀ M : Submodule ℂ (Hilbert I), (∀ g x, x ∈ M → V g x ∈ M) → M = ⊥ ∨ M = ⊤
/-! Sanity examples for the complete local definitions. -/
/-- Domain sanity: the inverse-square-root choice satisfies its equation whenever
that equation has a supported solution; no off-domain value is used here. -/
example {I : Type} (X : Matrix I I ℂ) (v : Hilbert I)
(h : ∃ u : Hilbert I, positiveSquareRoot (boundedOperator X) u = v ∧
u ∈ (LinearMap.ker (positiveSquareRoot (boundedOperator X)).toLinearMap)ᗮ) :
positiveSquareRoot (boundedOperator X) (inverseRootImage X v) = v := by
rw [inverseRootImage, dif_pos h]
exact h.choose_spec.1
example : dimensionCount (Fin 0) = 0 := by simp [dimensionCount]
example : dimensionCount ℕ = ⊤ := by simp [dimensionCount]
example {I : Type} : componentSets (∅ : Set (State I)) = ∅ := by
ext C
simp [componentSets]
example {I : Type} : OrthogonallyNondecomposable (∅ : Set (State I)) := by
intro T hT hnonempty
obtain ⟨rho, hrho⟩ := hnonempty
exact (hT hrho).elim
example {I : Type} {n : ℕ∞} (v : BoundIndex n → Hilbert I) (c : BoundIndex n → ℂ) :
orderedPartialSum v c 0 = 0 := by simp [orderedPartialSum]
example {I : Type} (X : Matrix I I ℂ) (v : Hilbert I)
(h : ¬ ∃ u : Hilbert I, positiveSquareRoot (boundedOperator X) u = v ∧
u ∈ (LinearMap.ker (positiveSquareRoot (boundedOperator X)).toLinearMap)ᗮ) :
inverseRootImage X v = 0 := by simp [inverseRootImage, h]
example {I J : Type} (Phi : Matrix I I ℂ → Matrix J J ℂ) (X : Matrix I I ℂ) :
petzExtendedDual Phi X (0 : Hilbert I →L[ℂ] Hilbert I) =
petzSupportedDual Phi X 0 := by
simp [petzExtendedDual, boundedTracePair, operatorCoeff]
example {I K : Type} (sigma : State K) (X : Matrix I I ℂ) (a b : I × K) :
appendingMap sigma X a b = X a.1 b.1 * sigma.coefficients a.2 b.2 := rfl
/-- Equation (12), PDF p.12: P tensor identity, on completed tensor coordinates. -/
def tensorIdentityEffect {I M : Type} (P : Hilbert I →L[ℂ] Hilbert I) :
Hilbert (I × M) →L[ℂ] Hilbert (I × M) :=
boundedOperator (fun a b => operatorCoeff P a.1 b.1 * (if a.2 = b.2 then 1 else 0))
example {I M : Type} (P : Hilbert I →L[ℂ] Hilbert I) :
tensorIdentityEffect (M := M) P =
boundedOperator (fun a b => operatorCoeff P a.1 b.1 * (if a.2 = b.2 then 1 else 0)) := rfl
end QAlgorithms.Papers.Independent.Gap48.P45
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P45.BoundIndex
For any , is the type of natural numbers satisfying , with the comparison made in . Thus it has elements when is finite, is empty when , and contains every natural number when .
QAlgorithms.Papers.Independent.Gap48.P45.CompleteFamily
For any type , put , and let be any set of states indexed by . A state here has coefficient matrix expressible as , where and ; all its finite quadratic forms are real and nonnegative, and its real diagonal entries form a summable family with sum . For each matrix , let be a chosen bounded complex linear operator with coordinate matrix , or the zero operator if none exists. The assertion means that the norm closure of the complex linear span of equals all of . There is no assumption that or is nonempty; for , this assertion says .
QAlgorithms.Papers.Independent.Gap48.P45.Component
For an arbitrary type and a set of states indexed by , this abbreviation denotes the type of subsets equipped with the property that, for some , is exactly the set of reachable from by a finite chain in , allowing a zero-length chain, whose consecutive members satisfy . Here is a chosen bounded complex linear operator on with coordinate matrix , or zero when no such operator exists. A state matrix admits an entrywise countable expansion by square-summable vectors with summable norm products, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries totaling one. This type has no elements when is empty.
QAlgorithms.Papers.Independent.Gap48.P45.CountableSchmidtOutputs
For arbitrary types , an arbitrary function , and , this predicate says that for every countable nonempty type and every state matrix indexed by , there exist real weights , , summing to one, and vectors , such that every , including those with , has norm one and satisfies for some and . Write and
Both and every must have entrywise countable expansions with square-summable vectors and summable products . For each such matrix , let be a chosen bounded operator with coordinate matrix , or zero if no such operator exists. The operators , , and must, for every finite , admit operator-norm convergent countable rank-one expansions with summable norm products; moreover, the infimum of those norm-product sums for must tend to zero as increases through finite subsets. A state here is a matrix with the stated entrywise expansion, real nonnegative quadratic forms on every finite coordinate set, and summable real diagonal entries totaling one. No separate channel assumption is made on . For , the required norm-one vectors cannot exist, so the predicate is possible only when its universal quantification over input states is vacuous.
QAlgorithms.Papers.Independent.Gap48.P45.DiscreteEnsemble
For any type , let . A discrete ensemble consists of real weights , indexed by every , satisfying and , together with a state on for every , including indices of weight zero. Here a state is a complex matrix indexed by such that there exist sequences with and ; every finite quadratic form , for finite and arbitrary , is real and nonnegative; and the real diagonal entries are summable with . Weights may vanish, and states need not be distinct. No countability or nonemptiness assumption is imposed on ; if is empty, the diagonal normalization prevents such states, and hence such ensembles, from existing.
QAlgorithms.Papers.Independent.Gap48.P45.DualInjective
For arbitrary types , put , and let be any function from complex arrays on to arrays on . For any array , write for a chosen bounded complex-linear operator having coefficients , or zero if no such operator exists. For a bounded complex-linear operator , define the array
where is the input array equal to at row , column , and zero elsewhere. The predicate says that, for every such ,
The displayed sum is the total infinite-sum operation, so it is zero when nonsummable; the outer conversion also returns zero when no bounded operator has those coefficients. No linearity, channel, countability, or nonemptiness assumption on is part of this predicate.
QAlgorithms.Papers.Independent.Gap48.P45.FullRank
For any type and arbitrary complex matrix on , let be a chosen bounded complex-linear operator on whose coefficients satisfy , if such an operator exists, and let otherwise. The predicate asserts
Thus it requires this selected operator to have trivial kernel. No positivity, trace-class, or normalization assumption is imposed on . If no representing operator exists and the Hilbert space is nonzero, the zero fallback fails this condition; on the zero Hilbert space, including when , the condition holds vacuously.
QAlgorithms.Papers.Independent.Gap48.P45.HasBlockCQForm
For arbitrary types , put for each label type . Let be any function from complex arrays on to complex arrays on , let be bounded complex-linear operators, and let . For any array , write for a chosen bounded operator with coefficients , or zero if none exists. The predicate asserts the existence of states with coefficient arrays , indexed by , such that the complex dimension of , recorded as its finite dimension or as for every infinite dimension, is at most , and such that every trace-class coefficient array has the output decomposition
in the precise sense specified below. A coefficient array is trace class here when for vectors in the appropriate with ; a state additionally has real nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum . For each such , the required summation sense is that and all are trace-class coefficient arrays; , all finite sums , and their differences from admit operator nuclear expansions; and
An operator nuclear expansion is an operator-norm convergent sum with summable , and is the real infimum of the costs of all such expansions. The scalar double sums are the total infinite-sum operation; their summability is not separately required. No projection assumptions on , channel assumptions on , or conditions on at non-trace-class inputs are included. The bound imposes no rank restriction; if and is nonempty, the required states cannot exist.
QAlgorithms.Papers.Independent.Gap48.P45.HasBlockNormalForm
For arbitrary types , let , let be any function from complex arrays on to arrays on , let be bounded complex-linear operators, and let . Put , so when . This predicate asserts that there exist a countable nonempty type and vectors , for , whose squared norms sum to in each row and which are pairwise orthogonal within each row, such that the map
is a trace-class channel and is isometrically equivalent to . Here is a chosen bounded operator with coefficient array , or zero if none exists, and all displayed infinite sums use the total infinite-sum operation without additional summability hypotheses. To spell out the channel condition, call trace class when for vectors with summable , and call it a density array when it is trace class, every finite-coordinate quadratic form is real and nonnegative, and its real diagonal is summable with sum . The map must preserve trace class, be additive on trace-class inputs and complex homogeneous there, and, for every and every density array on , the array
indexed overall by , must be a density array. The equivalence condition means that there exists a bounded complex-linear satisfying and, for every trace-class ,
There is no assumption that is an orthogonal resolution, and no condition is imposed on at non-trace-class inputs. When and is nonempty, the row-normalization condition is impossible.
QAlgorithms.Papers.Independent.Gap48.P45.HasBoundedRankKraus
For arbitrary types , a function , , and , this predicate asserts the existence of a countable type , possibly empty, and bounded complex linear operators such that the cardinality of , recorded as its finite cardinality or when infinite, is at most , and the complex algebraic dimension of the range of each , recorded in the same way, is at most . They must satisfy
where the sum converges in Hilbert-space norm through finite subsets of . They must also satisfy, for every matrix admitting an entrywise expansion by square-summable vectors with summable norm products,
Here is a chosen bounded operator with coordinate matrix , or zero if no such operator exists, and . The quantity is the infimum, in , of over all entrywise expansions of of the stated kind, with value if there are none. No channel assumption is separately imposed on . When , every has zero range; when is empty, the normalization sum is zero, so that normalization requires to be the zero space.
QAlgorithms.Papers.Independent.Gap48.P45.HasGramNormalForm
For arbitrary types , put , let be any function from complex arrays on to arrays on , let be bounded complex-linear operators, and let be an arbitrary proposition, the argument named nonzero. This predicate asserts the existence of a countable nonempty type and unit vectors such that, if holds, then for every , and such that
is a trace-class channel and is unitarily equivalent to . Here is a chosen bounded operator with coefficients , or zero if none exists; the nested infinite sums are total sums without separate summability assumptions. Explicitly, a coefficient array is trace class when with summable , and it is a density array when it is trace class, has real nonnegative quadratic forms on all finite coordinate sets, and has summable real diagonal of sum . The channel condition requires to preserve trace class, be additive and complex homogeneous on trace-class inputs, and send every density array on , for every , to a density array on the same label set by the entrywise rule
Unitary equivalence means that there is a surjective complex-linear isometry with
for every trace-class . There is no requirement that hold, and when it does not hold it imposes no restriction on the pairwise inner products. No projection condition on or condition on at non-trace-class inputs is included; if is empty, its vector conditions are vacuous, while the channel and equivalence conditions remain.
QAlgorithms.Papers.Independent.Gap48.P45.HasWhitenedForm
For arbitrary types , an arbitrary map , arbitrary , vectors , and , use the following conventions: ; is a chosen bounded complex-linear operator with coordinate matrix , if one exists, and zero otherwise; is the continuous functional calculus of for ; ; and is a chosen vector in satisfying , or zero if no such vector exists. The predicate requires that this equation actually hold for every , that for every the family have sum in Hilbert-space norm, and that there exist vectors , indexed by and , together with complex matrices on , such that
and both of the following matrix-family summation conditions hold: the matrices , with entries , sum to ; and, for every coefficient-trace-class matrix , the matrices
sum to . Here denotes the matrix with entries , and “coefficient-trace-class” means admitting vectors in the appropriate space such that and . Each asserted matrix-family sum has the following exact meaning: and every are coefficient-trace-class; , every finite sum , and every difference admit an operator-norm-convergent expansion with ; and, as finite increase by inclusion, the real infimum of these expansion costs for tends to zero, where acts by . All total nonsummable complex sums are zero, and real square roots of negative inputs are zero. No separate positivity or normalization hypothesis on , unit-norm hypothesis on , or channel hypothesis on is included. If , ; if and is nonempty, the required row normalization is impossible.
QAlgorithms.Papers.Independent.Gap48.P45.IrreducibleUnitaryAction
For any type , any group equipped with a topology, and any assignment of surjective complex-linear isometries of , this predicate asserts that for every vector , that for every and every , that is continuous for each fixed , and that every complex-linear subspace satisfying for all and is either or the whole Hilbert space. The last condition quantifies over all linear subspaces, without requiring them to be closed. The topology on is not assumed compatible with its group operations, and the zero Hilbert space is not excluded.
QAlgorithms.Papers.Independent.Gap48.P45.IsONDPartition
For an arbitrary type , a set of states indexed by , and a set of sets of such states, this predicate requires that ; that every is nonempty and, for every with both and nonempty, there exist and with ; and that every pair of distinct is disjoint and satisfies for every . Here is a chosen bounded complex linear operator on with coordinate matrix , or zero if no such operator exists. A state matrix admits an entrywise expansion by square-summable vectors with summable norm products, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries totaling one. No nonemptiness assumption on is made: for , precisely the empty collection of parts satisfies these requirements.
QAlgorithms.Papers.Independent.Gap48.P45.NormalizedOrthogonalRows
For arbitrary types , let . This predicate says that, for every , the finite-subset sums of the nonnegative real numbers , indexed by , converge to , and that
Individual vectors may be zero, and no orthogonality between different rows is required. There are no countability or nonemptiness assumptions. If is empty the predicate is vacuous; if is nonempty and is empty, the required sum would be .
QAlgorithms.Papers.Independent.Gap48.P45.OrthogonalResolution
For arbitrary types , let , and let be bounded complex-linear operators indexed by . This predicate says that every is self-adjoint, idempotent, and nonzero; that whenever ; and that, for every , the finite-subset sums converge in norm to . No countability or nonemptiness assumption is imposed on or . In particular, an empty requires , whereas a nonempty requires nonzero projections.
QAlgorithms.Papers.Independent.Gap48.P45.OrthogonallyNondecomposable
For an arbitrary type and a set of states indexed by , this predicate says that every subset for which both and are nonempty contains a state and has a state such that . Here is a chosen bounded complex linear operator on with coordinate matrix , if one exists, and zero otherwise. A state matrix admits an entrywise expansion by square-summable vectors with summable norm products, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries with sum one. The definition does not require itself to be nonempty: it holds vacuously for the empty set and for every singleton.
QAlgorithms.Papers.Independent.Gap48.P45.OrthonormalBasisFamily
For arbitrary types , let and . This predicate says that the vectors are orthonormal over , so is when and otherwise, and that, for every ,
Here the sum converges in the Hilbert-space norm as finite subsets of increase. Neither index type is assumed countable or nonempty; if is empty, the summation condition requires .
QAlgorithms.Papers.Independent.Gap48.P45.PartiallyEntanglementBreaking
For arbitrary types , an arbitrary function , and , this predicate says that for every countable nonempty type and every state indexed by , the matrix defined by
has the following approximation property: for every real , there is a finite real convex combination of matrices such that , with the comparison made in . Here each generating vector has norm one and admits a representation , with , , and . For any matrix , is the infimum of over all entrywise expansions by square-summable vectors with summable norm products; the infimum is when no expansion exists. A state means a matrix admitting such an expansion, whose quadratic form is real and nonnegative for every finite and every complex coordinate function , and whose real diagonal entries form a summable family with sum one. No channel, linearity, or positivity hypothesis is imposed separately on . When , the vector representation forces , so there are no norm-one generators and their convex hull and trace closure are empty; consequently, the predicate can then hold only if there are no input states for the quantified auxiliary types.
QAlgorithms.Papers.Independent.Gap48.P45.PositiveLaw
For an arbitrary type and a function , this predicate means that for every and that the family has sum : the net , indexed by finite subsets ordered by inclusion, converges to . Thus every index must have strictly positive weight; zero weights are excluded. No countability or nonemptiness assumption on is supplied, although the predicate cannot hold when is empty.
QAlgorithms.Papers.Independent.Gap48.P45.ResolutionClassification
For arbitrary types , arbitrary functions and , and an arbitrary family of bounded complex-linear operators , where , this predicate is the conjunction of the following four requirements, with all notation defined here. Write , where is a coordinate unit vector; let be a chosen bounded operator with coefficient matrix , or zero if no such operator exists; and put . A matrix is coordinate trace class when for vectors with ; write for the infimum, over all these representations, of , with infimum when there is no representation. A state is such a matrix whose every finite quadratic form is real and nonnegative and whose real diagonal is summable with sum one. Call a function a channel here when it preserves coordinate trace class, is additive and complex-homogeneous on coordinate trace-class inputs, and, for every and every state on its input index type times , the matrix
is a state; this includes , where there are no such states. Define to mean that and every are coordinate trace class and that the bounded operators sum to in the following specified sense: , every finite partial sum, and every difference between a finite partial sum and admit countable operator-norm convergent expansions with , and the real infimum of over such expansions of each difference tends to zero as the finite subsets increase. Here sends to . Let consist of states , , for which for some , and let consist of states satisfying . The first two requirements are that there exists a channel recovering every state in , and that there exists a channel recovering every state in , meaning and on the respective sets; the two recovery channels need not coincide. To specify the remaining requirements, put
where has its sole nonzero entry, equal to one, at row , column . Let be the closed linear span of all vectors , over input states and , and let be its orthogonal projection. Let
where is ordinary finite dimension when finite and otherwise; likewise write for this dimension of the operator’s range. The third requirement is the existence of states on , each with , such that for every coordinate trace-class ,
For the fourth requirement, set , with the inequality in . There must exist a countable nonempty type and vectors , indexed by , such that as a summable family for every , and whenever . The map
must be a channel, and there must exist a bounded complex-linear with such that, for every coordinate trace-class , and . Infinite complex sums throughout use their total-sum convention. The predicate places no separate projection, orthogonality, completeness, or nonzero assumptions on the supplied family .
QAlgorithms.Papers.Independent.Gap48.P45.SimplifiedRegime
For arbitrary types and an arbitrary map , this predicate holds if either the dual map defined below has zero kernel, or and have equal finite cardinalities, including the possibility that both are empty. To specify the dual, write , let be its coordinate unit vector, and write . For a matrix , let be a chosen bounded complex-linear operator with coefficients , if one exists, and otherwise let . For a bounded operator , put . The first alternative is precisely that, for every bounded complex-linear operator ,
where has entry in row , column , and zero elsewhere. The cardinalities in the second alternative are cardinalities converted to , so every infinite cardinality becomes , which fails the required strict inequality with . The sums defining are total complex sums, equal to zero when the summands are not summable. No channel, linearity, or positivity assumption on is part of this predicate.
QAlgorithms.Papers.Independent.Gap48.P45.StatesOrthogonal
For an arbitrary type and states indexed by , this predicate means exactly , in that order, as bounded operators on . For a matrix , denotes a chosen bounded complex linear operator satisfying , if one exists, and zero otherwise, where is the coordinate unit vector. Each state matrix is required to admit an entrywise expansion , with and summable norm products ; every quadratic form , for finite and arbitrary complex , must be real and nonnegative; and the real diagonal entries must be summable with sum one. No countability or nonemptiness assumption on is stated.
QAlgorithms.Papers.Independent.Gap48.P45.UniqueConvergentBasis
For an arbitrary type , , and vectors indexed by , this predicate means that every has exactly one coefficient function for which
in Hilbert-space norm. The convergence is specifically that of partial sums in natural-number order. For finite , the partial sums eventually equal the full finite sum; for , all natural-number indices occur. For , the sole coefficient function is empty and all partial sums are zero, so the predicate holds exactly when the Hilbert space consists only of zero. No orthogonality or unit-norm condition is explicitly required.
QAlgorithms.Papers.Independent.Gap48.P45.UnitarilyEquivalent
For arbitrary types , put , and let and be arbitrary functions from complex arrays on to arrays on and , respectively. This predicate says that there exists a surjective complex-linear isometry such that, for every coefficient array admitting an expansion
with , one has
Here is the coordinate unit vector, and is a chosen bounded operator having coefficient array , or zero if none exists. Neither function is assumed to be a channel or linear, and the equality is required only at the specified trace-class inputs. Empty label types are allowed, subject to the existence of the stated surjective isometry.
QAlgorithms.Papers.Independent.Gap48.P45.activeStates
For any type and discrete ensemble , this defines the set of states for which there exists with and , where the ensemble has nonnegative real weights summing to one and supplies a state at every index. A state here is a matrix with a representation , , , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum one. Repeated occurrences of the same state give a single element of this set; a state occurring at a zero-weight index belongs precisely when it also occurs at some positive-weight index.
QAlgorithms.Papers.Independent.Gap48.P45.appendingMap
For arbitrary types , a state on , and an arbitrary complex matrix on , this defines the matrix on by
Here has a representation , with and ; its finite quadratic forms are real and nonnegative; and its real diagonal is summable with sum one. No state, positivity, or trace-class assumption is imposed on . Neither type is explicitly required to be countable or nonempty, although the supplied state cannot exist when is empty.
QAlgorithms.Papers.Independent.Gap48.P45.blockDiagonalStates
For arbitrary types , put , let be its coordinate unit vectors, and let be arbitrary bounded complex-linear operators. For an array , write for a chosen bounded operator satisfying , if such an operator exists, and for zero otherwise, and set
The defined set consists of precisely those states with coefficient array for which the following summation requirements hold. Here a state means that for some with , every finite quadratic form has zero imaginary part and nonnegative real part, the real diagonal is summable, and . The requirements are that and each admit such coefficient expansions, and that , every , and every , for finite , admit operator nuclear expansions. An operator nuclear expansion of means sequences with summable such that converges to in operator norm. Finally,
as finite subsets increase. No projection or orthogonality condition on is part of this definition. If is empty, these conditions cannot hold for a state: the constant error has size , which is bounded below by the nonzero operator norm of .
QAlgorithms.Papers.Independent.Gap48.P45.blockNormalMap
For arbitrary types , put , let be bounded complex-linear operators, let for , and let be any complex array on . Write for the coordinate unit vectors and for a chosen bounded operator satisfying , or zero if no such operator exists. The defined output is the array on given by
These are nested total infinite sums: no summability assumption is included, and a nonsummable inner or outer sum takes the value zero according to that operation. No positivity, normalization, projection, or orthogonality hypotheses are imposed. In particular, the right-hand factor is , without an adjoint, and an empty gives the zero array.
QAlgorithms.Papers.Independent.Gap48.P45.blockPureStates
For arbitrary types , let , and let be arbitrary bounded complex-linear operators. This is the set of states with coefficient array such that there is a unit vector with , and there is an index such that
Here is the coordinate unit vector, and is a chosen bounded operator with coefficients , or zero if no such operator exists. A state, as required independently by membership in the ambient state space, has a coefficient expansion with , has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal with sum . No projection or orthogonality assumption on is imposed. An empty gives the empty set.
QAlgorithms.Papers.Independent.Gap48.P45.boundedTracePair
For any type , any complex matrix indexed by , and any bounded complex linear operator , where , let be a chosen bounded complex linear operator whose coordinate matrix is , if one exists, and otherwise. Writing for the coordinate unit vector, the complex number is defined by
There is no trace class or summability hypothesis on or ; the displayed total sum is defined to be if its complex summand family is not summable. It is also if has no bounded operator realization or is empty.
QAlgorithms.Papers.Independent.Gap48.P45.channelDual
For arbitrary types , any function , and any bounded complex linear operator , where , define , for a square matrix on either index type, to be a chosen bounded complex linear operator with coordinate matrix , or if no such operator exists. Let be the matrix on with entry at row , column , and zero elsewhere, and define the matrix on by
Then . Each displayed complex sum is when its summand family is not summable, and the final operator is if has no bounded operator realization. No channel, linearity, countability, or nonemptiness assumption on is made.
QAlgorithms.Papers.Independent.Gap48.P45.coefficientSupportProjection
For an arbitrary type and complex matrix indexed by , let and let be a chosen bounded complex-linear operator satisfying for all , if one exists, and zero otherwise, where is the coordinate unit vector. This definition returns the bounded orthogonal projection onto the norm closure of the range of . No positivity, self-adjointness, or trace-class assumption on is imposed; if has no bounded operator with these coefficients, the returned projection is zero.
QAlgorithms.Papers.Independent.Gap48.P45.coefficientTraceHasSum
For arbitrary types , matrices indexed by , and , this predicate requires the following. First, each of and every admits an entrywise expansion , where and is summable. For any matrix , let be a chosen bounded complex linear operator on satisfying , if such an operator exists, and zero otherwise, where is the coordinate unit vector. The remaining requirements concern these operators: , every finite sum , and every , for finite , must admit an expansion converging in operator norm, with summable; here sends to . Defining as the real infimum of over all such expansions, the net must tend to zero as increases through all finite subsets of . This real infimum is defined to be zero when its defining set is empty, although the explicit expansion requirements exclude that case for the operators used in this limit. No countability or nonemptiness assumption is imposed on ; if is empty, the finite sum is always zero.
QAlgorithms.Papers.Independent.Gap48.P45.componentProjection
For an arbitrary type , a set of states indexed by , and an element of its component type, let be the underlying subset specified by . Thus, for some , consists of all states reachable from by finite chains in , including the zero-length chain, whose consecutive members satisfy . This definition returns the bounded complex linear orthogonal projection on onto
For a matrix , is a chosen bounded operator having coordinate matrix , or zero if no such operator exists. A state matrix admits an entrywise countable expansion by square-summable vectors with summable norm products, has real nonnegative quadratic forms on finite coordinate sets, and has summable real diagonal entries with sum one. The closure in the displayed subspace is Hilbert-space norm closure. When is empty, there is no admissible argument .
QAlgorithms.Papers.Independent.Gap48.P45.componentSets
For an arbitrary type and a set of states indexed by , this definition gives the set of subsets for which there exists such that consists exactly of the states reachable from by a finite chain , allowing , with every consecutive pair in satisfying . For each matrix , is a chosen bounded operator on having coordinate matrix , or zero if none exists. A state matrix has an entrywise countable expansion by square-summable vectors with summable norm products, real nonnegative quadratic forms on finite coordinate sets, and summable real diagonal entries with sum one. Equal subsets arising from different choices of are the same element of this set of subsets. If is empty, the defined set is empty.
QAlgorithms.Papers.Independent.Gap48.P45.connectedComponent
For an arbitrary type , a set of states indexed by , and a state , this definition gives the set of states such that and there is a finite chain , with , whose consecutive states satisfy and for every . Here is a chosen bounded complex linear operator on having coordinate matrix , or zero if no such operator exists. A state matrix admits an entrywise countable expansion by square-summable vectors with summable norm products, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries totaling one. The zero-length chain is allowed, so belongs to this set whenever , without requiring a nonzero operator product for that chain; if , the defined set is empty.
QAlgorithms.Papers.Independent.Gap48.P45.dimensionCount
For any type , including an empty or infinite type, is the cardinality of converted to : it equals when has exactly elements and equals when is infinite.
QAlgorithms.Papers.Independent.Gap48.P45.discreteAverageCoefficients
For any type and discrete ensemble , write , let be its coordinate unit vector, and let , , and be the ensemble’s weights and state matrices. Each state matrix has an expansion with , real nonnegative finite quadratic forms, and summable real diagonal of sum one. For a matrix , define to be a chosen bounded complex-linear operator satisfying , if one exists, and the zero operator otherwise. Form the array
Choose a bounded complex-linear operator with for all , if one exists, and set otherwise. The defined average matrix is . These choices and their zero fallbacks are part of the definition; the complex infinite sums are total sums, which take the value zero when the corresponding families are not summable.
QAlgorithms.Papers.Independent.Gap48.P45.discreteHolevo
For arbitrary types , an arbitrary function , and a discrete ensemble on , this defines the extended nonnegative quantity
Here , , and each is a state: it has a coordinate nuclear expansion with and , real nonnegative finite quadratic forms, and summable real diagonal of sum one. To obtain , replace each by a chosen bounded operator with those coordinate coefficients, or by zero if none exists; take the weighted sums of the resulting coefficients; choose a bounded operator representing this new array, or zero if none exists; and take its coordinate coefficients. For matrices on , is the supremum over all finite of
where are the coordinate compressions to , and the logarithms use real continuous functional calculus. The finite subset is included. The function replaces negative real values by zero. No channel, linearity, positivity, or finiteness assumption is made on ; the sum and products use extended nonnegative arithmetic, including .
QAlgorithms.Papers.Independent.Gap48.P45.discreteProbabilityLaw
For any type and discrete ensemble , this defines the probability mass function on whose mass at is , equivalently regarded as an extended nonnegative real, where and are the ensemble’s weights. Thus zero weights give zero probability, and the masses sum to one. The ensemble also supplies a matrix state for every : each has a representation by vectors in with , has real nonnegative finite quadratic forms, and has summable real diagonal of sum one. These states do not enter the formula for the probability mass function.
QAlgorithms.Papers.Independent.Gap48.P45.familyProjection
For any type , let , and let be any set of states indexed by . A state has a coefficient matrix with an expansion , where and , with every finite quadratic form real and nonnegative, and with summable real diagonal entries totaling . Write for a chosen bounded complex linear operator with coordinate matrix , or if such an operator does not exist. Then is the orthogonal projection onto the norm closure of the complex linear span of all , where comes from a state in and . This closed subspace is complete, as used in constructing the projection. Empty sets are allowed and give the zero projection; no countability or nonemptiness assumption on is required.
QAlgorithms.Papers.Independent.Gap48.P45.finiteEntropyGain
For arbitrary types , an arbitrary function , and an arbitrary matrix on , this defines the real number
For any matrix on an index type , the entropy used here is
where is its coordinate compression to , uses real continuous functional calculus, and truncates negative real values to zero. The empty compression is included. Neither entropy is assumed finite, and ; consequently the definition uses this zero value whenever either entropy is infinite. No state or channel assumptions are required.
QAlgorithms.Papers.Independent.Gap48.P45.generatedSpace
For any type , put , and let be any set of states indexed by . Here a state is a complex matrix admitting vectors , indexed by , with and , such that every finite quadratic form , for finite and arbitrary , is real and nonnegative, and such that is summable with sum . For any matrix , let be a chosen bounded complex linear operator satisfying for all , if such an operator exists, and let otherwise, where is the coordinate unit vector. Then is the norm closure of the complex linear span of all , with the coefficient matrix of a state in and . In particular, an empty generates the zero subspace; no countability or nonemptiness assumption on is imposed.
QAlgorithms.Papers.Independent.Gap48.P45.gramNormalMap
For arbitrary types , put , let be bounded complex-linear operators, let , and let be any complex array on . With the coordinate unit vector and a chosen bounded operator satisfying , or zero if no such operator exists, this definition gives the array
The nested sums are total infinite sums and carry no separate convergence assumptions; a nonsummable sum has value zero. No projection or orthogonality conditions on , normalization conditions on , or trace-class condition on are imposed. The factor on the right of is , without an adjoint, and an empty gives the zero array.
QAlgorithms.Papers.Independent.Gap48.P45.inverseRootImage
For an arbitrary type , a complex matrix indexed by , and , let be a chosen bounded complex-linear operator on satisfying for every , if such an operator exists, and otherwise let ; here is the coordinate unit vector. Let be the continuous functional calculus of for the complex-valued function , with the real square root interpreted as zero on negative inputs. This definition chooses a vector satisfying
if such a vector exists, and returns otherwise. No positivity, self-adjointness, or bounded representability assumption on , and no solvability assumption for the displayed equation, is imposed.
QAlgorithms.Papers.Independent.Gap48.P45.operatorRank
For arbitrary types , let and . For every bounded complex linear operator , is the algebraic complex dimension of its range, converted to . Thus it is the usual finite rank when the range is finite dimensional, and otherwise; the range is not replaced by its closure. Empty index types and the zero operator are included.
QAlgorithms.Papers.Independent.Gap48.P45.orderedPartialSum
For an arbitrary type , , vectors and complex coefficients indexed by , and , this definition returns
This is a finite sum in the natural-number order, with indices outside contributing zero. It is zero when or ; when is finite, it becomes constant once ; and when , it includes exactly the indices . No normalization, independence, or convergence assumption is imposed.
QAlgorithms.Papers.Independent.Gap48.P45.outputProjection
For arbitrary types , put and , and let be any function. A state indexed by has coefficient matrix expressible as , where and , with real nonnegative finite quadratic forms and summable real diagonal entries totaling . For any matrix indexed by , let be a chosen bounded complex linear operator on with coordinate matrix , or if none exists. Then is the bounded complex linear orthogonal projection onto the norm closure of the complex linear span of . The closedness of this subspace supplies its completeness. No channel, countability, or nonemptiness hypothesis is imposed; if there are no input states, the projection is zero.
QAlgorithms.Papers.Independent.Gap48.P45.outputSpace
For arbitrary types , let , , and let be any function, with no linearity, positivity, or channel assumption. A state indexed by has coefficient matrix admitting an expansion , where and , such that all finite quadratic forms are real and nonnegative and its real diagonal is summable with sum . For any matrix indexed by , let be a chosen bounded complex linear operator with , if one exists, and otherwise. Then is the norm closure of the complex linear span of all , where ranges over coefficient matrices of states indexed by and . If there are no input states, this is the zero subspace; outputs having no bounded operator realization contribute only zero vectors.
QAlgorithms.Papers.Independent.Gap48.P45.petzExtendedDual
For arbitrary types , an arbitrary matrix map , a matrix on , and a bounded complex-linear operator on , write , let be a chosen bounded operator with coordinate matrix , if one exists, and zero otherwise, and let be its continuous functional calculus for . Let be the orthogonal projection onto , and let be a chosen bounded operator on satisfying and , or zero if no such operator exists. This definition returns
The scalar sum is a total complex sum and is zero if its summands are not summable; real square roots of negative inputs are zero. The formula imposes no channel, positivity, trace-class, or normalization assumptions on its inputs.
QAlgorithms.Papers.Independent.Gap48.P45.petzRecovery
For arbitrary types , an arbitrary map , a matrix on , and a matrix on , write , , and let be a chosen bounded operator with coordinate matrix , if one exists, and zero otherwise. Put using the continuous functional calculus for , let be the orthogonal projection onto , and define . For each bounded on , let be a chosen bounded operator on satisfying
or zero if none exists, and put . The returned matrix has entries
where has its sole nonzero entry in row , column . Every nonsummable total complex sum here is zero, and real square roots of negative inputs are zero. No assumption makes a channel or makes or positive, normalized, or trace-class.
QAlgorithms.Papers.Independent.Gap48.P45.petzSupportedDual
For arbitrary types , an arbitrary map , an arbitrary matrix on , and a bounded complex-linear operator on , write . For any matrix , let be a chosen bounded operator with coefficients , if one exists, and zero otherwise; let be the continuous functional calculus of for , using real square root, which is zero on negative inputs; and let be the orthogonal projection onto . This definition chooses a bounded complex-linear operator satisfying
if such an operator exists, and returns zero otherwise. No channel assumption on , state or positivity assumption on , or self-adjointness or positivity assumption on or the chosen is imposed.
QAlgorithms.Papers.Independent.Gap48.P45.rankMultiplicity
For arbitrary types , any function , and any natural number , including , put and let denote a chosen bounded complex linear operator with coordinate matrix , or if none exists. A state coefficient matrix on admits an expansion , with and , has all finite quadratic forms real and nonnegative, and has summable real diagonal entries totaling . Let be the norm closure of the complex linear span of all , for such matrices and , and let be its orthogonal projection. For every bounded complex linear operator on , set , where has entry at row , column , and zero elsewhere; nonsummable complex sums are assigned . Let be the complex linear span of all such satisfying and . If means the algebraic complex dimension of , retaining finite dimensions and replacing infinite dimensions by , then
No channel or nonemptiness assumptions are imposed, and all bounded operator fallbacks remain part of this definition; when , the first argument of the minimum is .
QAlgorithms.Papers.Independent.Gap48.P45.restrictedDualNullity
For arbitrary types , let and let be any function. For every square matrix , write for a chosen bounded complex linear operator with coordinate matrix , or if none exists. A state coefficient matrix on has an expansion , with and , all finite quadratic forms real and nonnegative, and summable real diagonal entries totaling . Let be the orthogonal projection onto the norm closure of the complex linear span of all , for such state matrices and . For a bounded complex linear operator on , define , where has its sole nonzero entry at ; a nonsummable complex sum here has value . Then is the algebraic complex dimension of
converted to , with every infinite dimension mapped to . This span is not topologically closed in the definition, and includes the fallback case in which has no bounded operator realization. No channel, countability, or nonemptiness assumptions are imposed.
QAlgorithms.Papers.Independent.Gap48.P45.separableConditionalEntropyNats
For arbitrary types and an arbitrary complex matrix indexed by , this defines
The displayed sum is the total complex infinite sum, equal to zero if the corresponding family is not summable. For a matrix on any index type, is the supremum over all finite coordinate compressions , including the empty one, of
with the matrix logarithm interpreted by real continuous functional calculus and truncating negative values to zero. Both occurrences of send to zero. The definition assumes neither separability nor positivity, normalization, trace-class membership, or finite entropy.
QAlgorithms.Papers.Independent.Gap48.P45.tensorIdentityEffect
For arbitrary types and any bounded complex-linear operator on , let denote the coordinate unit vector. This defines a bounded complex-linear operator on by choosing an operator whose coordinate coefficients satisfy
if such a bounded operator exists, and returning the zero operator otherwise. No positivity, self-adjointness, projection, countability, or nonemptiness assumptions are imposed. If either index type is empty, the resulting operator acts on the zero Hilbert space.
QAlgorithms.Papers.Independent.Gap48.P45.vectorAverage
For arbitrary types , arbitrary real weights , and arbitrary vectors , this definition returns the complex matrix with entries
Each entry is defined by its own total complex sum, which is zero if that entry’s summands are not summable. There is no assumption that the weights are nonnegative, sum to , or are summable, and no assumption that the vectors have unit norm. For empty , the resulting matrix is zero.
QAlgorithms.Papers.Independent.Gap48.P45.vectorStates
For arbitrary types and an arbitrary family , this definition gives the set of states indexed by for which there exists such that
A state matrix is required to admit an entrywise countable expansion by square-summable vectors with summable norm products, to have real nonnegative quadratic forms on every finite coordinate set, and to have summable real diagonal entries with sum one. There is no normalization, orthogonality, completeness, countability, or nonemptiness hypothesis on the family ; membership still requires the displayed matrix to satisfy all state conditions, in particular the diagonal-sum condition . If is empty, this set is empty.
QAlgorithms.Papers.Independent.Gap48.P45.whitenedVector
For arbitrary types , real weights , vectors , and an index , form the matrix whose entries are , with each nonsummable complex sum defined as zero. Let be a chosen bounded complex-linear operator with coordinate matrix , if one exists, and zero otherwise, and let be its continuous functional calculus for . The returned vector is a chosen solution of
if one exists, and is zero otherwise. Here real square roots of negative numbers are zero, so a nonpositive weight gives a zero target. The definition assumes neither a positive probability law nor unit vectors.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.