Definitions for Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
DefinitionQAlgorithms_Papers_Independent_Support50_P19The objects the formalized statements of Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy (arXiv:1306.1586) are stated in. Each was checked against the paper by a blind read-back and a moderator.
classicalRenyiBits: PDF p.12: unnormalized classical Renyi divergence in bits, for alpha>1. Dependency50.P28.classicalD uses natural logs and a different order interface; its value cannot be substituted here. Test support before a negative power.filtered: PDF p.7, Remark 1: the positive filter is not normalized.renyiD: PDF pp.17,19: true selects sandwiched and false selects traditional Petz entropy.renyiEnsembleInformation: PDF p.17, Definition 12: Renyi cq information, before using the block formula. Dependency50.P07.ensembleInformation instead denotes ordinary Holevo information.channelInformation: PDF p.17, Definition 12: supremum over all finite mixed-state input ensembles.fixedRadius: PDF p.24, Definition 21: fixed-center radius, permitting infinite radius.informationRadius: PDF p.17, Definition 13: minimize over output states AFTER maximizing over inputs.blockInformation: PDF p.17, (14): zero-weight unsupported blocks contribute zero in ENNReal.InformationExtrema: PDF pp.17–19: witnesses for the maxima and minima in Definitions 12 and 13. The semantic extrema are not replaced by unattained suprema or infima.outputWeightedNorm: PDF p.19: alpha-norm of a positive output with weight sigma^((1-alpha)/alpha). On the compatible support domain this is the weighted Schatten norm in the source.CompatibleCenter: PDF pp.19,25: admissible centers for the FINITE weighted-norm expression. Singular centers containing every output support are included.normRadiusBefore: PDF p.19, (16): min max log norm, with the inverse-support domain explicit.normRadiusAfter: PDF p.19, (16): min log max norm; finite-dimensional compatible centers give nonempty bounded norm sets, with positive supremum on channels.NormExtrema: PDF p.19: attainment of the finite-domain norm minima and maxima in (16).expTwo: PDF pp.20,25: base-two exponential on extended reals, retaining BOTH endpoints.codingBound: PDF p.20, (17): success upper bound at one specified normalized radius.renyiNu: PDF p.22: the Renyi comparison constant nu in (20), expressed without converting possibly infinite divergences. Claimed50.P48.nu is an output norm, not this two-state constant. On supported states, these traces are 2^(D_3/2 / 2) and 2^(-D_1/2 / 2).CenterControl: PDF p.22: an attained ordinary information-radius center and a uniform finite renyiNu bound. These are witnesses in the conclusions below, never assumed approximation theorems.ExponentialAt: PDF p.24: exponential strong-converse THRESHOLD, without identifying it with capacity.InteriorEB: PDF p.25: interior relative to the finite-dimensional affine TP/HP map space. Entrywise coefficient balls give its usual topology; no CP constraint is placed on candidate perturbations before testing membership in the EB-channel set.InteriorHadamard: PDF p.25: the EB interior condition is on a complement of this SAME channel.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_MatrixMapPositivity
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P09
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P56
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P27
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P48
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P35
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P26
/-! Wilde–Winter–Yang, arXiv:1306.1586v4. All citations are PDF pages; logs are in bits.
The imported paper modules are pinned accepted libraries. In particular, their spectral
calculus, physical codes, tensor channels, and covariance interface are reused. The
unnormalized divergences of Dependency50.P09 and Q of Information100.P56 implement
Definition 4; the trace-normalized divergence of Dependency50.P35 is not substituted.
All new definitions below are local to this paper. Compilation is pending batch handoff. -/
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
/-- PDF p.12: unnormalized classical Renyi divergence in bits, for alpha>1.
Dependency50.P28.classicalD uses natural logs and a different order interface;
its value cannot be substituted here. Test support before a negative power. -/
def classicalRenyiBits {I : Type} [Fintype I]
(a : ℝ) (p q : I → ℝ) : EReal :=
if ∀ i, q i = 0 → p i = 0 then
((1 / (a - 1) : ℝ) : EReal) *
elog (∑ i, if p i = 0 then 0 else p i ^ a * q i ^ (1 - a))
else ⊤
/-- PDF p.7, Remark 1: the positive filter is not normalized. -/
def filtered {I J : Type} [Fintype J] (Y : Matrix J J ℂ) (N : Superop I J) : Superop I J :=
fun X => Y * N X * Y
/-- PDF pp.17,19: true selects sandwiched and false selects traditional Petz entropy. -/
def renyiD {I : Type} [Fintype I] [DecidableEq I]
(sandwiched : Bool) (a : ℝ) (A B : Matrix I I ℂ) : EReal :=
if sandwiched then sandwichedD a A B else petzD a A B
/-- PDF p.17, Definition 12: Renyi cq information, before using the block formula.
Dependency50.P07.ensembleInformation instead denotes ordinary Holevo information. -/
def renyiEnsembleInformation {I : Type} [Fintype I] [DecidableEq I] {m : ℕ}
(s : Bool) (a : ℝ) (p : Fin m → ℝ) (rho : Fin m → Matrix I I ℂ) : EReal :=
⨅ sigma : {X : Matrix I I ℂ // IsDensityMatrix X}, renyiD s a (cq p rho) (cq p (fun _ => sigma.1))
/-- PDF p.17, Definition 12: supremum over all finite mixed-state input ensembles. -/
def channelInformation {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(s : Bool) (a : ℝ) (N : Superop I J) : EReal :=
⨆ e : Ensemble I, renyiEnsembleInformation s a e.prob (fun x => N (e.state x))
/-- PDF p.24, Definition 21: fixed-center radius, permitting infinite radius. -/
def fixedRadius {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(s : Bool) (a : ℝ) (N : Superop I J) (sigma : Matrix J J ℂ) : EReal :=
⨆ rho : {X : Matrix I I ℂ // IsDensityMatrix X}, renyiD s a (N rho.1) sigma
/-- PDF p.17, Definition 13: minimize over output states AFTER maximizing over inputs. -/
def informationRadius {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(s : Bool) (a : ℝ) (N : Superop I J) : EReal :=
⨅ sigma : {X : Matrix J J ℂ // IsDensityMatrix X}, fixedRadius s a N sigma.1
/-- PDF p.17, (14): zero-weight unsupported blocks contribute zero in ENNReal. -/
def blockInformation {I : Type} [Fintype I] [DecidableEq I] {m : ℕ}
(a : ℝ) (p : Fin m → ℝ) (rho : Fin m → Matrix I I ℂ) : EReal :=
⨅ sigma : {X : Matrix I I ℂ // IsDensityMatrix X}, ((1 / (a - 1) : ℝ) : EReal) *
elogNN (∑ x, ENNReal.ofReal (p x) * sandwichedTrace a (rho x) sigma.1)
/-- PDF pp.17–19: witnesses for the maxima and minima in Definitions 12 and 13.
The semantic extrema are not replaced by unattained suprema or infima. -/
def InformationExtrema {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(s : Bool) (a : ℝ) (N : Superop I J) : Prop :=
(∃ e : Ensemble I, channelInformation s a N =
renyiEnsembleInformation s a e.prob (fun x => N (e.state x))) ∧
(∃ sigma : {X : Matrix J J ℂ // IsDensityMatrix X}, informationRadius s a N = fixedRadius s a N sigma.1) ∧
(∀ sigma : {X : Matrix J J ℂ // IsDensityMatrix X}, ∃ rho : {X : Matrix I I ℂ // IsDensityMatrix X},
fixedRadius s a N sigma.1 = renyiD s a (N rho.1) sigma.1)
/-- PDF p.19: alpha-norm of a positive output with weight sigma^((1-alpha)/alpha).
On the compatible support domain this is the weighted Schatten norm in the source. -/
def outputWeightedNorm {I : Type} [Fintype I] [DecidableEq I]
(a : ℝ) (A sigma : Matrix I I ℂ) : ℝ :=
(rawTrace a A sigma) ^ (1 / a)
/-- PDF pp.19,25: admissible centers for the FINITE weighted-norm expression.
Singular centers containing every output support are included. -/
def CompatibleCenter {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(N : Superop I J) (sigma : Matrix J J ℂ) : Prop :=
IsDensityMatrix sigma ∧ ∀ rho : {X : Matrix I I ℂ // IsDensityMatrix X}, Dominates sigma (N rho.1)
/-- PDF p.19, (16): min max log norm, with the inverse-support domain explicit. -/
def normRadiusBefore {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(a : ℝ) (N : Superop I J) : EReal :=
⨅ sigma : {S : Matrix J J ℂ // CompatibleCenter N S},
⨆ rho : {X : Matrix I I ℂ // IsDensityMatrix X}, ((a / (a - 1) : ℝ) : EReal) *
elog (outputWeightedNorm a (N rho.1) sigma.1)
/-- PDF p.19, (16): min log max norm; finite-dimensional compatible centers give
nonempty bounded norm sets, with positive supremum on channels. -/
def normRadiusAfter {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(a : ℝ) (N : Superop I J) : EReal :=
⨅ sigma : {S : Matrix J J ℂ // CompatibleCenter N S},
((a / (a - 1) : ℝ) : EReal) *
elog (sSup (Set.range (fun rho : {X : Matrix I I ℂ // IsDensityMatrix X} => outputWeightedNorm a (N rho.1) sigma.1)))
/-- PDF p.19: attainment of the finite-domain norm minima and maxima in (16). -/
def NormExtrema {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(a : ℝ) (N : Superop I J) : Prop :=
(∃ sigma : {S : Matrix J J ℂ // CompatibleCenter N S},
normRadiusAfter a N = ((a / (a - 1) : ℝ) : EReal) *
elog (sSup (Set.range (fun rho : {X : Matrix I I ℂ // IsDensityMatrix X} => outputWeightedNorm a (N rho.1) sigma.1)))) ∧
(∀ sigma : {S : Matrix J J ℂ // CompatibleCenter N S}, ∃ rho : {X : Matrix I I ℂ // IsDensityMatrix X},
sSup (Set.range (fun r : {X : Matrix I I ℂ // IsDensityMatrix X} => outputWeightedNorm a (N r.1) sigma.1)) =
outputWeightedNorm a (N rho.1) sigma.1)
/-- PDF pp.20,25: base-two exponential on extended reals, retaining BOTH endpoints. -/
def expTwo (x : EReal) : ℝ≥0∞ :=
if x = ⊤ then ⊤ else if x = ⊥ then 0 else ENNReal.ofReal ((2 : ℝ) ^ x.toReal)
/-- PDF p.20, (17): success upper bound at one specified normalized radius. -/
def codingBound (n : ℕ) (a R : ℝ) (v : EReal) : ℝ≥0∞ :=
expTwo (-(((n : ℝ) * (a - 1) / a : ℝ) : EReal) * ((R : EReal) - v))
/-- PDF p.22: the Renyi comparison constant nu in (20), expressed without
converting possibly infinite divergences. Claimed50.P48.nu is an output norm,
not this two-state constant.
On supported states, these traces are 2^(D_3/2 / 2) and 2^(-D_1/2 / 2). -/
def renyiNu {I : Type} [Fintype I] [DecidableEq I] (rho sigma : Matrix I I ℂ) : ℝ :=
tr (spectralPower rho (3 / 2 : ℝ) * spectralPower sigma (-1 / 2 : ℝ)) +
tr (spectralPower rho (1 / 2 : ℝ) * spectralPower sigma (1 / 2 : ℝ)) + 1
/-- PDF p.22: an attained ordinary information-radius center and a uniform finite renyiNu bound.
These are witnesses in the conclusions below, never assumed approximation theorems. -/
def CenterControl {I J : Type} [Fintype I] [Fintype J] [DecidableEq J]
(N : Superop I J) (sigma : Matrix J J ℂ) (c : ℝ) : Prop :=
CompatibleCenter N sigma ∧ 1 < c ∧
(⨆ rho : {X : Matrix I I ℂ // IsDensityMatrix X}, relativeD (N rho.1) sigma) = ((QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N) : EReal) ∧
∀ rho : {X : Matrix I I ℂ // IsDensityMatrix X}, renyiNu (N rho.1) sigma ≤ c
/-- PDF p.24: exponential strong-converse THRESHOLD, without identifying it with capacity. -/
def ExponentialAt {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
(N : Superop I J) (threshold : ℝ) : Prop :=
∀ R : ℝ, threshold < R → ∃ c : ℝ, 0 < c ∧ ∃ n0 : ℕ, 0 < n0 ∧
∀ n : ℕ, n0 ≤ n → ∀ M : ℕ, 0 < M → R ≤ (Real.logb 2 (M : ℝ) / (n : ℝ)) →
∀ K : UACode (Fin n → I) (Fin n → J) M,
uaCodeSuccess (channelPower N n) K ≤ (2 : ℝ) ^ (-(c * (n : ℝ)))
/-- PDF p.25: interior relative to the finite-dimensional affine TP/HP map space.
Entrywise coefficient balls give its usual topology; no CP constraint is placed on
candidate perturbations before testing membership in the EB-channel set. -/
def InteriorEB {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
(N : Superop I J) : Prop :=
IsChannel N ∧ IsEB N ∧
∃ e : ℝ, 0 < e ∧ ∀ L : Matrix I I ℂ →ₗ[ℂ] Matrix J J ℂ,
(∀ X, (L X).trace = X.trace) →
(∀ X, X.IsHermitian → (L X).IsHermitian) →
(∀ i j k l, ‖L (Matrix.single i j 1) k l - N (Matrix.single i j 1) k l‖ < e) →
Entanglement.IsCompletelyPositive L ∧ IsEB L
/-- PDF p.25: the EB interior condition is on a complement of this SAME channel. -/
def InteriorHadamard {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
(N : Superop I J) : Prop :=
∃ k : ℕ, 0 < k ∧ ∃ V : Matrix (J × Fin k) I ℂ,
IsIsometry V ∧ receiverChannel V = N ∧ InteriorEB (complementaryChannel V)
-- Small sanity checks pin support failure, zero operators, zero weights and the code boundary.
example {I : Type} [Fintype I] [DecidableEq I] (a : ℝ) (A B : Matrix I I ℂ)
(h : ¬ Dominates B A) : sandwichedTrace a A B = ⊤ := by
exact if_neg h
example {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J] :
FiniteKrausCP (fun _ : Matrix I I ℂ => (0 : Matrix J J ℂ)) := by
refine ⟨0, Fin.elim0, ?_⟩
funext X
simp [krausApply]
example {I J : Type} [Fintype J] (N : Superop I J) (X : Matrix I I ℂ) :
filtered 0 N X = 0 := by simp [filtered]
example : classicalRenyiBits 2 (fun _ : Fin 1 => (1 : ℝ)) (fun _ => 0) = ⊤ := by
simp [classicalRenyiBits]
example : Real.logb 2 (1 : ℝ) / (1 : ℝ) = 0 := by simp [Real.logb]
example : binEntropy2 0 = 0 := by simp [binEntropy2]
example (x : ℝ≥0∞) : ENNReal.ofReal 0 * x = 0 := by simp
example : expTwo ⊤ = ⊤ ∧ expTwo ⊥ = 0 := by simp [expTwo]
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
end QAlgorithms.Papers.Independent.Support50.P19
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P19.CenterControl
For finite types , with decidable equality on , any function from complex matrices on to complex matrices on , a matrix on , and a real , this predicate requires that be positive semidefinite of trace , that for every positive semidefinite trace-one input , and that . It additionally requires
for every such . Here if , and otherwise
regarded as an extended real number. The quantity is the real supremum over all finite ensembles , with , , and every positive semidefinite of trace , of
For the powers in the inequality, uses functional calculus with zero mapped to zero and nonzero mapped to the total real power . The supremum on the left is in the extended reals, whereas is embedded from . No channel assumption on or nonemptiness assumption on is included.
QAlgorithms.Papers.Independent.Support50.P19.CompatibleCenter
For finite types , with decidable equality on , an arbitrary function from complex matrices to complex matrices, and a complex matrix , this predicate means that is positive semidefinite with trace one and that
No positivity, trace-preservation, or linearity assumption is made on . If is empty, the universally quantified condition is vacuous, so the predicate requires only that be a density matrix. If is empty, no such exists.
QAlgorithms.Papers.Independent.Support50.P19.ExponentialAt
For finite types with decidable equality, any function from complex matrices on to complex matrices on , and any real threshold , this predicate says that for every real , there exist a real and a natural number such that, for every natural , every natural satisfying , and every collection of positive semidefinite trace-one matrices on together with positive semidefinite matrices on satisfying ,
Here denotes functions from to , and the function is defined on all matrices by
where has its sole nonzero entry, equal to , at . The threshold need not be nonnegative, and no channel assumption on or nonemptiness assumption on is imposed. Since , the asserted bound only concerns positive block lengths; if the required collections of states and measurement matrices do not exist, the corresponding universal assertion is vacuous.
QAlgorithms.Papers.Independent.Support50.P19.InformationExtrema
For finite types , with decidable equality on , Boolean , real , and an arbitrary function from complex matrices to complex matrices, this predicate is the conjunction of three attainment statements. Let denote the positive semidefinite matrices of trace one on the indicated types. Define , and define to be if and , and otherwise , where for , or for ; is the extended logarithm, equal to on nonpositive arguments, on finite positive arguments, and at . For a finite ensemble , with , , and , put . The three assertions are
and
No uniqueness is asserted, need not be linear or a channel, and is unrestricted with total arithmetic. Empty types are allowed in the parameters, but the predicate cannot hold if either or is empty, because its existential ensemble or density-matrix witness would be unavailable.
QAlgorithms.Papers.Independent.Support50.P19.InteriorEB
For finite types with decidable equality and a function from complex matrices on to complex matrices on , this predicate requires a finite family of matrices from to such that
It also requires that, for every natural and every positive semidefinite trace-one matrix on , the matrix be expressible as a finite sum , where and are positive semidefinite trace-one matrices on the reference and output spaces, respectively; no condition is part of this requirement. Finally, there must exist a real such that every complex-linear map on the same matrix spaces which preserves the complex trace of every matrix, maps every Hermitian matrix to a Hermitian matrix, and satisfies
has both of the following properties: is positive semidefinite for every natural , including , and every positive semidefinite ; and for every and positive semidefinite trace-one , it has a finite decomposition of the preceding form. Here is the matrix unit, and the amplification acts on reference-indexed blocks by . Empty finite types are not excluded.
QAlgorithms.Papers.Independent.Support50.P19.InteriorHadamard
For finite types with decidable equality and any function from complex matrices on to complex matrices on , this predicate asserts the existence of a natural and a matrix such that and
Define the other marginal map by
The predicate further requires that admit a finite representation with , and that for every natural and every positive semidefinite trace-one on the reference space times , be a finite sum with nonnegative weights and positive semidefinite trace-one factors, without requiring the weights to sum to . Finally, there must be an such that every complex-linear map from matrices on to matrices on , preserving trace and Hermitian matrices and satisfying for every choice of indices, is completely positive and has that same finite-decomposition property on every reference-extended density matrix. Complete positivity here means positivity of every finite reference amplification, including reference dimension zero; amplification applies the map separately to reference-indexed blocks. No nonemptiness assumption on is included.
QAlgorithms.Papers.Independent.Support50.P19.NormExtrema
For finite types , with decidable equality on , any real , and any function from complex matrices on to complex matrices on , let be the set of positive semidefinite trace-one matrices satisfying for every positive semidefinite trace-one input , and put
Here , while for is functional calculus with scalar function at and elsewhere, using total real powers. This predicate asserts both that there exists with
and that, for every , there exists a positive semidefinite trace-one input such that . The infimum and displayed products use extended-real arithmetic, with for and otherwise; the suprema defining are total real suprema. Neither optimizer is asserted to be unique. There is no channel assumption on or restriction on ; zero denominators use total division. Empty index types are included: an empty set of centers makes the first existence assertion false, and a center without any density-matrix inputs cannot satisfy the second existence assertion.
QAlgorithms.Papers.Independent.Support50.P19.blockInformation
For any finite type with decidable equality, natural number , real number , arbitrary real weights , and arbitrary complex matrices , indexed by , this defines
in the extended reals. The sum inside is in , and , , while for finite positive . To define , return if , regardless of ; otherwise put and set
viewed in . There is no requirement that the weights sum to one or that the are density matrices; negative weights are replaced by zero. Zero times in the inner sum is zero. The cases , empty , and arbitrary , including and , are included, with total powers and division; empty makes the outer infimum .
QAlgorithms.Papers.Independent.Support50.P19.channelInformation
For finite types , with decidable equality on , any Boolean , real , and arbitrary function from complex matrices to complex matrices, this defines
Here ranges over all finite lists of density matrices on , each positive semidefinite with trace one, with nonnegative real weights summing to one; and are block diagonal, with respective blocks and . To expand the divergence, put . For arbitrary , when and ; otherwise it is , where if , and if . The extended logarithm is on finite positive arguments, on nonpositive arguments, and at . No channel or linearity assumption on , and no restriction on , is imposed. An ensemble cannot have zero entries because its weights sum to one. If is empty there are no such ensembles and the supremum is ; if is nonempty and empty, each inner infimum is over an empty set and is . All arithmetic and functional calculus are total.
QAlgorithms.Papers.Independent.Support50.P19.classicalRenyiBits
For any finite type , any real number , and any real-valued functions , this defines an extended-real number as follows. If implies for every , put
and return , where when and otherwise. If that implication fails at any index, return . Neither nor is required to be nonnegative or normalized, and is unrestricted; powers and division use the total real operations. In particular, , so at the value is when the implication holds and when it fails, using extended-real multiplication with . The empty type is allowed: the implication then holds vacuously and the sum is zero.
QAlgorithms.Papers.Independent.Support50.P19.codingBound
For any natural number , real numbers , and extended real number , form
using real arithmetic for the coefficient , followed by extended-real arithmetic for the product. The definition returns if , if , and , embedded in , if is finite. No sign or finiteness restriction is imposed on , and is included. Real division by zero is zero; consequently, , , or gives value , including when is infinite, under the specified extended-real arithmetic.
QAlgorithms.Papers.Independent.Support50.P19.expTwo
For any extended real number , this defines a value in : it is when , it is when , and it is the nonnegative extended-real embedding of the real number when is the finite real number .
QAlgorithms.Papers.Independent.Support50.P19.filtered
For any type , any finite type , any complex matrix indexed by , and any function from complex matrices to complex matrices, this defines the function
There are no assumptions that is linear or a channel, or that is Hermitian, positive, or invertible. Both outside factors are itself. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P19.fixedRadius
For finite types , with decidable equality on , any Boolean , real , arbitrary function from complex matrices to complex matrices, and arbitrary complex matrix , this defines
in the extended reals. Explicitly, put . The value is if and ; otherwise it is , where for , and for . Here is on finite positive arguments, on nonpositive arguments, and at . The center is not required to be positive or normalized, and is not required to be linear or a channel. The order is unrestricted and all operations are total. Empty gives an empty supremum, hence ; empty is also allowed.
QAlgorithms.Papers.Independent.Support50.P19.informationRadius
For finite types , with decidable equality on , any Boolean , real , and arbitrary function from complex matrices to complex matrices, this defines
Both extrema are taken in the extended reals. To specify the divergence, let . Set if and ; otherwise set , where for , and for . The function equals on finite positive arguments, on nonpositive arguments, and at . There is no assumption that is linear or a channel, and is unrestricted with total arithmetic. If is empty, the outer infimum is empty and equals ; if is nonempty and empty, every inner supremum is empty and the result is .
QAlgorithms.Papers.Independent.Support50.P19.normRadiusAfter
For finite types , with decidable equality on , any real , and any function from complex matrices on to complex matrices on , this defines the extended real number
Here consists of positive semidefinite matrices of trace such that for every positive semidefinite trace-one input . The operation is the identity matrix when ; otherwise it is the real continuous functional calculus applied to the function taking to and every nonzero to the total real power . Also, for , and otherwise. The inner supremum is taken in , using the total real supremum, which is for an empty or unbounded-above set; the outer infimum and multiplication are in the extended reals. No channel assumption on , restriction on , or nonemptiness assumption on is imposed. In particular, division by zero is evaluated as zero, and an empty set gives outer infimum .
QAlgorithms.Papers.Independent.Support50.P19.normRadiusBefore
For finite types , with decidable equality on , a real number , and an arbitrary function from complex matrices to complex matrices, let consist of all positive semidefinite matrices of trace one such that for every positive semidefinite matrix of trace one. Define , and for define . For each , put . This definition returns
where for and otherwise, and the extrema and multiplication are in the extended reals. The supremum is taken after multiplying each logarithm by the displayed coefficient. No channel or linearity assumption on , and no restriction on , is imposed; all real operations are total, including division by zero. If no compatible center exists, the outer infimum is . If is empty and nonempty, compatibility is vacuous and the inner supremum is empty, giving ; if is empty, there are no compatible centers and the value is .
QAlgorithms.Papers.Independent.Support50.P19.outputWeightedNorm
For any finite type with decidable equality, any real number , and arbitrary complex matrices , put
This defines the real number
The symbol in denotes the identity matrix, including on the kernel. There are no positivity, normalization, support-inclusion, or order restrictions. Powers, division, and functional calculus are total; in particular is permitted and gives value , since the final exponent is . Empty is also permitted.
QAlgorithms.Papers.Independent.Support50.P19.renyiD
For any finite type with decidable equality, a Boolean flag , a real number , and arbitrary complex matrices , this defines an extended-real number by selecting the following formulas. Write
Here is the total real continuous functional calculus. If and , the value is ; otherwise it is , where , for , and for finite positive . No positivity or normalization of the matrices, and no restriction on , is imposed. All real divisions and powers are total; assigns zero to the zero spectral value rather than assigning one there. At the result is , using and . Empty is included.
QAlgorithms.Papers.Independent.Support50.P19.renyiEnsembleInformation
For any finite type with decidable equality, any natural number , Boolean , real , real weights , and arbitrary complex matrices , define block matrices indexed by through
The definition returns in the extended reals. Explicitly, let , let be the extended logarithm with , for , and for finite positive . Then if and ; otherwise it is , with for , and for . The supplied weights need not be probabilities and the supplied matrices need not be density matrices. Both and empty are allowed; for empty there is no density matrix , so the infimum is . The order is unrestricted, with total arithmetic, including division by zero.
QAlgorithms.Papers.Independent.Support50.P19.renyiNu
For any finite type with decidable equality and any two complex matrices indexed by , this defines the real number
For each of these nonzero exponents , is real continuous functional calculus with scalar function equal to at zero and to the total real power elsewhere. Thus the negative half-power also assigns zero at a zero spectral value. Neither matrix is assumed Hermitian, positive semidefinite, normalized, or nonzero; the total functional-calculus operation is used without those hypotheses. If is empty, both traces are zero and the value is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.