Definitions for Second-order coding rates for pure-loss bosonic channels
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P76The objects the formalized statements of Second-order coding rates for pure-loss bosonic channels (arXiv:1408.5328) are stated in. Each was checked against the paper by a blind read-back and a moderator.
IsUnitCoefficientVector: PDF p.4: unit-vector coefficients on the full countable orthonormal basis. Square summability is explicit; the zero vector is excluded.coefficientInner: PDF p.4: conjugate-linear first argument, as in Mathlib's Hilbert inner product.meanOutput: PDF pp.4,6, (4.1): the density is computed from the channel and input law. Coordinate measurability of pure projectors is the trace-norm Borel convention on this normalized separable-output domain. No finite-support restriction.HasSpectralLaw: PDF p.4: a genuine countable spectral decomposition, allowing zero weights and zero vectors at those weights. The operator is reconstructed, not free data. All nonzero eigenvectors are normalized and mutually orthogonal.lowEigenvalueMass: PDF p.4, (3.3)–(3.6): retained mass of eigenvalues at most 2^(-gamma). The weak inequality is taken from the spectral projector (3.3); eigenvalues at the cutoff are retained, as required by (3.7).spectralInfEntropy: PDF p.4: spectral inf-entropy. On a probability spectrum and 0<=e<1, the defining set is nonempty and bounded above, so the real supremum is valid.selfInformationMean: PDF p.5, (3.12): spectral mean self-information, used only with summability.selfInformationVariance: PDF p.5, (3.13): variance computed independently of the claimed bosonic formula.kernelEntropyBits: Spectral entropy of an actual positive trace-one kernel, in bits, including infinity. Spectral resolutions determine the same value. An empty set of resolutions gives infinity, not zero. PDF pp.4–5, (3.2),(3.12).PureCQCode: PDF p.5: finite nonempty uniform messages, deterministic encoder and one joint POVM on the entire output system. There is no oracle-dependent decoder.pureBornProbability: PDF p.5: Born probability for a normalized vector and bounded effect. Inner row sums and the outer Hilbert pairing converge absolutely on that domain.pureCQAverageError: PDF p.5, (3.15): average, not maximal, message error.logMaxCodeSize: PDF p.5, (3.16): supremum of achievable log cardinalities. EReal preserves an infinite unrestricted code size; all witnesses remain actual finite codes.HasFiniteCode: An actual deterministic finite code attaining a real lower threshold.productPureCQChannel: PDF p.9, (5.1): exact tensor-product pure outputs, in the full product basis.productSpectrum: PDF p.9: iid eigenvalue law of rho tensor n, with no finite truncation.thermalPhotonProbability: PDF p.10, (6.5): complete number-diagonal thermal spectrum, including vacuum.thermalDispersion: PDF pp.3,10: scalar thermal dispersion, explicitly extended to vacuum. This is distinct from selfInformationVariance, to which the theorem equates it.heterodyneDispersion: PDF p.11, (6.12), bits squared: log2(e)=1/ln(2).coherentChannel: PDF p.10, (6.2): identity-transmissivity coherent-state cq channel.photonLeakage: PDF p.11: leakage outside the total-photon subspace, averaged over uniform messages; the cutoff is ceil(n NS), not a separate cutoff on each mode.bpskAverage: PDF p.13: actual equiprobable BPSK average density, not its entropy formula.bpskHolevoBits: PDF p.13, (6.14): scalar BPSK Holevo expression in bits.bpskHolevoNats: PDF p.13: same scalar expression converted to nats.thermalEntropyNats: PDF p.13, (6.15): unconstrained-modulation Holevo expression in nats.dolinarCrossover: PDF p.13, (6.17): exact binary symmetric crossover probability.dolinarNats: PDF p.13: scalar BPSK/Dolinar capacity in nats, independently of the expansion.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Information
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P63
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P54
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P32
/-!
arXiv:1408.5328v3. Countable coordinates describe completed separable Hilbert
spaces, including finite dimensions. Infinite matrices below are coefficient
arrays, never finite cutoffs. Positive finite forms and POVM completeness imply
bounded effects on l2; all Born pairings are iterated sums, not an unordered
non-absolutely-convergent double series. Distinct new definitions are paper-local;
accepted definitions are imported as explicitly required by the repair instruction.
The three source deferrals and the printed sign correction are documented in
the unit artifacts. Compilation is pending the batch handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P76
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo normalCDF normalQuantile)
open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)
open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)
open QAlgorithms.Papers.Independent.Next46.P32 (PositiveKernel)
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.4: unit-vector coefficients on the full countable orthonormal basis.
Square summability is explicit; the zero vector is excluded. -/
def IsUnitCoefficientVector {I : Type} (u : I → ℂ) : Prop :=
Summable (fun i => Complex.normSq (u i)) ∧ ∑' i, Complex.normSq (u i) = 1
/-- PDF p.4: conjugate-linear first argument, as in Mathlib's Hilbert inner product. -/
def coefficientInner {I : Type} (u v : I → ℂ) : ℂ :=
∑' i, star (u i) * v i
/-- PDF pp.4,6, (4.1): the density is computed from the channel and input law.
Coordinate measurability of pure projectors is the trace-norm Borel convention
on this normalized separable-output domain. No finite-support restriction. -/
def meanOutput {X : Type*} {I : Type} [MeasurableSpace X]
(W : X → I → ℂ) (mu : Measure X) : Matrix I I ℂ :=
fun a b => ∫ x, Matrix.vecMulVec (W x) (star (W x)) a b ∂mu
/-- PDF p.4: a genuine countable spectral decomposition, allowing zero weights
and zero vectors at those weights. The operator is reconstructed, not free data.
All nonzero eigenvectors are normalized and mutually orthogonal. -/
def HasSpectralLaw {I : Type} {J : Type*} (rho : Matrix I I ℂ) (p : J → ℝ) : Prop :=
(∀ j, 0 ≤ p j) ∧ Summable p ∧ (∑' j, p j) = 1 ∧
∃ u : J → I → ℂ,
(∀ j, 0 < p j → IsUnitCoefficientVector (u j)) ∧
(∀ j k, j ≠ k → 0 < p j → 0 < p k → coefficientInner (u j) (u k) = 0) ∧
∀ a b, rho a b = ∑' j, (p j : ℂ) * Matrix.vecMulVec (u j) (star (u j)) a b
/-- PDF p.4, (3.3)–(3.6): retained mass of eigenvalues at most 2^(-gamma).
The weak inequality is taken from the spectral projector (3.3); eigenvalues
at the cutoff are retained, as required by (3.7). -/
def lowEigenvalueMass {J : Type*} (p : J → ℝ) (gamma : ℝ) : ℝ :=
∑' j, if p j ≤ (2 : ℝ) ^ (-gamma) then p j else 0
/-- PDF p.4: spectral inf-entropy. On a probability spectrum and 0<=e<1,
the defining set is nonempty and bounded above, so the real supremum is valid. -/
def spectralInfEntropy {J : Type*} (p : J → ℝ) (e : ℝ) : ℝ :=
sSup {gamma : ℝ | 1 - e ≤ lowEigenvalueMass p gamma}
/-- PDF p.5, (3.12): spectral mean self-information, used only with summability. -/
def selfInformationMean {J : Type*} (p : J → ℝ) : ℝ :=
∑' j, p j * (-logTwo (p j))
/-- PDF p.5, (3.13): variance computed independently of the claimed bosonic formula. -/
def selfInformationVariance {J : Type*} (p : J → ℝ) : ℝ :=
∑' j, p j * (-logTwo (p j) - selfInformationMean p) ^ 2
/-- Spectral entropy of an actual positive trace-one kernel, in bits, including
infinity. Spectral resolutions determine the same value. An empty set of
resolutions gives infinity, not zero. PDF pp.4–5, (3.2),(3.12). -/
def kernelEntropyBits {I : Type} (rho : Matrix I I ℂ) : ℝ≥0∞ :=
sInf {z : ℝ≥0∞ | ∃ p : ℕ → ℝ, HasSpectralLaw rho p ∧
z = ∑' j, ENNReal.ofReal (-p j * logTwo (p j))}
/-- PDF p.5: finite nonempty uniform messages, deterministic encoder and one
joint POVM on the entire output system. There is no oracle-dependent decoder. -/
structure PureCQCode (X : Type*) (I : Type) (M : ℕ) where
nonempty : 0 < M
encode : Fin M → X
effect : Fin M → Matrix I I ℂ
positive : ∀ m, PositiveKernel (effect m)
complete : ∀ a b, (∑ m, effect m a b) = if a = b then 1 else 0
/-- PDF p.5: Born probability for a normalized vector and bounded effect.
Inner row sums and the outer Hilbert pairing converge absolutely on that domain. -/
def pureBornProbability {I : Type} (u : I → ℂ) (E : Matrix I I ℂ) : ℝ :=
(∑' a, star (u a) * (∑' b, E a b * u b)).re
/-- PDF p.5, (3.15): average, not maximal, message error. -/
def pureCQAverageError {X : Type*} {I : Type} {M : ℕ} (W : X → I → ℂ) (c : PureCQCode X I M) : ℝ :=
1 - (∑ m, pureBornProbability (W (c.encode m)) (c.effect m)) / (M : ℝ)
/-- PDF p.5, (3.16): supremum of achievable log cardinalities. EReal preserves
an infinite unrestricted code size; all witnesses remain actual finite codes. -/
def logMaxCodeSize {X : Type*} {I : Type} (W : X → I → ℂ) (e : ℝ) : EReal :=
sSup {r : EReal | ∃ (M : ℕ) (c : PureCQCode X I M),
pureCQAverageError W c ≤ e ∧ r = (logTwo (M : ℝ) : EReal)}
/-- An actual deterministic finite code attaining a real lower threshold. -/
def HasFiniteCode {X : Type*} {I : Type} (W : X → I → ℂ) (e R : ℝ) : Prop :=
∃ (M : ℕ) (c : PureCQCode X I M), pureCQAverageError W c ≤ e ∧ R ≤ logTwo (M : ℝ)
/-- PDF p.9, (5.1): exact tensor-product pure outputs, in the full product basis. -/
def productPureCQChannel {X : Type*} {I : Type} (W : X → I → ℂ) (n : ℕ) :
(Fin n → X) → (Fin n → I) → ℂ :=
fun x a => ∏ i, W (x i) (a i)
/-- PDF p.9: iid eigenvalue law of rho tensor n, with no finite truncation. -/
def productSpectrum {J : Type*} (p : J → ℝ) (n : ℕ) : (Fin n → J) → ℝ :=
fun a => ∏ i, p (a i)
/-- PDF p.10, (6.5): complete number-diagonal thermal spectrum, including vacuum. -/
def thermalPhotonProbability (x : ℝ) (k : ℕ) : ℝ := x ^ k / (x + 1) ^ (k + 1)
/-- PDF pp.3,10: scalar thermal dispersion, explicitly extended to vacuum.
This is distinct from selfInformationVariance, to which the theorem equates it. -/
def thermalDispersion (x : ℝ) : ℝ :=
if x = 0 then 0 else x * (x + 1) * (logTwo (x + 1) - logTwo x) ^ 2
/-- PDF p.11, (6.12), bits squared: log2(e)=1/ln(2). -/
def heterodyneDispersion (x : ℝ) : ℝ :=
x * (x + 2) * (1 / Real.log 2) ^ 2 / (x + 1) ^ 2
/-- PDF p.10, (6.2): identity-transmissivity coherent-state cq channel. -/
def coherentChannel (n : ℕ) : (Fin n → ℂ) → (Fin n → ℕ) → ℂ :=
productPureCQChannel coherentCoefficient n
/-- PDF p.11: leakage outside the total-photon subspace, averaged over uniform
messages; the cutoff is ceil(n NS), not a separate cutoff on each mode. -/
def photonLeakage {n M : ℕ} (c : PureCQCode (Fin n → ℂ) (Fin n → ℕ) M) (NS : ℝ) : ℝ :=
(∑ m, ∑' a : Fin n → ℕ,
if ⌈(n : ℝ) * NS⌉₊ < ∑ i, a i then
Complex.normSq (coherentChannel n (c.encode m) a) else 0) / (M : ℝ)
/-- PDF p.13: actual equiprobable BPSK average density, not its entropy formula. -/
def bpskAverage (alpha : ℂ) : Matrix ℕ ℕ ℂ :=
fun a b => (Matrix.vecMulVec (coherentCoefficient alpha) (star (coherentCoefficient alpha)) a b +
Matrix.vecMulVec (coherentCoefficient (-alpha)) (star (coherentCoefficient (-alpha))) a b) / 2
/-- PDF p.13, (6.14): scalar BPSK Holevo expression in bits. -/
def bpskHolevoBits (x : ℝ) : ℝ :=
QAlgorithms.binEntropy2 ((1 - Real.exp (-2 * x)) / 2)
/-- PDF p.13: same scalar expression converted to nats. -/
def bpskHolevoNats (x : ℝ) : ℝ := Real.log 2 * bpskHolevoBits x
/-- PDF p.13, (6.15): unconstrained-modulation Holevo expression in nats. -/
def thermalEntropyNats (x : ℝ) : ℝ := Real.log 2 * thermalEntropy x
/-- PDF p.13, (6.17): exact binary symmetric crossover probability. -/
def dolinarCrossover (x : ℝ) : ℝ :=
(1 - Real.sqrt (1 - Real.exp (-4 * x))) / 2
/-- PDF p.13: scalar BPSK/Dolinar capacity in nats, independently of the expansion. -/
def dolinarNats (x : ℝ) : ℝ :=
Real.log 2 * (1 - QAlgorithms.binEntropy2 (dolinarCrossover x))
/-! Sanity checks on zero weights, zero energy, tensor products and normalization. -/
example : logTwo 1 = 0 := by simp [logTwo]
example : ¬ IsUnitCoefficientVector (fun _ : ℕ => (0 : ℂ)) := by simp [IsUnitCoefficientVector]
example : Matrix.vecMulVec (fun _ : ℕ => (0 : ℂ))
(star (fun _ : ℕ => (0 : ℂ))) = 0 := by ext a b; simp [Matrix.vecMulVec]
example : IsUnitCoefficientVector (fun k : ℕ => if k = 0 then (1 : ℂ) else 0) := by
constructor
· apply summable_of_ne_finset_zero (s := {0})
intro k hk
have hk0 : k ≠ 0 := by simpa using hk
simp [hk0]
· simp
example : pureBornProbability (fun _ : Fin 1 => (1 : ℂ)) (fun _ _ => (1 : ℂ)) = 1 := by
simp [pureBornProbability]
example : thermalPhotonProbability 0 0 = 1 := by simp [thermalPhotonProbability]
example (k : ℕ) : thermalPhotonProbability 0 (k + 1) = 0 := by simp [thermalPhotonProbability]
example : thermalEntropy 0 = 0 := by simp [thermalEntropy, logTwo]
example : thermalDispersion 0 = 0 := by simp [thermalDispersion]
example : heterodyneDispersion 0 = 0 := by simp [heterodyneDispersion]
example : coherentCoefficient 0 0 = 1 := by simp [coherentCoefficient]
example : bpskHolevoBits 0 = 0 := by
simp [bpskHolevoBits, QAlgorithms.binEntropy2]
example : dolinarCrossover 0 = 1 / 2 := by simp [dolinarCrossover]
example : dolinarNats 0 = 0 := by
rw [dolinarNats, show dolinarCrossover 0 = 1 / 2 by simp [dolinarCrossover]]
have hb : QAlgorithms.binEntropy2 (1 / 2) = 1 := by
rw [QAlgorithms.binEntropy2, show (1 / 2 : ℝ) = 2⁻¹ by norm_num,
Real.binEntropy_two_inv]
exact div_self (Real.log_pos (by norm_num : (1 : ℝ) < 2)).ne'
rw [hb]
simp
example {J : Type*} (p : J → ℝ) (a : Fin 0 → J) : productSpectrum p 0 a = 1 := by
simp [productSpectrum]
example {X : Type*} {I : Type} (W : X → I → ℂ) (x : Fin 0 → X) (a : Fin 0 → I) :
productPureCQChannel W 0 x a = 1 := by simp [productPureCQChannel]
end QAlgorithms.Papers.Independent.Intakenext100.P76
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P76.HasFiniteCode
For arbitrary types and , , and real numbers , this is the proposition that there exist a natural number , encoded inputs for , and complex matrices indexed by , such that
The matrices must satisfy , and every finite quadratic expression , for finite and , must have zero imaginary part and nonnegative real part. There is no normalization assumption on , no restriction on or , and no summability assumption on the nested infinite sums; a nonsummable family has total infinite sum zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.HasSpectralLaw
For arbitrary index types , a complex matrix indexed by , and a function , this predicate requires for every , summability of , and . It further requires the existence of functions such that, whenever , the family is summable with sum one; whenever and both , ; and, for every , . Vectors at zero-weight indices have no normalization or orthogonality requirement. No finiteness or countability assumption is imposed on either index type, and no separate summability condition is stated for the matrix-entry expansions; the complex infinite sums use the total convention of zero for nonsummable families. An empty cannot satisfy the required total weight.
QAlgorithms.Papers.Independent.Intakenext100.P76.IsUnitCoefficientVector
For any index type and function , this predicate means that the family is summable and . No finiteness or countability assumption on is imposed. If is empty, the predicate cannot hold because its sum is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.PureCQCode
For arbitrary types and a natural number , this structure consists of a proof that , an encoding function from to , and a complex matrix indexed by for each message . Each must satisfy finite quadratic-form positivity: for every finite subset and every function , the number has imaginary part zero and nonnegative real part. Completeness is required entrywise: equals one if and zero otherwise, for every . Neither index type is required to be finite or countable, and the encoder need not be injective. No structure exists for or empty ; empty is allowed, in which case the matrix conditions are vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P76.bpskAverage
For every complex , this defines the complex matrix indexed by with entries
The parameter is unrestricted, including ; powers use the convention .
QAlgorithms.Papers.Independent.Intakenext100.P76.bpskHolevoBits
For every real , set ; this defines
No assumption that , or that , is imposed. The logarithms are total real logarithms, with and for , so the formula remains defined outside the usual probability range; its value at is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.bpskHolevoNats
For every real , with , this defines
There is no nonnegativity restriction on or probability-range restriction on . Real logarithms are total, with and for negative ; in particular, the value at is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.coefficientInner
For any index type and functions , this defines the complex number . Neither normalization nor summability is assumed; the sum is the total infinite-sum operation, whose value is zero when the family is not summable. For empty , its value is also zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.coherentChannel
For every natural number , this defines a function taking and to
All real factors are regarded as complex numbers. The amplitudes are unrestricted; when , the value on the unique pair of empty tuples is .
QAlgorithms.Papers.Independent.Intakenext100.P76.dolinarCrossover
For every real number , this defines
The real square root is defined to be on negative arguments, so the definition includes , for which , as well as , for which .
QAlgorithms.Papers.Independent.Intakenext100.P76.dolinarNats
For every real number , this defines
where
The logarithm and square root are total real functions, with and for . No nonnegativity hypothesis on is imposed; for , the defined value is .
QAlgorithms.Papers.Independent.Intakenext100.P76.heterodyneDispersion
For every real , this defines
There is no assumption that is nonnegative. Division by zero is defined to be zero, so the value at is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.kernelEntropyBits
For any index type and complex matrix indexed by , this defines an element of as the infimum of over all real sequences satisfying the following conditions: for every , is summable with sum one, and there exist functions such that every positive-weight has summable squared moduli totaling one, distinct positive-weight vectors satisfy , and for every . Here , with ; the maximum denotes conversion into the nonnegative extended reals, and the entropy sum may be infinite. Zero-weight vectors are unrestricted, the matrix-entry sums are total complex infinite sums, and no independent density assumption on is supplied. If no such sequence and vectors exist, the infimum is .
QAlgorithms.Papers.Independent.Intakenext100.P76.logMaxCodeSize
For arbitrary types and , a function , and , this defines the extended real number
Here a code consists of , an encoding , and complex matrices indexed by , satisfying for all , and, for every , every finite , and every , the quadratic expression has zero imaginary part and nonnegative real part. No normalization of , finiteness of , or convergence of the displayed infinite sums is assumed; these sums use the total infinite-sum operation, which returns zero for a nonsummable family. The supremum is taken in the extended reals, so an empty admissible set gives , and a set unbounded above gives .
QAlgorithms.Papers.Independent.Intakenext100.P76.lowEigenvalueMass
For any index type , function , and real number , this defines , with equality included at the threshold. No nonnegativity, normalization, summability, or spectral interpretation of is required. The sum is zero if the selected family is nonsummable, and is also zero when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P76.meanOutput
For any measurable space , index type , function , and measure on , this defines the matrix indexed by with entries for every . There is no finiteness assumption on , no normalization condition on , and no requirement that be a probability measure or that the integrands be measurable or integrable. Each integral is the total Bochner integral, which is zero when its integrand is not integrable.
QAlgorithms.Papers.Independent.Intakenext100.P76.photonLeakage
For natural numbers , a code of the specified kind, and any real , this defines
where , and is the natural-number ceiling, equal to zero for . The code includes and matrices indexed by whose sum is the identity kernel and whose quadratic expressions on every finite subset have zero imaginary part and nonnegative real part; these matrices do not enter this formula. There is no restriction on or the encoded amplitudes. The inner sum is the total real infinite sum, returning zero if nonsummable. For , the strict threshold condition is false and the defined value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.productPureCQChannel
For arbitrary types , any function , and every natural number , this defines a function taking tuples and to
No normalization or other condition on is required. When , both tuples are the unique empty tuples and the value is .
QAlgorithms.Papers.Independent.Intakenext100.P76.productSpectrum
For an arbitrary type , any real-valued function , and every natural number , this defines the function on tuples by
There is no nonnegativity, summability, or normalization requirement on . For , the value on the unique empty tuple is , including when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P76.pureBornProbability
For any index type , function , and complex matrix indexed by , this defines , with the inner sum over taken separately for each , followed by the outer sum over . No normalization of , positivity or completeness condition on , or summability assumption is imposed. Each complex sum is the total infinite-sum operation, returning zero for a nonsummable family; the definition does not itself assert that the result lies between zero and one. For empty , the result is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.pureCQAverageError
For arbitrary types , a natural number , a function , and a code consisting of , an encoder , and matrices indexed by , this defines . The code requires each finite quadratic form to be real and nonnegative for every finite and function , and requires to equal one when and zero otherwise. No normalization or summability condition is imposed on , and the nested complex sums use zero for nonsummable families, so the definition does not itself assert an error between zero and one. The denominator is nonzero because the code requires ; if is empty, the defined error is one.
QAlgorithms.Papers.Independent.Intakenext100.P76.selfInformationMean
For any index type and function , this defines , where . No nonnegativity, normalization, or summability hypothesis is imposed. The real logarithm is total, with and for negative , so zero weights contribute zero and negative weights are permitted. The result is zero when the summand family is nonsummable, and also when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P76.selfInformationVariance
For any index type and function , put , where . This defines . No nonnegativity, normalization, or summability hypothesis is imposed, so the definition does not itself require a nonnegative result. The real logarithm uses and for negative ; each real infinite sum is zero if its family is nonsummable. For empty , the result is zero.
QAlgorithms.Papers.Independent.Intakenext100.P76.spectralInfEntropy
For any index type , function , and real number , this defines the real supremum . There are no restrictions on or assumptions that is nonnegative, normalized, summable, or a spectral law. Each sum uses the total real infinite-sum convention, returning zero for a nonsummable family. The real supremum operation returns zero if the displayed set is empty or unbounded above, rather than an extended-real value.
QAlgorithms.Papers.Independent.Intakenext100.P76.thermalDispersion
For every real , this defines
No positivity assumption on is imposed. The real logarithm is total: , and for negative arguments it equals the logarithm of their absolute value; consequently the expression is also defined for negative .
QAlgorithms.Papers.Independent.Intakenext100.P76.thermalEntropyNats
For every real number , this defines
There is no assumption that . The logarithm is the total real logarithm, with and for negative ; in particular, the value at is .
QAlgorithms.Papers.Independent.Intakenext100.P76.thermalPhotonProbability
For every real and natural number , this defines
There is no assumption that . Division is total, with division by zero equal to zero, so the value is zero at . At , the value is for and zero for , using .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.