Definitions for Min- and Max- Relative Entropies and a New Entanglement Monotone
DefinitionQAlgorithms_Papers_Independent_Support50_P21The objects the formalized statements of Min- and Max- Relative Entropies and a New Entanglement Monotone (arXiv:0803.2770) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Le: PDF pp.2–3: Loewner order, expressed by positivity of the difference.dMin: PDF p.3, (9): support overlap, including +infinity at zero overlap.unnormalizedPetz: PDF p.3, (11): unnormalized Petz expression. No division by Tr rho. Only orders in (0,1) are used; zero overlap gives +infinity.weakPositive: PDF pp.2–3: weak positive spectral projector includes the zero eigenspace.strictPositive: PDF pp.2,7: strict positive spectral projector excludes the zero eigenspace.largestEigenvalue: PDF p.3, (7): largest eigenvalue. Uses occur on nonempty finite spectra.thresholdSet: PDF p.3, (8): the positive scalar parameters with vanishing positive-part trace.unnormalizedRelativeBits: PDF p.5, (27): Umegaki entropy in bits, with its support guard. The spectral log on the kernel is harmless only in the guarded trace.traceSmoothingBall: PDF p.7, Definition 4: full trace-norm ball with the source trace cap.traceSmoothMax: PDF p.7, Definition 4: infimum smoothing in the FIRST argument only.traceSmoothMin: PDF p.7, Definition 4: supremum smoothing in the FIRST argument only.hMin: PDF p.3, (12): unconditional min entropy.hMax: PDF p.3, (13): the paper's rank-based max entropy.conditionalMin: PDF p.3, (14): reference-state conditional min entropy. Printed first line uses rho_B; corrected to sigma_B using the preceding substitution and the second line of (14). Independent moderation required.conditionalMax: PDF p.3, (15): reference-state conditional rank-based max entropy.mutualMin: PDF p.3, Definition 3: min mutual information with fixed original marginals.mutualMax: PDF p.3, Definition 3: max mutual information.smoothHMin: PDF pp.4,7: smooth unconditional min entropy with the paper's trace-norm ball.smoothHMax: PDF pp.4,7: smooth unconditional rank-based max entropy.smoothConditionalMin: PDF pp.4,7: smooth reference-state conditional min entropy.smoothConditionalMax: PDF pp.4,7: smooth reference-state conditional rank-based max entropy.smoothMutualMin: PDF pp.4,7: smoothing holds the ORIGINAL product of marginals fixed.smoothMutualMax: PDF pp.4,7: smooth max mutual information, with fixed comparison operator.chernoffCoefficient: PDF p.6: support-limit endpoint convention in the Chernoff coefficient. At s=0 the zero spectral power is the support projector, likewise at s=1.chernoff: PDF p.6: Chernoff distance; the theorem also asserts attainment.PositiveTensorBasis: PDF p.7, Definition 5: tensor register at positive length k+1.spectralMass: PDF p.7, (40)–(41): positive-part trace of the difference operator. Every length is k+1, and the threshold is 2^((k+1)*gamma).spectralSup: PDF p.7, (40): extended infimum of the limsup-zero thresholds.spectralInf: PDF p.7, (41): extended supremum of the liminf-one thresholds.maxAsymptotic: PDF p.8, (53): inner asymptotic limsup, taken before eps tends to zero.minAsymptotic: PDF p.9, (67): inner asymptotic liminf, taken before eps tends to zero.eMax: PDF p.6, (35): optimization over every separable density matrix.eRelative: PDF p.7, Lemma 13: relative entropy of entanglement.bundledMatrix: PDF p.6, (35): convert the accepted dependent two-party basis to a product basis.bundledEMax: PDF pp.6,12: Emax on accepted bundled states. Theorem 1 asserts finiteness on every density, so toReal here is never an infinity fallback in the LOCC claim.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P71
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P35
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
/-! Datta, arXiv:0803.2770v3. All logarithms are in bits. New definitions
are paper-local; accepted support projections, powers, channels, separability,
and adaptive finite LOCC are imported without modification.
Compilation is pending the separate mechanical handoff. -/
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- PDF pp.2–3: Loewner order, expressed by positivity of the difference. -/
def Le (A B : Mat I) : Prop := (B - A).PosSemidef
/-- PDF p.3, (9): support overlap, including +infinity at zero overlap. -/
def dMin (rho sigma : Mat I) : EReal := -elog (tr (support rho * sigma))
/-- PDF p.3, (11): unnormalized Petz expression. No division by Tr rho.
Only orders in (0,1) are used; zero overlap gives +infinity. -/
def unnormalizedPetz (alpha : ℝ) (rho sigma : Mat I) : EReal :=
(((alpha - 1)⁻¹ : ℝ) : EReal) *
elog (tr (supportPower rho alpha * supportPower sigma (1 - alpha)))
/-- PDF pp.2–3: weak positive spectral projector includes the zero eigenspace. -/
def weakPositive (A : Mat I) : Mat I :=
cfc (fun x : ℝ => if 0 ≤ x then 1 else 0) A
/-- PDF pp.2,7: strict positive spectral projector excludes the zero eigenspace. -/
def strictPositive (A : Mat I) : Mat I :=
cfc (fun x : ℝ => if 0 < x then 1 else 0) A
/-- PDF p.3, (7): largest eigenvalue. Uses occur on nonempty finite spectra. -/
def largestEigenvalue (A : Mat I) : ℝ := sSup (Set.range (ascEigenvalues A))
/-- PDF p.3, (8): the positive scalar parameters with vanishing positive-part trace. -/
def thresholdSet (rho sigma : Mat I) : Set ℝ :=
{t | 0 < t ∧ tr (weakPositive (rho - (t : ℂ) • sigma) *
(rho - (t : ℂ) • sigma)) = 0}
/-- PDF p.5, (27): Umegaki entropy in bits, with its support guard.
The spectral log on the kernel is harmless only in the guarded trace. -/
def unnormalizedRelativeBits (rho sigma : Mat I) : EReal :=
if SupportIncluded rho sigma then
(tr (rho * (cfc (fun x : ℝ => Real.logb 2 x) rho -
cfc (fun x : ℝ => Real.logb 2 x) sigma)) : EReal)
else ⊤
/-- PDF p.7, Definition 4: full trace-norm ball with the source trace cap. -/
def traceSmoothingBall (eps : ℝ) (rho : Mat I) : Set (Mat I) :=
{r | r.PosSemidef ∧ traceNorm (r - rho) ≤ eps ∧ tr r ≤ tr rho}
/-- PDF p.7, Definition 4: infimum smoothing in the FIRST argument only. -/
def traceSmoothMax (eps : ℝ) (rho sigma : Mat I) : EReal :=
sInf {v | ∃ r ∈ traceSmoothingBall eps rho, v = maxRelative r sigma}
/-- PDF p.7, Definition 4: supremum smoothing in the FIRST argument only. -/
def traceSmoothMin (eps : ℝ) (rho sigma : Mat I) : EReal :=
sSup {v | ∃ r ∈ traceSmoothingBall eps rho, v = dMin r sigma}
/-- PDF p.3, (12): unconditional min entropy. -/
def hMin (rho : Mat I) : EReal := -maxRelative rho 1
/-- PDF p.3, (13): the paper's rank-based max entropy. -/
def hMax (rho : Mat I) : EReal := -dMin rho 1
/-- PDF p.3, (14): reference-state conditional min entropy.
Printed first line uses rho_B; corrected to sigma_B using the preceding
substitution and the second line of (14). Independent moderation required. -/
def conditionalMin (rho : Mat (I × J)) (sigmaB : Mat J) : EReal :=
-maxRelative rho (Matrix.kronecker (1 : Mat I) sigmaB)
/-- PDF p.3, (15): reference-state conditional rank-based max entropy. -/
def conditionalMax (rho : Mat (I × J)) (sigmaB : Mat J) : EReal :=
-dMin rho (Matrix.kronecker (1 : Mat I) sigmaB)
/-- PDF p.3, Definition 3: min mutual information with fixed original marginals. -/
def mutualMin (rho : Mat (I × J)) : EReal :=
dMin rho (Matrix.kronecker (traceRight rho) (traceLeft rho))
/-- PDF p.3, Definition 3: max mutual information. -/
def mutualMax (rho : Mat (I × J)) : EReal :=
maxRelative rho (Matrix.kronecker (traceRight rho) (traceLeft rho))
/-- PDF pp.4,7: smooth unconditional min entropy with the paper's trace-norm ball. -/
def smoothHMin (eps : ℝ) (rho : Mat I) : EReal := -traceSmoothMax eps rho 1
/-- PDF pp.4,7: smooth unconditional rank-based max entropy. -/
def smoothHMax (eps : ℝ) (rho : Mat I) : EReal := -traceSmoothMin eps rho 1
/-- PDF pp.4,7: smooth reference-state conditional min entropy. -/
def smoothConditionalMin (eps : ℝ) (rho : Mat (I × J)) (sigmaB : Mat J) : EReal :=
-traceSmoothMax eps rho (Matrix.kronecker (1 : Mat I) sigmaB)
/-- PDF pp.4,7: smooth reference-state conditional rank-based max entropy. -/
def smoothConditionalMax (eps : ℝ) (rho : Mat (I × J)) (sigmaB : Mat J) : EReal :=
-traceSmoothMin eps rho (Matrix.kronecker (1 : Mat I) sigmaB)
/-- PDF pp.4,7: smoothing holds the ORIGINAL product of marginals fixed. -/
def smoothMutualMin (eps : ℝ) (rho : Mat (I × J)) : EReal :=
traceSmoothMin eps rho (Matrix.kronecker (traceRight rho) (traceLeft rho))
/-- PDF pp.4,7: smooth max mutual information, with fixed comparison operator. -/
def smoothMutualMax (eps : ℝ) (rho : Mat (I × J)) : EReal :=
traceSmoothMax eps rho (Matrix.kronecker (traceRight rho) (traceLeft rho))
/-- PDF p.6: support-limit endpoint convention in the Chernoff coefficient.
At s=0 the zero spectral power is the support projector, likewise at s=1. -/
def chernoffCoefficient (rho sigma : Mat I) (s : ℝ) : ℝ :=
tr (supportPower rho s * supportPower sigma (1 - s))
/-- PDF p.6: Chernoff distance; the theorem also asserts attainment. -/
def chernoff (rho sigma : Mat I) : EReal :=
-elog (sInf (chernoffCoefficient rho sigma '' Set.Icc (0 : ℝ) 1))
/-- PDF p.7, Definition 5: tensor register at positive length k+1. -/
abbrev PositiveTensorBasis (I : Type) (k : ℕ) := Fin (k + 1) → I
/-- PDF p.7, (40)–(41): positive-part trace of the difference operator.
Every length is k+1, and the threshold is 2^((k+1)*gamma). -/
def spectralMass (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k)) (gamma : ℝ) (k : ℕ) : ℝ :=
let A := rho k - (((2 : ℝ) ^ (((k + 1 : ℕ) : ℝ) * gamma)) : ℂ) • sigma k
tr (weakPositive A * A)
/-- PDF p.7, (40): extended infimum of the limsup-zero thresholds. -/
def spectralSup (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k)) : EReal :=
sInf {v : EReal | ∃ gamma : ℝ, v = (gamma : EReal) ∧
Filter.limsup (spectralMass rho sigma gamma) atTop = 0}
/-- PDF p.7, (41): extended supremum of the liminf-one thresholds. -/
def spectralInf (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k)) : EReal :=
sSup {v : EReal | ∃ gamma : ℝ, v = (gamma : EReal) ∧
Filter.liminf (spectralMass rho sigma gamma) atTop = 1}
/-- PDF p.8, (53): inner asymptotic limsup, taken before eps tends to zero. -/
def maxAsymptotic (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k)) (eps : ℝ) : EReal :=
Filter.limsup (fun k => (((1 / ((k + 1 : ℕ) : ℝ)) : ℝ) : EReal) *
traceSmoothMax eps (rho k) (sigma k)) atTop
/-- PDF p.9, (67): inner asymptotic liminf, taken before eps tends to zero. -/
def minAsymptotic (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k)) (eps : ℝ) : EReal :=
Filter.liminf (fun k => (((1 / ((k + 1 : ℕ) : ℝ)) : ℝ) : EReal) *
traceSmoothMin eps (rho k) (sigma k)) atTop
section Bipartite
variable [Nonempty I] [Nonempty J]
/-- PDF p.6, (35): optimization over every separable density matrix. -/
def eMax (rho : Mat (I × J)) : EReal :=
sInf {v | ∃ sigma : Mat (I × J), IsSeparableDensity sigma ∧ v = maxRelative rho sigma}
/-- PDF p.7, Lemma 13: relative entropy of entanglement. -/
def eRelative (rho : Mat (I × J)) : EReal :=
sInf {v | ∃ sigma : Mat (I × J), IsSeparableDensity sigma ∧ v = unnormalizedRelativeBits rho sigma}
end Bipartite
/-- PDF p.6, (35): convert the accepted dependent two-party basis to a product basis. -/
def bundledMatrix (s : FiniteState 2) :
Mat (Fin (s.dims 0) × Fin (s.dims 1)) :=
fun x y => s.rho (Fin.cases x.1 (Fin.cases x.2 (fun i => Fin.elim0 i)))
(Fin.cases y.1 (Fin.cases y.2 (fun i => Fin.elim0 i)))
/-- PDF pp.6,12: Emax on accepted bundled states. Theorem 1 asserts finiteness
on every density, so toReal here is never an infinity fallback in the LOCC claim. -/
def bundledEMax (s : FiniteState 2) : ℝ :=
letI : Nonempty (Fin (s.dims 0)) := ⟨⟨0, s.positive 0⟩⟩
letI : Nonempty (Fin (s.dims 1)) := ⟨⟨0, s.positive 1⟩⟩
(eMax (bundledMatrix s)).toReal
/-! Elementary sanity checks for the new definitions. -/
example : elog 0 = ⊥ := by simp [elog]
example : elog 1 = 0 := by simp [elog]
example : elog 2 = 1 := by norm_num [elog, Real.logb_self_eq_one]
example {rho : Mat I} : IsSubnormalized rho → rho.PosSemidef := fun h => h.1
example (A : Mat I) : Le A A := by
simpa only [Le, sub_self] using (Matrix.PosSemidef.zero : (0 : Mat I).PosSemidef)
example (rho : Mat I) : hMin rho = -maxRelative rho 1 := rfl
example (rho : Mat (I × J)) (sigma : Mat J) (eps : ℝ) :
smoothConditionalMax eps rho sigma =
-traceSmoothMin eps rho (Matrix.kronecker (1 : Mat I) sigma) := rfl
example (rho : Mat (I × J)) (eps : ℝ) :
smoothMutualMax eps rho =
traceSmoothMax eps rho (Matrix.kronecker (traceRight rho) (traceLeft rho)) := rfl
example (rho sigma : Mat I) :
chernoffCoefficient rho sigma 0 = tr (supportPower rho 0 * supportPower sigma 1) := by
simp only [chernoffCoefficient, sub_zero]
example (rho : Mat I) : dMin rho 0 = ⊤ := by
simp [dMin, tr, elog]
example (rho sigma : Mat I) (h : ¬ SupportIncluded rho sigma) :
unnormalizedRelativeBits rho sigma = ⊤ := by simp [unnormalizedRelativeBits, h]
example : strictPositive (0 : Mat I) = 0 := by
simp [strictPositive, cfc_zero]
example (rho : Mat I) (h : rho.PosSemidef) : rho ∈ traceSmoothingBall 0 rho := by
simp [traceSmoothingBall, h, traceNorm, cfc_zero]
example (rho : Mat I) : maxRelative rho rho ≤ 0 := by
unfold maxRelative
apply sInf_le
refine ⟨0, by simp, ?_⟩
simpa only [Real.rpow_zero, Complex.ofReal_one, one_smul, sub_self] using
(Matrix.PosSemidef.zero : (0 : Mat I).PosSemidef)
example (rho sigma : Mat I) (h : rho ∈ traceSmoothingBall 0 rho) :
traceSmoothMax 0 rho sigma ≤ maxRelative rho sigma := by
unfold traceSmoothMax
exact sInf_le ⟨rho, h, rfl⟩
example (rho sigma : Mat I) (h : rho ∈ traceSmoothingBall 0 rho) :
dMin rho sigma ≤ traceSmoothMin 0 rho sigma := by
unfold traceSmoothMin
exact le_sSup ⟨rho, h, rfl⟩
example (rho : Mat I) : 1 ∈ thresholdSet rho rho := by
simp [thresholdSet, tr]
example (s : FiniteState 2) (x y : Fin (s.dims 0) × Fin (s.dims 1)) :
bundledMatrix s x y = s.rho (Fin.cases x.1 (Fin.cases x.2 (fun i => Fin.elim0 i)))
(Fin.cases y.1 (Fin.cases y.2 (fun i => Fin.elim0 i))) := rfl
section Statements
variable [Nonempty I] [Nonempty J]
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P21.Le
For a finite index type and arbitrary complex square matrices indexed by , means that is positive semidefinite. Neither matrix is separately required to be Hermitian, positive semidefinite, or normalized. The index type may be empty.
QAlgorithms.Papers.Independent.Support50.P21.PositiveTensorBasis
For any type and natural number , this is the type of functions from to , equivalently ordered tuples of elements of . Thus gives tuples with one coordinate, rather than empty tuples; is not required to be finite or nonempty.
QAlgorithms.Papers.Independent.Support50.P21.bundledEMax
Given a two-party finite state with positive local dimensions and density matrix , first reindex its function basis as pairs, obtaining
Form the extended-real infimum
where ranges over finite convex combinations of tensor products of local positive semidefinite, trace-one matrices. The defined real number is the conversion of to : it equals when is finite and equals zero when or . The positive local dimensions supply the nonempty local basis sets required for the outer infimum.
QAlgorithms.Papers.Independent.Support50.P21.bundledMatrix
Given a two-party finite state , consisting of positive natural dimensions and a positive semidefinite, trace-one matrix indexed by functions with and , this defines a matrix indexed by pairs from those two sets. Its entries are
Thus the definition reindexes the two-coordinate function basis as a pair basis; both dimensions are required to be strictly positive by the data carried by .
QAlgorithms.Papers.Independent.Support50.P21.chernoff
For a finite basis type with decidable equality and arbitrary complex square matrices indexed by , define by real continuous functional calculus using the scalar function when and otherwise. In particular, uses value , rather than , at a zero eigenvalue. Set
where this infimum is taken in . The defined value is , regarded as an extended real number, if , and is if . Neither positivity nor trace normalization of either input matrix is assumed.
QAlgorithms.Papers.Independent.Support50.P21.chernoffCoefficient
For any finite type with decidable equality, possibly empty, arbitrary complex matrices on , and any real , define when and otherwise, using the total real-power operation. The real-valued coefficient is
where each matrix function is evaluated by the real continuous functional calculus. There are no positivity, normalization, or Hermitian assumptions on the matrices, and no restriction . Zero eigenvalues contribute zero even when the exponent is zero or negative; on a non-Hermitian matrix this functional calculus returns zero. For empty , the coefficient is zero.
QAlgorithms.Papers.Independent.Support50.P21.conditionalMax
For any finite types with decidable equality, possibly empty, any complex matrix on , and any complex matrix on , let be the orthogonal projection onto the range of . Define for , and for . The extended-real value defined here is
There are no positivity or normalization assumptions and no optimization over . In particular, the value is when .
QAlgorithms.Papers.Independent.Support50.P21.conditionalMin
For any finite types with decidable equality, possibly empty, any complex matrix indexed by , and any complex matrix indexed by , the definition assigns the extended-real value
where is the identity matrix on , and the infimum is taken in the extended reals. Neither matrix is required to be positive or normalized, and there is no optimization over . If the displayed set is empty, the value is .
QAlgorithms.Papers.Independent.Support50.P21.dMin
For a finite index type with decidable equality and arbitrary complex square matrices indexed by , let be the orthogonal projection onto the range of , and put . The extended-real quantity defined here is
No positivity or normalization is assumed. In particular, gives , including on an empty index type.
QAlgorithms.Papers.Independent.Support50.P21.eMax
For finite nonempty basis types with decidable equality and an arbitrary complex square matrix indexed by , this is the extended-real quantity
The outer infimum ranges over precisely the matrices admitting a finite decomposition
where every and is positive semidefinite with complex trace equal to one on and , respectively. Zero weights are permitted, while cannot satisfy the weight-sum condition. The matrix inequality in the inner infimum means positive semidefiniteness. No density-matrix assumption is made on ; an empty inner set has infimum , and an inner set unbounded below has infimum .
QAlgorithms.Papers.Independent.Support50.P21.eRelative
For finite nonempty basis types with decidable equality and an arbitrary complex square matrix indexed by , this is the extended-real infimum, over matrices of the form
with every positive semidefinite and of trace one, of the value
Here each matrix logarithm is formed by real continuous functional calculus using the total real function , including its value zero at . The trace expression is not divided by . No positivity or trace-normalization hypothesis is imposed on . The decomposition is finite, allows zero weights, and cannot have , because its weights must sum to one.
QAlgorithms.Papers.Independent.Support50.P21.hMax
For any finite type with decidable equality, possibly empty, and any complex matrix indexed by , let be the orthogonal projection onto the range of , and define when and otherwise. The extended-real value defined here is
No positivity or normalization of is assumed. In particular, this is when , including when is empty.
QAlgorithms.Papers.Independent.Support50.P21.hMin
For a finite index type with decidable equality and any complex square matrix indexed by , this defines
where the infimum is taken in the extended reals and each real is embedded there. No positivity or normalization is assumed. If the feasible set is empty, the value is ; if its infimum is , the value is . In particular, , including on an empty index type, gives .
QAlgorithms.Papers.Independent.Support50.P21.largestEigenvalue
For a finite index type with decidable equality and an arbitrary complex square matrix indexed by , this defines the real supremum of the values in its ascending eigenvalue list. For Hermitian , that list contains its real eigenvalues in ascending order, with multiplicities; for non-Hermitian , every entry is defined to be . Thus, in positive dimension the value is the greatest eigenvalue when is Hermitian and otherwise. If is empty, the list is empty and its real supremum is defined to be .
QAlgorithms.Papers.Independent.Support50.P21.maxAsymptotic
For a finite basis type with decidable equality, arbitrary matrix sequences indexed by , and any real , let
where . The defined value is
with both infima and the limit superior taken in the extended real numbers, and matrix inequalities meaning positive semidefiniteness. The smoothing matrices need not have trace one or be nonzero. Neither input sequence is assumed positive or normalized, and its terms need not be tensor powers. The parameter has no sign restriction; if it is negative, every smoothing ball is empty and the defined value is . The denominator is always positive, including at .
QAlgorithms.Papers.Independent.Support50.P21.minAsymptotic
For a finite basis type with decidable equality, arbitrary matrix sequences indexed by , and any real , let
For such an , let be the orthogonal projection onto the range of the linear operator represented by , and define
The defined value is
using extended-real suprema and limit inferior. No positivity or normalization of the input sequences, tensor-power relationship, or sign condition on is assumed. A negative makes every smoothing ball empty and gives value . Zero smoothing matrices are allowed; whenever zero belongs to a smoothing ball, its contribution to the inner supremum is . The denominator never vanishes.
QAlgorithms.Papers.Independent.Support50.P21.mutualMax
For any finite types with decidable equality, possibly empty, and any complex matrix on , define and . The extended-real value defined here is
No positivity or normalization of is assumed. The infimum is for an empty set and for a set unbounded below; in particular, gives .
QAlgorithms.Papers.Independent.Support50.P21.mutualMin
For any finite types with decidable equality, possibly empty, and any complex matrix on , define matrices by and . Let be the orthogonal projection onto the range of , and let for , with otherwise. The definition is
No positivity or normalization of is assumed. A nonpositive argument of , in particular the argument obtained when , gives the value .
QAlgorithms.Papers.Independent.Support50.P21.smoothConditionalMax
For any finite types with decidable equality, possibly empty, any real , any complex matrix on , and any complex matrix on , let consist of the positive semidefinite matrices satisfying and , where . Write for the orthogonal projection onto the range of , and define for , with otherwise. The definition is
with an extended-real supremum. No positivity or normalization of either supplied matrix is assumed, and is fixed. An empty smoothing set gives , including for ; inclusion of zero gives .
QAlgorithms.Papers.Independent.Support50.P21.smoothConditionalMin
For any finite types with decidable equality, possibly empty, any real , any complex matrix on , and any complex matrix on , let be the positive semidefinite matrices on satisfying and , where . The definition assigns
using extended-real infima. Neither nor is required to be positive or normalized, and remains fixed. An empty smoothing set gives , including whenever .
QAlgorithms.Papers.Independent.Support50.P21.smoothHMax
For any finite type with decidable equality, possibly empty, any real , and any complex matrix on , let consist of all positive semidefinite matrices satisfying and , where . For each , let be the orthogonal projection onto its range, and set for and otherwise. The definition is
with the supremum in the extended reals. No positivity or normalization of is required. An empty smoothing set gives , including for ; if zero belongs to the smoothing set, the value is .
QAlgorithms.Papers.Independent.Support50.P21.smoothHMin
For any finite type with decidable equality, possibly empty, any real , and any complex matrix on , put
The definition is the negative of the extended-real infimum, over , of . The matrix need not be positive or normalized, and zero matrices are permitted in the smoothing set. An empty smoothing set gives ; this occurs whenever .
QAlgorithms.Papers.Independent.Support50.P21.smoothMutualMax
For any finite types with decidable equality, possibly empty, any real , and any complex matrix on , define and . Let consist of all positive semidefinite matrices satisfying and , where . The definition is
with extended-real infima. The marginal matrices remain those of the original , which need not be positive or normalized. An empty smoothing set gives , including whenever .
QAlgorithms.Papers.Independent.Support50.P21.smoothMutualMin
For any finite types with decidable equality, possibly empty, any real , and any complex matrix on , define and . Let be the positive semidefinite matrices satisfying and , where . With the orthogonal projection onto the range of , and for and otherwise, the definition is
The supremum is extended-real, and the two marginal matrices are computed from the original throughout. No positivity or normalization of is assumed. An empty smoothing set gives , including for ; inclusion of zero gives .
QAlgorithms.Papers.Independent.Support50.P21.spectralInf
For a finite basis type with decidable equality and arbitrary matrix sequences indexed by , put
where real continuous functional calculus applies for and for . The defined value is the extended-real supremum
The inner limit inferior is taken in , with its total order-theoretic conventions; equality to one does not itself assert convergence to one. Only finite real thresholds enter the set, whose extended-real supremum is if it is empty and if it is unbounded above. No positivity, normalization, or tensor-power relationship is assumed.
QAlgorithms.Papers.Independent.Support50.P21.spectralMass
For a finite basis type with decidable equality, arbitrary sequences of complex square matrices indexed by , a real number , and a natural number , put
The defined real number is
where is formed by real continuous functional calculus. The scalar function includes zero in its nonnegative branch. The definition imposes no positivity, Hermiticity, normalization, or tensor-power relationship on the matrices, and uses matrices indexed by one-coordinate tuples.
QAlgorithms.Papers.Independent.Support50.P21.spectralSup
For a finite basis type with decidable equality and arbitrary matrix sequences indexed by , define, for each real ,
where real continuous functional calculus applies for and for . The defined value is the extended-real infimum
The inner limit superior is taken in , with its total order-theoretic conventions; the condition is equality of that limit superior to zero, rather than an assertion that the sequence converges to zero. Only finite real thresholds enter the set, whose extended-real infimum is if it is empty and if it is unbounded below. No state assumptions or tensor-power relationships are imposed.
QAlgorithms.Papers.Independent.Support50.P21.strictPositive
For a finite index type with decidable equality and any complex square matrix indexed by , this defines the real functional-calculus value
When is Hermitian, it is the orthogonal projection onto the sum of its eigenspaces with strictly positive eigenvalues; zero eigenvalues are excluded. No Hermitian hypothesis is imposed, and the functional calculus returns on non-Hermitian inputs. Its value at the zero matrix is .
QAlgorithms.Papers.Independent.Support50.P21.thresholdSet
For a finite index type with decidable equality and arbitrary complex square matrices indexed by , this defines the set
Here the indicator is applied by real functional calculus: on a Hermitian matrix it projects onto the nonnegative eigenspaces, including the kernel, and on a non-Hermitian matrix it returns . No positivity or normalization is assumed for or . Consequently, every positive for which is non-Hermitian satisfies the displayed trace condition; on an empty index type the set is all positive reals.
QAlgorithms.Papers.Independent.Support50.P21.traceSmoothMax
For a finite index type with decidable equality, any real , and arbitrary complex square matrices indexed by , this defines
Both infima are taken in the extended reals, with real embedded there; an empty infimum is . No positivity or normalization is assumed for , and zero smoothing matrices are allowed. In particular, if and satisfies the outer constraints, the value is .
QAlgorithms.Papers.Independent.Support50.P21.traceSmoothMin
For a finite index type with decidable equality, any real , and arbitrary complex square matrices indexed by , this defines the extended-real supremum, over all satisfying
of the following value: writing for the orthogonal projection onto the range of , it is when that trace is strictly positive, and otherwise. No positivity or normalization of is assumed. An empty outer supremum is ; if meets the constraints, the value is .
QAlgorithms.Papers.Independent.Support50.P21.traceSmoothingBall
For a finite index type with decidable equality, any real , and an arbitrary complex square matrix indexed by , this defines the set of complex square matrices satisfying
The square root is taken by real continuous functional calculus. Neither normalization nor positivity of is required, and is permitted when it meets the inequalities. The set is empty if , or if .
QAlgorithms.Papers.Independent.Support50.P21.unnormalizedPetz
For a finite index type with decidable equality, any real , and arbitrary complex square matrices indexed by , define by real continuous functional calculus using the scalar function that is at and otherwise, with real powers interpreted as total real powers. Put . The defined extended-real value is
There are no positivity, normalization, support, or parameter restrictions. Zero eigenvalues contribute even when the exponent is ; real functional calculus returns the zero matrix on non-Hermitian inputs. At , the reciprocal is , so the value is under the extended-real convention .
QAlgorithms.Papers.Independent.Support50.P21.unnormalizedRelativeBits
For a finite index type with decidable equality and arbitrary complex square matrices indexed by , this defines
with the finite real value embedded in the extended reals. Both matrix logarithms use real continuous functional calculus with the total scalar function , where and the real logarithm of a negative argument equals the logarithm of its absolute value; this calculus returns on non-Hermitian inputs. No positivity, nonzero, or normalization hypothesis is imposed, and there is no division by . In particular, gives .
QAlgorithms.Papers.Independent.Support50.P21.weakPositive
For a finite index type with decidable equality and any complex square matrix indexed by , this defines the real functional-calculus value
When is Hermitian, it is the orthogonal projection onto the sum of its eigenspaces with nonnegative eigenvalues, including its kernel. No Hermitian hypothesis is imposed; on non-Hermitian inputs the functional calculus returns . In particular, the value at the zero matrix is the identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.