Definitions for Sending Quantum Information with Gaussian States
DefinitionQAlgorithms_Papers_Independent_Support50_P29The objects the formalized statements of Sending Quantum Information with Gaussian States (arXiv:quant-ph/9809022) are stated in. Each was checked against the paper by a blind read-back and a moderator.
canonicalCommutation: PDF pp.4-5: grouped physical commutation matrix, never the cocycle matrix.referenceCoordinateSwap: PDF p.6: reference coordinates exchange q and p, reversing the CCR form.physicalWeyl: PDF p.4: normalized regular irreducible Weyl system in physical units.centeredCharacteristic: PDF p.5: characteristic of a centered Gaussian, for either block ordering.GaussianCovariancePhysical: PDF p.5, (2.3): symmetry and the non-strict matrix uncertainty condition.CenteredGaussianWithCovariance: PDF p.5: an actual normalized Gaussian density, with its specified covariance.SimilarityData: PDF pp.5-6: similarity diagonalization, without a normality assumption.similarityFunction: PDF p.5: spectral matrix function in a similarity eigenbasis. The choice is irrelevant on diagonalizable matrices, including repeated eigenvalues. On a nondiagonalizable matrix the total extension is zero; the source targets conclude diagonalizability and use this function only on diagonalizable matrices.realSpectralSqrt: PDF p.6: principal nonnegative spectral square root of a real matrix similar to a nonnegative diagonal matrix. Entrywise real part recovers the real matrix. It is not the singular-value square root of M* M.entropyMatrix: PDF p.6, (2.6): g(abs M-I/2), using the source's similarity calculus.purificationCovariance: PDF pp.6-7: the explicitly prescribed reflected purification covariance.reflectedDelta: PDF p.7: the commutation matrix is diag(Delta,-Delta).jointCharacteristic: PDF p.6: actual tensor Weyl pairing, with the reference CCR reflected.realify: PDF p.7: realification on all complex matrices, not an alleged Hermitian algebra.shuffle: PDF pp.7-8: (q1;p1;q2;p2) to the realification order (q1;q2;p1;p2).gaugeCovariance: PDF p.7: occupation-matrix covariance in grouped real coordinates.gaugePurificationMatrix: PDF p.8, (3.8): the two-by-two block complex representative.outputNumber: PDF p.9: thermal output occupation, with the p.10 identity endpoint.exchangeOutput: PDF p.9: the actual extended output on the normalized Schmidt purification.thermalCoherentInformationNats: PDF p.10: coherent information in nats, as a difference of actual entropies. Its use below includes conclusions that both extended entropies are finite.exchangeCovariance: PDF p.9: the full reflected output covariance, in subsystem block order.jointFockCharacteristic: PDF pp.8-9: actual Fock Weyl pairing; the reference uses (p,q).oneModeRealification: PDF p.9: two-by-two complex matrix, reindexed into subsystem real order.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P35
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P49
/-! Holevo, quant-ph/9809022v1. Full separable oscillator Hilbert spaces,
normalized trace-class states, natural logarithms, and reflected reference CCR.
Source corrections are documented in the unit's moderation notes and HARD ledger.
Mechanical compilation and independent moderation are pending the batch handoff. -/
noncomputable section
open Filter
open scoped BigOperators ENNReal Topology ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Support50.P29
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P10 (Phase sigma complexify)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity rankOne productCoeff tensorApply IsTraceClassChannel)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)
open QAlgorithms.Papers.Independent.Frontier30.P10 (WeylSystem)
open QAlgorithms.Papers.Independent.Frontier30.P14 (partialRight PureDensity)
open QAlgorithms.Papers.Independent.Claimed50.P35
(tracePair thermalInput thermalPurificationDensity vacuumChannel exchangeMatrix RealizedDensity)
open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)
open QAlgorithms.Papers.Independent.Information100.P49 (thermalEntropy)
/-! These source-specific adapters have distinct names because the accepted
same-short-name definitions do not have the same meaning. Information100.P56.delta
is a finite cq entropy difference; Claimed50.P44.reflect is a one-mode momentum
sign matrix, rather than the grouped q/p exchange used here. Claimed50.P19/P30
PhysicalCovariance use interleaved vacuum-I units; Frontier30.P14.CenteredGaussian
is an existential one-mode covariance predicate. Information100.P22/P39
coherentInformation use finite registers, whereas the present difference uses
extended nats entropies of full-Fock outputs. The underlying canonical sigma,
Weyl system, density, channel, and entropy definitions remain accepted imports. -/
/-- PDF pp.4-5: grouped physical commutation matrix, never the cocycle matrix. -/
def canonicalCommutation (s : ℕ) (hbar : ℝ) : Matrix (Phase s) (Phase s) ℝ := hbar • sigma s
/-- PDF p.6: reference coordinates exchange q and p, reversing the CCR form. -/
def referenceCoordinateSwap {s : ℕ} (z : Phase s → ℝ) : Phase s → ℝ :=
Sum.elim (fun j => z (Sum.inr j)) (fun j => z (Sum.inl j))
/-- PDF p.4: normalized regular irreducible Weyl system in physical units. -/
def physicalWeyl {I : Type} {s : ℕ} (hbar : ℝ)
(W : WeylSystem (Hilbert I) s) (z : Phase s → ℝ) : Hilbert I →L[ℂ] Hilbert I :=
(W.operator (fun j => Real.sqrt hbar * z j)).toLinearIsometry.toContinuousLinearMap
/-- PDF p.5: characteristic of a centered Gaussian, for either block ordering. -/
def centeredCharacteristic {F : Type} [Fintype F]
(alpha : Matrix F F ℝ) (z : F → ℝ) : ℂ :=
Complex.exp (-((dotProduct z (alpha.mulVec z) / 2 : ℝ) : ℂ))
/-- PDF p.5, (2.3): symmetry and the non-strict matrix uncertainty condition. -/
def GaussianCovariancePhysical {s : ℕ} (hbar : ℝ)
(alpha : Matrix (Phase s) (Phase s) ℝ) : Prop :=
alpha.transpose = alpha ∧
(complexify alpha - (Complex.I / 2) • complexify (canonicalCommutation s hbar)).PosSemidef
/-- PDF p.5: an actual normalized Gaussian density, with its specified covariance. -/
def CenteredGaussianWithCovariance {I : Type} {s : ℕ} (hbar : ℝ)
(W : WeylSystem (Hilbert I) s) (rho : State I)
(alpha : Matrix (Phase s) (Phase s) ℝ) : Prop :=
GaussianCovariancePhysical hbar alpha ∧ ∀ z,
tracePair rho.coefficients (operatorCoeff (physicalWeyl hbar W z)) =
centeredCharacteristic alpha z
/-- PDF pp.5-6: similarity diagonalization, without a normality assumption. -/
def SimilarityData {F : Type} [Fintype F] [DecidableEq F]
(M P : Matrix F F ℂ) (d : F → ℂ) : Prop :=
IsUnit P ∧ M = P * Matrix.diagonal d * P⁻¹
/-- PDF p.5: spectral matrix function in a similarity eigenbasis.
The choice is irrelevant on diagonalizable matrices, including repeated eigenvalues.
On a nondiagonalizable matrix the total extension is zero; the source targets
conclude diagonalizability and use this function only on diagonalizable matrices. -/
def similarityFunction {F : Type} [Fintype F] [DecidableEq F]
(M : Matrix F F ℂ) (f : ℂ → ℂ) : Matrix F F ℂ :=
if h : ∃ P d, SimilarityData M P d then
let P := h.choose
let d := h.choose_spec.choose
P * Matrix.diagonal (fun j => f (d j)) * P⁻¹
else 0
/-- PDF p.6: principal nonnegative spectral square root of a real matrix
similar to a nonnegative diagonal matrix. Entrywise real part recovers the real
matrix. It is not the singular-value square root of M* M. -/
def realSpectralSqrt {F : Type} [Fintype F] [DecidableEq F]
(M : Matrix F F ℝ) : Matrix F F ℝ :=
fun i j => (similarityFunction (complexify M) (fun z => (Real.sqrt z.re : ℂ)) i j).re
/-- PDF p.6, (2.6): g(abs M-I/2), using the source's similarity calculus. -/
def entropyMatrix {F : Type} [Fintype F] [DecidableEq F]
(M : Matrix F F ℂ) : Matrix F F ℂ :=
similarityFunction M (fun z => (thermalEntropy (‖z‖ - 1 / 2) : ℂ))
/-- PDF pp.6-7: the explicitly prescribed reflected purification covariance. -/
def purificationCovariance {s : ℕ} (hbar : ℝ)
(alpha : Matrix (Phase s) (Phase s) ℝ) :
Matrix (Phase s ⊕ Phase s) (Phase s ⊕ Phase s) ℝ :=
let A := (canonicalCommutation s hbar)⁻¹ * alpha
let B := canonicalCommutation s hbar * realSpectralSqrt (-(A ^ 2) - (1 / 4 : ℝ) • 1)
Matrix.fromBlocks alpha B (-B) alpha
/-- PDF p.7: the commutation matrix is diag(Delta,-Delta). -/
def reflectedDelta (s : ℕ) (hbar : ℝ) :
Matrix (Phase s ⊕ Phase s) (Phase s ⊕ Phase s) ℝ :=
Matrix.fromBlocks (canonicalCommutation s hbar) 0 0 (-canonicalCommutation s hbar)
/-- PDF p.6: actual tensor Weyl pairing, with the reference CCR reflected. -/
def jointCharacteristic {I J : Type} {s : ℕ} (hbar : ℝ)
(W : WeylSystem (Hilbert I) s) (V : WeylSystem (Hilbert J) s)
(X : Matrix (I × J) (I × J) ℂ) (z : (Phase s ⊕ Phase s) → ℝ) : ℂ :=
tracePair X (productCoeff
(operatorCoeff (physicalWeyl hbar W (fun i => z (Sum.inl i))))
(operatorCoeff (physicalWeyl hbar V (referenceCoordinateSwap (fun i => z (Sum.inr i))))))
/-- PDF p.7: realification on all complex matrices, not an alleged Hermitian algebra. -/
def realify {F : Type} (M : Matrix F F ℂ) : Matrix (F ⊕ F) (F ⊕ F) ℝ :=
Matrix.fromBlocks (fun i j => (M i j).re) (fun i j => -(M i j).im)
(fun i j => (M i j).im) (fun i j => (M i j).re)
/-- PDF pp.7-8: (q1;p1;q2;p2) to the realification order (q1;q2;p1;p2). -/
def shuffle {s : ℕ} : Phase s ⊕ Phase s → (Fin s ⊕ Fin s) ⊕ (Fin s ⊕ Fin s)
| Sum.inl (Sum.inl j) => Sum.inl (Sum.inl j)
| Sum.inl (Sum.inr j) => Sum.inr (Sum.inl j)
| Sum.inr (Sum.inl j) => Sum.inl (Sum.inr j)
| Sum.inr (Sum.inr j) => Sum.inr (Sum.inr j)
/-- PDF p.7: occupation-matrix covariance in grouped real coordinates. -/
def gaugeCovariance {s : ℕ} (hbar : ℝ) (N : Matrix (Fin s) (Fin s) ℂ) :
Matrix (Phase s) (Phase s) ℝ := hbar • realify (N + (1 / 2 : ℂ) • 1)
/-- PDF p.8, (3.8): the two-by-two block complex representative. -/
def gaugePurificationMatrix {s : ℕ} (N : Matrix (Fin s) (Fin s) ℂ) :
Matrix (Fin s ⊕ Fin s) (Fin s ⊕ Fin s) ℂ :=
let C := similarityFunction (N ^ 2 + N) (fun z => (Real.sqrt z.re : ℂ))
Matrix.fromBlocks (Complex.I • (N + (1 / 2 : ℂ) • 1)) C C
(-Complex.I • (N + (1 / 2 : ℂ) • 1))
/-- PDF p.9: thermal output occupation, with the p.10 identity endpoint. -/
def outputNumber (N k : ℝ) : ℝ :=
if k ≤ 1 then k ^ 2 * N else k ^ 2 * N + (k ^ 2 - 1)
/-- PDF p.9: the actual extended output on the normalized Schmidt purification. -/
def exchangeOutput (N k : ℝ) : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ :=
tensorApply (vacuumChannel k) (thermalPurificationDensity N)
/-- PDF p.10: coherent information in nats, as a difference of actual entropies.
Its use below includes conclusions that both extended entropies are finite. -/
def thermalCoherentInformationNats (N k : ℝ) : ℝ :=
(extendedEntropyNats (vacuumChannel k (thermalInput N))).toReal -
(extendedEntropyNats (exchangeOutput N k)).toReal
/-- PDF p.9: the full reflected output covariance, in subsystem block order. -/
def exchangeCovariance (hbar N k : ℝ) :
Matrix (Phase 1 ⊕ Phase 1) (Phase 1 ⊕ Phase 1) ℝ :=
let B := (k * Real.sqrt (N * (N + 1))) • canonicalCommutation 1 hbar
Matrix.fromBlocks ((hbar * (outputNumber N k + 1 / 2)) • 1) B (-B)
((hbar * (N + 1 / 2)) • 1)
/-- PDF pp.8-9: actual Fock Weyl pairing; the reference uses (p,q). -/
def jointFockCharacteristic (hbar : ℝ) (X : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ)
(z : (Phase 1 ⊕ Phase 1) → ℝ) : ℂ :=
let u : ℂ := (z (Sum.inl (Sum.inl 0)) : ℂ) +
Complex.I * (z (Sum.inl (Sum.inr 0)) : ℂ)
let v : ℂ := (z (Sum.inr (Sum.inr 0)) : ℂ) +
Complex.I * (z (Sum.inr (Sum.inl 0)) : ℂ)
tracePair X (productCoeff
(displacementMatrix (Complex.I * (Real.sqrt (hbar / 2) : ℂ) * u))
(displacementMatrix (Complex.I * (Real.sqrt (hbar / 2) : ℂ) * v)))
/-- PDF p.9: two-by-two complex matrix, reindexed into subsystem real order. -/
def oneModeRealification (M : Matrix (Fin 2) (Fin 2) ℂ) :
Matrix (Phase 1 ⊕ Phase 1) (Phase 1 ⊕ Phase 1) ℝ :=
let index : Fin 1 ⊕ Fin 1 → Fin 2 := Sum.elim (fun _ => 0) (fun _ => 1)
let C : Matrix (Fin 1 ⊕ Fin 1) (Fin 1 ⊕ Fin 1) ℂ := M.submatrix index index
(realify C).submatrix shuffle shuffle
/-! Definition sanity examples. No source theorem is proved in this draft. -/
example : thermalEntropy 0 = 0 := by simp [thermalEntropy]
example {s : ℕ} (z : Phase s → ℝ) : referenceCoordinateSwap (referenceCoordinateSwap z) = z := by
funext i
cases i <;> rfl
example (hbar : ℝ) : canonicalCommutation 1 hbar (Sum.inl 0) (Sum.inr 0) = hbar := by
simp [canonicalCommutation, sigma]
example {F : Type} [Fintype F] [DecidableEq F] (M : Matrix F F ℂ) :
similarityFunction M (fun _ => 0) = 0 := by
unfold similarityFunction
split <;> simp
example (N : ℝ) : outputNumber N 1 = N := by simp [outputNumber]
example (hbar : ℝ) : exchangeCovariance hbar 0 0 =
Matrix.fromBlocks ((hbar * (1 / 2)) • (1 : Matrix (Phase 1) (Phase 1) ℝ))
0 0 ((hbar * (1 / 2)) • (1 : Matrix (Phase 1) (Phase 1) ℝ)) := by
simp [exchangeCovariance, outputNumber]
end QAlgorithms.Papers.Independent.Support50.P29
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P29.CenteredGaussianWithCovariance
For any type , natural number , real , and real matrix indexed by two disjoint copies of , let . The supplied state consists of a complex matrix indexed by with the following properties: there are sequences such that is summable and ; for every finite and every , the number has zero imaginary part and nonnegative real part; and the real diagonal entries are summable with . The supplied assigns a surjective complex linear isometry to each real vector on the two copies, has , satisfies for , is continuous on each vector of , and has no closed invariant complex linear subspaces other than and . This definition requires , positive semidefiniteness of over , and, for every real coordinate vector , the identity
where is the coordinate unit vector in . The left side uses nested total infinite sums, with each nonsummable sum assigned zero. No countability assumption on or positivity assumption on is added; for , is the identity. The case is included; an empty cannot supply a state because its diagonal sum would be zero.
QAlgorithms.Papers.Independent.Support50.P29.GaussianCovariancePhysical
For every natural number , every real , and every real matrix indexed by two disjoint copies of , this defines the conjunction that and that the complex matrix
is positive semidefinite, where real matrix entries are embedded into . There is no positivity assumption on ; at , the condition is symmetry and positive semidefiniteness of . For , both requirements hold for the empty matrix.
QAlgorithms.Papers.Independent.Support50.P29.SimilarityData
For any finite index type equipped with decidable equality, complex matrices indexed by , and function , this defines the conjunction that is invertible and
No restriction is imposed on the diagonal values . The empty index type is permitted, in which case its unique square matrix is invertible and the equation holds.
QAlgorithms.Papers.Independent.Support50.P29.canonicalCommutation
For every natural number , including , and every real number , this defines the real matrix indexed by two disjoint copies of as
There is no positivity or nonzero assumption on ; when , this is the empty matrix.
QAlgorithms.Papers.Independent.Support50.P29.centeredCharacteristic
For any finite index type , real matrix indexed by , and real vector indexed by , this defines the complex number
No symmetry or positivity assumption is imposed on . If is empty, the value is .
QAlgorithms.Papers.Independent.Support50.P29.entropyMatrix
For any finite index type equipped with decidable equality and complex matrix indexed by , this defines zero if has no complex diagonalization. Otherwise, choose an invertible and diagonal values satisfying , and return
with the real values of embedded into . No positivity, symmetry, or restriction is assumed. The logarithm is the total real logarithm, with and for negative , so the formula also applies when . The empty index type is included.
QAlgorithms.Papers.Independent.Support50.P29.exchangeCovariance
For arbitrary real , let
This defines the real matrix indexed by two copies of , in each of which the first coordinate precedes the second, as
There are no sign assumptions on the three arguments. In particular, when , and the whole matrix is zero when .
QAlgorithms.Papers.Independent.Support50.P29.exchangeOutput
For arbitrary real , this defines a complex matrix indexed by . Put
and, for , put
The defined entries are
Thus the matrix map determined by these is applied to the first pair of indices of , leaving the second pair fixed. No restrictions are imposed on or . Division by zero is assigned , real square roots of negative numbers are , and each nonsummable complex infinite sum is assigned .
QAlgorithms.Papers.Independent.Support50.P29.gaugeCovariance
For every natural number , every real , and every complex matrix , this defines a real matrix indexed by by
All real and imaginary parts are entrywise. No condition is imposed on or on , including Hermitian symmetry or positivity. For the matrix is zero, and for it is the empty matrix.
QAlgorithms.Papers.Independent.Support50.P29.gaugePurificationMatrix
For every natural number and every complex matrix , this defines the complex block matrix
Here is constructed from as follows: if there exist an invertible complex matrix and complex numbers such that , one such pair is chosen and
with the real square roots embedded into ; if no such diagonalization exists, . In particular, a negative real part contributes square root . No Hermitian symmetry, positivity, or diagonalizability assumption is imposed on . The definition also includes , when all these matrices are empty.
QAlgorithms.Papers.Independent.Support50.P29.jointCharacteristic
For arbitrary types , a natural number including , a real number , Weyl systems on and on , an arbitrary complex matrix indexed by , and a real vector indexed by two copies of , this defines a complex number as follows. Each Weyl system consists of complex linear isometric bijections or , equals the identity at , is strongly continuous, satisfies
and has no closed invariant complex subspaces other than and the whole Hilbert space; the same requirements hold for . Write for the restrictions of to its first and second copies of , and let exchange their two coordinate groups, so and . With denoting the coordinate unit vector, the defined value is
These are nested total infinite sums, with a nonsummable complex sum assigned ; no density, trace-class, or convergence assumption is imposed on . There is no positivity assumption on : when , its real square root is , so both Weyl operators here are identities. For , the phase vectors have no coordinates and both operators are likewise identities.
QAlgorithms.Papers.Independent.Support50.P29.jointFockCharacteristic
For arbitrary real , an arbitrary complex matrix indexed by , and a real vector indexed by two copies of , write its coordinates in order as and put , . For and , define
The defined complex number is
No density, trace-class, or summability assumptions are imposed on ; nonsummable complex infinite sums are assigned . There is no positivity assumption on ; for , the square root is and both displacement matrices in this expression are identities.
QAlgorithms.Papers.Independent.Support50.P29.oneModeRealification
For an arbitrary complex matrix , write for . This defines the real matrix indexed by two copies of , ordered as first-copy first coordinate, first-copy second coordinate, second-copy first coordinate, second-copy second coordinate, by
It is obtained by first replacing each complex entry with its real multiplication matrix and arranging the coordinates in this order. No symmetry or positivity condition is imposed on .
QAlgorithms.Papers.Independent.Support50.P29.outputNumber
For arbitrary real numbers and , this defines
The branch condition concerns itself, rather than : all negative fall in the first branch. There are no nonnegativity assumptions on either argument. At the value is , and at it is .
QAlgorithms.Papers.Independent.Support50.P29.physicalWeyl
For any type , natural number , real number , and real vector on two disjoint copies of , let . The supplied is a family of surjective complex linear isometries of , with , satisfying
where label the first and second copies; for every , the map is continuous, and every closed complex linear subspace invariant under all is either or . This definition returns the bounded complex linear operator . No countability or nonemptiness assumption is imposed on , and no positivity assumption is imposed on : the real square root is zero for , so in that case the returned operator is the identity. The case is also included.
QAlgorithms.Papers.Independent.Support50.P29.purificationCovariance
For every natural number , real , and arbitrary real matrix indexed by two disjoint copies of , set
To form a real matrix , regard as complex; if for some invertible , choose such data and take the entrywise real part of ; if no such diagonalization exists, take . Real square roots of nonpositive numbers are zero. With , this definition returns the real block matrix
indexed by two disjoint copies of the index set of . No symmetry or positivity of , and no positivity or nonzero condition on , is assumed. Matrix inversion is total, with singular matrices assigned inverse zero; in particular, at the result is . The case gives the empty matrix.
QAlgorithms.Papers.Independent.Support50.P29.realSpectralSqrt
For any finite index type equipped with decidable equality and any real matrix indexed by , regard as a complex matrix. If it has a diagonalization with invertible, choose such data and define the returned real matrix entrywise by
If no complex diagonalization exists, return zero. Here the square root is the real square root, so an eigenvalue with nonpositive real part contributes zero. No symmetry, positivity, or diagonalizability assumption is imposed on ; the empty index type is permitted.
QAlgorithms.Papers.Independent.Support50.P29.realify
For any type , with no finiteness assumption, and any complex matrix indexed by , this defines the real matrix indexed by two disjoint copies of whose block form is
where real and imaginary parts are taken entry by entry. There are no symmetry or positivity assumptions on ; if is empty, the resulting matrix has no entries.
QAlgorithms.Papers.Independent.Support50.P29.referenceCoordinateSwap
For every natural number and every real coordinate vector indexed by two disjoint copies of , this defines the vector obtained by interchanging the two copies: its first-copy coordinate at is the second-copy coordinate of at , and its second-copy coordinate at is the first-copy coordinate of at . For , this is the unique vector on the empty index set.
QAlgorithms.Papers.Independent.Support50.P29.reflectedDelta
For every natural number , including , and every real , this defines the real block matrix
indexed by two disjoint copies of an index set that itself consists of two copies of . There is no positivity or nonzero assumption on ; at the matrix is zero, and at it is empty.
QAlgorithms.Papers.Independent.Support50.P29.shuffle
For every natural number , this defines a map from two copies of to two copies of , where itself is that same disjoint union. Label an index by , where record the outer and inner disjoint-union choices and . The map sends to : it fixes the choices and and exchanges with , always retaining . When , both indexing sets are empty and this is the empty map.
QAlgorithms.Papers.Independent.Support50.P29.similarityFunction
For any finite index type equipped with decidable equality, complex matrix indexed by , and arbitrary function , this defines a matrix as follows: if there exist an invertible complex matrix and values with , choose such a and then such diagonal values, and return
If no such diagonalization exists, return the zero matrix. No continuity or other regularity of is assumed. The construction also applies to the empty index type, where the returned matrix is the unique empty matrix.
QAlgorithms.Papers.Independent.Support50.P29.thermalCoherentInformationNats
For arbitrary real , this defines the real number using the following constructions. Set and , and set when and , and otherwise. For , define to be if and , to be if and , and to be otherwise. Then
For a complex matrix indexed by any type , let be its compression to a finite subset and define
where is the total continuous functional calculus used for the real logarithm. The notation means its real value if finite and if it is . The finite-subset supremum includes the empty subset. No density, positivity, finiteness, or convergence assumptions are imposed: divisions by zero, negative real square roots, and nonsummable complex sums use their total values .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.