Definitions for Quantum Information Processing with Finite Resources -- Mathematical Foundations
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P07The objects the formalized statements of Quantum Information Processing with Finite Resources -- Mathematical Foundations (arXiv:1504.00233) are stated in. Each was checked against the paper by a blind read-back and a moderator.
paperMatpaperBelow: PDF p.22: Loewner order.paperSupported: PDF p.22: support inclusion is reverse kernel inclusion.paperSubnormalized: PDF pp.26-28: subnormalized PSD states, including zero.paperPure: PDF p.27: pure means rank one.paperLogE: PDF pp.19-20: binary logarithm with log(0)=-infinity.expE: PDF pp.19-20: binary exponential at finite and infinite arguments.paperPower: PDF p.32: support powers, with zero on the kernel even at exponent zero.matrixLog: PDF p.32: logarithm on the support, zero on the kernel.paperSchatten: PDF p.40: Schatten functional at positive real orders.positiveNorm: PDF p.42, (3.17): norm on all complex operators, with trace modulus.paperDelta: PDF p.43: generalized trace distance for all operators.paperFidelity: PDF p.44: squared algebraic fidelity, distinct from generalized fidelity.paperGeneralizedFidelity: PDF p.46: squared generalized fidelity.purified: PDF p.47: purified distance, using generalized fidelity once.paperBall: PDF p.98: full subnormalized ball, without a support restriction.Radius: PDF p.98: standing trace-dependent smoothing-radius restriction.paperTraceMiddle: PDF p.30: trace out B in (AB)C.paperRegroup: PDF p.30: actual regrouping (AB)C to A(BC).paperMarginalBC: PDF p.30: computed marginal BC.paperHmin: PDF p.92: extended supremum of domination exponents and reference states.hmax: PDF p.94: extended max-entropy from squared algebraic fidelity; Hmax(0)=-infinity.paperSmoothMin: PDF p.98: smooth min-entropy over the full subnormalized ball.paperSmoothMax: PDF p.98: smooth max-entropy is an infimum over the same ball.conditionalVN: PDF p.76: conditional von Neumann entropy in bits.paperJointPower: PDF pp.109-111: iid matrix product, regrouped as A^n B^n.paperTensorPower: PDF p.109: single-system matrix tensor power, with tensor unit at n=0.minRate: PDF p.110: regularization in EReal; the n=0 default is irrelevant to the limit.maxRate: PDF p.110: regularized smooth max-entropy.paperLocalEmbedding: PDF p.100: arbitrary rectangular local isometric embedding.CPTNI: PDF p.26: CPTNI, on every PSD input.paperCPTP: PDF p.26: CPTP, with trace preservation on every operator.paperTensorAction: PDF p.104: tensor action on the actual matrix-unit expansion.paperMix: PDF p.32: binary convex combination of matrices.ClassicalLeft: PDF p.32: classical on the first register.ClassicalXY: PDF p.100: classical X and Y in register order (AX)(BY).classicalProcess: PDF p.105: pushforward of the classical register; quantum registers retained.paperPenalty: PDF p.103: smoothing penalty, used only at 0<e<1.maxD: PDF p.106: max-divergence, including -infinity for a zero numerator.smoothMaxD: PDF p.106: relative smoothing over subnormalized states, also at large radii.paperPositivePart: PDF p.107: actual positive spectral part.excessRadius: PDF p.107: radius computed from the positive excess, not a free witness.paperRelativeD: PDF pp.61,65: normalized-trace Umegaki entropy with support-failure value +infinity.paperVariance: PDF pp.72,109: centered relative-entropy variance on the support domain.MinPrimal: PDF p.93: min-entropy primal feasibility.MinDual: PDF p.93: min-entropy dual feasibility.SmoothPrimal: PDF p.99: smooth min-entropy SDP, with overlap threshold 1-e^2.conditionalBlocks: PDF p.96: classical blocks in the BY register without renormalization.guessObjective: PDF p.97: guessing success probability.paperMeasuredJoint: PDF p.97: classical joint distribution produced by a measurement.paperCqState: PDF p.97: actual CQ assembly.hartleyConditional: PDF p.95: optimized support entropy with the extended zero value.paperRenyiQ: PDF pp.62,69: unnormalized sandwiched or Petz trace functional.renyiFinite: PDF pp.61,69: finite positive-order divergence, normalized by Tr r. The a=1 value is the Umegaki limit, and support/orthogonality guards preserve infinity.paperRenyi: PDF pp.61,69,78: endpoint orders are limits of the increasing finite-order family. For the sandwiched family infinity is the max-divergence.conditionalDown: PDF p.77, Definition 5.2: fixed-reference conditional Renyi entropy.conditionalUp: PDF p.77, Definition 5.2: optimize over actual normalized reference states.paperConditional: PDF p.81: select fixed-reference or optimized entropy without changing the divergence family.DPIOrder: PDF pp.81,86: orders for which this family has data processing, including limiting endpoints.transformedOrder: PDF pp.84-85: real order 2-1/a including a=infinity, with reciprocal endpoint limits.paperIndependentProduct: PDF p.84: regrouped independent product AB,CD to AC,BD.spectralValues: PDF p.36: distinct spectral values; zero is included when present.paperSpectralProjector: PDF p.36: actual spectral projection at l.paperPinch: PDF p.36: spectral pinching of an operator.SpectralRep: PDF p.70: spectral data is tied to the input matrix by reconstruction.paperNsP: PDF p.70: Nussbaum-Szkola probability law from the actual two spectral bases.paperNsQ: PDF p.70: Nussbaum-Szkola reference law.paperProbability: PDF p.12: a finite normalized classical probability distribution.paperSeparable: PDF p.76: finite separable states, with actual normalized product components.basisLaw: PDF p.116: Born law for the orthonormal basis in the columns of U.paperBasisMeasurement: PDF p.117: local basis measurement on A, retaining the side information B.basisOverlap: PDF p.116: maximum SQUARED overlap of the two actual bases.paperTypeI: PDF p.114: type-I error when T accepts rho.paperTypeII: PDF p.114: type-II error when T accepts rho.alphaStar: PDF p.114, (7.6). Printed: minimize alpha(T;sigma) subject to beta(T;rho). Changed: minimize alpha(T;rho) subject to beta(T;sigma). Why: (7.1)-(7.2), the sentence before (7.6), and the Stein threshold all fix these roles.paperBetaStar: PDF p.115: minimum type-II error at prescribed type-I tolerance.paperSymmetricError: PDF p.114: optimal average error with equal priors.paperRenyiReal: PDF p.72: Renyi divergences as real-valued functions only on supported pairs.petzExtendedQ: PDF p.69: extended Petz Q on support failure above one.paperSourceCode: PDF p.12: fixed-cardinality deterministic source code.paperCodeError: PDF p.12: actual probability of decoding failure.paperClassicalRenyi: PDF p.13: classical Renyi entropy at finite positive order other than one.paperShannon: PDF p.13: Shannon entropy, with zero contributions from zero probabilities.variation: PDF p.14: introductory variation distance (different from purified distance).introSmoothMax: PDF p.14: smoothing only over normalized classical probability laws.iidLaw: PDF p.13: iid classical product law.codeCardinality: PDF p.13: integer memory cardinality rounded upward from 2^(nR).Resolution: PDF p.36: finite orthogonal resolution of identity.resolutionPinch: PDF p.36: pinching from a finite resolution.UnitaryInvariantNorm: PDF p.40: all unitarily invariant complex norms, rather than a particular matrix norm.hatState: PDF p.46: normalized hat-state with a single vacuum flag.paperChoi: PDF p.37: Choi matrix from the UNNORMALIZED entangled vector.inverseChoi: PDF p.37, (2.69): inverse in register order A-prime,B; the input transpose is implicit in the pairing.paperEntangled: PDF p.93: normalized maximally entangled density matrix on two copies of the same basis.preparedEntangled: PDF p.94, (6.11): a B-prime-to-A channel applied to the second half of psi_BBprime, then regrouped as AB.paperAdjointAction: PDF pp.91-92: the actual Hilbert-Schmidt adjoint, computed from matrix units.sdpPrimal: PDF p.92: extended primal infimum; infeasibility is +infinity.sdpDual: PDF p.92: extended dual supremum; infeasibility is -infinity.productState: PDF p.109: heterogeneous product states, retaining every factor.paperQuadratic: PDF pp.31,42: the actual quadratic form, with conjugation in the first argument.measureOutput: PDF pp.35,68: actual classical probability matrix of a POVM output.optimalCardinality: PDF p.14: minimum code alphabet cardinality. On probability sources the feasible set is nonempty (lossless coding).paperDivergenceFamily: PDF pp.52-58: a divergence is one family across all finite systems, so classical outputs, tensor powers, direct sums and rectangular channels have the same value rule.paperClassicalAgreement: PDF pp.56,58,61: agreement with the classical divergence on diagonal positive pairs.AdditiveDivergence: PDF p.52, (V): tensor additivity, on arbitrary nonzero positive numerators.paperDataProcessing: PDF p.53, (VIII): every CPTP map, including maps between different dimensions.paperMaxFamily: PDF pp.60-61: the concrete max-divergence family.measuredRenyi: PDF p.66, (4.73): optimization over actual finite-outcome POVMs, in EReal.MeasuredRepresentation: PDF p.66, (4.73): the measured representation for every positive input pair, including attainment of each finite-copy maximum. This predicate does not assume DPI.AxiomDomain: PDF p.52: finite real domain of the six axioms.RealDivergenceFamily: PDF p.52: real-valued divergence across every finite system, before adjoining infinities.paperDirectSum: PDF p.52: direct sum in the disjoint-union basis.paperSixAxioms: PDF p.52, (I)-(VI): the actual unbounded positive cone and the full trace-weighted mean. The accepted Dependency50.P35.SixAxioms restricts the mean to total traces at most one; this book states the mean for arbitrary positive inputs, so it has a distinct local predicate.MeanCurvature: PDF pp.53,57: joint convexity or concavity of g(D) on normalized pairs.RealDataProcessing: PDF pp.53,57: data processing on the finite domain where the axiomatic D is real.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_MatrixMapPositivity
import Definitions.Def_QAlgorithms_Defs_QuantumInformation
import Definitions.Def_QAlgorithms_Defs_Ensemble
/-! Tomamichel, arXiv:1504.00233v5. PDF pages; binary logarithms.
New definitions are local to this paper. Compilation and independent moderation pending. -/
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
abbrev paperMat (I : Type*) := Matrix I I ℂ
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- PDF p.22: Loewner order. -/
def paperBelow (M N : paperMat I) : Prop := (N-M).PosSemidef
/-- PDF p.22: support inclusion is reverse kernel inclusion. -/
def paperSupported (M N : paperMat I) : Prop := LinearMap.ker N.mulVecLin ≤ LinearMap.ker M.mulVecLin
/-- PDF pp.26-28: subnormalized PSD states, including zero. -/
def paperSubnormalized (r : paperMat I) : Prop := r.PosSemidef ∧ r.trace.re ≤ 1
/-- PDF p.27: pure means rank one. -/
def paperPure (r : paperMat I) : Prop := r.PosSemidef ∧ r.rank = 1
/-- PDF pp.19-20: binary logarithm with log(0)=-infinity. -/
def paperLogE (x : ℝ) : EReal := if x = 0 then ⊥ else (Real.logb 2 x : EReal)
/-- PDF pp.19-20: binary exponential at finite and infinite arguments. -/
def expE (x : EReal) : ENNReal :=
if x = ⊤ then ⊤ else if x = ⊥ then 0 else ENNReal.ofReal ((2:ℝ)^x.toReal)
/-- PDF p.32: support powers, with zero on the kernel even at exponent zero. -/
def paperPower (M : paperMat I) (p : ℝ) : paperMat I := cfc (fun x : ℝ => if x = 0 then 0 else x^p) M
/-- PDF p.32: logarithm on the support, zero on the kernel. -/
def matrixLog (M : paperMat I) : paperMat I := cfc (fun x : ℝ => Real.logb 2 x) M
/-- PDF p.40: Schatten functional at positive real orders. -/
def paperSchatten (M : paperMat I) (p : ℝ) : ℝ :=
(paperPower (cfc Real.sqrt (Mᴴ*M)) p).trace.re ^ (1/p)
/-- PDF p.42, (3.17): norm on all complex operators, with trace modulus. -/
def positiveNorm (M : paperMat I) : ℝ :=
sSup {r : ℝ | ∃ E : paperMat I, IsEffect E ∧ r = ‖(M*E).trace‖}
/-- PDF p.43: generalized trace distance for all operators. -/
def paperDelta (M N : paperMat I) : ℝ := positiveNorm (M-N)
/-- PDF p.44: squared algebraic fidelity, distinct from generalized fidelity. -/
def paperFidelity (r s : paperMat I) : ℝ := rootFidelity r s ^ 2
/-- PDF p.46: squared generalized fidelity. -/
def paperGeneralizedFidelity (r s : paperMat I) : ℝ :=
(rootFidelity r s + Real.sqrt ((1-r.trace.re)*(1-s.trace.re)))^2
/-- PDF p.47: purified distance, using generalized fidelity once. -/
def purified (r s : paperMat I) : ℝ := Real.sqrt (1-paperGeneralizedFidelity r s)
/-- PDF p.98: full subnormalized ball, without a support restriction. -/
def paperBall (r : paperMat I) (e : ℝ) : Set (paperMat I) := {s | paperSubnormalized s ∧ purified s r ≤ e}
/-- PDF p.98: standing trace-dependent smoothing-radius restriction. -/
def Radius (r : paperMat I) (e : ℝ) : Prop := 0 ≤ e ∧ e < Real.sqrt r.trace.re
/-- PDF p.30: trace out B in (AB)C. -/
def paperTraceMiddle (r : paperMat ((A × B) × C)) : paperMat (A × C) :=
fun x y => ∑ b, r ((x.1,b),x.2) ((y.1,b),y.2)
/-- PDF p.30: actual regrouping (AB)C to A(BC). -/
def paperRegroup (r : paperMat ((A × B) × C)) : paperMat (A × (B × C)) :=
fun x y => r ((x.1,x.2.1),x.2.2) ((y.1,y.2.1),y.2.2)
/-- PDF p.30: computed marginal BC. -/
def paperMarginalBC (r : paperMat ((A × B) × C)) : paperMat (B × C) := traceLeft (paperRegroup r)
/-- PDF p.92: extended supremum of domination exponents and reference states. -/
def paperHmin (r : paperMat (A × B)) : EReal :=
sSup {h : EReal | ∃ l : ℝ, h = (l:EReal) ∧ ∃ s : paperMat B, paperSubnormalized s ∧
paperBelow r ((((2:ℝ)^(-l) : ℝ) : ℂ) • Matrix.kronecker (1:paperMat A) s)}
/-- PDF p.94: extended max-entropy from squared algebraic fidelity; Hmax(0)=-infinity. -/
def hmax (r : paperMat (A × B)) : EReal :=
sSup {h : EReal | ∃ s : paperMat B, paperSubnormalized s ∧ h = paperLogE (paperFidelity r (Matrix.kronecker (1:paperMat A) s))}
/-- PDF p.98: smooth min-entropy over the full subnormalized ball. -/
def paperSmoothMin (r : paperMat (A × B)) (e : ℝ) : EReal :=
sSup {h : EReal | ∃ s ∈ paperBall r e, h = paperHmin s}
/-- PDF p.98: smooth max-entropy is an infimum over the same ball. -/
def paperSmoothMax (r : paperMat (A × B)) (e : ℝ) : EReal :=
sInf {h : EReal | ∃ s ∈ paperBall r e, h = hmax s}
/-- PDF p.76: conditional von Neumann entropy in bits. -/
def conditionalVN (r : paperMat (A × B)) : ℝ := vnEntropy r-vnEntropy (traceLeft r)
/-- PDF pp.109-111: iid matrix product, regrouped as A^n B^n. -/
def paperJointPower (r : paperMat (A × B)) (n : ℕ) : paperMat ((Fin n → A) × (Fin n → B)) :=
fun x y => ∏ i, r (x.1 i,x.2 i) (y.1 i,y.2 i)
/-- PDF p.109: single-system matrix tensor power, with tensor unit at n=0. -/
def paperTensorPower (r : paperMat I) (n : ℕ) : paperMat (Fin n → I) := fun x y => ∏ i, r (x i) (y i)
/-- PDF p.110: regularization in EReal; the n=0 default is irrelevant to the limit. -/
def minRate (r : paperMat (A × B)) (e : ℝ) (n : ℕ) : EReal :=
((1/(n:ℝ) : ℝ) : EReal)*paperSmoothMin (paperJointPower r n) e
/-- PDF p.110: regularized smooth max-entropy. -/
def maxRate (r : paperMat (A × B)) (e : ℝ) (n : ℕ) : EReal :=
((1/(n:ℝ) : ℝ) : EReal)*paperSmoothMax (paperJointPower r n) e
/-- PDF p.100: arbitrary rectangular local isometric embedding. -/
def paperLocalEmbedding (U : Matrix C A ℂ) (V : Matrix D B ℂ) (r : paperMat (A × B)) : paperMat (C × D) :=
Matrix.kronecker U V*r*(Matrix.kronecker U V)ᴴ
/-- PDF p.26: CPTNI, on every PSD input. -/
def CPTNI (E : paperMat I →ₗ[ℂ] paperMat J) : Prop :=
QAlgorithms.Entanglement.IsCompletelyPositive E ∧ ∀ r, r.PosSemidef → (E r).trace.re ≤ r.trace.re
/-- PDF p.26: CPTP, with trace preservation on every operator. -/
def paperCPTP (E : paperMat I →ₗ[ℂ] paperMat J) : Prop :=
QAlgorithms.Entanglement.IsCompletelyPositive E ∧ ∀ M, (E M).trace = M.trace
/-- PDF p.104: tensor action on the actual matrix-unit expansion. -/
def paperTensorAction (E : paperMat A →ₗ[ℂ] paperMat C) (F : paperMat B →ₗ[ℂ] paperMat D) (r : paperMat (A × B)) : paperMat (C × D) :=
fun x y => ∑ a, ∑ a', ∑ b, ∑ b', r (a,b) (a',b') * E (Matrix.single a a' 1) x.1 y.1 *
F (Matrix.single b b' 1) x.2 y.2
/-- PDF p.32: binary convex combination of matrices. -/
def paperMix (t : ℝ) (M N : paperMat I) : paperMat I := (t:ℂ) • M + ((1-t:ℝ):ℂ) • N
/-- PDF p.32: classical on the first register. -/
def ClassicalLeft (r : paperMat (X × A)) : Prop := ∀ x y a b, x ≠ y → r (x,a) (y,b) = 0
/-- PDF p.100: classical X and Y in register order (AX)(BY). -/
def ClassicalXY (r : paperMat ((A × X) × (B × Y))) : Prop :=
∀ a x b y a' x' b' y', x ≠ x' ∨ y ≠ y' → r ((a,x),(b,y)) ((a',x'),(b',y')) = 0
/-- PDF p.105: pushforward of the classical register; quantum registers retained. -/
def classicalProcess (f : X → Z) (r : paperMat ((X × A) × B)) : paperMat ((Z × A) × B) :=
fun z w => if z.1.1 = w.1.1 then ∑ x, if f x = z.1.1 then
r ((x,z.1.2),z.2) ((x,w.1.2),w.2) else 0 else 0
/-- PDF p.103: smoothing penalty, used only at 0<e<1. -/
def paperPenalty (e : ℝ) : ℝ := -Real.logb 2 (1-Real.sqrt (1-e^2))
/-- PDF p.106: max-divergence, including -infinity for a zero numerator. -/
def maxD (r s : paperMat I) : EReal :=
sInf {d : EReal | ∃ l : ℝ, d = (l:EReal) ∧ paperBelow r (((2:ℝ)^l : ℂ) • s)}
/-- PDF p.106: relative smoothing over subnormalized states, also at large radii. -/
def smoothMaxD (r s : paperMat I) (e : ℝ) : EReal :=
sInf {d : EReal | ∃ t ∈ paperBall r e, d = maxD t s}
/-- PDF p.107: actual positive spectral part. -/
def paperPositivePart (M : paperMat I) : paperMat I := cfc (fun x : ℝ => max x 0) M
/-- PDF p.107: radius computed from the positive excess, not a free witness. -/
def excessRadius (r s : paperMat I) (l : ℝ) : ℝ :=
let t := (paperPositivePart (r-(((2:ℝ)^l : ℂ) • s))).trace.re
Real.sqrt (2*t-t^2)
/-- PDF pp.61,65: normalized-trace Umegaki entropy with support-failure value +infinity. -/
def paperRelativeD (r s : paperMat I) : EReal := if paperSupported r s then
(((r*(matrixLog r-matrixLog s)).trace.re/r.trace.re : ℝ):EReal) else ⊤
/-- PDF pp.72,109: centered relative-entropy variance on the support domain. -/
def paperVariance (r s : paperMat I) : ℝ :=
(r*(matrixLog r-matrixLog s-((paperRelativeD r s).toReal:ℂ) • (1:paperMat I))^2).trace.re
/-- PDF p.93: min-entropy primal feasibility. -/
def MinPrimal (r : paperMat (A × B)) (s : paperMat B) : Prop := s.PosSemidef ∧ paperBelow r (Matrix.kronecker (1:paperMat A) s)
/-- PDF p.93: min-entropy dual feasibility. -/
def MinDual (W : paperMat (A × B)) : Prop := W.PosSemidef ∧ paperBelow (traceLeft W) 1
/-- PDF p.99: smooth min-entropy SDP, with overlap threshold 1-e^2. -/
def SmoothPrimal (r : paperMat ((A × B) × C)) (e : ℝ) (t : paperMat ((A × B) × C)) (s : paperMat B) : Prop :=
paperSubnormalized t ∧ s.PosSemidef ∧ 1-e^2 ≤ (t*r).trace.re ∧
paperBelow (traceRight t) (Matrix.kronecker (1:paperMat A) s)
/-- PDF p.96: classical blocks in the BY register without renormalization. -/
def conditionalBlocks (r : Y → paperMat (A × B)) : paperMat (A × (B × Y)) :=
fun x z => if x.2.2 = z.2.2 then r x.2.2 (x.1,x.2.1) (z.1,z.2.1) else 0
/-- PDF p.97: guessing success probability. -/
def guessObjective (r : X → paperMat B) (M : X → paperMat B) : ℝ := ∑ x, (M x*r x).trace.re
/-- PDF p.97: classical joint distribution produced by a measurement. -/
def paperMeasuredJoint (r : X → paperMat B) (M : X → paperMat B) : paperMat (X × X) :=
Matrix.diagonal (fun xy => ((M xy.2*r xy.1).trace.re:ℂ))
/-- PDF p.97: actual CQ assembly. -/
def paperCqState (r : X → paperMat B) : paperMat (X × B) := fun x y => if x.1 = y.1 then r x.1 x.2 y.2 else 0
/-- PDF p.95: optimized support entropy with the extended zero value. -/
def hartleyConditional (r : paperMat (A × B)) : EReal :=
sSup {h : EReal | ∃ s : paperMat B, paperSubnormalized s ∧
h = paperLogE ((paperPower r 0*Matrix.kronecker (1:paperMat A) s).trace.re)}
example (M : paperMat I) : paperMix 0 M M = M := by simp [paperMix]
example : paperLogE 0 = ⊥ := by simp [paperLogE]
example : paperSubnormalized (0:paperMat I) := ⟨Matrix.PosSemidef.zero, by simp⟩
example (r : paperMat I) (x y : Fin 0 → I) : paperTensorPower r 0 x y = 1 := by simp [paperTensorPower]
example (r : paperMat I) (e : ℝ) (s : paperMat I) : s ∈ paperBall r e ↔ paperSubnormalized s ∧ purified s r ≤ e := Iff.rfl
example (r : paperMat ((A × B) × C)) (a a' : A) (b b' : B) (c c' : C) :
paperRegroup r (a,(b,c)) (a',(b',c')) = r ((a,b),c) ((a',b'),c') := rfl
example (r : Y → paperMat (A × B)) (a a' : A) (b b' : B) (y : Y) :
conditionalBlocks r (a,(b,y)) (a',(b',y)) = r y (a,b) (a',b') := by simp [conditionalBlocks]
/-- PDF pp.62,69: unnormalized sandwiched or Petz trace functional. -/
def paperRenyiQ (sand : Bool) (r s : paperMat I) (a : ℝ) : ℝ :=
if sand then (paperPower (paperPower s ((1-a)/(2*a))*r*paperPower s ((1-a)/(2*a))) a).trace.re
else (paperPower r a*paperPower s (1-a)).trace.re
/-- PDF pp.61,69: finite positive-order divergence, normalized by Tr r.
The a=1 value is the Umegaki limit, and support/orthogonality guards preserve infinity. -/
def renyiFinite (sand : Bool) (r s : paperMat I) (a : ℝ) : EReal :=
if a = 1 then paperRelativeD r s
else if (a < 1 ∧ 0 < paperRenyiQ sand r s a) ∨ paperSupported r s then
((1/(a-1):ℝ):EReal)*paperLogE (paperRenyiQ sand r s a/r.trace.re)
else ⊤
/-- PDF pp.61,69,78: endpoint orders are limits of the increasing finite-order family.
For the sandwiched family infinity is the max-divergence. -/
def paperRenyi (sand : Bool) (r s : paperMat I) (a : ENNReal) : EReal :=
if a = 0 then sInf {d : EReal | ∃ t : ℝ, 0 < t ∧ d = renyiFinite sand r s t}
else if a = ⊤ then
if sand then maxD r s else sSup {d : EReal | ∃ t : ℝ, 0 < t ∧ d = renyiFinite sand r s t}
else renyiFinite sand r s a.toReal
/-- PDF p.77, Definition 5.2: fixed-reference conditional Renyi entropy. -/
def conditionalDown (sand : Bool) (a : ENNReal) (r : paperMat (A × B)) : EReal :=
-paperRenyi sand r (Matrix.kronecker (1:paperMat A) (traceLeft r)) a
/-- PDF p.77, Definition 5.2: optimize over actual normalized reference states. -/
def conditionalUp (sand : Bool) (a : ENNReal) (r : paperMat (A × B)) : EReal :=
sSup {h : EReal | ∃ s : paperMat B, IsDensityMatrix s ∧ h = -paperRenyi sand r (Matrix.kronecker (1:paperMat A) s) a}
/-- PDF p.81: select fixed-reference or optimized entropy without changing the divergence family. -/
def paperConditional (sand up : Bool) (a : ENNReal) (r : paperMat (A × B)) : EReal :=
if up then conditionalUp sand a r else conditionalDown sand a r
/-- PDF pp.81,86: orders for which this family has data processing, including limiting endpoints. -/
def DPIOrder (sand : Bool) (a : ENNReal) : Prop :=
if sand then (1/2:ENNReal) ≤ a else a ≤ 2
/-- PDF pp.84-85: real order 2-1/a including a=infinity, with reciprocal endpoint limits. -/
def transformedOrder (a : ENNReal) : ENNReal :=
if a = ⊤ then 2 else ENNReal.ofReal (2-1/a.toReal)
/-- PDF p.84: regrouped independent product AB,CD to AC,BD. -/
def paperIndependentProduct (r : paperMat (A × B)) (s : paperMat (C × D)) : paperMat ((A × C) × (B × D)) :=
fun x y => r (x.1.1,x.2.1) (y.1.1,y.2.1)*s (x.1.2,x.2.2) (y.1.2,y.2.2)
/-- PDF p.36: distinct spectral values; zero is included when present. -/
def spectralValues (H : paperMat I) : Finset ℝ := Finset.univ.image (ascEigenvalues H)
/-- PDF p.36: actual spectral projection at l. -/
def paperSpectralProjector (H : paperMat I) (l : ℝ) : paperMat I :=
cfc (fun x : ℝ => if x = l then (1:ℝ) else 0) H
/-- PDF p.36: spectral pinching of an operator. -/
def paperPinch (H L : paperMat I) : paperMat I :=
∑ l ∈ spectralValues H, paperSpectralProjector H l*L*paperSpectralProjector H l
/-- PDF p.70: spectral data is tied to the input matrix by reconstruction. -/
def SpectralRep (r : paperMat I) (v : I → ℝ) (U : paperMat I) : Prop :=
(∀ i, 0 ≤ v i) ∧ Uᴴ*U = 1 ∧ U*Uᴴ = 1 ∧ r = U*Matrix.diagonal (fun i => (v i:ℂ))*Uᴴ
/-- PDF p.70: Nussbaum-Szkola probability law from the actual two spectral bases. -/
def paperNsP (v : I → ℝ) (U V : paperMat I) : I × I → ℝ :=
fun xy => v xy.1*‖(Uᴴ*V) xy.1 xy.2‖^2
/-- PDF p.70: Nussbaum-Szkola reference law. -/
def paperNsQ (v : I → ℝ) (U V : paperMat I) : I × I → ℝ :=
fun xy => v xy.2*‖(Uᴴ*V) xy.1 xy.2‖^2
/-- PDF p.12: a finite normalized classical probability distribution. -/
def paperProbability (p : X → ℝ) : Prop := (∀ x, 0 ≤ p x) ∧ ∑ x, p x = 1
/-- PDF p.76: finite separable states, with actual normalized product components. -/
def paperSeparable (r : paperMat (A × B)) : Prop :=
∃ n : ℕ, ∃ w : Fin n → ℝ, ∃ s : Fin n → paperMat A, ∃ t : Fin n → paperMat B,
paperProbability w ∧ (∀ i, IsDensityMatrix (s i) ∧ IsDensityMatrix (t i)) ∧
r = ∑ i, (w i:ℂ) • Matrix.kronecker (s i) (t i)
/-- PDF p.116: Born law for the orthonormal basis in the columns of U. -/
def basisLaw (U r : paperMat I) : paperMat I := Matrix.diagonal (fun i => (Uᴴ*r*U) i i)
/-- PDF p.117: local basis measurement on A, retaining the side information B. -/
def paperBasisMeasurement (U : paperMat A) (r : paperMat (A × B)) : paperMat (A × B) :=
let W := Matrix.kronecker U (1:paperMat B)
fun x y => if x.1 = y.1 then (Wᴴ*r*W) x y else 0
/-- PDF p.116: maximum SQUARED overlap of the two actual bases. -/
def basisOverlap (U V : paperMat I) : ℝ := sSup {c : ℝ | ∃ i j, c = ‖(Uᴴ*V) i j‖^2}
/-- PDF p.114: type-I error when T accepts rho. -/
def paperTypeI (r T : paperMat I) : ℝ := ((1-T)*r).trace.re
/-- PDF p.114: type-II error when T accepts rho. -/
def paperTypeII (s T : paperMat I) : ℝ := (T*s).trace.re
/-- PDF p.114, (7.6). Printed: minimize alpha(T;sigma) subject to beta(T;rho).
Changed: minimize alpha(T;rho) subject to beta(T;sigma).
Why: (7.1)-(7.2), the sentence before (7.6), and the Stein threshold all fix these roles. -/
def alphaStar (r s : paperMat I) (e : ℝ) : ℝ :=
sInf {v : ℝ | ∃ T : paperMat I, IsEffect T ∧ paperTypeII s T ≤ e ∧ v = paperTypeI r T}
/-- PDF p.115: minimum type-II error at prescribed type-I tolerance. -/
def paperBetaStar (r s : paperMat I) (e : ℝ) : ℝ :=
sInf {v : ℝ | ∃ T : paperMat I, IsEffect T ∧ paperTypeI r T ≤ e ∧ v = paperTypeII s T}
/-- PDF p.114: optimal average error with equal priors. -/
def paperSymmetricError (r s : paperMat I) : ℝ :=
sInf {v : ℝ | ∃ T : paperMat I, IsEffect T ∧ v = (paperTypeI r T+paperTypeII s T)/2}
/-- PDF p.72: Renyi divergences as real-valued functions only on supported pairs. -/
def paperRenyiReal (sand : Bool) (r s : paperMat I) (a : ℝ) : ℝ := (renyiFinite sand r s a).toReal
example (r : paperMat I) (a : ENNReal) :
conditionalDown true a (fun x y : I × Unit => r x.1 y.1) =
-paperRenyi true (fun x y : I × Unit => r x.1 y.1)
(Matrix.kronecker (1:paperMat I) (traceLeft (fun x y : I × Unit => r x.1 y.1))) a := rfl
example (r s : paperMat I) : renyiFinite false r s 1 = paperRelativeD r s := by simp [renyiFinite]
example (r : paperMat I) (v : I → ℝ) (U : paperMat I) : paperNsP v U U = (fun xy => v xy.1*‖(Uᴴ*U) xy.1 xy.2‖^2) := rfl
example (r : paperMat I) : paperTypeI r 1 = 0 := by simp [paperTypeI]
example (s : paperMat I) : paperTypeII s 0 = 0 := by simp [paperTypeII]
/-- PDF p.69: extended Petz Q on support failure above one. -/
def petzExtendedQ (r s : paperMat I) (a : ℝ) : EReal :=
if 1 < a ∧ ¬paperSupported r s then ⊤ else (paperRenyiQ false r s a:EReal)
/-- PDF p.12: fixed-cardinality deterministic source code. -/
structure paperSourceCode (X : Type*) (m : ℕ) where
encode : X → Fin m
decode : Fin m → X
/-- PDF p.12: actual probability of decoding failure. -/
def paperCodeError (p : X → ℝ) {m : ℕ} (c : paperSourceCode X m) : ℝ :=
∑ x, if c.decode (c.encode x) = x then 0 else p x
/-- PDF p.13: classical Renyi entropy at finite positive order other than one. -/
def paperClassicalRenyi (p : X → ℝ) (a : ℝ) : ℝ := Real.logb 2 (∑ x, p x^a)/(1-a)
/-- PDF p.13: Shannon entropy, with zero contributions from zero probabilities. -/
def paperShannon (p : X → ℝ) : ℝ := -∑ x, p x*Real.logb 2 (p x)
/-- PDF p.14: introductory variation distance (different from purified distance). -/
def variation (p q : X → ℝ) : ℝ := (∑ x, |p x-q x|)/2
/-- PDF p.14: smoothing only over normalized classical probability laws. -/
def introSmoothMax (p : X → ℝ) (e : ℝ) : ℝ :=
sInf {h : ℝ | ∃ q : X → ℝ, paperProbability q ∧ variation p q ≤ e ∧ h = paperClassicalRenyi q (1/2)}
/-- PDF p.13: iid classical product law. -/
def iidLaw (p : X → ℝ) (n : ℕ) : (Fin n → X) → ℝ := fun x => ∏ i, p (x i)
/-- PDF p.13: integer memory cardinality rounded upward from 2^(nR). -/
def codeCardinality (n : ℕ) (R : ℝ) : ℕ := Nat.ceil ((2:ℝ)^((n:ℝ)*R))
/-- PDF p.36: finite orthogonal resolution of identity. -/
def Resolution {m : ℕ} (P : Fin m → paperMat I) : Prop :=
(∀ i, (P i)ᴴ = P i ∧ P i*P i = P i) ∧ (∀ i j, i ≠ j → P i*P j = 0) ∧ ∑ i, P i = 1
/-- PDF p.36: pinching from a finite resolution. -/
def resolutionPinch {m : ℕ} (P : Fin m → paperMat I) (M : paperMat I) : paperMat I := ∑ i, P i*M*P i
/-- PDF p.40: all unitarily invariant complex norms, rather than a particular matrix norm. -/
def UnitaryInvariantNorm (v : paperMat I → ℝ) : Prop :=
(∀ M, 0 ≤ v M ∧ (v M = 0 ↔ M = 0)) ∧
(∀ (z : ℂ) M, v (z • M) = ‖z‖*v M) ∧ (∀ M N, v (M+N) ≤ v M+v N) ∧
∀ U V M : paperMat I, Uᴴ*U = 1 → Vᴴ*V = 1 → v (U*M*V) = v M
/-- PDF p.46: normalized hat-state with a single vacuum flag. -/
def hatState (r : paperMat I) : paperMat (Sum I Unit) :=
fun x y => match x,y with
| .inl i,.inl j => r i j
| .inr _,.inr _ => (1-r.trace.re:ℂ)
| _,_ => 0
/-- PDF p.37: Choi matrix from the UNNORMALIZED entangled vector. -/
def paperChoi (E : paperMat I →ₗ[ℂ] paperMat J) : paperMat (I × J) :=
fun x y => E (Matrix.single x.1 y.1 1) x.2 y.2
/-- PDF p.37, (2.69): inverse in register order A-prime,B; the input transpose is implicit in the pairing. -/
def inverseChoi (G : paperMat (I × J)) (r : paperMat I) : paperMat J :=
fun b b' => ∑ i, ∑ j, r i j*G (i,b) (j,b')
/-- PDF p.93: normalized maximally entangled density matrix on two copies of the same basis. -/
def paperEntangled (I : Type*) [Fintype I] [DecidableEq I] : paperMat (I × I) :=
fun x y => if x.1 = x.2 ∧ y.1 = y.2 then (Fintype.card I:ℂ)⁻¹ else 0
/-- PDF p.94, (6.11): a B-prime-to-A channel applied to the second half of psi_BBprime, then regrouped as AB. -/
def preparedEntangled (E : paperMat B →ₗ[ℂ] paperMat A) : paperMat (A × B) :=
fun x y => idTensorSuperop E (paperEntangled B) (x.2,x.1) (y.2,y.1)
/-- PDF pp.91-92: the actual Hilbert-Schmidt adjoint, computed from matrix units. -/
def paperAdjointAction (E : paperMat I →ₗ[ℂ] paperMat J) (Y : paperMat J) : paperMat I :=
fun i j => ∑ a, ∑ b, conj (E (Matrix.single i j 1) a b)*Y a b
/-- PDF p.92: extended primal infimum; infeasibility is +infinity. -/
def sdpPrimal (E : paperMat I →ₗ[ℂ] paperMat J) (K : paperMat I) (L : paperMat J) : EReal :=
sInf {v : EReal | ∃ X : paperMat I, X.PosSemidef ∧ paperBelow L (E X) ∧ v = ((K*X).trace.re:EReal)}
/-- PDF p.92: extended dual supremum; infeasibility is -infinity. -/
def sdpDual (E : paperMat I →ₗ[ℂ] paperMat J) (K : paperMat I) (L : paperMat J) : EReal :=
sSup {v : EReal | ∃ Y : paperMat J, Y.PosSemidef ∧ paperBelow (paperAdjointAction E Y) K ∧ v = ((L*Y).trace.re:EReal)}
/-- PDF p.109: heterogeneous product states, retaining every factor. -/
def productState {n : ℕ} (r : Fin n → paperMat I) : paperMat (Fin n → I) :=
fun x y => ∏ i, r i (x i) (y i)
/-- PDF pp.31,42: the actual quadratic form, with conjugation in the first argument. -/
def paperQuadratic (r : paperMat I) (v : I → ℂ) : ℂ := ∑ i, ∑ j, conj (v i)*r i j*v j
example (r : paperMat I) (i j : I) : hatState r (.inl i) (.inl j) = r i j := rfl
example (E : paperMat I →ₗ[ℂ] paperMat J) (i j : I) (b c : J) :
paperChoi E (i,b) (j,c) = E (Matrix.single i j 1) b c := rfl
example (p : X → ℝ) (x : Fin 0 → X) : iidLaw p 0 x = 1 := by simp [iidLaw]
example (p : X → ℝ) : variation p p = 0 := by simp [variation]
example (K : paperMat I) (L : paperMat J) :
paperAdjointAction (0 : paperMat I →ₗ[ℂ] paperMat J) L = 0 := by ext i j; simp [paperAdjointAction]
/-- PDF pp.35,68: actual classical probability matrix of a POVM output. -/
def measureOutput {m : ℕ} (M : Fin m → paperMat I) (r : paperMat I) : paperMat (Fin m) :=
Matrix.diagonal (fun x => (M x*r).trace)
/-- PDF p.14: minimum code alphabet cardinality. On probability sources the feasible set is nonempty (lossless coding). -/
def optimalCardinality (p : X → ℝ) (e : ℝ) : ℕ :=
sInf {m : ℕ | 0 < m ∧ ∃ c : paperSourceCode X m, paperCodeError p c ≤ e}
/-- PDF pp.52-58: a divergence is one family across all finite systems,
so classical outputs, tensor powers, direct sums and rectangular channels have the same value rule. -/
structure paperDivergenceFamily where
value : (I : Type) → [Fintype I] → [DecidableEq I] → paperMat I → paperMat I → EReal
/-- PDF pp.56,58,61: agreement with the classical divergence on diagonal positive pairs. -/
def paperClassicalAgreement (D : paperDivergenceFamily) (a : ENNReal) : Prop :=
∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I], ∀ p q : I → ℝ,
(∀ i, 0 ≤ p i) → (∀ i, 0 ≤ q i) → p ≠ 0 →
D.value I (Matrix.diagonal (fun i => (p i:ℂ))) (Matrix.diagonal (fun i => (q i:ℂ))) =
paperRenyi false (Matrix.diagonal (fun i => (p i:ℂ))) (Matrix.diagonal (fun i => (q i:ℂ))) a
/-- PDF p.52, (V): tensor additivity, on arbitrary nonzero positive numerators. -/
def AdditiveDivergence (D : paperDivergenceFamily) : Prop :=
∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ r s : paperMat I, ∀ t u : paperMat J,
r.PosSemidef → s.PosSemidef → t.PosSemidef → u.PosSemidef → r ≠ 0 → t ≠ 0 →
D.value (I × J) (Matrix.kronecker r t) (Matrix.kronecker s u) = D.value I r s+D.value J t u
/-- PDF p.53, (VIII): every CPTP map, including maps between different dimensions. -/
def paperDataProcessing (D : paperDivergenceFamily) : Prop :=
∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ E : paperMat I →ₗ[ℂ] paperMat J,
paperCPTP E → ∀ r s : paperMat I, r.PosSemidef → s.PosSemidef → r ≠ 0 →
D.value J (E r) (E s) ≤ D.value I r s
/-- PDF pp.60-61: the concrete max-divergence family. -/
def paperMaxFamily : paperDivergenceFamily := ⟨fun _ _ _ r s => maxD r s⟩
/-- PDF p.66, (4.73): optimization over actual finite-outcome POVMs, in EReal. -/
def measuredRenyi (r s : paperMat I) (a : ENNReal) : EReal :=
sSup {d : EReal | ∃ m : ℕ, 0 < m ∧ ∃ M : Fin m → paperMat I, IsPOVM M ∧
d = paperRenyi false (measureOutput M r) (measureOutput M s) a}
/-- PDF p.66, (4.73): the measured representation for every positive input pair,
including attainment of each finite-copy maximum. This predicate does not assume DPI. -/
def MeasuredRepresentation (D : paperDivergenceFamily) (a : ENNReal) : Prop :=
∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I], ∀ r s : paperMat I,
r.PosSemidef → s.PosSemidef → r ≠ 0 →
Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*measuredRenyi (paperTensorPower r n) (paperTensorPower s n) a)
atTop (nhds (D.value I r s)) ∧
∀ n : ℕ, 0 < n → ∃ m : ℕ, 0 < m ∧ ∃ M : Fin m → paperMat (Fin n → I), IsPOVM M ∧
measuredRenyi (paperTensorPower r n) (paperTensorPower s n) a =
paperRenyi false (measureOutput M (paperTensorPower r n)) (measureOutput M (paperTensorPower s n)) a
example {K : Type} [Fintype K] [DecidableEq K] (r s : paperMat K) :
paperMaxFamily.value K r s = maxD r s := rfl
example (E : paperMat A →ₗ[ℂ] paperMat C) (F : paperMat B →ₗ[ℂ] paperMat D) :
paperTensorAction E F (0:paperMat (A × B)) = 0 := by ext x y; simp [paperTensorAction]
/-- PDF p.52: finite real domain of the six axioms. -/
def AxiomDomain (r s : paperMat I) : Prop := r.PosSemidef ∧ s.PosSemidef ∧ r ≠ 0 ∧ paperSupported r s
/-- PDF p.52: real-valued divergence across every finite system, before adjoining infinities. -/
abbrev RealDivergenceFamily := (I : Type) → [Fintype I] → [DecidableEq I] → paperMat I → paperMat I → ℝ
/-- PDF p.52: direct sum in the disjoint-union basis. -/
def paperDirectSum (r : paperMat I) (s : paperMat J) : paperMat (I ⊕ J) :=
fun x y => match x,y with
| .inl i,.inl j => r i j
| .inr i,.inr j => s i j
| _,_ => 0
/-- PDF p.52, (I)-(VI): the actual unbounded positive cone and the full trace-weighted mean.
The accepted Dependency50.P35.SixAxioms restricts the mean to total traces at most one;
this book states the mean for arbitrary positive inputs, so it has a distinct local predicate. -/
def paperSixAxioms (D : RealDivergenceFamily) (g : ℝ → ℝ) : Prop :=
Continuous g ∧ (StrictMono g ∨ StrictAnti g) ∧
(∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I],
ContinuousOn (fun x : paperMat I × paperMat I => D I x.1 x.2) {x | AxiomDomain x.1 x.2}) ∧
(∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ r s : paperMat I, ∀ U : Matrix J I ℂ,
AxiomDomain r s → Uᴴ*U = 1 → U*Uᴴ = 1 → D I r s = D J (U*r*Uᴴ) (U*s*Uᴴ)) ∧
D (Fin 1) 1 ((1/2:ℂ) • (1:paperMat (Fin 1))) = Real.logb 2 2 ∧
(∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I], ∀ r s : paperMat I,
AxiomDomain r s → (paperBelow s r → 0 ≤ D I r s) ∧ (paperBelow r s → D I r s ≤ 0)) ∧
(∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ r s : paperMat I, ∀ t u : paperMat J,
AxiomDomain r s → AxiomDomain t u →
D (I × J) (Matrix.kronecker r t) (Matrix.kronecker s u) = D I r s+D J t u) ∧
(∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ r s : paperMat I, ∀ t u : paperMat J,
AxiomDomain r s → AxiomDomain t u →
g (D (I ⊕ J) (paperDirectSum r t) (paperDirectSum s u)) =
r.trace.re/(r.trace.re+t.trace.re)*g (D I r s)+t.trace.re/(r.trace.re+t.trace.re)*g (D J t u))
/-- PDF pp.53,57: joint convexity or concavity of g(D) on normalized pairs. -/
def MeanCurvature (D : RealDivergenceFamily) (g : ℝ → ℝ) : Prop :=
∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I], ∀ r s t u : paperMat I,
AxiomDomain r s → AxiomDomain t u →
IsDensityMatrix r → IsDensityMatrix s → IsDensityMatrix t → IsDensityMatrix u →
∀ l : ℝ, l ∈ Set.Icc 0 1 →
(StrictMono g → g (D I (paperMix l r t) (paperMix l s u)) ≤ l*g (D I r s)+(1-l)*g (D I t u)) ∧
(StrictAnti g → l*g (D I r s)+(1-l)*g (D I t u) ≤ g (D I (paperMix l r t) (paperMix l s u)))
/-- PDF pp.53,57: data processing on the finite domain where the axiomatic D is real. -/
def RealDataProcessing (D : RealDivergenceFamily) : Prop :=
∀ (I J : Type) [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J], ∀ E : paperMat I →ₗ[ℂ] paperMat J,
paperCPTP E → ∀ r s : paperMat I, AxiomDomain r s → D J (E r) (E s) ≤ D I r s
example (r : paperMat I) (s : paperMat J) (i j : I) : paperDirectSum r s (.inl i) (.inl j) = r i j := rfl
example (r : paperMat I) (h : AxiomDomain r r) : r ≠ 0 := h.2.2.1
/-- Definition sanity: the exponential has the extended endpoint values. -/
example : expE ⊥ = 0 ∧ expE ⊤ = ⊤ := by simp [expE]
/-- Definition sanity: the zero matrix remains zero at support exponent zero. -/
example : paperPower (0:paperMat I) 0 = 0 := by simp [paperPower, cfc_zero]
/-- Definition sanity: zero radius around the zero center is outside the strict chapter domain. -/
example : ¬Radius (0:paperMat I) 0 := by simp [Radius]
/-- Definition sanity: the order transformation maps infinity to collision order two. -/
example : transformedOrder ⊤ = 2 := by simp [transformedOrder]
/-- Definition sanity: two zero subnormalized states have generalized fidelity one. -/
example : paperGeneralizedFidelity (0:paperMat I) 0 = 1 := by
simp [paperGeneralizedFidelity, rootFidelity, cfc_zero]
/-- Definition sanity: algebraic fidelity at zero gives extended max-entropy minus infinity. -/
example : hmax (0:paperMat (A × B)) = ⊥ := by
apply le_antisymm
· apply sSup_le
rintro h ⟨s, hs, rfl⟩
simp [paperLogE, paperFidelity, rootFidelity, cfc_zero]
· exact bot_le
/-- Definition sanity: a one-symbol source is decoded exactly by a one-symbol code. -/
example : paperCodeError (fun _ : Unit => (1:ℝ))
(⟨fun _ => 0, fun _ => ()⟩ : paperSourceCode Unit 1) = 0 := by
simp [paperCodeError]
end QAlgorithms.Papers.Independent.Intakenext100.P07
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P07.AdditiveDivergence
For an assignment taking pairs of complex square matrices on finite types with decidable equality to extended real numbers, this property says that for every pair of nonempty finite types with decidable equality, every positive semidefinite -indexed matrices , and every positive semidefinite -indexed matrices , if and , then
The tensor products are Kronecker products, and the sum on the right uses extended real addition. There is no trace normalization or support hypothesis; and are allowed to be zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.AxiomDomain
For square complex matrices indexed by a finite type , this predicate means exactly that and are positive semidefinite, , and , where the kernels are those of their actions on complex coordinate vectors. It imposes no trace normalization and does not require to be invertible; on an empty index type its requirement cannot hold.
QAlgorithms.Papers.Independent.Intakenext100.P07.CPTNI
For finite index types and a complex linear map from complex matrices indexed by to complex matrices indexed by , this predicate means that both of the following hold: for every natural number , including , and every positive semidefinite matrix indexed by , the matrix with entries is positive semidefinite; and for every positive semidefinite matrix indexed by , . The trace inequality applies to all positive semidefinite inputs, without a trace normalization requirement, and empty index types are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P07.ClassicalLeft
For index types and any complex matrix indexed by , this predicate means that, for every and , implies . Entries within each fixed -block are unrestricted, and no positivity or normalization is required. The condition is vacuous if is empty or has at most one element.
QAlgorithms.Papers.Independent.Intakenext100.P07.ClassicalXY
For index types and any complex matrix indexed by , this predicate means that, for every , , , and , the condition or implies . Entries with and are unrestricted, and no positivity or normalization is assumed. The condition is vacuous if any indexing factor is empty, or if both and have at most one element.
QAlgorithms.Papers.Independent.Intakenext100.P07.DPIOrder
For a Boolean and an extended nonnegative real , this predicate means when , and when . Thus the true branch includes and excludes , while the false branch includes and excludes ; both bounds are inclusive.
QAlgorithms.Papers.Independent.Intakenext100.P07.MeanCurvature
Let be a real-valued rule on pairs of square complex matrices for every finite index type with decidable equality, and let . This predicate says that for every such nonempty , every four positive semidefinite matrices on each having complex trace , with , , , and , and every real , both implications
hold. The endpoints are included. Continuity or monotonicity of is not itself required by this predicate; if is neither strictly increasing nor strictly decreasing, both implications hold vacuously.
QAlgorithms.Papers.Independent.Intakenext100.P07.MeasuredRepresentation
For an extended real-valued assignment on pairs of complex square matrices over finite types with decidable equality, and an order , this property says the following for every nonempty finite type with decidable equality and every positive semidefinite pair indexed by , with . Define , indexed by functions , by , and define similarly. For matrices , define as the extended real supremum, over all integers and all positive semidefinite families summing to the identity, of , where . Here is defined by the following formulas: is functional calculus for the function at and elsewhere; is functional calculus for the total real logarithm , with value at ; means ; and , otherwise. For , put ; set when , and otherwise; for , set when or , and otherwise. Take for finite positive , , and , using total real division and extended real arithmetic. The required conclusions are
in the topology of the extended reals, and, for every natural number , the supremum defining is attained by some finite measurement with a positive number of outcomes. The sequence is defined also at : the tensor products then have every entry equal to the empty product , and the real factor is . No normalization of is required.
QAlgorithms.Papers.Independent.Intakenext100.P07.MinDual
For finite index types with decidable equality, allowing either to be empty, and a complex matrix indexed by , this predicate means precisely that is positive semidefinite and
is positive semidefinite, where the partial trace is defined entrywise by
No trace normalization of is required. If is empty, the displayed partial trace is the zero matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.MinPrimal
For finite index types with decidable equality, allowing either to be empty, a complex matrix indexed by , and a complex matrix indexed by , this predicate means precisely that is positive semidefinite and
is positive semidefinite, where is the identity matrix and is the Kronecker product. It imposes no separate positivity or trace condition on and no trace bound on .
QAlgorithms.Papers.Independent.Intakenext100.P07.Radius
For a finite index type , an arbitrary complex matrix , and a real number , this defines the proposition
No positivity or normalization hypothesis is imposed on . The real square root is on nonpositive inputs, so this proposition cannot hold if , including when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.RealDataProcessing
For a real-valued rule on pairs of square complex matrices on every finite index type with decidable equality, this predicate says the following: for every pair of finite nonempty types with decidable equality, every complex linear map from matrices on to matrices on that is completely positive and preserves the complex trace of every matrix, and every pair of positive semidefinite matrices on satisfying and ,
Complete positivity here means that for every natural number , including , and every positive semidefinite matrix on , the matrix on whose -entry is
is positive semidefinite. The inputs need not have trace one.
QAlgorithms.Papers.Independent.Intakenext100.P07.RealDivergenceFamily
This is the type of rules that, for every type , every specified finite enumeration of , and every specified decidable equality on , take two square complex matrices indexed by and return a real number. Empty index types are included. No positivity, normalization, continuity, or other property of the rule or its matrix arguments is required by this abbreviation.
QAlgorithms.Papers.Independent.Intakenext100.P07.Resolution
For a finite index type with decidable equality, a natural number , and complex matrices indexed by , this predicate requires and for every , for every pair of distinct indices , and . Individual matrices may be zero. For , the requirement reduces to , which holds for empty and fails for nonempty .
QAlgorithms.Papers.Independent.Intakenext100.P07.SmoothPrimal
For finite index types with decidable equality, allowing empty types, complex matrices indexed by , a complex matrix indexed by , and every real , this predicate means that all four conditions hold:
and, additionally, is positive semidefinite, where
Here denotes the matrix product of and . No positivity or normalization of , trace bound on , or restriction on is imposed; enters only through , and an empty makes the partial trace zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.SpectralRep
For a finite index type with decidable equality, complex square matrices indexed by , and a real function , this predicate means precisely that for every , , , and
where denotes conjugate transpose and the real diagonal entries are regarded as complex numbers. No condition requires . Empty is allowed, in which case the entrywise condition is vacuous and all the displayed matrix equalities hold for the unique empty matrices.
QAlgorithms.Papers.Independent.Intakenext100.P07.UnitaryInvariantNorm
For a finite index type with decidable equality and a function , this predicate means that all four conditions hold: every matrix satisfies and if and only if ; every complex scalar and matrix satisfy ; every pair of matrices satisfies ; and every triple of matrices satisfying and satisfies , where denotes conjugate transpose and is the identity matrix. The index type is allowed to be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.alphaStar
For any finite index type with decidable equality, any complex matrices indexed by , and any real , this defines
Here means positive semidefinite, and the infimum is taken in the real numbers, with the convention that an empty set or a set unbounded below has infimum . There is no assumption that or is positive semidefinite or normalized, and is unrestricted; thus the feasible set can be empty. Empty is allowed and gives value , including when makes the feasible set empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.basisLaw
For a finite index type with decidable equality and arbitrary complex square matrices indexed by , this defines the diagonal complex matrix with
Here denotes conjugate transpose. No unitarity, positivity, or normalization requirement is imposed. Empty gives the unique empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.basisOverlap
For a finite index type and arbitrary complex square matrices indexed by , this defines
where denotes conjugate transpose and absolute value denotes complex modulus. When is nonempty, this is the maximum of these finitely many real numbers. When is empty, the real supremum convention used here gives . No unitarity requirement is imposed on either matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.classicalProcess
For index types , with finite and equality on decidable, a function , and a complex matrix indexed by , this defines a complex matrix indexed by whose entries are
No positivity, normalization, or block structure of is assumed. An empty fiber of contributes zero; in particular, if is empty, every output entry is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.codeCardinality
For every natural number and real number , this defines the natural-number ceiling . Negative and zero values of , and , are included. The value is one whenever or .
QAlgorithms.Papers.Independent.Intakenext100.P07.conditionalBlocks
For index types , with equality on decidable, and any family assigning a complex matrix indexed by to each , this defines a complex matrix indexed by through
No positivity, normalization, or weighting of the matrices is required. Empty index types are allowed; if is empty, the output matrix has an empty index type.
QAlgorithms.Papers.Independent.Intakenext100.P07.conditionalDown
Let be finite types with decidable equality, possibly empty, any complex matrix on , a Boolean, and . Define by . To specify the extended-real function used here, let be real functional calculus for the scalar function equal to at and to elsewhere; put for true , and for false . Write for , , otherwise, and let matrix logarithms use real functional calculus. Set if , and otherwise; for , set if or , and otherwise. Define ; define and ; and at finite positive , define . The declaration defines the value to be
All extrema and the final negation are extended-real. There is no positivity, normalization, or nonzero-trace requirement; real divisions and logarithms are total, with division by zero equal to .
QAlgorithms.Papers.Independent.Intakenext100.P07.conditionalUp
Let be finite types with decidable equality, possibly empty, any complex matrix on , a Boolean, and . Define by real functional calculus for the scalar function equal to at and to elsewhere, and set when is true, and otherwise. Write for , let , otherwise, and interpret matrix logarithms by real functional calculus. Define if , and otherwise; for , define if or , and otherwise. Define , , , and at finite positive . The declaration defines
This is an extended-real supremum, equal to if there is no such , in particular when is empty. No positivity, normalization, or nonzero-trace assumption is imposed on ; real division by zero is , and real powers and logarithms use their total real definitions.
QAlgorithms.Papers.Independent.Intakenext100.P07.conditionalVN
For finite index types with decidable equality and any complex matrix indexed by , this defines the real number , where and , with applied through the real continuous functional calculus. No positivity, Hermitianity, or trace normalization of is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P07.excessRadius
For a finite index type with decidable equality, including the empty type, arbitrary complex matrices , and every real , this defines
where is the real continuous functional calculus of , retaining the positive eigenvalues of Hermitian and returning zero for non-Hermitian . No positivity, normalization, or bound on is assumed. The real square root returns zero when its argument is negative, so the result is zero whenever , as well as at and .
QAlgorithms.Papers.Independent.Intakenext100.P07.expE
For every extended real number , is an extended nonnegative real number. It equals if , equals if , and otherwise equals , regarded as an extended nonnegative real, where is the finite real value of .
QAlgorithms.Papers.Independent.Intakenext100.P07.guessObjective
For finite index types and , and arbitrary families , the guessing objective is the real number
There are no positivity, normalization, or measurement assumptions on either family. If is empty, the sum is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.hartleyConditional
For finite index types with decidable equality and an arbitrary complex matrix indexed by , define by functional calculus, where and for every nonzero real . The conditional Hartley quantity is the supremum in the extended real line of
where and , interpreted using the total real logarithm, for . No positivity or normalization condition is imposed on ; is allowed and contributes .
QAlgorithms.Papers.Independent.Intakenext100.P07.hatState
For a finite index type and any complex matrix indexed by , this definition gives a matrix indexed by the disjoint union of and a singleton, with block form
The lower-right entry is regarded as a complex number with zero imaginary part. There is no positivity or trace assumption on ; if is empty, the resulting matrix is the matrix with entry .
QAlgorithms.Papers.Independent.Intakenext100.P07.hmax
For finite index types with decidable equality and any complex matrix indexed by , this defines
in the extended reals, where is the total real continuous functional calculus for , and if , while , embedded into the extended reals, otherwise. No positivity or normalization assumption is imposed on . The witness is permitted and contributes ; empty index types are allowed, and the supremum may take an infinite value.
QAlgorithms.Papers.Independent.Intakenext100.P07.iidLaw
For any type , any function , and any natural number , this defines the function on tuples whose value is . No finiteness, nonnegativity, or normalization assumption on or is required. At , the unique empty tuple has value one.
QAlgorithms.Papers.Independent.Intakenext100.P07.introSmoothMax
For a finite type , any function , and any real , this defines the real infimum of over all functions satisfying for every , , and . There is no probability assumption on and no restriction on . If no such exists—including when is empty or —the real infimum of the empty set has the defined value zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.inverseChoi
For a finite index type , an index type , any complex matrix indexed by , and any complex matrix indexed by , this definition gives the matrix on with entries
No conjugation of occurs. If is empty, the resulting matrix is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.matrixLog
For a finite index type with decidable equality and any complex matrix indexed by , applies the real continuous functional calculus to the total real function . For Hermitian , an eigenvalue is replaced by , and a zero eigenvalue is replaced by zero; for non-Hermitian , the result is the zero matrix. Empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P07.maxD
For a finite index type with decidable equality, including the empty type, and arbitrary complex matrices , this defines an extended real number by
where the real numbers in the set are embedded into the extended reals. No positivity or normalization of or is assumed. The infimum is if the set is empty and if it is unbounded below; for empty , every real is admissible, so the value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.maxRate
For finite index types with decidable equality, any complex matrix indexed by , any real , and any natural number , put , , and . This defines the extended real number , where consists of matrices indexed by satisfying and . Here , using the real continuous functional calculus for matrix square roots, and , where is indexed by , , and for , regarded as an extended real. No positivity or normalization of , restriction on , or positivity of is assumed; an empty infimum is , and at the real reciprocal is , so the rate is .
QAlgorithms.Papers.Independent.Intakenext100.P07.measureOutput
For a finite index type with decidable equality, any natural number , any family of complex matrices on indexed by , and any complex matrix on , this definition produces the matrix on whose entries are
The diagonal uses the full complex trace, without taking its real part. There are no positivity, normalization, or measurement hypotheses on or ; is allowed and gives the matrix with empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P07.measuredRenyi
For a finite type with decidable equality, arbitrary complex square matrices indexed by , and an order , this defines
with supremum in the extended reals. To specify literally, let be real functional calculus for the function equal to at and elsewhere, let be real functional calculus for the total real logarithm , with , and put . Write for , and let , otherwise. For , define
Then for finite positive , , and . These formulas use total functional calculus and total real division, including division by zero, and extended real arithmetic after applying . In particular, the measurement outputs above retain the full complex traces as diagonal entries; no positivity or normalization of is assumed. The index type may be empty, and an empty set of attained values has extended real supremum .
QAlgorithms.Papers.Independent.Intakenext100.P07.minRate
For finite index types with decidable equality, any complex matrix indexed by , any real , and any natural number , put , , and . This defines the extended real number , where consists of matrices indexed by such that is positive semidefinite, , and ; here , with matrix square roots taken through the real continuous functional calculus. For such , , where is indexed by and the supremum is taken in the extended reals. There are no positivity or normalization assumptions on , no restriction on , and no requirement that ; an empty supremum is , and at the real reciprocal is defined as , so the rate is .
QAlgorithms.Papers.Independent.Intakenext100.P07.optimalCardinality
For a finite type with decidable equality, an arbitrary real-valued function , and an arbitrary real number , this defines the natural number
Thus, when the set is nonempty, the value is its least element; when it is empty, the natural-number infimum is . The definition does not require to be nonnegative or to sum to , does not restrict , and does not require either coding function to be injective or surjective.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperAdjointAction
For finite index types , with decidable equality on , any complex-linear map , and any complex matrix indexed by , this definition gives the matrix on with entries
where has entry at and elsewhere. If is empty, the resulting matrix is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperBall
For any finite index type with decidable equality, arbitrary matrix , and real number , this defines the set of all matrices such that is positive semidefinite, , and
where denotes the total real continuous functional calculus for , and scalar square roots of negative numbers are . No positivity or normalization condition is imposed on the center , and no restriction on is assumed. The set is empty when ; empty index types are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperBasisMeasurement
For finite index types with decidable equality, any complex square matrix indexed by , and any complex square matrix indexed by , put , so . This defines the matrix by
No unitarity of or positivity or trace condition on is required. If either index type is empty, the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperBelow
For a finite index type and complex matrices indexed by , means that is positive semidefinite. Empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperBetaStar
For any finite index type with decidable equality, any complex matrices indexed by , and any real , this defines
Here the infimum is a real infimum, assigned value when the feasible set is empty or the objective values are unbounded below. Neither nor is required to be positive semidefinite or normalized, and may be any real number. Empty is allowed and gives value , including when makes the feasible set empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperCPTP
For finite index types and a complex linear map from complex matrices indexed by to complex matrices indexed by , this predicate means that, for every natural number , including , and every positive semidefinite matrix indexed by , the matrix is positive semidefinite, and that for every complex matrix indexed by . This is equality of complex traces for all inputs, with no positivity or normalization restriction on ; empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperChoi
For finite index types , with decidable equality on , and any complex-linear map , this definition gives the complex matrix indexed by whose entries are
for every and , where is the matrix with entry at and elsewhere. No normalization factor or positivity assumption is included; either index type may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperClassicalAgreement
For an assignment taking pairs of complex square matrices on each finite type with decidable equality to extended real numbers, and an order , this property requires the following for every nonempty finite type with decidable equality and every pair of functions : if for all and is not identically zero, then , where the extended real quantity is specified as follows. Set if , and otherwise; put , and write for the condition for every . Let and otherwise. For real , set
Here the real logarithm at in the first line is , and the third line uses extended real multiplication. For , ; ; and . Neither nor is required to sum to , and may be identically zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperClassicalRenyi
For a finite type , any function , and any real , this defines , using the total real power, logarithm, and division operations. No probability or positivity assumption is imposed on , and no order is excluded. In particular, the value at is zero because division by zero is defined as zero; an empty also gives zero because .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperCodeError
For a finite type , any real-valued function on , any natural number , and encoding and decoding functions and , this defines the real number . Neither nonnegativity nor normalization of is assumed, and reconstruction need not succeed anywhere. The sum is zero when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperConditional
Let be finite types with decidable equality, possibly empty, any complex matrix on , Booleans, and . Write . For real , let be real functional calculus for the function equal to at and elsewhere. Put for true , and for false . Let mean , let and otherwise, and use real functional calculus for matrix logarithms. Define when , and otherwise; for , define when or , and otherwise. Define , , , and for finite positive . The declaration defines
All extrema and entropy arithmetic are extended-real, so the first branch is when its feasible set is empty. There are no positivity or normalization assumptions on ; real division by zero equals , and real powers and logarithms are total.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperCqState
For index types , with equality on decidable, and an arbitrary family , the associated complex matrix on is defined by
Thus its blocks indexed by distinct elements of vanish, and its block indexed by is . No positivity, trace, or normalization condition is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperDataProcessing
For an assignment taking pairs of complex square matrices on finite types with decidable equality to extended real numbers, this property requires that for every pair of nonempty finite types with decidable equality and every complex linear map from -indexed matrices to -indexed matrices, if preserves the complex trace of every matrix and is completely positive in the explicit sense that, for every natural number , including , and every positive semidefinite matrix indexed by , the matrix indexed by with entries
is positive semidefinite, then every pair of positive semidefinite -indexed matrices with satisfies
No trace normalization or support relation is required, and is included.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperDelta
For a finite index type with decidable equality and any complex matrices indexed by , is the real supremum , where the absolute value is the complex modulus and is the identity matrix. Empty index types are included, in which case the value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperDirectSum
For index types and square complex matrices on and on , this defines the square matrix on the disjoint union : its block is , its block is , and both mixed blocks are zero. No finiteness, nonemptiness, positivity, or normalization condition is imposed; either index type may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperDivergenceFamily
This structure consists of one assignment that, for every type equipped with a finite enumeration and decidable equality, takes two complex square matrices indexed by and returns an extended real number in . Empty index types are included. The structure imposes no positivity, normalization, continuity, or other condition on either the matrices or the assignment.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperEntangled
For every finite index type with decidable equality, this definition gives a complex matrix indexed by , with entries
Here the reciprocal is taken in . When is nonempty, this is . The empty index type is also permitted: its reciprocal scalar is defined as , and the resulting matrix has no entries.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperFidelity
For any finite index type with decidable equality and arbitrary complex matrices , this defines the real number
where is the total real continuous functional calculus of for the function . No positivity, Hermitian, trace, or normalization hypothesis is imposed on either matrix. Scalar real square roots take value on negative inputs, and the empty index type is allowed.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperGeneralizedFidelity
For any finite index type with decidable equality and arbitrary complex matrices , this defines
where denotes the total real continuous functional calculus for . There are no positivity or trace restrictions on ; in particular, the product inside the scalar square root may be negative, in which case that square root is . The index type may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperHmin
For finite index types , with decidable equality on for its identity matrix, and any complex matrix indexed by , this defines an extended real number as
where each real is embedded into the extended reals and means positive semidefinite. The witness may be zero, and has no positivity or normalization hypothesis. The supremum is if there are no witnesses and may be ; in particular, makes every real feasible. Empty index types are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperIndependentProduct
For arbitrary index types , a complex matrix indexed by , and a complex matrix indexed by , this defines a complex matrix indexed by through
There are no positivity, trace, or nonemptiness requirements on these inputs.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperJointPower
For index types , any complex matrix indexed by , and any natural number , this defines a matrix indexed by pairs of functions , where and , whose entries are . No conditions on are imposed. The case is included: both function spaces are singletons, and the resulting matrix has its sole entry equal to the empty product , even if or is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperLocalEmbedding
For finite input index types , output index types , complex matrices with rows indexed by and columns by , with rows indexed by and columns by , and any complex matrix indexed by , this defines the matrix , indexed by , where and denotes conjugate transpose. Neither nor is required to be an isometry, and no positivity or normalization condition is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperLogE
For every real number , is an extended real number: it equals when , and otherwise equals the finite real value under the total real logarithm convention. In particular, for negative , this finite value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperMarginalBC
For a finite index type , arbitrary index types , and any complex matrix indexed by , this defines a matrix indexed by with entries
No positivity, Hermitian, or normalization assumption is imposed. If is empty, the resulting matrix is zero; empty or is also allowed.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperMat
For any index type , denotes the type of complex matrices whose rows and columns are both indexed by , equivalently functions . The index type may be empty or infinite.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperMaxFamily
This defines an extended real-valued assignment on pairs of complex square matrices over every finite type with decidable equality by
where the infimum is taken in the extended reals after embedding each real . An empty set therefore gives , and a set unbounded below gives . The definition includes empty index types and imposes no positivity or normalization assumptions on or .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperMeasuredJoint
For an index type with decidable equality, a finite index type , and arbitrary families , the measured joint matrix is the complex matrix indexed by whose diagonal entry at is the real number , embedded in , and whose off-diagonal entries are zero. Neither positivity nor normalization is assumed, so the definition does not require these diagonal entries to form a probability distribution.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperMix
For any index type , any real number , and any two complex matrices indexed by , this defines the matrix , with the real coefficients regarded as complex scalars. There is no requirement that , and neither matrix is required to be positive semidefinite or normalized.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperNsP
For a finite index type , any real function , and arbitrary complex square matrices indexed by , this defines the real function on given by
Here denotes conjugate transpose and absolute value denotes complex modulus. Neither nonnegativity or normalization of nor unitarity of is required. If is empty, this is the unique function on the empty domain.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperNsQ
For a finite index type , any real function , and arbitrary complex square matrices indexed by , this defines the real function on given by
Here denotes conjugate transpose and absolute value denotes complex modulus. Neither nonnegativity or normalization of nor unitarity of is required. If is empty, this is the unique function on the empty domain.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperPenalty
For every real number , this defines the real number
using the total real square root and logarithm: the square root of a negative real number is zero, and . There is no restriction on ; the value is zero when and also whenever .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperPinch
For a finite index type with decidable equality and arbitrary complex square matrices indexed by , this defines
where is the set of distinct eigenvalues of when is Hermitian, is when is non-Hermitian and is nonempty, and is empty when is empty; is the real continuous functional calculus of for the function equal to at and elsewhere. For Hermitian , these are its eigenspace projections; for non-Hermitian , they are zero, so the result is zero. An empty index type also gives the empty sum, hence zero. No positivity or trace requirement is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperPositivePart
For a finite index type with decidable equality, including the empty type, and every complex matrix , this defines by applying the real continuous functional calculus to the function . Thus, for Hermitian , it retains each positive eigenvalue and replaces each nonpositive eigenvalue by zero; for non-Hermitian , this functional calculus returns the zero matrix. No Hermitian or positivity hypothesis is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperPower
For a finite index type with decidable equality, a complex matrix indexed by , and any real number , applies the real continuous functional calculus to the scalar function defined by and for , using the total real power convention. Thus, for Hermitian , it applies to each eigenvalue; for non-Hermitian , this functional calculus returns the zero matrix. All real exponents are allowed, including zero and negative exponents; a zero eigenvalue is always sent to zero, even when . Empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperProbability
For a finite index type and a real function , this predicate means that for every and . If is empty, the sum is zero, so no function satisfies the predicate.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperPure
For a finite index type and a complex matrix indexed by , means that is positive semidefinite and has rank exactly . There is no trace normalization condition. For an empty index type, this condition cannot hold.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperQuadratic
For a finite index type , any complex matrix indexed by , and any function , this definition gives the complex number
Neither Hermiticity of nor normalization of is assumed, and the result is not restricted to its real part. If is empty, the value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperRegroup
For arbitrary index types and any complex matrix indexed by , this defines a matrix indexed by by the entrywise rule
There are no finiteness, nonemptiness, positivity, or normalization hypotheses; the definition changes the grouping of the indices.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperRelativeD
For a finite index type with decidable equality, including the empty type, and arbitrary complex matrices , this defines
where the quotient in the first branch is embedded into the extended reals and is the real continuous functional calculus of the total base-two logarithm. For Hermitian , this replaces a nonzero eigenvalue by and a zero eigenvalue by zero; for non-Hermitian , it returns zero. No positivity or normalization is assumed. Division by zero in the first branch gives zero, so that branch returns zero whenever .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperRenyi
Let be any finite type with decidable equality, arbitrary complex matrices on , a Boolean, and . For real , let be real functional calculus for at and elsewhere, and define as when is true, and as otherwise. Write for , let denote real functional calculus, and let , otherwise. Define to be if , and otherwise; for , define if or , and otherwise. Also put , as an extended-real infimum. The declaration defines
The endpoint extrema range over every positive real , including . All indicated entropy arithmetic is extended-real; no positivity or normalization assumptions are made, empty index types and zero traces are permitted, and real division by zero is .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperRenyiQ
For a finite type with decidable equality, arbitrary complex square matrices indexed by , a Boolean , and any real , define by real functional calculus applied to the function that is at and at every nonzero real . The declaration defines the real number
There are no positivity, normalization, nonzero-matrix, or restrictions on . In particular, and are included; division by zero uses the total real operation and gives , and the scalar function defining still takes value at . The index type may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperRenyiReal
For any finite index type with decidable equality, any Boolean , any complex matrices indexed by , and any real , this defines the real value obtained from the following extended-real expression, sending either or to . Write for the continuous functional calculus of with the real function equal to at and to otherwise, write for the continuous functional calculus with , and let mean . Define
With and as an embedded real otherwise, the extended-real expression is
Thus . There are no positivity, nonzero, normalization, nonemptiness, or parameter-range assumptions: in particular , negative , and zero trace are included, with real division by zero equal to and the supplied total functional-calculus, logarithm, and real-power operations used throughout.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSchatten
For a finite index type with decidable equality, any complex matrix indexed by , and any real number , let , using the positive semidefinite matrix square root, and let be obtained by replacing each zero eigenvalue of by zero and each nonzero eigenvalue by . Then is the real number , with total real division and exponentiation. There is no restriction on ; in particular, at , the exponent is zero and the result is , including for the zero matrix and for an empty index type.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSeparable
For finite index types and a complex square matrix indexed by , this predicate means that there exist a natural number , real weights , complex square matrices indexed by , and complex square matrices indexed by , such that every , , every is positive semidefinite with complex trace equal to , and
The quantified includes zero, but zero cannot satisfy the weight-sum condition. Zero weights are allowed. If either or is empty, the required trace-one factor matrices cannot exist.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperShannon
For a finite type and any function , this defines . No nonnegativity or normalization condition is imposed. The logarithm is the total real logarithm, with , so zero entries contribute zero; an empty gives zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSixAxioms
For a rule returning a real number for each pair of square complex matrices on each finite index type with decidable equality, and a function , this predicate is the conjunction of the following requirements. Define . The function is continuous and is either strictly increasing or strictly decreasing; for every finite nonempty with decidable equality, is continuous on ; for every two such types , every , and every complex matrix with rows indexed by and columns by satisfying both and ,
on the singleton index type, ; for every such and , positive semidefiniteness of implies , and positive semidefiniteness of implies ; for every such , , and ,
and
Here is the conjugate transpose, is the Kronecker product, and puts its arguments in the two diagonal blocks on the disjoint union and puts zero in the mixed blocks. These requirements do not restrict the matrices to trace one, and the stated continuity, invariance, ordering, and composition requirements quantify only over nonempty index types.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSmoothMax
For finite index types with decidable equality, any complex matrix indexed by , and any real , let denote the total real continuous functional calculus for , and let consist of all matrices with satisfying
This defines the extended real number
where and , embedded into the extended reals, for . Scalar square roots of negative inputs are , zero witnesses are permitted, and no positivity condition on or restriction on is imposed. Empty index types are allowed. An infimum over empty is ; in particular, this occurs when .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSmoothMin
For finite index types with decidable equality, any complex matrix indexed by , and any real , let denote the total real continuous functional calculus for , and let be the set of matrices with satisfying
This defines the extended real number
with real values embedded into the extended reals. Scalar square roots of negative inputs are . Neither positivity of nor a restriction on is assumed, and empty index types are allowed. Each empty supremum is ; in particular, makes empty and the defined value .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSourceCode
For any type and natural number , this structure consists of two functions: an encoding function and a decoding function . No inverse or reconstruction condition is required. The case is included, and such a structure can then exist only when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSpectralProjector
For a finite index type with decidable equality, any complex square matrix indexed by , and any real number , this defines using real continuous functional calculus, where if , and otherwise. For Hermitian , this is the orthogonal projection onto its -eigenspace, including the zero projection when is not an eigenvalue. For non-Hermitian , this functional-calculus expression is defined to be zero; an empty gives the unique empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSubnormalized
For a finite index type and a complex matrix indexed by , means that is positive semidefinite and . Zero matrices are included; for an empty index type, the unique matrix satisfies this condition.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSupported
For a finite index type and complex matrices indexed by , means , where the kernels are those of matrix multiplication on vectors . Thus every vector annihilated by must also be annihilated by . This includes the empty index type.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperSymmetricError
For any finite index type with decidable equality and any complex matrices indexed by , this defines
No positivity or normalization assumptions are imposed on or . The infimum is taken in , whose infimum convention assigns to an empty set or a set unbounded below; here the feasible set contains . Empty is permitted and gives value .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperTensorAction
For finite index types with decidable equality, output index types , complex linear maps and , and any complex matrix indexed by , this defines a matrix indexed by whose entries are , where is the matrix with entry at and elsewhere. No positivity or trace preservation is required of either map, and is unrestricted; if either input index type is empty, the sums are empty and the result is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperTensorPower
For any index type , any complex matrix indexed by , and any natural number , this defines a matrix indexed by functions , with entries . No positivity or normalization is required. When , the indexing function space is a singleton and the matrix has sole entry , including when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperTraceMiddle
For arbitrary index types , a finite index type , and any complex matrix indexed by , this defines a complex matrix indexed by whose entries are
No positivity, Hermitian, or normalization condition is required. If is empty, the sum is , so the resulting matrix is zero; and may also be empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.paperTypeI
For any finite index type with decidable equality and any complex matrices indexed by , this defines
where is the identity matrix. No positivity, normalization, or bound on either matrix is assumed. The index type may be empty, in which case the value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperTypeII
For any finite index type with decidable equality and any complex matrices indexed by , this defines
No positivity, normalization, or bound on either matrix is assumed. The index type may be empty, in which case the value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.paperVariance
For a finite index type with decidable equality, including the empty type, and arbitrary complex matrices , this defines
Here is the identity matrix, and applies the total real base-two logarithm by continuous functional calculus: on Hermitian matrices it sends nonzero eigenvalues to and zero eigenvalues to zero, while on non-Hermitian matrices it returns zero. If , then
otherwise , because conversion of the extended real value to a real number gives zero. Real division by zero also gives zero. No positivity or normalization of either matrix is assumed, and the square is matrix multiplication of the centered expression by itself.
QAlgorithms.Papers.Independent.Intakenext100.P07.petzExtendedQ
For a finite index type with decidable equality, arbitrary complex matrices indexed by , and any real , this defines an extended-real value equal to when and , and otherwise equal to , embedded into the extended reals. Here is the continuous functional calculus with the real function taking value zero at zero and at every nonzero . No positivity, normalization, or nonemptiness assumption is imposed; in particular, uses the second branch, and still has value zero on the zero spectral value.
QAlgorithms.Papers.Independent.Intakenext100.P07.positiveNorm
For a finite index type with decidable equality and any complex matrix indexed by , is the real supremum , where the absolute value is the complex modulus and is the identity matrix. The supremum ranges over all such complex matrices . For an empty index type, its value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P07.preparedEntangled
For finite index types , with decidable equality on , and any complex-linear map , this definition gives a matrix on by applying to the second matrix factor of the matrix on whose -entry is when and , and otherwise, and then exchanging the two output factors. Explicitly, for all and ,
where has a single entry at . No positivity or trace-preservation assumption is imposed on ; if either index type is empty, the output matrix has no entries.
QAlgorithms.Papers.Independent.Intakenext100.P07.productState
For every natural number , index type , and family of arbitrary complex matrices indexed by , this definition gives a matrix indexed by functions , with entries
for every pair of such functions . No positivity or normalization is assumed. For , the function index type has one element and the empty product makes the matrix with entry , including when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P07.purified
For any finite index type with decidable equality and arbitrary complex matrices , this defines
where is the total real continuous functional calculus for the real square-root function. Neither matrix is assumed positive or normalized, and the index type may be empty. Every scalar real square root is when its argument is negative; thus the outer square root is also if the squared expression exceeds .
QAlgorithms.Papers.Independent.Intakenext100.P07.renyiFinite
For a finite type with decidable equality, arbitrary complex matrices on , a Boolean , and any real , let be real functional calculus for the scalar function when , and otherwise, and put
Write for , define by real functional calculus, and set when holds, and otherwise. With and for nonzero real , the declaration defines
The product in the middle branch is extended-real multiplication after embedding . No positivity, normalization, or nonzero-trace hypotheses are imposed; an empty , , and zero denominators are allowed, with real division by zero equal to and the real logarithm interpreted as its total real function.
QAlgorithms.Papers.Independent.Intakenext100.P07.resolutionPinch
For a finite index type , any natural number , any family of complex matrices indexed by , and any complex matrix indexed by , this defines . No Hermitian, idempotence, orthogonality, or sum-to-identity condition is assumed on the family. When , the result is the zero matrix.
QAlgorithms.Papers.Independent.Intakenext100.P07.sdpDual
For finite index types , with decidable equality on , any complex-linear map , and arbitrary complex matrices on and on , this definition gives the extended-real value
where has a single entry at , and means positive semidefinite. Each real objective value is embedded into the extended reals; an empty feasible set gives , and objective values unbounded above give . Empty index types are permitted.
QAlgorithms.Papers.Independent.Intakenext100.P07.sdpPrimal
For finite index types , any complex-linear map , and arbitrary complex matrices on and on , this definition gives the extended-real value
where means positive semidefinite and each real objective value is embedded into the extended reals. An empty feasible set gives , and objective values unbounded below give . Empty index types are permitted.
QAlgorithms.Papers.Independent.Intakenext100.P07.smoothMaxD
For a finite index type with decidable equality, including the empty type, arbitrary complex matrices , and every real , this defines
with both infima taken in the extended reals, where
Here is the real continuous functional calculus of : on a Hermitian matrix it replaces each eigenvalue by , and on a non-Hermitian matrix it is zero. All real square roots return zero on negative arguments. No positivity or trace condition is imposed on or . An empty outer admissible set gives ; in particular, this occurs for .
QAlgorithms.Papers.Independent.Intakenext100.P07.spectralValues
For a finite index type with decidable equality and any complex square matrix indexed by , this defines the finite set of values in the following list: if is Hermitian, its eigenvalues in ascending order, counted with multiplicity; otherwise, a list of zeros. Taking the set removes repetitions. Thus the result is empty when is empty, and is when is nonempty and is not Hermitian.
QAlgorithms.Papers.Independent.Intakenext100.P07.transformedOrder
For every extended nonnegative real , this definition returns when , and otherwise returns the extended nonnegative real obtained by truncating below at , where is the real value of finite . Explicitly,
Real division by zero is , so ; for , the value is .
QAlgorithms.Papers.Independent.Intakenext100.P07.variation
For a finite type and arbitrary functions , this defines . Neither function is required to be nonnegative or normalized. If is empty, the value is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.