Definitions for Extremality of Gaussian quantum states
DefinitionQAlgorithms_Papers_Independent_Support50_P14The objects the formalized statements of Extremality of Gaussian quantum states (arXiv:quant-ph/0509154) are stated in. Each was checked against the paper by a blind read-back and a moderator.
OscillatorKernel: PDF p.1: coefficients on the completed oscillator Hilbert space.InterleavedQuadrature: PDF p.1: interleaved canonical coordinates, second coordinate 0=Q, 1=P.OscillatorCovariance: PDF p.1: real symmetric covariance matrices are required in CompleteMoments.oscillatorWeylKernel: PDF p.1, (1): bounded Weyl kernel exp(i xi.R), with hbar=1.oscillatorCharacteristic: PDF p.1: trace-class/bounded pairing, multiplication before diagonal trace.OscillatorCharacteristicSummable: Genuine convergence guards for the two iterated sums in the Weyl pairing.meanForm: PDF p.1: xi dot d.varianceForm: PDF p.1: the full covariance quadratic form.photonEnergy: PDF p.1: extended mean photon number, on positive densities. The finite zero-point term does not affect finiteness.CompleteMoments: PDF p.1, moments preceding (1): finite oscillator energy and all directional first/second derivatives of the actual characteristic function. Symmetry is explicit: directional quadratic forms alone cannot determine an antisymmetric part. For a density these derivatives are precisely the finite symmetric quadrature moments, including the subtraction of d d^T from the second moment.GaussianAt: PDF p.1, (1): Gaussianity of this density with these actual moments. The density condition is supplied by State, never by a covariance-only surrogate.InDomain: PDF p.2: no cap means all densities. A finite cap e bounds mean photon number by e times the number of modes. These compatible compact sublevels scale on tensor powers; the centering and passive copy mixers used in the proof and their single-copy marginals remain within the respective sublevels.MultipartiteOscillatorFunctional: PDF pp.1--2: the functional is a family BEFORE choosing any input. Arbitrary finite mode labels and ownership maps support copies and regrouping. Values on arrays outside the specified density domain are unused.oscillatorTensor: PDF p.2: the actual tensor product, regrouped into A+B oscillator modes.marginalFirst: PDF p.2: trace out precisely the B modes, retaining all A coherences.marginalSecond: PDF p.2: trace out precisely the A modes.localKernel: PDF pp.1--3: independent bounded unitaries at all parties, allowing arbitrary mixing of all modes/copies held by that party. A party's Hilbert space is the completed l2 of its entire occupation basis.StronglySuperadditive: PDF p.2, definition of strong super-additivity: BOTH the inequality on correlated inputs and equality on arbitrary product densities. Restricted-domain clauses are used only when all states in the clause belong to that domain.LocallyInvariant: PDF pp.1--2: invariance under independent local bounded unitaries and ownership-preserving mode relabelings. No Gaussification or entropy conclusion is included among these purely algebraic hypotheses.OscillatorTraceContinuous: PDF p.2: epsilon-delta continuity in full TRACE norm, relative to the normalized density domain.TraceLowerSemicontinuous: PDF p.2: lower semicontinuity, with open strict superlevel sets in the relative trace-norm topology. This is distinct from continuity.hadamardEntry: PDF p.2, (5): H=((1,1),(1,-1)) tensor m, in binary tensor order.mixedArgument: PDF p.2, (5)--(7): the contravariant Weyl argument of the real passive mixer.copiesKernel: PDF p.2, (3): actual independent copies of the given density, regrouped by mode.copyMixerKernel: PDF p.2: identical copy mixer at each oscillator site.insertCopy: Reinsert the retained copy and every discarded copy at their actual labels.copyMarginal: PDF p.2: computed marginal, tracing out all copy labels except k.positiveEntries: PDF p.2, (6)--(8): positive entries, either all or half the row.counterexampleVector: PDF p.3, (iv): the explicit normalized Schmidt vector on TWO complete modes.counterexampleState: PDF p.3, (iv): actual rank-one density coefficients, not its covariance.negativityExampleCovariance: PDF p.3: the explicit state's covariance in the p.1 vacuum-I convention.transposeFirst: PDF p.3: partial transpose of the first complete oscillator mode.logarithmicNegativity: PDF p.3: E_N=log_2 ||rho^(T_A)||_1. Every use below concludes finiteness and norm>=1, before converting the extended norm to a real logarithm.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P14
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P47
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P20
/-!
Wolf--Giedke--Cirac, arXiv:quant-ph/0509154v1, PDF pp.1--4.
Full oscillator Hilbert spaces have countable occupation bases, without a cutoff.
Coordinates (mode,0),(mode,1) are interleaved Q,P; covariance is the full
anticommutator, vacuum I. No Gaussian-limit or entropy identity is an axiom of
any functional. Operational applications not yet represented are in HARD.md.
Compilation is pending the separate batch handoff.
-/
noncomputable section
open Filter
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Support50.P14
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClass traceSize)
open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)
open QAlgorithms.Papers.Independent.Frontier30.P14
(unitaryCoeff conjugateKernel boundedUnitaryConjugation)
open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
/-!
Reuse audit (repair): Occupation is the accepted full oscillator label type;
Copies Bool m is the accepted register-power type specialized to binary labels.
No local aliases redeclare either one. The remaining descriptive names below
retain the previous bodies and distinguish incompatible accepted short names:
P32.Kernel is a classical box, P10.Phase uses grouped Fin n indices,
P04.Covariance fixes Fin n, Information100.P34.weyl is a finite clock/shift,
P39.characteristic takes a one-mode bounded operator, P19.CharacteristicSummable
fixes Fin n and one Weyl argument, P30.Functional has finite-dimensional inputs,
Information100.P21.tensor takes two vectors, Next46.P27.TraceContinuous maps INTO
one-mode operators, and Gap48.P13.counterexampleCovariance is a different complex
six-by-six matrix. ASSESSMENT.json records each exact declaration separately.
The defective P47.HasBipartiteMoments is never used.
-/
/-- PDF p.1: coefficients on the completed oscillator Hilbert space. -/
abbrev OscillatorKernel (I : Type) := Matrix (Occupation I) (Occupation I) ℂ
/-- PDF p.1: interleaved canonical coordinates, second coordinate 0=Q, 1=P. -/
abbrev InterleavedQuadrature (I : Type) := I × Fin 2
/-- PDF p.1: real symmetric covariance matrices are required in CompleteMoments. -/
abbrev OscillatorCovariance (I : Type) := Matrix (InterleavedQuadrature I) (InterleavedQuadrature I) ℝ
/-- PDF p.1, (1): bounded Weyl kernel exp(i xi.R), with hbar=1. -/
def oscillatorWeylKernel {I : Type} [Fintype I] (xi : InterleavedQuadrature I → ℝ) : OscillatorKernel I :=
fun u v => ∏ j, displacementMatrix
((-(xi (j, 1) : ℂ) + Complex.I * (xi (j, 0) : ℂ)) / (Real.sqrt 2 : ℂ))
(u j) (v j)
/-- PDF p.1: trace-class/bounded pairing, multiplication before diagonal trace. -/
def oscillatorCharacteristic {I : Type} [Fintype I] (rho : OscillatorKernel I) (xi : InterleavedQuadrature I → ℝ) : ℂ :=
∑' u, ∑' v, rho u v * oscillatorWeylKernel xi v u
/-- Genuine convergence guards for the two iterated sums in the Weyl pairing. -/
def OscillatorCharacteristicSummable {I : Type} [Fintype I] (rho : OscillatorKernel I) : Prop :=
∀ xi : InterleavedQuadrature I → ℝ,
(∀ u, Summable (fun v => rho u v * oscillatorWeylKernel xi v u)) ∧
Summable (fun u => ∑' v, rho u v * oscillatorWeylKernel xi v u)
/-- PDF p.1: xi dot d. -/
def meanForm {I : Type} [Fintype I] (d xi : InterleavedQuadrature I → ℝ) : ℝ :=
∑ a, xi a * d a
/-- PDF p.1: the full covariance quadratic form. -/
def varianceForm {I : Type} [Fintype I] (gamma : OscillatorCovariance I) (xi : InterleavedQuadrature I → ℝ) : ℝ :=
∑ a, ∑ b, xi a * gamma a b * xi b
/-- PDF p.1: extended mean photon number, on positive densities.
The finite zero-point term does not affect finiteness. -/
def photonEnergy {I : Type} [Fintype I] (rho : OscillatorKernel I) : ℝ≥0∞ :=
∑' u : Occupation I, ENNReal.ofReal (∑ j, (u j : ℝ)) * ENNReal.ofReal (rho u u).re
/-- PDF p.1, moments preceding (1): finite oscillator energy and all directional
first/second derivatives of the actual characteristic function. Symmetry is
explicit: directional quadratic forms alone cannot determine an antisymmetric
part. For a density these derivatives are precisely the finite symmetric
quadrature moments, including the subtraction of d d^T from the second moment. -/
def CompleteMoments {I : Type} [Fintype I] (rho : OscillatorKernel I)
(d : InterleavedQuadrature I → ℝ) (gamma : OscillatorCovariance I) : Prop :=
photonEnergy rho < ⊤ ∧ gamma.transpose = gamma ∧ OscillatorCharacteristicSummable rho ∧
∀ xi : InterleavedQuadrature I → ℝ,
HasDerivAt (fun t : ℝ => oscillatorCharacteristic rho (t • xi))
(Complex.I * (meanForm d xi : ℂ)) 0 ∧
HasDerivAt (deriv (fun t : ℝ => oscillatorCharacteristic rho (t • xi)))
(((-varianceForm gamma xi / 2 - (meanForm d xi) ^ 2 : ℝ) : ℂ)) 0
/-- PDF p.1, (1): Gaussianity of this density with these actual moments.
The density condition is supplied by State, never by a covariance-only surrogate. -/
def GaussianAt {I : Type} [Fintype I] (rho : OscillatorKernel I)
(d : InterleavedQuadrature I → ℝ) (gamma : OscillatorCovariance I) : Prop :=
CompleteMoments rho d gamma ∧ ∀ xi : InterleavedQuadrature I → ℝ,
oscillatorCharacteristic rho xi = Complex.exp
(((-varianceForm gamma xi / 4 : ℝ) : ℂ) + Complex.I * (meanForm d xi : ℂ))
/-- PDF p.2: no cap means all densities. A finite cap e bounds mean photon
number by e times the number of modes. These compatible compact sublevels
scale on tensor powers; the centering and passive copy mixers used in the proof
and their single-copy marginals remain within the respective sublevels. -/
def InDomain {I : Type} [Fintype I] (cap : Option ℝ) (rho : OscillatorKernel I) : Prop :=
IsDensity rho ∧ match cap with
| none => True
| some e => photonEnergy rho ≤ ENNReal.ofReal (e * Fintype.card I)
/-- PDF pp.1--2: the functional is a family BEFORE choosing any input.
Arbitrary finite mode labels and ownership maps support copies and regrouping.
Values on arrays outside the specified density domain are unused. -/
abbrev MultipartiteOscillatorFunctional (M : ℕ) :=
(I : Type) → [Fintype I] → (I → Fin M) → OscillatorKernel I → ℝ
/-- PDF p.2: the actual tensor product, regrouped into A+B oscillator modes. -/
def oscillatorTensor {A B : Type} (rho : OscillatorKernel A) (sigma : OscillatorKernel B) : OscillatorKernel (A ⊕ B) :=
fun u v => rho (u ∘ Sum.inl) (v ∘ Sum.inl) * sigma (u ∘ Sum.inr) (v ∘ Sum.inr)
/-- PDF p.2: trace out precisely the B modes, retaining all A coherences. -/
def marginalFirst {A B : Type} (rho : OscillatorKernel (A ⊕ B)) : OscillatorKernel A :=
fun u v => ∑' w : Occupation B, rho (Sum.elim u w) (Sum.elim v w)
/-- PDF p.2: trace out precisely the A modes. -/
def marginalSecond {A B : Type} (rho : OscillatorKernel (A ⊕ B)) : OscillatorKernel B :=
fun u v => ∑' w : Occupation A, rho (Sum.elim w u) (Sum.elim w v)
/-- PDF pp.1--3: independent bounded unitaries at all parties, allowing arbitrary
mixing of all modes/copies held by that party. A party's Hilbert space is the
completed l2 of its entire occupation basis. -/
def localKernel {M : ℕ} {I : Type} [Fintype I] (owner : I → Fin M)
(U : (p : Fin M) → Hilbert (Occupation {j : I // owner j = p}) ≃ₗᵢ[ℂ]
Hilbert (Occupation {j : I // owner j = p})) : OscillatorKernel I :=
fun u v => ∏ p, unitaryCoeff (U p) (fun j => u j.val) (fun j => v j.val)
/-- PDF p.2, definition of strong super-additivity: BOTH the inequality on
correlated inputs and equality on arbitrary product densities. Restricted-domain
clauses are used only when all states in the clause belong to that domain. -/
def StronglySuperadditive {M : ℕ} (cap : Option ℝ) (f : MultipartiteOscillatorFunctional M) : Prop :=
(∀ (A B : Type) [Fintype A] [Fintype B]
(a : A → Fin M) (b : B → Fin M) (rho : OscillatorKernel (A ⊕ B)),
InDomain cap rho → InDomain cap (marginalFirst rho) →
InDomain cap (marginalSecond rho) →
f A a (marginalFirst rho) + f B b (marginalSecond rho) ≤
f (A ⊕ B) (Sum.elim a b) rho) ∧
(∀ (A B : Type) [Fintype A] [Fintype B]
(a : A → Fin M) (b : B → Fin M) (rho : OscillatorKernel A) (sigma : OscillatorKernel B),
InDomain cap rho → InDomain cap sigma → InDomain cap (oscillatorTensor rho sigma) →
f (A ⊕ B) (Sum.elim a b) (oscillatorTensor rho sigma) = f A a rho + f B b sigma)
/-- PDF pp.1--2: invariance under independent local bounded unitaries and
ownership-preserving mode relabelings. No Gaussification or entropy conclusion
is included among these purely algebraic hypotheses. -/
def LocallyInvariant {M : ℕ} (cap : Option ℝ) (f : MultipartiteOscillatorFunctional M) : Prop :=
(∀ (I : Type) [Fintype I] (owner : I → Fin M) (rho : OscillatorKernel I)
(U : (p : Fin M) → Hilbert (Occupation {j : I // owner j = p}) ≃ₗᵢ[ℂ]
Hilbert (Occupation {j : I // owner j = p})),
InDomain cap rho → InDomain cap (conjugateKernel (localKernel owner U) rho) →
f I owner (conjugateKernel (localKernel owner U) rho) = f I owner rho) ∧
(∀ (I J : Type) [Fintype I] [Fintype J] (e : I ≃ J)
(owner : J → Fin M) (rho : OscillatorKernel I), InDomain cap rho →
InDomain cap (fun u v => rho (u ∘ e) (v ∘ e)) →
f J owner (fun u v => rho (u ∘ e) (v ∘ e)) = f I (owner ∘ e) rho)
/-- PDF p.2: epsilon-delta continuity in full TRACE norm, relative to the
normalized density domain. -/
def OscillatorTraceContinuous {M : ℕ} (cap : Option ℝ) (f : MultipartiteOscillatorFunctional M) : Prop :=
∀ (I : Type) [Fintype I] (owner : I → Fin M) (rho : OscillatorKernel I),
InDomain cap rho → ∀ epsilon : ℝ, 0 < epsilon →
∃ delta : ℝ, 0 < delta ∧ ∀ sigma : OscillatorKernel I, InDomain cap sigma →
traceSize (sigma - rho) < ENNReal.ofReal delta →
|f I owner sigma - f I owner rho| < epsilon
/-- PDF p.2: lower semicontinuity, with open strict superlevel sets in the
relative trace-norm topology. This is distinct from continuity. -/
def TraceLowerSemicontinuous {M : ℕ} (cap : Option ℝ) (f : MultipartiteOscillatorFunctional M) : Prop :=
∀ (I : Type) [Fintype I] (owner : I → Fin M) (rho : OscillatorKernel I),
InDomain cap rho → ∀ a : ℝ, a < f I owner rho →
∃ delta : ℝ, 0 < delta ∧ ∀ sigma : OscillatorKernel I, InDomain cap sigma →
traceSize (sigma - rho) < ENNReal.ofReal delta → a < f I owner sigma
/-- PDF p.2, (5): H=((1,1),(1,-1)) tensor m, in binary tensor order. -/
def hadamardEntry (m : ℕ) (k l : Copies Bool m) : ℝ :=
(-1 : ℝ) ^ (∑ j : Fin m, if k j = true ∧ l j = true then 1 else 0)
/-- PDF p.2, (5)--(7): the contravariant Weyl argument of the real passive mixer. -/
def mixedArgument (m : ℕ) (xi : InterleavedQuadrature (Copies Bool m) → ℝ) : InterleavedQuadrature (Copies Bool m) → ℝ :=
fun l => ∑ k : Copies Bool m, hadamardEntry m k l.1 /
Real.sqrt ((2 : ℝ) ^ m) * xi (k, l.2)
/-- PDF p.2, (3): actual independent copies of the given density, regrouped by mode. -/
def copiesKernel {I : Type} (m : ℕ) (rho : OscillatorKernel I) : OscillatorKernel (I × Copies Bool m) :=
fun u v => ∏ k : Copies Bool m, rho (fun j => u (j, k)) (fun j => v (j, k))
/-- PDF p.2: identical copy mixer at each oscillator site. -/
def copyMixerKernel {I : Type} [Fintype I] (m : ℕ)
(U : Hilbert (Occupation (Copies Bool m)) ≃ₗᵢ[ℂ] Hilbert (Occupation (Copies Bool m))) :
OscillatorKernel (I × Copies Bool m) :=
fun u v => ∏ j, unitaryCoeff U (fun k => u (j, k)) (fun k => v (j, k))
/-- Reinsert the retained copy and every discarded copy at their actual labels. -/
def insertCopy {I : Type} {m : ℕ} (k : Copies Bool m) (u : Occupation I)
(rest : Occupation (I × {l : Copies Bool m // l ≠ k})) : Occupation (I × Copies Bool m) :=
fun p => if h : p.2 = k then u p.1 else rest (p.1, ⟨p.2, h⟩)
/-- PDF p.2: computed marginal, tracing out all copy labels except k. -/
def copyMarginal {I : Type} {m : ℕ} (rho : OscillatorKernel (I × Copies Bool m)) (k : Copies Bool m) : OscillatorKernel I :=
fun u v => ∑' rest : Occupation (I × {l : Copies Bool m // l ≠ k}),
rho (insertCopy k u rest) (insertCopy k v rest)
/-- PDF p.2, (6)--(8): positive entries, either all or half the row. -/
def positiveEntries (m : ℕ) (k : Copies Bool m) : ℕ :=
if k = (fun _ => false) then 2 ^ m else 2 ^ m / 2
/-- PDF p.3, (iv): the explicit normalized Schmidt vector on TWO complete modes. -/
def counterexampleVector (u : Occupation (Fin 2)) : ℂ :=
if u = (fun _ => 0) then (Real.sqrt 15 / 4 : ℝ)
else if u = (fun _ => 1) then (1 / 4 : ℝ) else 0
/-- PDF p.3, (iv): actual rank-one density coefficients, not its covariance. -/
def counterexampleState : OscillatorKernel (Fin 2) :=
fun u v => counterexampleVector u * star (counterexampleVector v)
/-- PDF p.3: the explicit state's covariance in the p.1 vacuum-I convention. -/
def negativityExampleCovariance : OscillatorCovariance (Fin 2) :=
fun a b => if a.1 = b.1 then (if a.2 = b.2 then 9 / 8 else 0)
else if a.2 = b.2 then (if a.2 = 0 then Real.sqrt 15 / 8 else -Real.sqrt 15 / 8)
else 0
/-- PDF p.3: partial transpose of the first complete oscillator mode. -/
def transposeFirst (rho : OscillatorKernel (Fin 2)) : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ :=
fun u v => rho ![v.1, u.2] ![u.1, v.2]
/-- PDF p.3: E_N=log_2 ||rho^(T_A)||_1. Every use below concludes finiteness
and norm>=1, before converting the extended norm to a real logarithm. -/
def logarithmicNegativity (rho : OscillatorKernel (Fin 2)) : ℝ :=
Real.logb 2 (traceSize (transposeFirst rho)).toReal
/-! Sanity examples pin definitions only; source results remain unproved. -/
example {I : Type} [Fintype I] (gamma : OscillatorCovariance I) : varianceForm gamma 0 = 0 := by
simp [varianceForm]
example {I : Type} [Fintype I] (rho : OscillatorKernel I) :
InDomain none rho ↔ IsDensity rho := by simp [InDomain]
example {A B : Type} (rho : OscillatorKernel A) (sigma : OscillatorKernel B) (u v : Occupation (A ⊕ B)) :
oscillatorTensor rho sigma u v = rho (u ∘ Sum.inl) (v ∘ Sum.inl) *
sigma (u ∘ Sum.inr) (v ∘ Sum.inr) := rfl
example {I : Type} {m : ℕ} (k : Copies Bool m) (u : Occupation I)
(rest : Occupation (I × {l : Copies Bool m // l ≠ k})) (j : I) :
insertCopy k u rest (j, k) = u j := by simp [insertCopy]
example : hadamardEntry 0 (fun i => Fin.elim0 i) (fun i => Fin.elim0 i) = 1 := by
simp [hadamardEntry]
example (m : ℕ) : positiveEntries m (fun _ => false) = 2 ^ m := by
simp [positiveEntries]
example : negativityExampleCovariance (0, 0) (1, 0) = Real.sqrt 15 / 8 := by
norm_num [negativityExampleCovariance]
example : negativityExampleCovariance (0, 1) (1, 1) = -Real.sqrt 15 / 8 := by
norm_num [negativityExampleCovariance]
example (rho : OscillatorKernel (Fin 2)) : transposeFirst rho (0, 1) (1, 0) = rho ![1, 1] ![0, 0] := rfl
end QAlgorithms.Papers.Independent.Support50.P14
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P14.CompleteMoments
For any finite type , arbitrary complex occupation kernel , real function , and real matrix on , this property requires finite energy
symmetry , and the following summability and derivative conditions. For every real , put
For each , the inner family indexed by must be summable, and the family indexed by of these inner sums must also be summable. Writing , , and for real , the required derivatives at are
In the second assertion, the derivative function uses the total derivative convention, taking value wherever the first derivative does not exist. No density, normalization, or positivity condition on , and no positivity condition on , is explicitly included. Empty is allowed; in that case the property holds for every kernel and the unique .
QAlgorithms.Papers.Independent.Support50.P14.GaussianAt
For any finite type , arbitrary complex occupation kernel , real function , and real matrix on that index set, this property requires all of the following. The energy
is finite, , and, for every real , each inner family indexed by and the outer family of its sums in
are summable. With , , and , it additionally requires
The derivative function in the second condition takes value wherever a derivative does not exist. No density or positivity condition on , or positivity condition on , is explicitly required. For empty , these requirements reduce to the sole entry of being .
QAlgorithms.Papers.Independent.Support50.P14.InDomain
For any finite type , an optional real cap, and arbitrary complex kernel indexed by occupation functions , this property first requires to satisfy the following density conditions: there exist sequences , indexed by , such that is summable and for every ; for every finite set of occupation functions and every complex function on occupation functions, the number has imaginary part and nonnegative real part; and the real diagonal family is summable with . If no cap is supplied, there is no further requirement. If the supplied cap is , the additional requirement is
interpreted in . The cap is not assumed nonnegative: a negative cap gives a right-hand side of . Without a cap, finite photon energy is not required. Empty is allowed; then the density conditions force the sole entry to be , and every supplied cap gives the energy bound .
QAlgorithms.Papers.Independent.Support50.P14.InterleavedQuadrature
For any type , the interleaved quadrature index set is . Thus each has two indices, and . No finiteness or nonemptiness assumption is imposed; when is empty, this index set is empty.
QAlgorithms.Papers.Independent.Support50.P14.LocallyInvariant
For a natural number , an optional real cap , and a real-valued functional on finitely enumerated mode types , maps , and complex matrices on , this predicate requires invariance under the following two operations whenever both the original and resulting matrices are admissible. Here a matrix on an index set is a density when it admits with and , every quadratic form is real and nonnegative for every finite and every , and its real diagonal entries are summable with sum . Admissibility additionally requires, when specifies , that in ; an absent cap adds no condition. First, for every and every family of surjective complex linear isometries of , where , put , with the coordinate unit vector, and define
If are admissible, then . Second, for every pair of finitely enumerated types , bijection , ownership map , and matrix on , define for ; if are admissible, then . The nested complex sums retain their indicated order and are zero individually when nonsummable. Empty mode types and parties owning no modes are included; if , ownership maps require empty mode types and the product defining is . A negative specified cap gives the energy bound zero.
QAlgorithms.Papers.Independent.Support50.P14.MultipartiteOscillatorFunctional
For any natural number , a multipartite oscillator functional assigns a real number to every type equipped with a finite enumeration, every map , and every complex matrix indexed by , where is the set of occupation assignments . No positivity, normalization, energy bound, or regularity is required of either the matrix or the functional. Empty is included; then has one element, so such a matrix has one complex entry. The value is included, in which case an ownership map exists only when is empty.
QAlgorithms.Papers.Independent.Support50.P14.OscillatorCharacteristicSummable
For any finite type and arbitrary complex kernel indexed by occupation functions , this property means that, for every real , both of the following summability conditions hold: for every occupation function , the complex family
is summable, and the family
is summable, where
These are conditions on the inner families and the family of their sums; no separate summability condition on the family indexed jointly by is included. No density condition is imposed. For empty , both required families have singleton index sets, so the property holds for every kernel.
QAlgorithms.Papers.Independent.Support50.P14.OscillatorCovariance
For any type , an oscillator covariance is an arbitrary real matrix indexed by in both coordinates, equivalently a function . This abbreviation imposes no symmetry, positivity, or other covariance condition, and does not require to be finite or nonempty. For empty , it is the unique matrix with no entries.
QAlgorithms.Papers.Independent.Support50.P14.OscillatorKernel
For any type , an oscillator kernel is a complex matrix indexed in both coordinates by occupation functions ; explicitly, it is an arbitrary function . No finiteness assumption on , positivity, normalization, symmetry, boundedness, or summability is imposed. If is empty, there is exactly one occupation function, so such a kernel has one complex entry.
QAlgorithms.Papers.Independent.Support50.P14.OscillatorTraceContinuous
For every natural number , optional real cap , and real-valued functional on finitely enumerated mode types , ownership maps , and arbitrary complex matrices on , this predicate means the following. A matrix on an index set is a density here when it has an expansion with and , all finite quadratic forms are real and nonnegative for every finite and every , and its real diagonal entries are summable with sum . It is admissible if it is a density and, when specifies , its energy is at most in ; an absent cap adds no energy condition. Define to be the infimum of over all expansions of of the preceding form with summable norm products, with infimum if no expansion exists. Then, for every , every admissible , and every real , there is a real such that every admissible satisfying also satisfies
Empty mode types are included; for , only empty mode types admit ownership maps. A negative specified cap gives the energy bound zero. The number may depend on , its finite enumeration, , , and .
QAlgorithms.Papers.Independent.Support50.P14.StronglySuperadditive
For a natural number , an optional real cap , and a real-valued functional defined for every finitely enumerated mode type , ownership map , and arbitrary complex matrix on , this predicate requires both the marginal inequality and product equality below. For clarity, a matrix on an index set is a density here precisely when it has an expansion with and , every finite quadratic form is real and nonnegative for every finite and every , and the real diagonal entries are summable with sum . An oscillator matrix on is admissible when it is such a density and, if specifies a real number , its energy , evaluated in , satisfies ; an absent cap adds no energy condition. The first requirement is that, for every pair of finitely enumerated types , ownership maps , and matrix on occupations of , if and both matrices and are admissible, then
The second requirement is that, for every such and every pair of matrices , if and the matrix are admissible, then
The marginal sums are unconditional complex sums, with value zero for nonsummable families. Empty mode types are included; a negative specified cap imposes the energy bound zero. When , ownership maps exist only for empty mode types. Each requirement is conditional on all three stated admissibility hypotheses.
QAlgorithms.Papers.Independent.Support50.P14.TraceLowerSemicontinuous
For every natural number , optional real cap , and real-valued functional on finitely enumerated mode types , ownership maps , and arbitrary complex matrices on , this predicate means the following. A matrix on an index set is a density here when for some with , every finite quadratic form is real and nonnegative for every finite and every , and its real diagonal entries are summable with sum . It is admissible if it is a density and, when specifies , its energy is at most in ; an absent cap adds no energy condition. Let be the infimum of over all such expansions of with summable norm products, and let it be if no expansion exists. Then, for every , every admissible , and every real , there exists a real such that every admissible satisfies
Empty mode types are included; when , ownership maps exist only for empty mode types. A negative specified cap gives the energy bound zero. The number may depend on , its finite enumeration, , , and .
QAlgorithms.Papers.Independent.Support50.P14.copiesKernel
For every type , with no finiteness assumption, every natural number , and every complex matrix indexed by , let be the set of Boolean strings of length . This definition gives a matrix indexed by occupation assignments , with entries
The product has factors, and no density, normalization, or summability assumptions are imposed on . For , there is one empty Boolean string, so the product has one factor. If is empty, the resulting matrix has one entry equal to the single entry of raised to the power .
QAlgorithms.Papers.Independent.Support50.P14.copyMarginal
For any type , any natural number , any complex matrix indexed by occupation functions , and any , this defines a complex matrix on occupation functions by
where is if , and otherwise. No density, positivity, trace-class, or summability hypothesis is imposed on , and need not be finite; the displayed sum is the totalized sum over its index type, which is when its summands are not summable. For , there is exactly one rest occupation function, so the sum has one term.
QAlgorithms.Papers.Independent.Support50.P14.copyMixerKernel
For any finite type , any natural number , and any complex linear isometric equivalence of with itself, where , this defines a complex matrix indexed by occupation functions , with entries
where is the function equal to at the occupation function and elsewhere. No nonemptiness assumption is made on : if is empty, this product is . The definition includes , when has one element.
QAlgorithms.Papers.Independent.Support50.P14.counterexampleState
This defines a complex matrix indexed by occupation functions , with , where is at the occupation , at , and elsewhere. Equivalently, its only nonzero entries are
QAlgorithms.Papers.Independent.Support50.P14.counterexampleVector
This defines a complex-valued function on occupation functions by
with the displayed real values regarded as complex numbers. In particular, the two exceptional occupations are the constant-zero and constant-one functions.
QAlgorithms.Papers.Independent.Support50.P14.hadamardEntry
For every natural number and every pair of Boolean strings , this real-valued entry is
Thus its exponent is the natural-number count of positions where both strings are true. The case is included: there is one empty string, the count is zero, and the entry is .
QAlgorithms.Papers.Independent.Support50.P14.insertCopy
For any type , any natural number , any binary string , any occupation function , and any occupation function , this defines an occupation function on by
There is no finiteness or nonemptiness assumption on . For , is the unique empty binary string, the domain of is empty, and the resulting function takes value on the unique copy.
QAlgorithms.Papers.Independent.Support50.P14.localKernel
For every natural number , every finitely enumerated type , every ownership map , and every family of surjective complex linear isometries of , where , the local kernel is the complex matrix on defined, for all occupation assignments , by
where is the square-summable vector equal to at occupation assignment and elsewhere. Parties with are included: their occupation space is a singleton and their Hilbert space is one-dimensional. If , the ownership map requires , and the empty product gives the single kernel entry .
QAlgorithms.Papers.Independent.Support50.P14.logarithmicNegativity
For every complex matrix indexed by occupations , form . This defines the real number
The infimum is taken in , and is if there is no such expansion. The conversion equals when finite and equals when it is infinite. The logarithm is totalized with ; thus the defined value is if is either or . No density or trace-class hypothesis is required.
QAlgorithms.Papers.Independent.Support50.P14.marginalFirst
For arbitrary types , with no finiteness assumptions, and any complex matrix indexed by occupation assignments of , the first marginal is the complex matrix indexed by whose entries, for every , are
where is the assignment equal to on and on . No density or summability hypothesis is required; the sum is the unconditional complex sum, defined to be zero when the indexed family is not summable. If is empty, the sum has one term, corresponding to its unique empty occupation assignment.
QAlgorithms.Papers.Independent.Support50.P14.marginalSecond
For arbitrary types , with no finiteness assumptions, and any complex matrix indexed by occupation assignments of , the second marginal is the complex matrix indexed by whose entries, for every , are
where is the assignment equal to on and on . No density or summability hypothesis is required; the sum is the unconditional complex sum, defined to be zero when the indexed family is not summable. If is empty, the sum has one term, corresponding to its unique empty occupation assignment.
QAlgorithms.Papers.Independent.Support50.P14.meanForm
For any finite type and arbitrary real functions , the mean form is
There are no additional conditions on either function. When is empty, this sum equals .
QAlgorithms.Papers.Independent.Support50.P14.mixedArgument
For every natural number , let be the set of Boolean strings of length . Given any real-valued function , its mixed argument is the function on the same set defined, for every and , by
There are no restrictions on , and the second coordinate is unchanged by the mixing. The denominator is positive for every . For , contains one empty string and the resulting function equals .
QAlgorithms.Papers.Independent.Support50.P14.negativityExampleCovariance
This defines a real matrix indexed by pairs . In the ordered basis , it is
QAlgorithms.Papers.Independent.Support50.P14.oscillatorCharacteristic
For any finite type , arbitrary complex kernel on occupation functions , and real function , the characteristic is the iterated sum
The inner sum is taken first. Neither density conditions nor summability are assumed: each infinite complex sum is defined to be when its summand family is not summable. If is empty, the product is and both occupation index sets are singletons, so the characteristic is the sole entry of , independent of .
QAlgorithms.Papers.Independent.Support50.P14.oscillatorTensor
For arbitrary types , with no finiteness assumptions, and arbitrary complex matrices indexed by and indexed by , their oscillator tensor is the matrix on occupation assignments of the disjoint union defined, for every , by
No density or summability conditions are imposed. Either type may be empty; its occupation space then consists of the unique empty assignment, and its matrix contributes its single complex entry as a scalar factor.
QAlgorithms.Papers.Independent.Support50.P14.oscillatorWeylKernel
For any finite type and real function , this definition assigns a complex kernel on occupation functions by
Here real factors are regarded as complex numbers, and may be zero, with zeroth powers equal to , including . If is empty, the product equals at its sole pair of occupation functions.
QAlgorithms.Papers.Independent.Support50.P14.photonEnergy
For any finite type and arbitrary complex kernel indexed by occupation functions , the photon energy is the extended nonnegative real number
with all terms interpreted in . Thus negative real parts of diagonal entries contribute ; no positivity, normalization, or convergence hypothesis on is required, and the result may be . If is empty, the sole occupation function has total occupation , and the energy is .
QAlgorithms.Papers.Independent.Support50.P14.positiveEntries
For every natural number and binary string , this defines the natural number
The division in the second branch is natural-number division. When , the unique string is identically false, so the value is ; the second branch cannot occur. When , the second branch equals .
QAlgorithms.Papers.Independent.Support50.P14.transposeFirst
For every complex matrix indexed by occupation functions , this defines a complex matrix indexed by pairs of natural numbers by
Here a pair used as an index of denotes the occupation function taking values and at and , respectively. There are no density, positivity, or summability assumptions on .
QAlgorithms.Papers.Independent.Support50.P14.varianceForm
For any finite type , arbitrary real matrix indexed by , and real function , the variance form is
No symmetry or positivity assumption on is imposed, so the definition does not require this value to be nonnegative. When is empty, it equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.