Definitions for Separability Criterion for all bipartite Gaussian States
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P68The objects the formalized statements of Separability Criterion for all bipartite Gaussian States (arXiv:quant-ph/0104050) are stated in. Each was checked against the paper by a blind read-back and a moderator.
interleavedJ: PDF p.1, Eq.(1): J has J_XP=-1 and J_PX=+1.Uncertainty: PDF p.1: the uncertainty inequality A >= iJ, in Loewner order.IsCM: PDF p.1: a CM is real, symmetric and satisfies uncertainty.CovarianceBlocks: PDF p.1, Eq.(2): initial bipartite blocks with a rectangular C.covarianceBlockMatrix: PDF p.1, Eq.(2): the actual real symmetric-block assembly.realCovarianceSum: PDF p.1 [9]: direct sum, retaining the displayed bipartition.IsPhysicalCovariance: PDF p.1, Eq.(2): physical bipartite covariance; symmetry is explicit.DominatesLocalCovariances: PDF pp.1--2, Eq.(3): a local witness inequality, not separability.hermitianInverse: PDF p.4 [11]: spectral Moore--Penrose inverse on the Hermitian domain. Each eigenvalue t is sent to t^{-1}, with 0^{-1}=0. The off-domain zero is irrelevant to the Hermitian/PSD inputs in all statements.updateX: PDF p.2, Eq.(4): X=C(B-iJ)^+ C^T, including singular B-iJ.covarianceStep: PDF p.2, Eq.(4): nonphysical inputs give zero; physical inputs follow (4a,b). The output split is always n|n, even when the input split is n|m.tail: PDF p.2: tail g k is gamma_(k+1), constructed only from g=gamma_0.euclideanOpNorm: PDF p.4 [12]: Euclidean induced operator norm, not the matrix infinity norm.lowerWitness: PDF p.2, Eq.(6): the constructed acceptance witness L=A-||C||_op I.secondWitness: PDF p.2, corrected Eq.(5): B-C^T(A-U)^+C. Printed: B-C(A-U)^(-1)C^T. Changed: transpose the first C, not the last. Why: the print is ill-typed for n != m; Prop.1's proof and Appendix Lemma 1(iii) use this corrected Schur complement.averageWitness: PDF p.2, Cor.1: average using the constructed second witness.recoverFirst: PDF p.2 following Thm.1: descend from gamma_(k+1) to gamma_1, using Cor.1 at the preceding matrix at each recursive call.bipartiteGroupedIndex: PDF pp.1,4 [8]: accepted grouped Weyl coordinates to the source's two interleaved local quadrature lists; this is a permutation, without rescaling.HasGaussianCovariance: PDF pp.1,4 [8]: actual Gaussian density with symmetric physical covariance and arbitrary mean. The accepted Weyl convention has vacuum I and hbar=1. Summability guards the iterated trace/Weyl pairing. The defective frozen HasBipartiteMoments predicate is not used.SeparableCM: PDF pp.1--2: existence of an actual separable Gaussian density, independent of local witness inequality (3).momentumFlip: PDF pp.1--3: partial transposition reverses the second party's P coordinates.partialTransposeCovariance: PDF pp.1--3: covariance of the partially transposed Gaussian operator.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P47
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P10
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P19
/-!
Giedke--Kraus--Lewenstein--Cirac, arXiv:quant-ph/0104050v1, PDF pp.1--4.
Interleaved quadratures, doubled covariance, vacuum I. All inequalities below
are Loewner inequalities. The initial n|m matrix is separate from the n|n tail:
`tail g k` denotes gamma_(k+1). Full oscillator states and trace-norm separability
come from the pinned accepted library. No moments predicate from P47 is used.
Exact accepted coordinate, covariance, complexification and occupation definitions
are imported. Distinct Gaussian objects use descriptive names: accepted short-name
matches for Blocks, Physical, Dominates and step denote unrelated objects.
Compilation and independent moderation are pending the separate batch handoff.
-/
noncomputable section
open MeasureTheory Filter
open scoped BigOperators Topology ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P68
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P33
(State PureState IsSeparable IsBarycenter productCoeff)
open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)
open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)
open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
/-- PDF p.1, Eq.(1): J has J_XP=-1 and J_PX=+1. -/
def interleavedJ (n : ℕ) : Cov n :=
fun i j => if i.1 = j.1 then
if i.2 = j.2 then 0 else if i.2 = 0 then -1 else 1
else 0
/-- PDF p.1: the uncertainty inequality A >= iJ, in Loewner order. -/
def Uncertainty {n : ℕ} (A : Cov n) : Prop :=
(complexify A - Complex.I • complexify (interleavedJ n)).PosSemidef
/-- PDF p.1: a CM is real, symmetric and satisfies uncertainty. -/
def IsCM {n : ℕ} (A : Cov n) : Prop := A.transpose = A ∧ Uncertainty A
/-- PDF p.1, Eq.(2): initial bipartite blocks with a rectangular C. -/
structure CovarianceBlocks (n m : ℕ) where
A : Cov n
B : Cov m
C : Matrix (QuadratureIndex n) (QuadratureIndex m) ℝ
/-- PDF p.1, Eq.(2): the actual real symmetric-block assembly. -/
def covarianceBlockMatrix {n m : ℕ} (g : CovarianceBlocks n m) :
Matrix (QuadratureIndex n ⊕ QuadratureIndex m) (QuadratureIndex n ⊕ QuadratureIndex m) ℝ :=
Matrix.fromBlocks g.A g.C g.C.transpose g.B
/-- PDF p.1 [9]: direct sum, retaining the displayed bipartition. -/
def realCovarianceSum {I J : Type} [DecidableEq I] [DecidableEq J]
(A : Matrix I I ℝ) (B : Matrix J J ℝ) : Matrix (I ⊕ J) (I ⊕ J) ℝ :=
Matrix.fromBlocks A 0 0 B
/-- PDF p.1, Eq.(2): physical bipartite covariance; symmetry is explicit. -/
def IsPhysicalCovariance {n m : ℕ} (g : CovarianceBlocks n m) : Prop :=
(covarianceBlockMatrix g).transpose = covarianceBlockMatrix g ∧
(complexify (covarianceBlockMatrix g) -
Complex.I • complexify (realCovarianceSum (interleavedJ n) (interleavedJ m))).PosSemidef
/-- PDF pp.1--2, Eq.(3): a local witness inequality, not separability. -/
def DominatesLocalCovariances {n m : ℕ} (g : CovarianceBlocks n m) (U : Cov n) (V : Cov m) : Prop :=
(covarianceBlockMatrix g - realCovarianceSum U V).PosSemidef
/-- PDF p.4 [11]: spectral Moore--Penrose inverse on the Hermitian domain.
Each eigenvalue t is sent to t^{-1}, with 0^{-1}=0. The off-domain zero
is irrelevant to the Hermitian/PSD inputs in all statements. -/
def hermitianInverse {K I : Type} [RCLike K] [Fintype I] [DecidableEq I]
(A : Matrix I I K) : Matrix I I K :=
if h : A.IsHermitian then h.cfc (fun t : ℝ => t⁻¹) else 0
/-- PDF p.2, Eq.(4): X=C(B-iJ)^+ C^T, including singular B-iJ. -/
def updateX {n m : ℕ} (g : CovarianceBlocks n m) : Matrix (QuadratureIndex n) (QuadratureIndex n) ℂ :=
complexify g.C *
hermitianInverse (complexify g.B - Complex.I • complexify (interleavedJ m)) *
complexify g.C.transpose
/-- PDF p.2, Eq.(4): nonphysical inputs give zero; physical inputs follow (4a,b).
The output split is always n|n, even when the input split is n|m. -/
def covarianceStep {n m : ℕ} (g : CovarianceBlocks n m) : CovarianceBlocks n n :=
if IsPhysicalCovariance g then
{ A := g.A - (updateX g).map Complex.re
B := g.A - (updateX g).map Complex.re
C := -(updateX g).map Complex.im }
else { A := 0, B := 0, C := 0 }
/-- PDF p.2: tail g k is gamma_(k+1), constructed only from g=gamma_0. -/
def tail {n m : ℕ} (g : CovarianceBlocks n m) : ℕ → CovarianceBlocks n n
| 0 => covarianceStep g
| k + 1 => covarianceStep (tail g k)
/-- PDF p.4 [12]: Euclidean induced operator norm, not the matrix infinity norm. -/
def euclideanOpNorm {I J : Type} [Fintype I] [Fintype J] [DecidableEq I]
[DecidableEq J] (C : Matrix I J ℝ) : ℝ :=
‖(Matrix.toEuclideanLin C).toContinuousLinearMap‖
/-- PDF p.2, Eq.(6): the constructed acceptance witness L=A-||C||_op I. -/
def lowerWitness {n : ℕ} (g : CovarianceBlocks n n) : Cov n :=
g.A - euclideanOpNorm g.C • (1 : Cov n)
/-- PDF p.2, corrected Eq.(5): B-C^T(A-U)^+C.
Printed: B-C(A-U)^(-1)C^T. Changed: transpose the first C, not the last.
Why: the print is ill-typed for n != m; Prop.1's proof and Appendix
Lemma 1(iii) use this corrected Schur complement. -/
def secondWitness {n m : ℕ} (g : CovarianceBlocks n m) (U : Cov n) : Cov m :=
g.B - g.C.transpose * hermitianInverse (g.A - U) * g.C
/-- PDF p.2, Cor.1: average using the constructed second witness. -/
def averageWitness {n : ℕ} (g : CovarianceBlocks n n) (U : Cov n) : Cov n :=
(1 / 2 : ℝ) • (U + secondWitness g U)
/-- PDF p.2 following Thm.1: descend from gamma_(k+1) to gamma_1,
using Cor.1 at the preceding matrix at each recursive call. -/
def recoverFirst {n m : ℕ} (g : CovarianceBlocks n m) : ℕ → Cov n → Cov n
| 0, U => U
| k + 1, U => recoverFirst g k (averageWitness (tail g k) U)
/-- PDF pp.1,4 [8]: accepted grouped Weyl coordinates to the source's two
interleaved local quadrature lists; this is a permutation, without rescaling. -/
def bipartiteGroupedIndex {n m : ℕ} :
(Fin n ⊕ Fin m) ⊕ (Fin n ⊕ Fin m) → QuadratureIndex n ⊕ QuadratureIndex m
| Sum.inl (Sum.inl i) => Sum.inl (i, 0)
| Sum.inl (Sum.inr j) => Sum.inr (j, 0)
| Sum.inr (Sum.inl i) => Sum.inl (i, 1)
| Sum.inr (Sum.inr j) => Sum.inr (j, 1)
/-- PDF pp.1,4 [8]: actual Gaussian density with symmetric physical covariance
and arbitrary mean. The accepted Weyl convention has vacuum I and hbar=1.
Summability guards the iterated trace/Weyl pairing. The defective frozen
HasBipartiteMoments predicate is not used. -/
def HasGaussianCovariance {n m : ℕ}
(rho : State (Occupation (Fin n) × Occupation (Fin m))) (g : CovarianceBlocks n m)
(d : QuadratureIndex n ⊕ QuadratureIndex m → ℝ) : Prop :=
IsPhysicalCovariance g ∧ ∀ xi : (Fin n ⊕ Fin m) ⊕ (Fin n ⊕ Fin m) → ℝ,
(∀ u, Summable (fun v => rho.coefficients u v *
QAlgorithms.Papers.Independent.Claimed50.P47.bipartiteWeyl xi v u)) ∧
Summable (fun u => ∑' v, rho.coefficients u v *
QAlgorithms.Papers.Independent.Claimed50.P47.bipartiteWeyl xi v u) ∧
QAlgorithms.Papers.Independent.Claimed50.P47.bipartiteCharacteristic
rho.coefficients xi =
QAlgorithms.Papers.Independent.Claimed50.P47.gaussianStateCharacteristic
(d ∘ bipartiteGroupedIndex) ((covarianceBlockMatrix g).submatrix bipartiteGroupedIndex bipartiteGroupedIndex) xi
/-- PDF pp.1--2: existence of an actual separable Gaussian density,
independent of local witness inequality (3). -/
def SeparableCM {n m : ℕ} (g : CovarianceBlocks n m) : Prop :=
∃ (rho : State (Occupation (Fin n) × Occupation (Fin m))) (d : QuadratureIndex n ⊕ QuadratureIndex m → ℝ),
HasGaussianCovariance rho g d ∧ IsSeparable rho.coefficients
/-- PDF pp.1--3: partial transposition reverses the second party's P coordinates. -/
def momentumFlip (m : ℕ) : Cov m :=
Matrix.diagonal (fun i => if i.2 = 0 then 1 else -1)
/-- PDF pp.1--3: covariance of the partially transposed Gaussian operator. -/
def partialTransposeCovariance {n m : ℕ} (g : CovarianceBlocks n m) : CovarianceBlocks n m :=
{ A := g.A
B := momentumFlip m * g.B * momentumFlip m
C := g.C * momentumFlip m }
/-! Small definitional sanity checks; source results remain unproved. -/
example : interleavedJ 1 (0, 0) (0, 1) = -1 := by
norm_num [interleavedJ]
example : interleavedJ 1 (0, 1) (0, 0) = 1 := by
norm_num [interleavedJ]
example {n m : ℕ} (g : CovarianceBlocks n m) (i j : QuadratureIndex n) :
covarianceBlockMatrix g (Sum.inl i) (Sum.inl j) = g.A i j := rfl
example {K I : Type} [RCLike K] [Fintype I] [DecidableEq I]
(A : Matrix I I K) (h : A.IsHermitian) :
hermitianInverse A = h.cfc (fun t : ℝ => t⁻¹) := by
simp only [hermitianInverse, dif_pos h]
example {n m : ℕ} (g : CovarianceBlocks n m) (h : ¬ IsPhysicalCovariance g) :
covarianceStep g = { A := 0, B := 0, C := 0 } := by
simp only [covarianceStep, if_neg h]
example {n m : ℕ} (g : CovarianceBlocks n m) : tail g 0 = covarianceStep g := rfl
example {n m : ℕ} (g : CovarianceBlocks n m) (U : Cov n) : recoverFirst g 0 U = U := rfl
example {n m : ℕ} (i : Fin n) :
(bipartiteGroupedIndex (n := n) (m := m)) (Sum.inr (Sum.inl i)) = Sum.inl (i, 1) := rfl
example : momentumFlip 1 (0, 1) (0, 1) = -1 := by
norm_num [momentumFlip, Matrix.diagonal]
end QAlgorithms.Papers.Independent.Intakenext100.P68
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P68.CovarianceBlocks
For every pair of natural numbers , this structure consists of three arbitrary real matrices: a square matrix indexed by , a square matrix indexed by , and a rectangular matrix whose row indices are those of and whose column indices are those of . The structure imposes no symmetry, positivity, or other conditions. Either or may be zero.
QAlgorithms.Papers.Independent.Intakenext100.P68.DominatesLocalCovariances
For all natural numbers , every triple of real matrices of sizes , , and , and arbitrary real matrices and of sizes and , this predicate means precisely that is positive semidefinite. There are no additional conditions on , and either mode count may be zero.
QAlgorithms.Papers.Independent.Intakenext100.P68.HasGaussianCovariance
For any natural numbers , including zero, put , , and . The arguments are a state with coefficient kernel , an arbitrary real block triple of sizes , and a real vector on . Being a state means that there exist , indexed by , such that and ; every finite quadratic form , for finite and any , is real and nonnegative; and the real diagonal is summable with . Write
and let have entries , , and zero otherwise. Let send each first-copy mode index to its subsystem’s coordinate , and each second-copy mode index to its subsystem’s coordinate ; thus its domain is . Set , , and \Omega=\begin{psmallmatrix}0&I\\-I&0\end{psmallmatrix} on this grouped domain. For a real vector there, assign to each mode the complex number , and define
The predicate holds precisely when is symmetric, is positive semidefinite, and for every such real vector , each inner series is summable, the series of their sums over is summable, and
Empty mode sets contribute empty products equal to one.
QAlgorithms.Papers.Independent.Intakenext100.P68.IsCM
For every natural number and every real matrix indexed by , this predicate means that and that , viewed as a complex matrix, is positive semidefinite. Here is block diagonal with one block per mode. When , both conditions hold for the matrix with empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P68.IsPhysicalCovariance
For all natural numbers and every triple of real matrices of sizes , , and , respectively, this predicate means that satisfies and that the complex matrix is positive semidefinite. Each is block diagonal with copies of , and all real matrices in the complex expression are embedded entrywise into . Either mode count may be zero; when both are zero, both conditions hold.
QAlgorithms.Papers.Independent.Intakenext100.P68.SeparableCM
For any natural numbers , including zero, put , , and let be arbitrary real blocks on . This predicate says that there exist a state kernel on and a real vector on satisfying both the following Gaussian condition and the following approximation condition. For any label set used here, a state kernel means a kernel admitting
whose quadratic forms on every finite subset are real and nonnegative, and whose real diagonal is summable with sum one. For the Gaussian condition, set G=\begin{psmallmatrix}A&C\\C^{\mathsf T}&B\end{psmallmatrix}; require symmetric and , where has same-mode entries , , and all others zero. Reorder into by listing coordinate of both subsystems first and coordinate of both subsystems second, and put \Omega=\begin{psmallmatrix}0&I\\-I&0\end{psmallmatrix}. For every real vector in that order, set , define
and let be the product of these entries over all modes in both subsystems. Require every inner series and the outer series in to be summable, and require this sum to equal . The approximation condition is that for every real , there is a finite convex combination , where , , are state kernels on , and , such that . Here is the infimum, in , of over all summable expansions of the displayed kind; an empty collection of expansions has infimum . Zero mode counts are included, with empty products equal to one.
QAlgorithms.Papers.Independent.Intakenext100.P68.Uncertainty
For every natural number and every real matrix indexed by , this predicate means that the complex matrix is positive semidefinite, where real entries are embedded into and has zero entries between distinct modes and block within each mode. No separate hypothesis on is imposed. The definition includes , when the positive semidefiniteness condition holds on the empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P68.averageWitness
For every natural number , including zero, let . For arbitrary real matrices on , with , this defines
where if is not Hermitian, and otherwise applies the reciprocal function to its eigenvalues, assigning zero to a zero eigenvalue. The definition requires no symmetry, positivity, or uncertainty hypotheses.
QAlgorithms.Papers.Independent.Intakenext100.P68.bipartiteGroupedIndex
For any natural numbers , including zero, this defines a function from two disjoint copies of the disjoint union to
An index from the -element part of the first outer copy is sent to the first summand’s ; an index from the -element part of that copy is sent to the second summand’s . In the second outer copy, the corresponding images are respectively the first summand’s and the second summand’s . Cases involving an empty part have no indices to map.
QAlgorithms.Papers.Independent.Intakenext100.P68.covarianceBlockMatrix
For all natural numbers and every triple of real matrices with of size , of size , and of size , with each mode indexed by two coordinates, this defines the real matrix on the disjoint union of the two index sets. No conditions on these matrices are required, and zero-sized blocks are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P68.covarianceStep
For all natural numbers and every real matrix triple of sizes , , and , this defines a new triple with both mode counts equal to . Write for the block diagonal matrix with copies of . If is symmetric and is positive semidefinite after complexification, the returned triple is , where , real and imaginary parts are taken entrywise, and is zero for non-Hermitian and otherwise applies by Hermitian functional calculus, with . If that symmetry-and-positivity condition fails, all three returned matrices are zero. The definition includes zero mode counts and imposes no hypotheses on the input triple.
QAlgorithms.Papers.Independent.Intakenext100.P68.euclideanOpNorm
For any finite index types , each equipped with decidable equality, and any real matrix , this defines the real number
namely the operator norm of the continuous linear map from the Euclidean space to given by multiplication by . Empty index types are allowed; if either index type is empty, this norm is zero.
QAlgorithms.Papers.Independent.Intakenext100.P68.hermitianInverse
For any scalar type equipped with a real-or-complex scalar structure, any finite index type equipped with decidable equality, and any matrix over indexed by , this defines a matrix as follows: if is Hermitian, apply the real function to by Hermitian continuous functional calculus; otherwise return the zero matrix. The scalar reciprocal is total, with , so in the Hermitian branch zero eigenvalues are sent to zero and nonzero eigenvalues to their reciprocals. No invertibility assumption is required, and may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P68.interleavedJ
For every natural number , this defines a real matrix indexed by pairs . Its entries between distinct values of are zero, and its block for each fixed , in coordinate order , is . When , this is the matrix with empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P68.lowerWitness
For every natural number , including , let , and let be three arbitrary real matrices indexed by . This defines the real matrix
where is the operator norm of multiplication by between Euclidean spaces, and is the identity matrix. No symmetry, positivity, or uncertainty condition on is required.
QAlgorithms.Papers.Independent.Intakenext100.P68.momentumFlip
For every natural number , including zero, this defines the real diagonal matrix indexed by , with
Thus multiplication by this matrix preserves every coordinate labelled and negates every coordinate labelled ; for , it is the empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P68.partialTransposeCovariance
For all natural numbers , including zero, let , and let consist of arbitrary real matrices on , on , and indexed by . With the diagonal matrix assigning to coordinates and to coordinates , this defines the new block triple
The definition imposes no symmetry, positivity, or physicality hypotheses.
QAlgorithms.Papers.Independent.Intakenext100.P68.realCovarianceSum
For any types , each equipped with decidable equality, and arbitrary real matrices indexed by and indexed by , this defines the block diagonal matrix indexed by the disjoint union . Neither index type is required to be finite or nonempty.
QAlgorithms.Papers.Independent.Intakenext100.P68.recoverFirst
For all natural numbers , let , and take an arbitrary block triple , with on , on , and indexed by . For a real square matrix , write when is not Hermitian, and otherwise let apply the reciprocal function to its eigenvalues with . Define by , , and all other entries zero. A triple , whose two block sizes may differ, is called physical here when
where real matrices are embedded entrywise into complex matrices. Define to be the zero triple if this physicality condition fails; otherwise, with
define . Put and , and write . The declaration defines a function of a natural number and an arbitrary real matrix on by
All zero dimensions and all natural iteration counts are included, and no physicality assumption on the initial is required.
QAlgorithms.Papers.Independent.Intakenext100.P68.secondWitness
For all natural numbers , including zero, put . Given arbitrary real matrices on , on , with rows in and columns in , grouped as , and any real matrix on , this defines
Here is zero when is not Hermitian; when is Hermitian, is obtained by applying the scalar function to its spectrum, with . Thus is defined even for singular matrices. No physicality or positivity assumption is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P68.tail
For all natural numbers and every real matrix triple of sizes , , and , this defines a sequence of triples with both mode counts equal to by and for every natural number ; thus applies the following rule times. For a triple with mode counts , let be block diagonal with copies of . If is symmetric and its complexification minus is positive semidefinite, set , where , real matrices are complexified in this expression, and is zero for non-Hermitian and otherwise applies the reciprocal function to its eigenvalues by Hermitian functional calculus, sending zero to zero. If the condition fails, returns three zero matrices. All natural indices and zero mode counts are included, with no assumptions on the initial triple.
QAlgorithms.Papers.Independent.Intakenext100.P68.updateX
For all natural numbers and every triple of real matrices of sizes , , and , this defines the complex matrix , where real matrices are embedded entrywise into , is block diagonal with copies of , and is zero when is not Hermitian and otherwise is obtained by Hermitian functional calculus from , with . The definition does not use and requires no positivity or invertibility assumptions. Zero mode counts are included; in particular, gives the zero matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.