Definitions for Quantum f-divergences and error correction
DefinitionQAlgorithms_Papers_Independent_Support50_P12The objects the formalized statements of Quantum f-divergences and error correction (arXiv:1008.2529) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Algsupp: Section 2, p.4: support projection, including support(0)=0.AlgebraDensity: Section 2, p.4: density operators in the stated concrete algebra.spec: Section 2, p.5: distinct spectral values, including zero when it is an eigenvalue.cpow: Section 2, p.5: support-zero complex powers, including z=0.modular: Equation (2.1), p.5: functional calculus of L_A R_(B^-1), acting on X.quasi: Definition 2.1, p.5: the finite Hilbert–Schmidt expression.recessionSlope: Definition 2.1, p.5: recession slope in signed extended reals.DivergenceGenerator: Definition 2.1, p.5: continuity only at strictly positive arguments and existence of the signed extended recession slope. Values at negative arguments are unused.div: Definition 2.1, p.5: supported expression, and one-sided regularization otherwise.supportScalarPower: Example 2.7, pp.6–7: scalar support powers, also at exponent zero.petzRenyi: Example 2.7, pp.6–7: unnormalized Petz Rényi relative entropy.AlgebraExtension: Section 3, p.9: canonical extensions of maps between concrete algebras. The range conditions mean Phi=i_B ◦ phi ◦ E_A; E_A is the trace-orthogonal projection.PositiveOnConcreteAlgebra: Section 3, p.9: positivity only on the stated algebra.AlgebraTracePreserving: Section 3, p.9: trace preservation on the stated algebra.AlgebraTraceNonincreasing: Section 3, p.9: trace non-increase on positive elements.SchwarzBound: Section 3, p.12: Schwarz bound, including positivity at coefficient zero.AlgebraSchwarzMap: Section 3, p.12: finite Schwarz norm means existence of a nonnegative bound.snorm: Section 3, p.12: extended norm, +infinity if there is no Schwarz bound.pnorm: Section 3, p.12: operator norm, using the source equality for positive maps.Substochastic: Section 3, p.12: the adjoint Schwarz condition, not a CP condition.AlgebraStochastic: Section 3, p.12: stochastic = trace preserving and substochastic.modularContraction: Equation (4.1), p.16: the actual Hilbert–Schmidt contraction V.CornerTP: Section 3, p.10: trace preservation on a support corner.amp: Section 3, p.9: n×n block amplification of a map, acting on genuine block entries.AlgebraKPositive: Section 3, p.9: n-positivity on all positive block matrices over the domain algebra.AlgebraCompletelyPositive: Section 3, p.9: complete positivity at every finite amplification size.CoBound: Remark 4.8, p.20: co-Schwarz condition, with reversed product in the argument.CoSubstochastic: Remark 4.8, p.20: co-substochastic maps use the adjoint co-Schwarz contraction.CoStochastic: Remark 4.8, p.20: co-stochastic maps.KCoPositive: Remark 5.7, p.26: n-copositivity is positivity after transposing each input block.SemidefiniteOperatorConvex: Section 4, p.17: all-size operator convexity INCLUDING semidefinite matrices.PosReal: Theorem 8.1, pp.37–38: measures live on the OPEN positive half-line.representationKernel: Equation (8.2), p.37: the combined kernel is integrated as one function.HalfLineRepresentation: Theorem 8.1, p.37: a genuine integral representation, with integrability guards.continuousPart: Equation (5.1), p.21: remove the possible jump at zero before representing f.representingMeasure: Section 5, p.21: the unique representing measure, computed from the continuous part. Only operator convex functions are used in measure-support criteria.Rich: Sections 5 and 7: actual cardinal support, including infinite support.resolventGenerator: Equation (4.9), p.17.modularSpec: Section 5, p.21: spectrum of the relative modular operator on the stated algebra.logOverlap: Definition 6.1, p.27: raw log-overlap, no normalization by trace.chernoff: Definition 6.1, p.27: Chernoff supremum on [0,1).hoeffding: Definition 6.1, p.27: Hoeffding distance as a signed extended supremum.psiReal: Remark 6.2, pp.27–28: finite log-overlap representative, used only on nonorthogonal pairs.logOverlapPerspective: Remark 6.2, p.27: perspective, including +infinity on the negative half-line.polar: Remark 6.2, p.27: Legendre–Fenchel transform in extended reals.Reversible: Sections 6–7: exact recoverability of a positive pair by one stochastic map.RepresentsStateDivergence: Section 6, p.30: representability on the state space of one algebra.TwoProjections: Section 6, p.30: nontrivial algebras admit two nonzero orthogonal projections.Noncommutative: Sections 6–7: noncommutativity is a property of the actual observable algebra.signedSchatten: Proposition A.6, p.46: norm-like functional for ALL nonzero real exponents. The zero-matrix branch is explicitly zero, including at negative q.SpectralAlphabet: Lemma 2.9, p.7: the exact product spectral alphabet.law1: Lemma 2.9, p.7: the first classical distribution a Tr(P_a Q_b).law2: Lemma 2.9, p.7: the second classical distribution b Tr(P_a Q_b).isometricConjugation: Corollary 2.5, p.6: linear isometries, or anti-linear isometries via transpose.pairConditions: Section 5, p.21: ten conditions, computed from the input pair. The Boolean selects Remark 5.7's co-variant, changing precisely (i),(ii),(vi)–(viii).PairChain: Theorem 5.1, pp.21–25: asymmetric implication chain, never a blanket equivalence.RecoveryRefinement: Sections 5 and 7: preserve the positivity level when a stochastic recovery exists.hull: Section 7, p.33: CLOSED convex hull in the finite-dimensional matrix topology.Covers: Section 7, p.33: maximal support without choosing an unrelated projection.CodeSupportEquals: Section 7, p.33: equality of a reference support with the join of code supports.RecoveryBlocks: Section 7, p.34: shared direct-sum/tensor data. Algebraic action and cone equality are deliberately NOT fields; they are conclusions in the theorems below.inputBlock: Shared block embedding on the input side, equation (3.8), p.15.outputBlock: Shared block action on the output side, equation (3.8), p.15.BlockSupports: Section 7, p.34: support joins are exactly the direct sum of all the shared blocks.BlockState: Section 7, p.34: a code state has variable left states and probabilities, while the noise states, embeddings, and unitaries are shared across the whole code.bayesianTestingDistance: Equation (6.8), p.29: optimal Bayesian error normalized by min(p,1-p).codeConditions: Theorem 7.1, pp.33–34: its ten uniform criteria.MonotoneRepresentation: Section 6, p.30: monotone functions are strictly increasing on the ATTAINED extended divergence range, rather than on an arbitrary real domain.transposeNoise: Example 3.6, p.12: transpose mixed with complete depolarization.identityNoise: Example 3.6, pp.12–13: identity mixed with complete depolarization.transposeMix: Example 3.6, p.13: transpose mixed with identity.transposeDefect: Example 3.6, p.12: the full six-term Schwarz defect expansion.MonotoneMap: Remark 4.8, pp.20–21: maps monotone for a specified f.renyiOne: Remark 6.2, p.28: limiting order-one entropy, before identifying it on states.exampleRho: Example 6.6, p.31: the stated diagonal state.exampleSigma: Example 6.6, p.31: the stated reference state.merge: Example 6.6, p.31: canonical extension of the diagonal block-merging map.diagonalAlgebra: Section 6, p.31: the concrete diagonal observable algebra.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Learning
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P04
import Definitions.Def_QAlgorithms_Defs_SpectralFilter
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P30
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P60
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P28
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P17
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P23
import Definitions.Def_QAlgorithms_Papers_Independent_Support21_P03
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_QuantumOutputMetrics
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P71
/-! Hiai–Mosonyi–Petz–Beny, arXiv:1008.2529v6.
Accepted primitives supply matrices, linear maps, trace, Hilbert–Schmidt product,
spectral calculus, support inclusion, adjoints, Petz recovery and tensor-state powers.
Remaining paper-specific definitions use actual representation traces and support-zero powers.
An intrinsic algebra map is represented by its canonical full-matrix extension:
inclusion after the map after the trace-orthogonal projection onto its domain.
`AlgebraExtension` characterizes exactly these extensions by the ranges of the map and
its computed Hilbert–Schmidt adjoint. It adds no positivity or trace assumption.
Compilation is pending the authorized batch handoff. -/
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
abbrev Alg (I : Type) [Fintype I] [DecidableEq I] := StarSubalgebra ℂ (Mat I)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Section 2, p.4: support projection, including support(0)=0. -/
def supp (X : Mat I) : Mat I := supportPower X 0
/-- Section 2, p.4: density operators in the stated concrete algebra. -/
def AlgebraDensity (A : Alg I) (rho : Mat I) : Prop := rho ∈ A ∧ rho.PosSemidef ∧ tr rho = 1
/-- Section 2, p.5: distinct spectral values, including zero when it is an eigenvalue. -/
def spec (X : Mat I) : Finset ℝ :=
if h : X.IsHermitian then Finset.univ.image h.eigenvalues else ∅
/-- Section 2, p.5: support-zero complex powers, including z=0. -/
def cpow (X : Mat I) (z : ℂ) : Mat I :=
spectralFunction (fun a => if a = 0 then 0 else Complex.exp (z * (Real.log a : ℂ))) X
/-- Equation (2.1), p.5: functional calculus of L_A R_(B^-1), acting on X. -/
def modular (f : ℝ → ℝ) (A B X : Mat I) : Mat I :=
∑ a ∈ spec A, ∑ b ∈ spec B, (f (a / b) : ℂ) • (spectralProjector A a * X * spectralProjector B b)
/-- Definition 2.1, p.5: the finite Hilbert–Schmidt expression. -/
def quasi (f : ℝ → ℝ) (A B : Mat I) : ℝ :=
(hs (supportPower B (1 / 2)) (modular f A B (supportPower B (1 / 2)))).re
/-- Definition 2.1, p.5: recession slope in signed extended reals. -/
def recessionSlope (f : ℝ → ℝ) : EReal := limUnder atTop (fun x : ℝ => ((f x / x : ℝ) : EReal))
/-- Definition 2.1, p.5: continuity only at strictly positive arguments and existence
of the signed extended recession slope. Values at negative arguments are unused. -/
def DivergenceGenerator (f : ℝ → ℝ) : Prop :=
ContinuousOn f (Ioi 0) ∧ Tendsto (fun x : ℝ => ((f x / x : ℝ) : EReal)) atTop (𝓝 (recessionSlope f))
/-- Definition 2.1, p.5: supported expression, and one-sided regularization otherwise. -/
def div (f : ℝ → ℝ) (A B : Mat I) : EReal :=
if Supports A B then (quasi f A B : EReal) else
limUnder (𝓝[>] (0 : ℝ)) (fun e => (quasi f A (B + (e : ℂ) • 1) : EReal))
/-- Example 2.7, pp.6–7: scalar support powers, also at exponent zero. -/
def supportScalarPower (a x : ℝ) : ℝ := if x = 0 then 0 else Real.rpow x a
/-- Example 2.7, pp.6–7: unnormalized Petz Rényi relative entropy. -/
def petzRenyi (a : ℝ) (A B : Mat I) : EReal :=
if Supports A B ∨ a < 1 then
(((a - 1)⁻¹ : ℝ) : EReal) * logNonnegativeExtended (tr (supportPower A a * supportPower B (1 - a)))
else ⊤
/-- Section 3, p.9: canonical extensions of maps between concrete algebras.
The range conditions mean Phi=i_B ◦ phi ◦ E_A; E_A is the trace-orthogonal projection. -/
def AlgebraExtension (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) : Prop :=
(∀ X, Phi X ∈ B) ∧ (∀ Y, channelAdjoint Phi Y ∈ A)
/-- Section 3, p.9: positivity only on the stated algebra. -/
def PositiveOnConcreteAlgebra (A : Alg I) (Phi : Mat I → Mat J) : Prop :=
∀ X ∈ A, X.PosSemidef → (Phi X).PosSemidef
/-- Section 3, p.9: trace preservation on the stated algebra. -/
def AlgebraTracePreserving (A : Alg I) (Phi : Mat I → Mat J) : Prop := ∀ X ∈ A, (Phi X).trace = X.trace
/-- Section 3, p.9: trace non-increase on positive elements. -/
def AlgebraTraceNonincreasing (A : Alg I) (Phi : Mat I → Mat J) : Prop :=
∀ X ∈ A, X.PosSemidef → tr (Phi X) ≤ tr X
/-- Section 3, p.12: Schwarz bound, including positivity at coefficient zero. -/
def SchwarzBound (A : Alg I) (Phi : Mat I → Mat J) (c : ℝ) : Prop :=
0 ≤ c ∧ PositiveOnConcreteAlgebra A Phi ∧ ∀ X ∈ A, LE ((Phi X)ᴴ * Phi X) ((c : ℂ) • Phi (Xᴴ * X))
/-- Section 3, p.12: finite Schwarz norm means existence of a nonnegative bound. -/
def AlgebraSchwarzMap (A : Alg I) (Phi : Mat I → Mat J) : Prop := ∃ c, SchwarzBound A Phi c
/-- Section 3, p.12: extended norm, +infinity if there is no Schwarz bound. -/
def snorm (A : Alg I) (Phi : Mat I → Mat J) : ℝ≥0∞ :=
sInf {c | ∃ r : ℝ, SchwarzBound A Phi r ∧ c = ENNReal.ofReal r}
/-- Section 3, p.12: operator norm, using the source equality for positive maps. -/
def pnorm (Phi : Mat I → Mat J) : ℝ :=
Real.sqrt (sSup {x : ℝ | ∃ v : J → ℂ, ∑ j, ‖v j‖ ^ 2 = 1 ∧
x = (∑ j, conj (v j) * (((Phi 1)ᴴ * Phi 1) *ᵥ v) j).re})
/-- Section 3, p.12: the adjoint Schwarz condition, not a CP condition. -/
def Substochastic (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) : Prop :=
AlgebraExtension A B Phi ∧ SchwarzBound B (channelAdjoint Phi) 1
/-- Section 3, p.12: stochastic = trace preserving and substochastic. -/
def AlgebraStochastic (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) : Prop :=
Substochastic A B Phi ∧ AlgebraTracePreserving A Phi
/-- Equation (4.1), p.16: the actual Hilbert–Schmidt contraction V. -/
def modularContraction (Phi : MatrixMap I J) (B : Mat I) (X : Mat J) : Mat I :=
channelAdjoint Phi (X * supportPower (Phi B) (-(1 / 2))) * supportPower B (1 / 2)
/-- Section 3, p.10: trace preservation on a support corner. -/
def CornerTP (A : Alg I) (Phi : Mat I → Mat J) (P : Mat I) : Prop :=
∀ X ∈ A, (Phi (P * X * P)).trace = (P * X * P).trace
/-- Section 3, p.9: n×n block amplification of a map, acting on genuine block entries. -/
def amp (Phi : Mat I → Mat J) (n : ℕ) (X : Mat (Fin n × I)) : Mat (Fin n × J) :=
fun u v => Phi (fun i j => X (u.1, i) (v.1, j)) u.2 v.2
/-- Section 3, p.9: n-positivity on all positive block matrices over the domain algebra. -/
def AlgebraKPositive (A : Alg I) (Phi : Mat I → Mat J) (n : ℕ) : Prop :=
∀ X : Mat (Fin n × I), (∀ a b, (fun i j => X (a, i) (b, j)) ∈ A) →
X.PosSemidef → (amp Phi n X).PosSemidef
/-- Section 3, p.9: complete positivity at every finite amplification size. -/
def AlgebraCompletelyPositive (A : Alg I) (Phi : Mat I → Mat J) : Prop := ∀ n, AlgebraKPositive A Phi n
/-- Remark 4.8, p.20: co-Schwarz condition, with reversed product in the argument. -/
def CoBound (A : Alg I) (Phi : Mat I → Mat J) (c : ℝ) : Prop :=
0 ≤ c ∧ PositiveOnConcreteAlgebra A Phi ∧ ∀ X ∈ A, LE ((Phi X)ᴴ * Phi X) ((c : ℂ) • Phi (X * Xᴴ))
/-- Remark 4.8, p.20: co-substochastic maps use the adjoint co-Schwarz contraction. -/
def CoSubstochastic (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) : Prop :=
AlgebraExtension A B Phi ∧ CoBound B (channelAdjoint Phi) 1
/-- Remark 4.8, p.20: co-stochastic maps. -/
def CoStochastic (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) : Prop :=
CoSubstochastic A B Phi ∧ AlgebraTracePreserving A Phi
/-- Remark 5.7, p.26: n-copositivity is positivity after transposing each input block. -/
def KCoPositive (A : Alg I) (Phi : Mat I → Mat J) (n : ℕ) : Prop :=
∀ X : Mat (Fin n × I), (∀ a b, (fun i j => X (a, j) (b, i)) ∈ A) →
X.PosSemidef → (amp (fun Y => Phi (Yᵀ)) n X).PosSemidef
/-- Section 4, p.17: all-size operator convexity INCLUDING semidefinite matrices. -/
def SemidefiniteOperatorConvex (f : ℝ → ℝ) : Prop :=
∀ (n : ℕ) (A B : Mat (Fin n)), A.PosSemidef → B.PosSemidef →
∀ t ∈ Icc (0 : ℝ) 1,
LE (cfc f ((t : ℂ) • A + ((1 - t : ℝ) : ℂ) • B))
((t : ℂ) • cfc f A + ((1 - t : ℝ) : ℂ) • cfc f B)
/-- Theorem 8.1, pp.37–38: measures live on the OPEN positive half-line. -/
abbrev PosReal := {t : ℝ // 0 < t}
/-- Equation (8.2), p.37: the combined kernel is integrated as one function. -/
def representationKernel (x : ℝ) (t : PosReal) : ℝ := x / (1 + t.1) - x / (x + t.1)
/-- Theorem 8.1, p.37: a genuine integral representation, with integrability guards. -/
def HalfLineRepresentation (f : ℝ → ℝ) (a b : ℝ) (mu : Measure PosReal) : Prop :=
0 ≤ b ∧ Integrable (fun t : PosReal => (1 + t.1)⁻¹ ^ 2) mu ∧
∀ x ≥ 0, Integrable (representationKernel x) mu ∧
f x = f 0 + a * x + b * x ^ 2 + ∫ t, representationKernel x t ∂mu
/-- Equation (5.1), p.21: remove the possible jump at zero before representing f. -/
def continuousPart (f : ℝ → ℝ) (x : ℝ) : ℝ :=
if x = 0 then limUnder (𝓝[>] (0 : ℝ)) f else f x
/-- Section 5, p.21: the unique representing measure, computed from the continuous part.
Only operator convex functions are used in measure-support criteria. -/
def representingMeasure (f : ℝ → ℝ) : Measure PosReal :=
Classical.epsilon (fun mu => ∃ a b, HalfLineRepresentation (continuousPart f) a b mu)
/-- Sections 5 and 7: actual cardinal support, including infinite support. -/
def Rich (f : ℝ → ℝ) (n : ℕ) : Prop :=
(n : Cardinal) ≤ Cardinal.mk (representingMeasure f).support
/-- Equation (4.9), p.17. -/
def resolventGenerator (t x : ℝ) : ℝ := -x / (x + t)
/-- Section 5, p.21: spectrum of the relative modular operator on the stated algebra. -/
def modularSpec (A : Alg I) (X Y : Mat I) : Finset ℝ :=
((spec X).product (spec Y)).image (fun p => p.1 / p.2) |>.filter
(fun a => ∃ Z ∈ A, Z ≠ 0 ∧ X * Z * supportPower Y (-1) = (a : ℂ) • Z)
/-- Definition 6.1, p.27: raw log-overlap, no normalization by trace. -/
def logOverlap (A B : Mat I) (a : ℝ) : EReal :=
logNonnegativeExtended (tr (supportPower A a * supportPower B (1 - a)))
/-- Definition 6.1, p.27: Chernoff supremum on [0,1). -/
def chernoff (A B : Mat I) : EReal :=
sSup {v | ∃ a : ℝ, 0 ≤ a ∧ a < 1 ∧ v = -logOverlap A B a}
/-- Definition 6.1, p.27: Hoeffding distance as a signed extended supremum. -/
def hoeffding (A B : Mat I) (r : ℝ) : EReal :=
sSup {v | ∃ a : ℝ, 0 ≤ a ∧ a < 1 ∧
v = (((1 - a)⁻¹ : ℝ) : EReal) * ((-a * r : ℝ) - logOverlap A B a)}
/-- Remark 6.2, pp.27–28: finite log-overlap representative, used only on nonorthogonal pairs. -/
def psiReal (A B : Mat I) (a : ℝ) : ℝ := (logOverlap A B a).toReal
/-- Remark 6.2, p.27: perspective, including +infinity on the negative half-line. -/
def logOverlapPerspective (A B : Mat I) (s : ℝ) : EReal :=
if 0 ≤ s then ((1 + s : ℝ) : EReal) * logOverlap A B (s / (1 + s)) else ⊤
/-- Remark 6.2, p.27: Legendre–Fenchel transform in extended reals. -/
def polar (f : ℝ → EReal) (r : ℝ) : EReal :=
sSup {v | ∃ s : ℝ, v = ((s * r : ℝ) : EReal) - f s}
/-- Sections 6–7: exact recoverability of a positive pair by one stochastic map. -/
def Reversible (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) (X Y : Mat I) : Prop :=
∃ Psi : MatrixMap J I, AlgebraStochastic B A Psi ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y
/-- Section 6, p.30: representability on the state space of one algebra. -/
def RepresentsStateDivergence (A : Alg I) (D : Mat I → Mat I → EReal) (f : ℝ → ℝ) : Prop :=
DivergenceGenerator f ∧ ∀ rho sigma, AlgebraDensity A rho → AlgebraDensity A sigma → D rho sigma = div f rho sigma
/-- Section 6, p.30: nontrivial algebras admit two nonzero orthogonal projections. -/
def TwoProjections (A : Alg I) : Prop :=
∃ P Q : Mat I, P ∈ A ∧ Q ∈ A ∧ P.IsHermitian ∧ Q.IsHermitian ∧
P * P = P ∧ Q * Q = Q ∧ P ≠ 0 ∧ Q ≠ 0 ∧ P * Q = 0
/-- Sections 6–7: noncommutativity is a property of the actual observable algebra. -/
def Noncommutative (A : Alg I) : Prop := ∃ X ∈ A, ∃ Y ∈ A, X * Y ≠ Y * X
/-- Proposition A.6, p.46: norm-like functional for ALL nonzero real exponents.
The zero-matrix branch is explicitly zero, including at negative q. -/
def signedSchatten (p : ℝ) (X : Mat I) : ℝ :=
if X = 0 then 0 else Real.rpow (tr (supportPower (absOp X) p)) (1 / p)
/-- Section 2 convention at the zero eigenvalue and zero exponent. -/
example : supportScalarPower 0 0 = 0 := by simp [supportScalarPower]
/-- Section 2 convention for the zero overlap. -/
example : logNonnegativeExtended 0 = ⊥ := by simp [logNonnegativeExtended]
/-- The zero-map adjoint is zero, independently of the algebra representation. -/
example (Y : Mat J) : channelAdjoint (0 : MatrixMap I J) Y = 0 := by ext i j; simp [channelAdjoint]
/-- The Appendix's negative-exponent zero branch. -/
example (p : ℝ) : signedSchatten p (0 : Mat I) = 0 := by simp [signedSchatten]
/-- Lemma 2.9, p.7: the exact product spectral alphabet. -/
abbrev SpectralAlphabet (X Y : Mat I) := ↥(spec X) × ↥(spec Y)
/-- Lemma 2.9, p.7: the first classical distribution a Tr(P_a Q_b). -/
def law1 (X Y : Mat I) : SpectralAlphabet X Y → ℝ :=
fun p => p.1.1 * tr (spectralProjector X p.1.1 * spectralProjector Y p.2.1)
/-- Lemma 2.9, p.7: the second classical distribution b Tr(P_a Q_b). -/
def law2 (X Y : Mat I) : SpectralAlphabet X Y → ℝ :=
fun p => p.2.1 * tr (spectralProjector X p.1.1 * spectralProjector Y p.2.1)
/-- Corollary 2.5, p.6: linear isometries, or anti-linear isometries via transpose. -/
def isometricConjugation (anti : Bool) (W : Matrix J I ℂ) (X : Mat I) : Mat J :=
W * (if anti then Xᵀ else X) * Wᴴ
/-- Section 5, p.21: ten conditions, computed from the input pair. The Boolean
selects Remark 5.7's co-variant, changing precisely (i),(ii),(vi)–(viii). -/
def pairConditions (co : Bool) (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(X Y : Mat I) : Fin 10 → Prop :=
let stochastic := if co then CoStochastic else AlgebraStochastic
let substochastic := if co then CoSubstochastic else Substochastic
let cocycle := fun z : ℂ =>
supp Y * channelAdjoint Phi (if co then cpow (Phi X) z * cpow (Phi Y) (-z)
else cpow (Phi Y) (-z) * cpow (Phi X) z) = cpow Y (-z) * cpow X z
![∃ Psi : MatrixMap J I, stochastic B A Psi ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y,
∃ Psi : MatrixMap J I, substochastic B A Psi ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y,
∀ f, DivergenceGenerator f → SemidefiniteOperatorConvex f → div f (Phi X) (Phi Y) = div f X Y,
∃ f, DivergenceGenerator f ∧ SemidefiniteOperatorConvex f ∧
Rich f ((modularSpec A X Y ∪ modularSpec B (Phi X) (Phi Y)).card) ∧
div f (Phi X) (Phi Y) = div f X Y,
∃ T : Set ℝ, T ⊆ Ioi 0 ∧
(((modularSpec A X Y ∪ modularSpec B (Phi X) (Phi Y)).card : ℕ) : Cardinal) ≤
Cardinal.mk T ∧ ∀ t ∈ T, div (resolventGenerator t) (Phi X) (Phi Y) = div (resolventGenerator t) X Y,
∀ z : ℂ, cocycle z,
∃ a : ℝ, 0 < a ∧ a < 2 ∧ a ≠ 1 ∧ cocycle (a : ℂ),
∀ t : ℝ, cocycle (Complex.I * (t : ℂ)),
supp Y * channelAdjoint Phi (cfc Real.log (Phi X) - cfc Real.log (Phi Y) * supp (Phi X)) =
cfc Real.log X - cfc Real.log Y * supp X,
petz Y Phi (Phi X) = X]
/-- Theorem 5.1, pp.21–25: asymmetric implication chain, never a blanket equivalence. -/
def PairChain (c : Fin 10 → Prop) : Prop :=
(c 0 → c 1) ∧ (c 1 → c 2) ∧ (c 2 → c 3) ∧ (c 3 ↔ c 4) ∧
(c 4 ↔ c 5) ∧ (c 5 ↔ c 6) ∧ (c 6 ↔ c 7) ∧ (c 7 ↔ c 8) ∧ (c 8 → c 9)
/-- Sections 5 and 7: preserve the positivity level when a stochastic recovery exists. -/
def RecoveryRefinement (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) (C : Set (Mat I)) : Prop :=
(∀ n, AlgebraKPositive A Phi n → ∃ Psi : MatrixMap J I,
AlgebraStochastic B A Psi ∧ AlgebraKPositive B Psi n ∧ ∀ rho ∈ C, Psi (Phi rho) = rho) ∧
(AlgebraCompletelyPositive A Phi → ∃ Psi : MatrixMap J I,
AlgebraStochastic B A Psi ∧ AlgebraCompletelyPositive B Psi ∧ ∀ rho ∈ C, Psi (Phi rho) = rho)
/-- Section 7, p.33: CLOSED convex hull in the finite-dimensional matrix topology. -/
def hull (C : Set (Mat I)) : Set (Mat I) := closure (convexHull ℝ C)
/-- Section 7, p.33: maximal support without choosing an unrelated projection. -/
def Covers (C : Set (Mat I)) (sigma : Mat I) : Prop := ∀ rho ∈ C, Supports rho sigma
/-- Section 7, p.33: equality of a reference support with the join of code supports. -/
def CodeSupportEquals (C : Set (Mat I)) (sigma : Mat I) : Prop :=
∀ v : I → ℂ, sigma *ᵥ v = 0 ↔ ∀ rho ∈ C, rho *ᵥ v = 0
/-- Section 7, p.34: shared direct-sum/tensor data. Algebraic action and cone equality
are deliberately NOT fields; they are conclusions in the theorems below. -/
structure RecoveryBlocks (I J : Type) [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J] where
count : ℕ
left1 : Fin count → ℕ
right1 : Fin count → ℕ
left2 : Fin count → ℕ
right2 : Fin count → ℕ
left1_pos : ∀ k, 0 < left1 k
right1_pos : ∀ k, 0 < right1 k
left2_pos : ∀ k, 0 < left2 k
right2_pos : ∀ k, 0 < right2 k
embed1 : ∀ k, Matrix I (Fin (left1 k) × Fin (right1 k)) ℂ
embed2 : ∀ k, Matrix J (Fin (left2 k) × Fin (right2 k)) ℂ
isometry1 : ∀ k, (embed1 k)ᴴ * embed1 k = 1
isometry2 : ∀ k, (embed2 k)ᴴ * embed2 k = 1
orthogonal1 : ∀ k l, k ≠ l → (embed1 k)ᴴ * embed1 l = 0
orthogonal2 : ∀ k l, k ≠ l → (embed2 k)ᴴ * embed2 l = 0
noise1 : ∀ k, Mat (Fin (right1 k))
noise2 : ∀ k, Mat (Fin (right2 k))
noise1_pos : ∀ k, (noise1 k).PosDef
noise2_pos : ∀ k, (noise2 k).PosDef
noise1_trace : ∀ k, tr (noise1 k) = 1
noise2_trace : ∀ k, tr (noise2 k) = 1
unitary : ∀ k, Matrix (Fin (left2 k)) (Fin (left1 k)) ℂ
unitary_left : ∀ k, (unitary k)ᴴ * unitary k = 1
unitary_right : ∀ k, unitary k * (unitary k)ᴴ = 1
/-- Shared block embedding on the input side, equation (3.8), p.15. -/
def inputBlock (D : RecoveryBlocks I J) (k : Fin D.count) (X : Mat (Fin (D.left1 k))) : Mat I :=
D.embed1 k * Matrix.kronecker X (D.noise1 k) * (D.embed1 k)ᴴ
/-- Shared block action on the output side, equation (3.8), p.15. -/
def outputBlock (D : RecoveryBlocks I J) (k : Fin D.count) (X : Mat (Fin (D.left1 k))) : Mat J :=
D.embed2 k * Matrix.kronecker (D.unitary k * X * (D.unitary k)ᴴ) (D.noise2 k) * (D.embed2 k)ᴴ
/-- Section 7, p.34: support joins are exactly the direct sum of all the shared blocks. -/
def BlockSupports (D : RecoveryBlocks I J) (C : Set (Mat I)) (E : Set (Mat J)) : Prop :=
CodeSupportEquals C (∑ k, D.embed1 k * (D.embed1 k)ᴴ) ∧
CodeSupportEquals E (∑ k, D.embed2 k * (D.embed2 k)ᴴ)
/-- Section 7, p.34: a code state has variable left states and probabilities,
while the noise states, embeddings, and unitaries are shared across the whole code. -/
def BlockState (D : RecoveryBlocks I J) (rho : Mat I) : Prop :=
∃ (p : Fin D.count → ℝ) (X : ∀ k, Mat (Fin (D.left1 k))),
IsDistribution p ∧ (∀ k, (X k).PosSemidef ∧ tr (X k) = 1) ∧
rho = ∑ k, (p k : ℂ) • inputBlock D k (X k)
/-- Equation (6.8), p.29: optimal Bayesian error normalized by min(p,1-p). -/
def bayesianTestingDistance (p : ℝ) (rho sigma : Mat I) : EReal :=
-logNonnegativeExtended ((1 - QAlgorithms.traceNorm ((p : ℂ) • rho - ((1 - p : ℝ) : ℂ) • sigma)) /
(2 * min p (1 - p)))
/-- Theorem 7.1, pp.33–34: its ten uniform criteria. -/
def codeConditions (A : Alg I) (B : Alg J) (Phi : MatrixMap I J) (C : Set (Mat I)) : Fin 10 → Prop :=
let d := Fintype.card I ^ 2 + Fintype.card J ^ 2
![∃ Psi : MatrixMap J I, AlgebraStochastic B A Psi ∧ ∀ rho ∈ hull C, Psi (Phi rho) = rho,
∀ f, DivergenceGenerator f → SemidefiniteOperatorConvex f → ∀ rho ∈ hull C, ∀ sigma ∈ hull C,
div f (Phi rho) (Phi sigma) = div f rho sigma,
∃ sigma f, AlgebraDensity A sigma ∧ Covers C sigma ∧ DivergenceGenerator f ∧ SemidefiniteOperatorConvex f ∧ Rich f d ∧
∀ rho ∈ C, div f (Phi rho) (Phi sigma) = div f rho sigma,
∃ sigma, AlgebraDensity A sigma ∧ Covers C sigma ∧ ∃ T : Set ℝ, T ⊆ Ioi 0 ∧
(d : Cardinal) ≤ Cardinal.mk T ∧ ∀ rho ∈ C, ∀ t ∈ T,
div (resolventGenerator t) (Phi rho) (Phi sigma) = div (resolventGenerator t) rho sigma,
∀ rho ∈ hull C, ∀ sigma ∈ hull C, ∀ r : ℝ,
hoeffding (Phi rho) (Phi sigma) r = hoeffding rho sigma r,
∃ sigma, AlgebraDensity A sigma ∧ Covers C sigma ∧ ∃ delta : ℝ, 0 < delta ∧
∀ rho ∈ C, ∀ r ∈ Ioo 0 delta, hoeffding (Phi rho) (Phi sigma) r = hoeffding rho sigma r,
∀ rho ∈ hull C, ∀ sigma ∈ hull C, CodeSupportEquals C sigma → petz sigma Phi (Phi rho) = rho,
∃ sigma, AlgebraDensity A sigma ∧ ∀ rho ∈ C, petz sigma Phi (Phi rho) = rho,
∃ D : RecoveryBlocks I J, BlockSupports D C (Phi '' C) ∧ (∀ rho ∈ C, BlockState D rho) ∧
∀ k X, inputBlock D k X ∈ A ∧ Phi (inputBlock D k X) = outputBlock D k X,
∃ sigma, AlgebraDensity A sigma ∧ Covers C sigma ∧ ∀ rho ∈ C, ∀ p ∈ Ioo (0 : ℝ) 1, ∀ n : ℕ,
bayesianTestingDistance p ((QAlgorithms.piSuperop (fun _ : Fin n => (Phi : Mat I → Mat J))) (copies n rho)) ((QAlgorithms.piSuperop (fun _ : Fin n => (Phi : Mat I → Mat J))) (copies n sigma)) =
bayesianTestingDistance p (copies n rho) (copies n sigma)]
/-- Section 6, p.30: monotone functions are strictly increasing on the ATTAINED
extended divergence range, rather than on an arbitrary real domain. -/
def MonotoneRepresentation (A : Alg I) (D : Mat I → Mat I → EReal) (f : ℝ → ℝ) : Prop :=
let R := {v : EReal | ∃ rho sigma, AlgebraDensity A rho ∧ AlgebraDensity A sigma ∧ v = div f rho sigma}
∃ g : R → EReal, StrictMono g ∧ ∀ rho sigma (hr : AlgebraDensity A rho) (hs : AlgebraDensity A sigma),
D rho sigma = g ⟨div f rho sigma, ⟨rho, sigma, hr, hs, rfl⟩⟩
/-- The zero-copy product is the scalar identity. -/
example (X : Mat I) (a b : Fin 0 → I) : copies 0 X a b = 1 := by simp [copies]
/-- Resolvent kernels do not divide by zero on their intended parameter domain. -/
example (t : PosReal) : representationKernel 0 t = 0 := by simp [representationKernel]
/-- Example 3.6, p.12: transpose mixed with complete depolarization. -/
def transposeNoise (e : ℝ) (X : Mat I) : Mat I :=
((1 - e : ℝ) : ℂ) • Xᵀ + ((e : ℂ) * X.trace / (Fintype.card I : ℂ)) • 1
/-- Example 3.6, pp.12–13: identity mixed with complete depolarization. -/
def identityNoise (e : ℝ) (X : Mat I) : Mat I :=
((1 - e : ℝ) : ℂ) • X + ((e : ℂ) * X.trace / (Fintype.card I : ℂ)) • 1
/-- Example 3.6, p.13: transpose mixed with identity. -/
def transposeMix (e : ℝ) (X : Mat I) : Mat I :=
((1 - e : ℝ) : ℂ) • Xᵀ + (e : ℂ) • X
/-- The source's identity endpoint. -/
example (X : Mat I) : transposeMix 1 X = X := by simp [transposeMix]
/-- Example 3.6, p.12: the full six-term Schwarz defect expansion. -/
def transposeDefect (e c : ℝ) (X : Mat I) : Mat I :=
((c * (1 - e) : ℝ) : ℂ) • (Xᴴ * X)ᵀ +
(((c * e : ℝ) : ℂ) * (Xᴴ * X).trace / (Fintype.card I : ℂ)) • 1 -
(((1 - e) ^ 2 : ℝ) : ℂ) • ((Xᴴ)ᵀ * Xᵀ) -
(((e * (1 - e) : ℝ) : ℂ) * X.trace / (Fintype.card I : ℂ)) • (Xᴴ)ᵀ -
(((e * (1 - e) : ℝ) : ℂ) * (Xᴴ).trace / (Fintype.card I : ℂ)) • Xᵀ -
(((e ^ 2 : ℝ) : ℂ) * (Complex.normSq X.trace : ℂ) / (Fintype.card I : ℂ) ^ 2) • 1
/-- Remark 4.8, pp.20–21: maps monotone for a specified f. -/
def MonotoneMap (A : Alg I) (f : ℝ → ℝ) (Phi : Mat I → Mat J) : Prop :=
PositiveOnConcreteAlgebra A Phi ∧ ∀ X ∈ A, ∀ Y ∈ A, X.PosSemidef → Y.PosSemidef →
div f (Phi X) (Phi Y) ≤ div f X Y
/-- Remark 6.2, p.28: limiting order-one entropy, before identifying it on states. -/
def renyiOne (X Y : Mat I) : EReal := limUnder (𝓝[<] (1 : ℝ)) (fun a => petzRenyi a X Y)
/-- Example 6.6, p.31: the stated diagonal state. -/
def exampleRho : Mat (Fin 3) := Matrix.diagonal ![(2 / 3 : ℂ), 1 / 3, 0]
/-- Example 6.6, p.31: the stated reference state. -/
def exampleSigma : Mat (Fin 3) := Matrix.diagonal ![(1 / 6 : ℂ), 1 / 3, 1 / 2]
/-- Example 6.6, p.31: canonical extension of the diagonal block-merging map. -/
def merge : MatrixMap (Fin 3) (Fin 3) where
toFun X := Matrix.diagonal (fun i => if i = 0 then X 0 0 + X 1 1 else if i = 2 then X 2 2 else 0)
map_add' X Y := by
ext i j
simp only [Matrix.diagonal_apply, Matrix.add_apply]
split_ifs <;> simp_all <;> ring
map_smul' c X := by
ext i j
simp only [Matrix.diagonal_apply, Matrix.smul_apply, smul_eq_mul]
split_ifs <;> simp_all <;> ring
/-- Section 6, p.31: the concrete diagonal observable algebra. -/
def diagonalAlgebra (I : Type) [Fintype I] [DecidableEq I] : Alg I where
carrier := {X | ∀ i j, i ≠ j → X i j = 0}
zero_mem' := by simp
one_mem' := by intro i j h; simp [Matrix.one_apply, h]
add_mem' := by intro X Y hX hY i j h; simp [hX i j h, hY i j h]
mul_mem' := by
intro X Y hX hY i j h
apply Finset.sum_eq_zero
intro k hk
by_cases hik : i = k
· subst k; simp [hY i j h]
· simp [hX i k hik]
algebraMap_mem' := by intro c i j h; simp [Algebra.algebraMap_eq_smul_one, Matrix.one_apply, h]
star_mem' := by intro X hX i j h; simpa using congrArg conj (hX j i (Ne.symm h))
/-- The merge map preserves the last basis projection exactly. -/
example : merge (Matrix.single 2 2 1) = (Matrix.single 2 2 1 : Mat (Fin 3)) := by
change Matrix.diagonal (fun k : Fin 3 =>
if k = 0 then
(Matrix.single 2 2 (1 : ℂ) : Mat (Fin 3)) 0 0 +
(Matrix.single 2 2 (1 : ℂ) : Mat (Fin 3)) 1 1
else if k = 2 then (Matrix.single 2 2 (1 : ℂ) : Mat (Fin 3)) 2 2 else 0) =
(Matrix.single 2 2 1 : Mat (Fin 3))
ext i j
by_cases hi : i = 2
· subst i
simp only [Matrix.diagonal_apply, Matrix.single_apply,
show (2 : Fin 3) ≠ 0 from by decide, if_false, and_self,
true_and, eq_self_iff_true, if_true]
· by_cases hij : i = j
· subst j
simp only [Matrix.diagonal_apply, Matrix.single_apply,
show (2 : Fin 3) ≠ 0 from by decide,
show (2 : Fin 3) ≠ 1 from by decide,
hi, Ne.symm hi, eq_self_iff_true, and_self,
if_false, if_true, zero_add, ite_self]
· have hsingle : ¬ (2 = i ∧ 2 = j) := by
intro h
exact hij (h.1.symm.trans h.2)
simp only [Matrix.diagonal_apply, Matrix.single_apply, hij, hsingle, if_false]
/-- Support inclusion includes the zero and reflexive edge cases. -/
example (X : Mat I) : Supports X X := by intro v hv; exact hv
/-- The support-zero convention applies to the zero matrix even at exponent zero. -/
example : supp (0 : Mat I) = 0 := by simp [supp, supportPower, cfc_zero]
/-- The source identity channel has no hidden trace normalization. -/
example : AlgebraTracePreserving (⊤ : Alg I) (LinearMap.id : MatrixMap I I) := by intro X hX; rfl
/-- The actual amplification of identity acts on every block entry. -/
example (n : ℕ) (X : Mat (Fin n × I)) : amp (fun Y : Mat I => Y) n X = X := rfl
/-- The combined representing kernel vanishes at x=1, pinning a=f(1)-f(0)-b. -/
example (t : PosReal) : representationKernel 1 t = 0 := by simp [representationKernel]
end QAlgorithms.Papers.Independent.Support50.P12
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P12.Alg
For any finite type with decidable equality, abbreviates the type of complex star subalgebras of the algebra of complex matrices indexed by . Such a subalgebra contains the identity and is closed under addition, multiplication, complex scalar multiplication, and conjugate transpose. The index type may be empty.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraCompletelyPositive
For finite index types , with decidable equality on , a complex star subalgebra of the complex matrices, and an arbitrary map from complex matrices to complex matrices, this property means that, for every natural number , every positive semidefinite block matrix whose blocks lie in yields a positive semidefinite block matrix . This includes , where the condition is automatic; linearity of is not part of the definition.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraDensity
For any finite type with decidable equality, any complex star subalgebra of the complex matrices, and any such matrix , means that , is positive semidefinite, and . If is empty, this condition cannot hold because the trace is zero.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraExtension
For finite index types with decidable equality, unital complex star subalgebras , , and a complex linear map , this property means that for every matrix , and for every matrix , where, writing for the standard matrix unit,
Both conditions quantify over the entire matrix spaces, including matrices outside the specified subalgebras. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraKPositive
For finite index types , with decidable equality on , a complex star subalgebra of the complex matrices, an arbitrary map from complex matrices to complex matrices, and a natural number , this property means that every positive semidefinite matrix indexed by , all of whose blocks belong to , produces a positive semidefinite matrix with entries at . No linearity of is assumed. The value is included, and its condition is automatically satisfied.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraSchwarzMap
For finite index types , with decidable equality on , a unital complex star subalgebra , and any function , this property means that there exists a real such that sends every positive semidefinite matrix in to a positive semidefinite matrix and
The constant need not be unique or strictly positive, and need not be linear. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraStochastic
For finite index types with decidable equality, unital complex star subalgebras , , and a complex linear map , this property requires that the entire range of lie in , that the entire range of the map
lie in , that send positive semidefinite matrices in to positive semidefinite matrices, and that be positive semidefinite for every . Additionally, as complex numbers for every . Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraTraceNonincreasing
For finite index types , with decidable equality on , a unital complex star subalgebra , and any function , this property means that
for every positive semidefinite . The definition does not require to be positive semidefinite or to be linear; only the real parts of the traces are compared. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.AlgebraTracePreserving
For finite index types , with decidable equality on , a unital complex star subalgebra , and any function , this property means that
This is equality of complex traces for all matrices in , without restricting them to positive or Hermitian matrices and without assuming that is linear. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.BlockState
For finite types with decidable equality, let consist of blocks with positive dimensions , mutually orthogonal isometric embeddings and into and , positive definite right-factor matrices of real trace , and matrices between the left factors satisfying both unitary identities. For an arbitrary complex matrix , this property means that there exist real numbers and complex matrices such that for every , , every is positive semidefinite with , and
The requirements on also apply when . If , the required probability weights would have empty sum , so this property cannot hold.
QAlgorithms.Papers.Independent.Support50.P12.BlockSupports
For finite types with decidable equality, let consist of blocks with positive left and right dimensions, mutually orthogonal isometric embeddings into and into , positive definite right-factor matrices of real trace , and unitary identifications between the corresponding left factors. For arbitrary sets and , the defined property is the conjunction
There are no positivity or normalization assumptions on members of either set. An empty set on either side makes its universal annihilation condition vacuous. If , both sums are zero, and the property requires every matrix in and every matrix in to be zero.
QAlgorithms.Papers.Independent.Support50.P12.CoBound
For finite index types , with decidable equality on , a complex star subalgebra of the complex matrices, an arbitrary map to complex matrices, and a real number , this property means that , that is positive semidefinite whenever is positive semidefinite, and that, for every ,
Here is the conjugate transpose. The inequality applies to all , without requiring to be Hermitian or positive semidefinite, and is allowed.
QAlgorithms.Papers.Independent.Support50.P12.CoStochastic
For finite index types with decidable equality, complex star subalgebras and , and a complex linear map , let
where is the standard matrix unit. This property means that for every input matrix , that for every matrix , that sends positive semidefinite elements of to positive semidefinite matrices, that is positive semidefinite for every , and additionally that for every .
QAlgorithms.Papers.Independent.Support50.P12.CoSubstochastic
For finite index types with decidable equality, complex star subalgebras and , and a complex linear map , define
where has entry at and zero elsewhere. This property means that for every , that for every , that is positive semidefinite for every positive semidefinite , and that is positive semidefinite for every .
QAlgorithms.Papers.Independent.Support50.P12.CodeSupportEquals
For a finite type with decidable equality, a set of complex matrices, and a complex matrix , this property means that, for every vector , if and only if for every ; equivalently, . No positivity or normalization is required. If is empty, the right-hand condition holds for every vector, so the property requires ; empty is also allowed.
QAlgorithms.Papers.Independent.Support50.P12.CornerTP
For finite index types , with decidable equality on , a unital complex star subalgebra , any function , and any matrix , this property means that
The traces are complex traces. There is no assumption that is a projection, Hermitian, or a member of , and no linearity assumption on . Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.Covers
For a finite index type , any set , and any , this predicate means that
Equivalently, for every . No Hermiticity, positivity, or normalization is required. It holds vacuously when is empty, and for it requires every member of to be the zero matrix.
QAlgorithms.Papers.Independent.Support50.P12.DivergenceGenerator
For every function , means that is continuous on and that , viewed in the extended real numbers, converges as to the value selected by the total limit operation for that same function. Thus an extended-real limit is required, and it may be infinite. No condition is imposed on , on its values at negative arguments, or on convexity.
QAlgorithms.Papers.Independent.Support50.P12.HalfLineRepresentation
For a function , real numbers , and a measure on the positive real numbers, this property means that , that is integrable with respect to , and that, for every real , the function is integrable with respect to and
The coefficient is unrestricted, and need not have finite total mass. The case is included; its kernel vanishes everywhere.
QAlgorithms.Papers.Independent.Support50.P12.KCoPositive
For finite index types , with decidable equality on , a complex star subalgebra , an arbitrary map , and a natural number , this property means that every positive semidefinite block matrix satisfying for every yields a positive semidefinite block matrix . The transpose here does not conjugate entries. No linearity of is assumed, and is included with an automatically satisfied condition.
QAlgorithms.Papers.Independent.Support50.P12.MonotoneMap
Let be finite index types with decidable equality, possibly empty, let be a unital complex star subalgebra, let be arbitrary, and let be an arbitrary function, without a linearity assumption. Define to be its distinct eigenvalues if is Hermitian and the empty set otherwise, let be the orthogonal projection onto its -eigenspace, and define by spectral functional calculus with value zero at zero. Put
with values embedded in the extended real line, division by zero equal to zero, and a total selected-limit operation in the second branch. The predicate means that whenever and , and that for every positive semidefinite . There are no normalization, support-inclusion, trace-preservation, continuity, or convexity requirements in this definition.
QAlgorithms.Papers.Independent.Support50.P12.MonotoneRepresentation
Let be a finite type with decidable equality, let be a complex star subalgebra of , let be any function, and let . An algebra density means a positive semidefinite member of with real trace . For matrices , write , let be its distinct eigenvalues if Hermitian and the empty set otherwise, and let denote its eigenspace projection. Define
and define to be this real number embedded in the extended reals if , and otherwise the total selected right limit of as . Let be exactly the set of values attained by pairs of algebra densities. The defined property says that there exists a function such that in implies , and for every pair of algebra densities. No continuity or generator condition is imposed on , and there is no restriction on outside such pairs. If there are no algebra densities, then is empty and the property holds vacuously.
QAlgorithms.Papers.Independent.Support50.P12.Noncommutative
For a finite index type with decidable equality and a unital complex -subalgebra , this predicate means that there exist with . There are no positivity, Hermiticity, or normalization requirements on these witnesses. The predicate cannot hold when is empty or has one element.
QAlgorithms.Papers.Independent.Support50.P12.PairChain
For an arbitrary family of propositions , this predicate is exactly the conjunction
It does not assert that any holds, and the one-way implications do not include their converses.
QAlgorithms.Papers.Independent.Support50.P12.PosReal
This is the type of real numbers equipped with the condition ; zero and negative real numbers are excluded.
QAlgorithms.Papers.Independent.Support50.P12.PositiveOnConcreteAlgebra
For finite index types , with decidable equality on , a unital complex star subalgebra , and any function , this property means that every positive semidefinite matrix has positive semidefinite image . No linearity assumption is imposed on , and no condition is imposed on its values at matrices outside the positive semidefinite part of . Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.RecoveryBlocks
For finite types , both with decidable equality, this structure consists of a natural number of blocks and, for each , four positive natural numbers , complex matrices and mapping respectively into and into , positive definite matrices and with , and a complex matrix . The required identities are , , and whenever , and , . Thus the embeddings have mutually orthogonal ranges within each ambient space, while the two identities for require a unitary identification of its two coordinate spaces. There is no requirement that the embedding ranges exhaust the ambient spaces. The case is allowed, with all block-indexed requirements vacuous; neither nor is assumed nonempty.
QAlgorithms.Papers.Independent.Support50.P12.RecoveryRefinement
For finite index types with decidable equality, possibly empty, unital complex -subalgebras , , a complex-linear map , and any set , this predicate asserts two recovery-existence statements. To specify them, a map is -positive on an algebra when every positive semidefinite block matrix whose blocks all belong to remains positive semidefinite after replacing each block by ; complete positivity on means this for every natural . A reverse map has the required stochastic property when every ambient matrix has image in , every ambient matrix has adjoint image in , is positive on positive semidefinite members of ,
where means is positive semidefinite and
The first statement is that, for every natural , if is -positive on , there exists a complex-linear reverse map with this stochastic property that is -positive on and satisfies for every . The second statement is that, if is completely positive on , there exists such a stochastic reverse map that is completely positive on and recovers every . The first witness may depend on . The quantifier includes , where the positivity antecedent is vacuous, so the first statement still requires a stochastic recovering map. No density or algebra-membership assumptions are imposed on members of ; when , only the recovery equalities are vacuous.
QAlgorithms.Papers.Independent.Support50.P12.RepresentsStateDivergence
For any finite index type with decidable equality, unital complex star subalgebra , function , and function , this predicate requires to be continuous on and , embedded in the extended reals, to converge as to its selected extended-real limit. It also requires for every that are positive semidefinite with real trace . To define , write
where is the finite set of distinct real eigenvalues when is Hermitian and is empty otherwise, is the orthogonal projection onto its -eigenspace, and is real functional calculus with value at scalar zero and elsewhere. If , then , embedded in the extended reals; otherwise it is the totalized selected limit of as , with existence of this latter limit not separately required. The ratios in the sums equal by totalized division. No condition is imposed on outside the specified density matrices; if is empty, there are no such density matrices, so that equality requirement is vacuous.
QAlgorithms.Papers.Independent.Support50.P12.Reversible
For any finite index types with decidable equality, unital complex star subalgebras and , complex-linear map , and arbitrary , this predicate says that there exists a complex-linear map satisfying and , together with these conditions: for every matrix , its adjoint for every matrix , it preserves the trace of every , and for every ,
The adjoint here is explicitly , where is a matrix unit; matrix inequalities mean positive semidefiniteness. Neither nor their images are required to be density matrices or algebra members, and no additional condition is imposed on . Empty index types are permitted.
QAlgorithms.Papers.Independent.Support50.P12.Rich
For any function and natural number , this predicate says that the support of a selected measure on has cardinality at least . The measure is chosen, whenever possible, to admit real coefficients , with , for which is integrable and, for every , the integrable kernel gives
where away from zero and is the totalized selected right limit of at zero. If no such representation exists, is still an arbitrarily selected measure, and the predicate still tests its support cardinality. The comparison is a cardinal comparison, so infinite supports are allowed; when , the predicate always holds.
QAlgorithms.Papers.Independent.Support50.P12.SchwarzBound
For finite index types , with decidable equality on , a unital complex star subalgebra , any function , and a real number , this property means that , that is positive semidefinite whenever is positive semidefinite, and that
where denotes conjugate transpose. The value is included, no linearity is assumed, and empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.SemidefiniteOperatorConvex
For a function , this property means that, for every natural number , every pair of positive semidefinite complex matrices , and every , the matrix
is positive semidefinite, where each application of to a matrix uses the real continuous functional calculus. The definition includes and both endpoints ; it imposes no separate continuity hypothesis on .
QAlgorithms.Papers.Independent.Support50.P12.SpectralAlphabet
For a finite index type with decidable equality and arbitrary matrices , this is the type of pairs where belongs to the finite set assigned to and belongs to the finite set assigned to . For a Hermitian matrix, its assigned set consists of its distinct real eigenvalues; for a matrix that is not Hermitian, the assigned set is empty. Thus the alphabet is the Cartesian product of these two sets, with membership included in each coordinate. It is empty if either matrix is not Hermitian, and also when is empty.
QAlgorithms.Papers.Independent.Support50.P12.Substochastic
For finite index types with decidable equality, unital complex star subalgebras , , and a complex linear map , this property requires that for every and for every , where
It also requires that be positive semidefinite for every positive semidefinite , and that be positive semidefinite for every . Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.TwoProjections
For a finite index type with decidable equality and a unital complex -subalgebra , this predicate means that there exist matrices such that
Thus it requires two nonzero orthogonal Hermitian projections belonging to . It cannot hold when has fewer than two elements.
QAlgorithms.Papers.Independent.Support50.P12.amp
For any index types , any map from complex matrices to complex matrices, any natural number , and any complex matrix indexed by , the matrix is defined by
Thus is applied separately to each block. No linearity or positivity of is required. For , the result is the matrix with empty index set.
QAlgorithms.Papers.Independent.Support50.P12.bayesianTestingDistance
For a finite type with decidable equality, any real , and arbitrary complex matrices , define and
The defined extended-real value is when , and when . The square root is given by real functional calculus, so the numerator uses exactly the trace norm . No restriction , positivity, or normalization is imposed. Division by zero is the total real operation returning zero; consequently and both give . Empty is allowed.
QAlgorithms.Papers.Independent.Support50.P12.chernoff
For any finite index type with decidable equality and arbitrary complex matrices , this definition is the extended-real supremum
Here is real functional calculus for the function away from zero, assigned value at zero, and is natural. The endpoint is included and is excluded. No positivity, normalization, or support condition is assumed, and no maximizing parameter is asserted to exist. If for any allowed parameter, the supremum is ; this includes the case of an empty index type.
QAlgorithms.Papers.Independent.Support50.P12.codeConditions
Let be finite types with decidable equality, let and be complex star subalgebras, let be complex-linear, and let be arbitrary. This definition assigns ten propositions, indexed ; it does not assert their conjunction. The following notation specifies their meanings. Write , , and . An algebra density is a matrix belonging to the indicated algebra that is positive semidefinite and has real trace . Say when implies for every vector . Let denote functional calculus with the scalar function that is zero at zero and equals otherwise. Let be the finite set of distinct eigenvalues when is Hermitian, and the empty set otherwise; let be the orthogonal projection onto the eigenspace of for eigenvalue . For a real function , put
Define , embedded in the extended reals, when ; otherwise define it by the total right-limit selection at of . A generator means that is continuous on and that , embedded in the extended reals, converges as to its selected limit . Semidefinite operator convexity means that, in every finite matrix dimension, including zero, for positive semidefinite and , the difference
is positive semidefinite, with functions evaluated by functional calculus. To say that is rich for means that the support of its selected representing measure has cardinality at least : this measure on is selected to admit real , with , such that is integrable and, for every , the kernel is integrable and
where away from zero and is the selected right limit of ; the measure-selection definition itself does not require such a representation to exist. Write for and otherwise, and define
For a complex-linear map , its adjoint here is explicitly
where is the matrix unit. Define the recovery expression
A map , understood as a map on the full ambient matrix spaces, is algebra-stochastic when its entire range lies in , the entire range of lies in , is positive on positive semidefinite members of , for every , and for every ; matrix inequalities mean positive semidefinite differences. With this notation, proposition says that there exists an algebra-stochastic with for every . Proposition says that for every generator that is semidefinite operator convex and every . Proposition says that there exist an algebra density and a generator that is semidefinite operator convex and rich for , such that every satisfies and . Proposition says that there exist an algebra density supporting every in that same sense, and a set of cardinality at least , such that for all , , where . Proposition says that for every and every real . Proposition says that there exist an algebra density supporting and a real such that this same equality holds for every and . Proposition says that, for every , if , then . Proposition says that there exists an algebra density such that for every , without an additional support requirement. Proposition says that there exist blocks with positive left and right dimensions, mutually orthogonal isometric embeddings into and into , positive definite right-factor matrices of real trace , and left-factor matrices satisfying both unitary identities, such that and ; every has a representation with , , and positive semidefinite of real trace ; and, for every block and every complex matrix on its first left factor,
Proposition says that there exists an algebra density supporting such that, for every , every , and every natural , the Bayesian testing value of and equals that of and . Here , the map on factors is defined by
and the Bayesian value of is , with . All divisions and extended-real operations have their total meanings, including division by zero; is included and its products are empty products equal to . No assumption that is a channel, that consists of densities, or that are nonempty is part of this definition.
QAlgorithms.Papers.Independent.Support50.P12.continuousPart
For any function and any real number , this defines a real-valued function equal to when , and equal at to the library’s total limit selector for as through strictly positive real numbers. No existence of a right-hand limit is assumed: when a finite right-hand limit exists, that is the selected value; otherwise the definition still returns a real value without asserting convergence.
QAlgorithms.Papers.Independent.Support50.P12.cpow
For any finite type with decidable equality, any complex matrix , and any , is zero if is not Hermitian. Otherwise, writing the chosen Hermitian spectral decomposition as , it is , where and for nonzero real . Here is the total real logarithm, so for negative it equals . In particular, zero eigenvalues remain zero even when ; neither positivity nor invertibility of is assumed.
QAlgorithms.Papers.Independent.Support50.P12.diagonalAlgebra
For every finite index type with decidable equality, is the unital complex star subalgebra of matrices satisfying whenever , with the inherited matrix addition, multiplication, complex scalar action and conjugate transpose. The definition also applies when is empty.
QAlgorithms.Papers.Independent.Support50.P12.div
For any finite type with decidable equality, any function , and any complex matrices , define , where is the real functional calculus of with , for , the eigenvalue sets contain distinct Hermitian eigenvalues and are empty for non-Hermitian matrices, and the 's are orthogonal eigenspace projections. Powers and division use their total real operations, including . Then equals the finite extended-real value if every vector annihilated by is also annihilated by . Otherwise it is the total limit-selection value of as , without asserting that this limit exists. No positivity, normalization, continuity, or generator condition is assumed.
QAlgorithms.Papers.Independent.Support50.P12.exampleRho
The matrix is the complex diagonal matrix
with row and column indices .
QAlgorithms.Papers.Independent.Support50.P12.exampleSigma
The matrix is the complex diagonal matrix
with row and column indices .
QAlgorithms.Papers.Independent.Support50.P12.hoeffding
For any finite index type with decidable equality, arbitrary complex matrices , and real number , this definition is the extended-real supremum
Here denotes real functional calculus with scalar value at zero and elsewhere, and is natural. The factor is a positive finite real number throughout the parameter range. There is no restriction on , no positivity or normalization assumption on , and no assertion of attainment. A nonpositive at any allowed parameter makes the value , including when is empty.
QAlgorithms.Papers.Independent.Support50.P12.hull
For an index type and any set of complex matrices indexed by , this is the topological closure of the real convex hull of : the closure, in the usual matrix topology, of all finite convex combinations of elements of with nonnegative real coefficients summing to one. No positivity, normalization, or nonemptiness assumption is imposed on ; the hull of the empty set is empty.
QAlgorithms.Papers.Independent.Support50.P12.identityNoise
For a finite index type with decidable equality, any real number , and any complex matrix indexed by , this defines
Here is the identity matrix. No restriction on , positivity, or normalization of is imposed. Empty is allowed, with division by zero interpreted as .
QAlgorithms.Papers.Independent.Support50.P12.inputBlock
Let be finite types with decidable equality, and let be block data consisting of blocks with positive dimensions , isometric embeddings and whose ranges are pairwise orthogonal within each family, positive definite matrices on the corresponding right factors with real trace , and matrices satisfying and . For every block index and every complex matrix , the defined input block is the matrix
Here is the Kronecker product. No positivity or trace condition is imposed on ; when , there is no permissible block index .
QAlgorithms.Papers.Independent.Support50.P12.isometricConjugation
For a finite input index type , an output index type , a Boolean parameter , a rectangular complex matrix with rows indexed by and columns indexed by , and , this function returns
The transpose in the first branch is the ordinary transpose. No isometry, unitarity, positivity, or normalization hypothesis is imposed on or ; empty index types are permitted.
QAlgorithms.Papers.Independent.Support50.P12.law1
For a finite index type with decidable equality and arbitrary , this function assigns to each pair of distinct-eigenvalue labels from and the real number
where is the orthogonal projection onto the -eigenspace of the operator given by multiplication by . The label set of a Hermitian matrix is its set of distinct real eigenvalues, and that of a non-Hermitian matrix is empty. No positivity or trace-one assumptions are imposed on or , so the definition does not require these values to be nonnegative or to sum to one. If either label set is empty, the function has empty domain.
QAlgorithms.Papers.Independent.Support50.P12.law2
For a finite index type with decidable equality and arbitrary , this function assigns to each pair of distinct-eigenvalue labels from and the real number
where is the orthogonal projection onto the -eigenspace of the operator given by multiplication by . The label set of a Hermitian matrix is its set of distinct real eigenvalues, and that of a non-Hermitian matrix is empty. Neither positivity nor trace-one normalization of or is assumed; consequently nonnegativity and normalization of this function are not part of the definition. If either label set is empty, its domain is empty.
QAlgorithms.Papers.Independent.Support50.P12.logOverlap
For any finite index type with decidable equality, arbitrary complex matrices , and real number , define by real functional calculus using the scalar function that equals at zero and elsewhere, and put . This definition returns , embedded in the extended real numbers, if , and returns if . The logarithm is natural. No density, Hermitian, positivity, or support assumption is imposed; in particular, zero eigenvalues remain zero even at exponent . An empty index type gives and hence value .
QAlgorithms.Papers.Independent.Support50.P12.logOverlapPerspective
For any finite index type with decidable equality, arbitrary complex matrices , and real number , this definition returns if . If , it returns
in extended-real arithmetic, where is the natural logarithm of when that number is positive, and is otherwise. The matrix power is defined by real functional calculus with scalar value at zero and elsewhere. For , the factor is positive and , including parameter when . No matrix positivity or normalization is required; for empty , the value is for .
QAlgorithms.Papers.Independent.Support50.P12.merge
The declaration defines the complex-linear map by
for every complex matrix , without any Hermiticity, positivity or normalization requirement.
QAlgorithms.Papers.Independent.Support50.P12.modular
For any finite type with decidable equality, any function , and any complex matrices , the matrix is
where and are the sets of distinct real eigenvalues if the respective matrices are Hermitian, and are empty otherwise, and is the orthogonal projection onto , with defined similarly. Scalars are embedded into . Division is total real division, so . If either matrix is non-Hermitian, or is empty, the sum is zero; there are no positivity or regularity assumptions.
QAlgorithms.Papers.Independent.Support50.P12.modularContraction
For finite index types with decidable equality, a complex linear map , and arbitrary matrices , , this defines the matrix
where is the real continuous functional calculus of for the scalar function taking to and each nonzero real to its total real power , and
No positivity, Hermiticity, or invertibility assumption is imposed on , , or their images; the functional calculus is total, returning zero on non-Hermitian matrices. Zero eigenvalues contribute zero to both indicated powers. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.modularSpec
For any finite index type with decidable equality, any unital complex star subalgebra of the complex matrices, and arbitrary matrices of that size, this definition forms a finite set of real numbers. For a Hermitian matrix , let be its set of distinct real eigenvalues; for a non-Hermitian matrix, put . The resulting set consists exactly of those ratios , with and , for which there exists a nonzero satisfying
Here is obtained through real functional calculus from the scalar function that is at zero and elsewhere. Ratios with are included in the initial construction and equal by totalized division. No positivity or invertibility is assumed. If either matrix is non-Hermitian, or if is empty, the resulting finite set is empty.
QAlgorithms.Papers.Independent.Support50.P12.outputBlock
Let be finite types with decidable equality, and let consist of blocks with positive dimensions , isometric embeddings and with pairwise orthogonal ranges within each family, positive definite right-factor matrices with real trace , and matrices satisfying both and . For every and every complex matrix , the defined output block is the matrix
No positivity or normalization is imposed on , and there is no such block index when .
QAlgorithms.Papers.Independent.Support50.P12.pairConditions
Let be finite index types with decidable equality, possibly empty; let and be unital complex -subalgebras, let be complex-linear, let be arbitrary, and let be a Boolean. This definition returns a family of ten propositions indexed by , as specified below. The notation needed to state them is as follows: means is positive semidefinite; ; and the adjoint used for any linear map is defined entrywise by
where is the matrix unit. For algebras and a map from the ambient matrices of to those of , write for the conjunction that every ambient input has image in , every ambient output matrix has adjoint image in , sends positive semidefinite members of to positive semidefinite matrices, and, for every ,
Write for this conjunction together with for every . Define , where at and otherwise, using real functional calculus; set and . Let be the set of distinct real eigenvalues if is Hermitian and the empty set otherwise, and let be the orthogonal projection onto its -eigenspace. Define for non-Hermitian ; for Hermitian , define it in the chosen orthonormal eigenbasis by replacing each eigenvalue with when , and with otherwise. For a real function , define
where real values are embedded in the extended reals and denotes the total limit-selection operation, without an additional assertion that this limit exists. Say satisfies when it is continuous on and , viewed in the extended reals, converges as to its limit-selection value. Say satisfies when, in every natural matrix dimension, including zero, all positive semidefinite and satisfy
For the richness requirement, let and for , and let be the measure on selected by choice to admit real with , integrable , and, for every , an integrable kernel and representation
If no such measure exists, the choice still supplies a measure. Write when the cardinality of the topological support of is at least . Define
and define the proposition by
Then the ten returned propositions are: (0) there exists a complex-linear satisfying , , and ; (1) such a exists with in place of ; (2) every real function satisfying and obeys ; (3) some real function satisfying , , and obeys that equality; (4) there is a set of cardinality at least such that for every , where ; (5) holds for every complex ; (6) holds for some real with ; (7) holds for every real ; (8) the identity
holds; (9) writing and , the identity
holds. No density, positivity, support, algebra-membership, or stochasticity assumptions on are imposed by this definition itself. All displayed scalar operations are total: division by zero is zero, real logarithms are used also at nonpositive inputs, and zero spectral values are explicitly assigned zero in and , including at exponent zero.
QAlgorithms.Papers.Independent.Support50.P12.petzRenyi
For any finite type with decidable equality, any , and any complex matrices , let denote the real continuous functional calculus of with and for , using total real powers. If or , then
where for and for , and multiplication takes place in the extended real numbers. Otherwise the value is . No positivity or normalization is assumed, and is included: the real inverse of is then zero, so the supported branch evaluates to zero under extended-real multiplication, while failure of support gives .
QAlgorithms.Papers.Independent.Support50.P12.pnorm
For finite index types , with decidable equality on , and any function , this defines the real number
where is the identity matrix on . The function is evaluated only at that identity, and no linearity or positivity is assumed. If is empty, there is no vector satisfying the normalization condition; the real supremum of the empty set used here is , so the defined value is . The type may also be empty.
QAlgorithms.Papers.Independent.Support50.P12.polar
For any function and any real number , this definition returns the extended-real supremum
using extended-real subtraction after embedding the finite real number . There are no convexity, continuity, or finiteness assumptions on , and no maximizing is asserted to exist. A value contributes , while contributes .
QAlgorithms.Papers.Independent.Support50.P12.psiReal
For any finite index type with decidable equality, arbitrary complex matrices , and real number , let , where is real functional calculus for the scalar function equal to at zero and elsewhere. This definition returns the natural logarithm when , and returns when : in the latter case the intermediate extended-real logarithm is , whose conversion to a real number is . No positivity or normalization is assumed, and the empty index case also returns .
QAlgorithms.Papers.Independent.Support50.P12.quasi
For any finite type with decidable equality, any function , and any complex matrices , let be the real continuous functional calculus of with the function and for , using the total real power operation. Then is
where are the distinct Hermitian eigenvalue sets, taken to be empty for non-Hermitian matrices, and project orthogonally onto the corresponding eigenspaces. This uses the Hilbert–Schmidt inner product, conjugate-linear in its first argument. Zero denominators give ; no positivity or normalization is required. The value is zero if either matrix is non-Hermitian or is empty.
QAlgorithms.Papers.Independent.Support50.P12.recessionSlope
For every function , is the value selected by the total limit operation for the extended-real-valued function as . If this limit exists, including a limit of or , the definition returns it; otherwise the total operation supplies a fallback value. The definition itself asserts no convergence.
QAlgorithms.Papers.Independent.Support50.P12.renyiOne
For every finite index type with decidable equality, possibly empty, and arbitrary complex square matrices indexed by , define by real functional calculus with scalar value zero at zero and otherwise, and define to be the extended real value when , and otherwise. With , set
Then is the value selected by the total limit operation for as strictly from below. On this approach the first branch always applies, regardless of support inclusion. This is a definition, with no assertion that a limit exists and no positivity, Hermiticity, normalization, or nonzero assumptions on ; powers at zero remain zero, scalar inversion at zero is zero, and multiplication is extended real arithmetic.
QAlgorithms.Papers.Independent.Support50.P12.representationKernel
For every real number and every positive real number , the representation kernel is
There is no restriction on . In particular, is allowed, and the second quotient is then , according to the total real division convention used here.
QAlgorithms.Papers.Independent.Support50.P12.representingMeasure
For any function , this definition chooses a measure on satisfying the following property, if such a measure exists: there are real numbers , with , such that is integrable with respect to , and for every , the function is integrable and
Here for , while is the totalized limit selected for as ; existence of that limit is not assumed. The choice of need not be unique. If no measure has the stated property, the definition still selects a measure, without guaranteeing that property.
QAlgorithms.Papers.Independent.Support50.P12.resolventGenerator
For every pair of real numbers , this definition assigns the real number . Neither variable is restricted to be positive. Division is totalized, so when , the value is , including at .
QAlgorithms.Papers.Independent.Support50.P12.signedSchatten
For a finite index type with decidable equality, any real number , and any matrix , this real-valued function is
Here brackets denote the real functional calculus, and both real powers are the total real-power operation. No restriction such as is imposed. In particular, , so at the value is for every nonzero , while the zero matrix receives the separately specified value . Zero spectral values contribute zero to , including when or .
QAlgorithms.Papers.Independent.Support50.P12.snorm
For finite index types , with decidable equality on , a unital complex star subalgebra , and any function , this defines an extended nonnegative real number as the infimum of all real constants for which sends positive semidefinite matrices in to positive semidefinite matrices and
Each admissible is regarded as an element of . If no such constant exists, the infimum is ; attainment is not required. No linearity is assumed, and empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P12.spec
For any finite type with decidable equality and any complex matrix , is the finite set of real eigenvalues supplied by a Hermitian spectral decomposition when is Hermitian; repeated eigenvalues occur only once in this set. If is not Hermitian, the set is empty. It is also empty when is empty.
QAlgorithms.Papers.Independent.Support50.P12.supp
For any finite type with decidable equality and any complex matrix indexed by , is the real continuous functional calculus applied to with the function that is at and at every nonzero real number. Thus, for Hermitian , it is the orthogonal projection onto the sum of all nonzero eigenspaces, including eigenspaces with negative eigenvalues. For non-Hermitian , this functional calculus returns the zero matrix. No positivity assumption is imposed.
QAlgorithms.Papers.Independent.Support50.P12.supportScalarPower
For all real , is when , and is the total real power otherwise. In particular, its value at is zero even for or negative . Negative bases and arbitrary real exponents are included through the library’s total real power operation.
QAlgorithms.Papers.Independent.Support50.P12.transposeDefect
For a finite index type with decidable equality, arbitrary real numbers , and an arbitrary complex matrix indexed by , this defines the matrix
Here denotes conjugate transpose, ordinary transpose, and the identity. No positivity or normalization assumptions are imposed; empty is included, and division by zero is .
QAlgorithms.Papers.Independent.Support50.P12.transposeMix
For a finite index type with decidable equality, any real number , and any complex matrix indexed by , this defines
where is the ordinary transpose. The parameter is unrestricted, including values outside , and may be empty.
QAlgorithms.Papers.Independent.Support50.P12.transposeNoise
For a finite index type with decidable equality, any real number , and any complex matrix indexed by , this defines
where is the ordinary transpose and is the identity matrix. No restriction on , positivity, or normalization of is imposed. The definition also includes empty ; division by zero then has the totalized value .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.