Definitions for Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use
DefinitionQAlgorithms_Papers_Independent_Support50_P18The objects the formalized statements of Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use (arXiv:1609.07044) are stated in. Each was checked against the paper by a blind read-back and a moderator.
logPowerLevel: PDF p.8, Lemma 2: n+1 enumerates k=1,2,... . The first term is finite.logPowerPartition: PDF p.8, Lemma 2: a divergent partition sum is infinity, not zero.OscillatorParameters: Section 4.2, PDF p.9: positive physical parameters and at least one mode. This is a parameter record, not Frontier30.P07.Oscillator (the one-mode Hilbert space).OscillatorParameters.quantum: PDF p.9: the positive mode energy quanta hbar omega_i.OscillatorParameters.level: PDF p.9: eigenvalues of the actual Fock Hamiltonian, including the vacuum.OscillatorParameters.domain: PDF p.9: maximal dense domain of the self-adjoint diagonal Hamiltonian.OscillatorParameters.apply: PDF p.9: the Hamiltonian acts by its number-basis eigenvalues.OscillatorParameters.ground: PDF p.9: E0=(1/2) sum_i hbar omega_i.OscillatorParameters.geometricMean: PDF p.9, (23): geometric mean of the mode energy quanta.OscillatorParameters.meanEnergy: PDF pp.5,9: extended mean energy on positive trace-class arrays. The nonnegative series equals the increasing spectral-cutoff supremum.OscillatorParameters.entropyMaximum: PDF pp.7,9, (18): supremum of actual entropies over the energy ball.OscillatorParameters.entropyUpper: PDF p.9, (23): explicit oscillator entropy majorant.OscillatorParameters.allocations: PDF p.9: all admissible allocations, with equality of total energy.OscillatorParameters.allocationEntropy: PDF p.9: sum of single-mode entropies for a fixed allocation.AFWConstants: PDF pp.7--9: the four state-independent nonnegative constants (16),(17).OscillatorParameters.finiteMarginalEnergy: PDF p.9: finite energy of the actual oscillator marginal; R is arbitrary.OscillatorParameters.EntropyControlled: PDF pp.7,9: both inequalities (16),(17), exactly on finite-energy states. f accepts coefficient arrays, with values outside the source domain unconstrained. Actual matrix mixtures are used; normalization is not an additional premise.OscillatorParameters.continuityBound: PDF p.9, (24): ell and the logarithm are OUTSIDE sqrt(2 epsilon).nuclearStateDistance: PDF pp.5,9: normalized-state adapter to the imported full trace distance. The frozen QAlgorithms.traceDistance requires finite matrices and returns a real; the imported extendedHalfTraceDistance covers arbitrary nuclear coefficients.SubsystemBasis: PDF pp.9--10: complete basis for a selected multipartite subsystem.ComplementBasis: PDF pp.9--10: complete basis for the complementary subsystem.joinBasis: PDF pp.9--10: full basis coordinate reconstructed from its two factors.subsystemMarginal: PDF p.10: actual subsystem marginal, using the accepted completed partial trace.entropyCombination: PDF pp.9--10, (25): the prescribed finite real combination, on its domain of finite marginal entropies with nonzero coefficients. No infinite value is projected in the theorem.spectralGround: PDF p.5: infimum of the unit-vector energies, in a complete eigenbasis.Condition22: PDF p.8, (22): extended partition trace and a right-hand limit. Neither summability nor finite entropy is assumed separately.TraceUniformContinuousOn: Trace-distance uniform continuity on a specified state set (PDF pp.5,17--18). This epsilon-delta definition avoids imposing a coefficient uniformity.marginalMutualInformation: PDF p.4: genuine mutual information of a joint state, defined by relative entropy.extendedConditionalEntropy: PDF p.11, (28): finite-A-entropy conditional entropy, without infinity subtraction.outputMutualInformation: PDF p.17, (48): mutual information after the actual reference-amplified channel.entropyModulus: PDF p.8, (21): the real modulus, used only with proved finite F_H.EnergyContinuity: PDF pp.17--18: finite-valued uniform continuity and the quantitative bound, on one FIXED energy ball. This is a conclusion package, never a hypothesis.countableRelativeEntanglementNats: PDF p.14, (38): relative entropy distance to the actual trace-norm closed convex hull of product states. Empty infima retain infinity. The frozen P54 relativeEntanglement is finite-dimensional and in bits; this interface is in nats on arbitrary countable systems and cannot use that finite-dimensional function.bipartiteTensorPower: PDF pp.14,16: n copies, regrouped as A^n:B^n, without restricting other states of that tensor-power system to be products.regularizedCountableEntanglementNats: PDF p.14, (39): regularization as the extended infimum of ER(rho^n)/n, equivalent to the actual limit by subadditivity. Only positive block lengths are used; a divergent value remains infinity. The frozen P54 regularization is finite-dimensional and in bits, so it does not represent this domain.additiveEnergy: PDF p.16: additive tensor-power Hamiltonian eigenvalues.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P01
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P08
/-!
Statements from Shirokov, arXiv:1609.07044v5. Pinned accepted nuclear states,
trace norm and extended spectral entropies are reused. Product coordinates
represent completed Hilbert tensor products. General Hamiltonians, including
continuous spectra, are deferred rather than replaced by diagonal observables.
The oscillator uses its full Fock basis and includes zero-point energy.
Compilation is pending the separate batch handoff.
-/
noncomputable section
open Filter
open scoped ENNReal NNReal BigOperators Topology
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Support50.P18
open QAlgorithms.Papers.Independent.Dependency50.P33 (State PureState traceSize rankOne)
open QAlgorithms.Papers.Independent.Frontier18.P01 (convexOperatorMixture traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(extendedEntropyNats extendedRelativeEntropyNats)
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Renew46.P08
(coefficientEnergy entropySupremum extendedHalfTraceDistance)
/-! The imported g is (x+1) log(x+1)-x log x (PDF p.9), equal to
(1+x) h2(x/(1+x)) for x>=0. Every use below has a nonnegative argument. -/
example : g 0 = 0 := by
simp [QAlgorithms.Papers.Independent.Claimed50.P39.g]
/-- PDF p.8, Lemma 2: n+1 enumerates k=1,2,... . The first term is finite. -/
def logPowerLevel (q : ℝ) (n : ℕ) : ℝ := (Real.log (n + 1 : ℝ)) ^ q
/-- PDF p.8, Lemma 2: a divergent partition sum is infinity, not zero. -/
def logPowerPartition (q lambda : ℝ) : ℝ≥0∞ :=
∑' n : ℕ, ENNReal.ofReal (Real.exp (-lambda * logPowerLevel q n))
example : logPowerLevel 2 0 = 0 := by simp [logPowerLevel]
example (q lambda : ℝ) : logPowerPartition q lambda =
∑' n : ℕ, ENNReal.ofReal (Real.exp (-lambda * logPowerLevel q n)) := rfl
/-- Section 4.2, PDF p.9: positive physical parameters and at least one mode.
This is a parameter record, not Frontier30.P07.Oscillator (the one-mode Hilbert space). -/
structure OscillatorParameters (ell : ℕ) where
modes_pos : 0 < ell
hbar : ℝ≥0
hbar_pos : 0 < hbar
omega : Fin ell → ℝ≥0
omega_pos : ∀ i, 0 < omega i
/-- PDF p.9: the positive mode energy quanta hbar omega_i. -/
def OscillatorParameters.quantum {ell : ℕ} (O : OscillatorParameters ell) (i : Fin ell) : ℝ≥0 :=
O.hbar * O.omega i
/-- PDF p.9: eigenvalues of the actual Fock Hamiltonian, including the vacuum. -/
def OscillatorParameters.level {ell : ℕ} (O : OscillatorParameters ell) (n : Fin ell → ℕ) : ℝ≥0 :=
∑ i, O.quantum i * ((n i : ℝ≥0) + 1 / 2)
/-- PDF p.9: maximal dense domain of the self-adjoint diagonal Hamiltonian. -/
def OscillatorParameters.domain {ell : ℕ} (O : OscillatorParameters ell) : Set (Hilbert (Fin ell → ℕ)) :=
{u | Memℓp (fun n => (O.level n : ℂ) * u n) 2}
/-- PDF p.9: the Hamiltonian acts by its number-basis eigenvalues. -/
def OscillatorParameters.apply {ell : ℕ} (O : OscillatorParameters ell) (u : O.domain) :
Hilbert (Fin ell → ℕ) :=
⟨fun n => (O.level n : ℂ) * u.val n, u.property⟩
/-- PDF p.9: E0=(1/2) sum_i hbar omega_i. -/
def OscillatorParameters.ground {ell : ℕ} (O : OscillatorParameters ell) : ℝ :=
(1 / 2 : ℝ) * ∑ i, (O.quantum i : ℝ)
/-- PDF p.9, (23): geometric mean of the mode energy quanta. -/
def OscillatorParameters.geometricMean {ell : ℕ} (O : OscillatorParameters ell) : ℝ :=
(∏ i, (O.quantum i : ℝ)) ^ (1 / (ell : ℝ))
/-- PDF pp.5,9: extended mean energy on positive trace-class arrays.
The nonnegative series equals the increasing spectral-cutoff supremum. -/
def OscillatorParameters.meanEnergy {ell : ℕ} (O : OscillatorParameters ell)
(X : Matrix (Fin ell → ℕ) (Fin ell → ℕ) ℂ) : ℝ≥0∞ :=
coefficientEnergy O.level X
/-- PDF pp.7,9, (18): supremum of actual entropies over the energy ball. -/
def OscillatorParameters.entropyMaximum {ell : ℕ} (O : OscillatorParameters ell) (E : ℝ) : ℝ≥0∞ :=
⨆ rho : {rho : State (Fin ell → ℕ) //
O.meanEnergy rho.coefficients ≤ ENNReal.ofReal E}, extendedEntropyNats rho.val.coefficients
/-- PDF p.9, (23): explicit oscillator entropy majorant. -/
def OscillatorParameters.entropyUpper {ell : ℕ} (O : OscillatorParameters ell) (E : ℝ) : ℝ :=
(ell : ℝ) * Real.log ((E + O.ground) / ((ell : ℝ) * O.geometricMean)) + ell
/-- PDF p.9: all admissible allocations, with equality of total energy. -/
def OscillatorParameters.allocations {ell : ℕ} (O : OscillatorParameters ell) (E : ℝ) : Set (Fin ell → ℝ) :=
{e | (∑ i, e i) = E ∧ ∀ i, (O.quantum i : ℝ) / 2 ≤ e i}
/-- PDF p.9: sum of single-mode entropies for a fixed allocation. -/
def OscillatorParameters.allocationEntropy {ell : ℕ} (O : OscillatorParameters ell) (e : Fin ell → ℝ) : ℝ :=
∑ i, g (e i / (O.quantum i : ℝ) - 1 / 2)
example {ell : ℕ} (O : OscillatorParameters ell) (u : O.domain) (n : Fin ell → ℕ) :
O.apply u n = (O.level n : ℂ) * u.val n := rfl
example {ell : ℕ} (O : OscillatorParameters ell) :
O.meanEnergy (0 : Matrix (Fin ell → ℕ) (Fin ell → ℕ) ℂ) = 0 := by
simp [OscillatorParameters.meanEnergy, coefficientEnergy]
example {ell : ℕ} (O : OscillatorParameters ell) (e : Fin ell → ℝ) (E : ℝ) :
e ∈ O.allocations E ↔ (∑ i, e i) = E ∧ ∀ i, (O.quantum i : ℝ) / 2 ≤ e i := Iff.rfl
/-- PDF pp.7--9: the four state-independent nonnegative constants (16),(17). -/
structure AFWConstants where
a : ℝ≥0
b : ℝ≥0
cMinus : ℝ≥0
cPlus : ℝ≥0
/-- PDF p.9: finite energy of the actual oscillator marginal; R is arbitrary. -/
def OscillatorParameters.finiteMarginalEnergy {ell : ℕ} {R : Type} (O : OscillatorParameters ell)
(rho : State ((Fin ell → ℕ) × R)) : Prop :=
O.meanEnergy (traceSecond rho.coefficients) < ⊤
/-- PDF pp.7,9: both inequalities (16),(17), exactly on finite-energy states.
f accepts coefficient arrays, with values outside the source domain unconstrained.
Actual matrix mixtures are used; normalization is not an additional premise. -/
def OscillatorParameters.EntropyControlled {ell : ℕ} {R : Type} (O : OscillatorParameters ell)
(C : AFWConstants) (f : Matrix ((Fin ell → ℕ) × R) ((Fin ell → ℕ) × R) ℂ → ℝ) : Prop :=
(∀ rho sigma : State ((Fin ell → ℕ) × R),
O.finiteMarginalEnergy rho → O.finiteMarginalEnergy sigma →
∀ p : ℝ, 0 < p → p < 1 →
-(C.a : ℝ) * Real.binEntropy p ≤
f (convexOperatorMixture p rho.coefficients sigma.coefficients) -
p * f rho.coefficients - (1 - p) * f sigma.coefficients ∧
f (convexOperatorMixture p rho.coefficients sigma.coefficients) -
p * f rho.coefficients - (1 - p) * f sigma.coefficients ≤
(C.b : ℝ) * Real.binEntropy p) ∧
(∀ rho : State ((Fin ell → ℕ) × R), O.finiteMarginalEnergy rho →
-(((C.cMinus : ℝ≥0∞) * extendedEntropyNats (traceSecond rho.coefficients)).toEReal) ≤
(f rho.coefficients : EReal) ∧
(f rho.coefficients : EReal) ≤
((C.cPlus : ℝ≥0∞) * extendedEntropyNats (traceSecond rho.coefficients)).toEReal)
/-- PDF p.9, (24): ell and the logarithm are OUTSIDE sqrt(2 epsilon). -/
def OscillatorParameters.continuityBound {ell : ℕ} (O : OscillatorParameters ell)
(C : AFWConstants) (E eps : ℝ) : ℝ :=
((C.cMinus : ℝ) + C.cPlus) * Real.sqrt (2 * eps) *
(ell : ℝ) * (Real.log ((E / eps + O.ground) /
((ell : ℝ) * O.geometricMean)) + 1) +
((C.a : ℝ) + C.b) * g (Real.sqrt (2 * eps))
/-- PDF pp.5,9: normalized-state adapter to the imported full trace distance.
The frozen QAlgorithms.traceDistance requires finite matrices and returns a real;
the imported extendedHalfTraceDistance covers arbitrary nuclear coefficients. -/
def nuclearStateDistance {I : Type} (rho sigma : State I) : ℝ≥0∞ :=
extendedHalfTraceDistance rho.coefficients sigma.coefficients
example {I : Type} (rho sigma : State I) : nuclearStateDistance rho sigma =
traceSize (rho.coefficients - sigma.coefficients) / 2 := rfl
example : (AFWConstants.mk 0 0 0 0).a = 0 := rfl
/-- PDF pp.9--10: complete basis for a selected multipartite subsystem. -/
abbrev SubsystemBasis {n : ℕ} (I : Fin n → Type) (S : Finset (Fin n)) :=
(i : {i : Fin n // i ∈ S}) → I i.val
/-- PDF pp.9--10: complete basis for the complementary subsystem. -/
abbrev ComplementBasis {n : ℕ} (I : Fin n → Type) (S : Finset (Fin n)) :=
(i : {i : Fin n // i ∉ S}) → I i.val
/-- PDF pp.9--10: full basis coordinate reconstructed from its two factors. -/
def joinBasis {n : ℕ} {I : Fin n → Type} {S : Finset (Fin n)}
(x : SubsystemBasis I S) (r : ComplementBasis I S) : (i : Fin n) → I i :=
fun i => if h : i ∈ S then x ⟨i, h⟩ else r ⟨i, h⟩
/-- PDF p.10: actual subsystem marginal, using the accepted completed partial trace. -/
def subsystemMarginal {n : ℕ} {I : Fin n → Type} (S : Finset (Fin n))
(X : Matrix ((i : Fin n) → I i) ((i : Fin n) → I i) ℂ) :
Matrix (SubsystemBasis I S) (SubsystemBasis I S) ℂ :=
traceSecond (fun a b : SubsystemBasis I S × ComplementBasis I S =>
X (joinBasis a.1 a.2) (joinBasis b.1 b.2))
/-- PDF pp.9--10, (25): the prescribed finite real combination, on its domain
of finite marginal entropies with nonzero coefficients. No infinite value is projected in the theorem. -/
def entropyCombination {n m : ℕ} {I : Fin n → Type}
(S : Fin m → Finset (Fin n)) (c : Fin m → ℝ)
(X : Matrix ((i : Fin n) → I i) ((i : Fin n) → I i) ℂ) : ℝ :=
∑ k, c k * (extendedEntropyNats (subsystemMarginal (S k) X)).toReal
example {n : ℕ} {I : Fin n → Type} (S : Fin 0 → Finset (Fin n))
(c : Fin 0 → ℝ) (X : Matrix ((i : Fin n) → I i) ((i : Fin n) → I i) ℂ) :
entropyCombination S c X = 0 := by simp [entropyCombination]
example {n : ℕ} {I : Fin n → Type} {S : Finset (Fin n)}
(x : SubsystemBasis I S) (r : ComplementBasis I S)
(i : Fin n) (h : i ∈ S) : joinBasis x r i = x ⟨i, h⟩ := by
simp [joinBasis, h]
/-- PDF p.5: infimum of the unit-vector energies, in a complete eigenbasis. -/
def spectralGround {I : Type} (energy : I → ℝ≥0) : ℝ :=
sInf (Set.range (fun i => (energy i : ℝ)))
/-- PDF p.8, (22): extended partition trace and a right-hand limit.
Neither summability nor finite entropy is assumed separately. -/
def Condition22 {I : Type} (energy : I → ℝ≥0) : Prop :=
Tendsto (fun lambda : ℝ =>
(∑' i, ENNReal.ofReal (Real.exp (-lambda * (energy i : ℝ)))) ^ lambda)
(nhdsWithin 0 (Set.Ioi 0)) (nhds (1 : ℝ≥0∞))
/-- Trace-distance uniform continuity on a specified state set (PDF pp.5,17--18).
This epsilon-delta definition avoids imposing a coefficient uniformity. -/
def TraceUniformContinuousOn {I : Type} (A : Set (State I)) (f : State I → ℝ) : Prop :=
∀ eta : ℝ, 0 < eta → ∃ delta : ℝ, 0 < delta ∧
∀ rho ∈ A, ∀ sigma ∈ A, nuclearStateDistance rho sigma < ENNReal.ofReal delta →
|f rho - f sigma| < eta
/-- PDF p.4: genuine mutual information of a joint state, defined by relative entropy. -/
def marginalMutualInformation {I J : Type}
(X : Matrix (I × J) (I × J) ℂ) : ℝ≥0∞ :=
extendedRelativeEntropyNats X
(QAlgorithms.Papers.Independent.Dependency50.P33.productCoeff
(traceSecond X) (QAlgorithms.Papers.Independent.Frontier18.P01.traceFirst X))
/-- PDF p.11, (28): finite-A-entropy conditional entropy, without infinity subtraction. -/
def extendedConditionalEntropy {I J : Type}
(X : Matrix (I × J) (I × J) ℂ) : ℝ :=
(extendedEntropyNats (traceSecond X)).toReal - (marginalMutualInformation X).toReal
/-- PDF p.17, (48): mutual information after the actual reference-amplified channel. -/
def outputMutualInformation {I J R : Type}
(Phi : QAlgorithms.Papers.Independent.Frontier18.P01.Channel I J)
(X : Matrix (I × R) (I × R) ℂ) : ℝ≥0∞ :=
marginalMutualInformation
(QAlgorithms.Papers.Independent.Dependency50.P33.tensorApply Phi.val X)
/-- PDF p.8, (21): the real modulus, used only with proved finite F_H. -/
def entropyModulus (F : ℝ → ℝ≥0∞) (C D E eps : ℝ) : ℝ :=
C * Real.sqrt (2 * eps) * (F (E / eps)).toReal + D * g (Real.sqrt (2 * eps))
/-- PDF pp.17--18: finite-valued uniform continuity and the quantitative bound,
on one FIXED energy ball. This is a conclusion package, never a hypothesis. -/
def EnergyContinuity {I : Type} (energyOn : Matrix I I ℂ → ℝ≥0∞)
(f : Matrix I I ℂ → ℝ≥0∞) (E : ℝ) (bound : ℝ → ℝ) : Prop :=
(∀ rho : State I, energyOn rho.coefficients ≤ ENNReal.ofReal E → f rho.coefficients < ⊤) ∧
TraceUniformContinuousOn {rho | energyOn rho.coefficients ≤ ENNReal.ofReal E}
(fun rho => (f rho.coefficients).toReal) ∧
∀ (rho sigma : State I) (eps : ℝ),
energyOn rho.coefficients ≤ ENNReal.ofReal E →
energyOn sigma.coefficients ≤ ENNReal.ofReal E →
0 < eps → eps ≤ 1 / 2 → nuclearStateDistance rho sigma ≤ ENNReal.ofReal eps →
|(f rho.coefficients).toReal - (f sigma.coefficients).toReal| ≤ bound eps
example {I : Type} (energy : I → ℝ≥0) :
coefficientEnergy energy (0 : Matrix I I ℂ) = 0 := by simp [coefficientEnergy]
example {I : Type} (f : State I → ℝ) : TraceUniformContinuousOn ∅ f := by
intro eta heta
exact ⟨1, by norm_num, by simp⟩
example {I : Type} (energy : I → ℝ≥0) (E : ℝ) : entropySupremum energy E =
⨆ rho : {rho : State I // coefficientEnergy energy rho.coefficients ≤ ENNReal.ofReal E},
extendedEntropyNats rho.val.coefficients := rfl
/-- PDF p.14, (38): relative entropy distance to the actual trace-norm closed
convex hull of product states. Empty infima retain infinity. The frozen P54
relativeEntanglement is finite-dimensional and in bits; this interface is in nats
on arbitrary countable systems and cannot use that finite-dimensional function. -/
def countableRelativeEntanglementNats {I J : Type}
(X : Matrix (I × J) (I × J) ℂ) : ℝ≥0∞ :=
⨅ omega : {omega : State (I × J) //
QAlgorithms.Papers.Independent.Dependency50.P33.IsSeparable omega.coefficients},
extendedRelativeEntropyNats X omega.val.coefficients
/-- PDF pp.14,16: n copies, regrouped as A^n:B^n, without restricting other
states of that tensor-power system to be products. -/
def bipartiteTensorPower {I J : Type} (n : ℕ)
(X : Matrix (I × J) (I × J) ℂ) :
Matrix ((Fin n → I) × (Fin n → J)) ((Fin n → I) × (Fin n → J)) ℂ :=
fun a b => ∏ k, X (a.1 k, a.2 k) (b.1 k, b.2 k)
/-- PDF p.14, (39): regularization as the extended infimum of ER(rho^n)/n,
equivalent to the actual limit by subadditivity. Only positive block lengths
are used; a divergent value remains infinity. The frozen P54 regularization
is finite-dimensional and in bits, so it does not represent this domain. -/
def regularizedCountableEntanglementNats {I J : Type}
(X : Matrix (I × J) (I × J) ℂ) : ℝ≥0∞ :=
⨅ n : ℕ, countableRelativeEntanglementNats (bipartiteTensorPower (n + 1) X) / (n + 1 : ℝ≥0∞)
/-- PDF p.16: additive tensor-power Hamiltonian eigenvalues. -/
def additiveEnergy {I : Type} (energy : I → ℝ≥0) (n : ℕ) (a : Fin n → I) : ℝ≥0 :=
∑ k, energy (a k)
example {I J : Type} (X : Matrix (I × J) (I × J) ℂ)
(a b : (Fin 0 → I) × (Fin 0 → J)) : bipartiteTensorPower 0 X a b = 1 := by
simp [bipartiteTensorPower]
example {I : Type} (energy : I → ℝ≥0) (a : Fin 0 → I) : additiveEnergy energy 0 a = 0 := by
simp [additiveEnergy]
end QAlgorithms.Papers.Independent.Support50.P18
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P18.AFWConstants
This structure consists of four independently specified nonnegative real numbers , , , and . Each may be zero; the structure imposes no further equations, inequalities, or positivity requirements.
QAlgorithms.Papers.Independent.Support50.P18.ComplementBasis
For every natural number , every family of types , and every finite subset , this abbreviates the type of assignments that choose an element for each index , namely . If contains every index, this type has exactly one element, the empty assignment, including when ; if some type outside is empty, there are no such assignments.
QAlgorithms.Papers.Independent.Support50.P18.Condition22
For any type and nonnegative real energies , the condition means precisely
Each exponential is embedded into using , the sum is the extended nonnegative sum, and the exponent is the extended nonnegative real-power operation. No countability assumption or separate requirement that the sum be finite for every positive appears in this condition. For empty , the expression is zero for positive , so the condition does not hold.
QAlgorithms.Papers.Independent.Support50.P18.EnergyContinuity
For any index type , any functions , any real , and any function , this defines the following conjunction. Here a state is a matrix admitting a representation , where and , whose quadratic forms on every finite coordinate set are real and nonnegative, and whose real diagonal entries form a summable family with sum . Write for the infimum, over all such representations of , of , with value if no representation exists, and put . For an extended nonnegative number , write for its real value when finite and when , and put . The conjunction requires: for every state with ; for every real , there exists a real such that all states satisfying and satisfy ; and all states and real satisfying and satisfy . No countability, nonemptiness, positivity, or regularity assumptions are imposed on ; a negative gives the cutoff , and if there are no states satisfying the cutoff, all three requirements hold vacuously.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.EntropyControlled
For every natural number , arbitrary type , oscillator parameters with , , and , four nonnegative real constants , and any real-valued function on all complex matrices indexed by , where , this predicate imposes the following two conditions. A state means a matrix admitting for square-summable complex vectors with , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal entries with sum one; write , and say its marginal energy is finite when . First, for every two such states of finite marginal energy and every real ,
Second, every state of finite marginal energy satisfies, in the extended real numbers,
where, for a matrix on ,
Here is the coordinate compression, denotes continuous functional calculus of the total real logarithm, and the products are formed in before passage to extended real numbers, with . The predicate itself does not require these entropies to be finite. There are no assumptions on away from the displayed conditions, and are excluded. No countability or nonemptiness assumption is placed on ; for empty both conditions are vacuous because there are no states.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.allocationEntropy
For every natural number , oscillator parameters with , , and , and every real vector , put . This defines
No condition that belong to an allocation set is imposed, so negative are included. The formula uses the total real logarithm, with and for negative ; consequently the expression is defined also at and . No oscillator parameters exist for .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.allocations
For every natural number , oscillator parameters consisting of , , and for , and every real , this defines the set of real vectors satisfying
Thus the set is empty if ; at equality it consists of the vector . The oscillator parameters exclude .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.apply
For every natural number , parameter object consisting of , , and positive nonnegative real frequencies , and vector satisfying square summability of , where , this defines a vector in by
Its square summability is supplied by the domain condition on ; need not be normalized.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.continuityBound
For every natural number , oscillator parameters with , , and , nonnegative real constants , and arbitrary real , put , , and . This defines the real number
No energy constraint or sign condition on or is imposed. Division by zero is zero, the real square root of a nonpositive number is zero, and the total real logarithm has and for negative ; in particular the displayed bound equals zero whenever . The parameters exclude .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.domain
For every natural number and parameter object consisting of , , and positive nonnegative real frequencies , this defines a subset of the complex Hilbert space :
No normalization or nonzero condition is imposed on ; in particular, the zero vector belongs to this set.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.entropyMaximum
For every natural number , parameter object consisting of , , and positive nonnegative real frequencies , and every real number , this defines
where , , , and is defined by continuous functional calculus using the total natural logarithm, with . Here a state means a complex matrix admitting sequences with and , such that every finite quadratic form is real and nonnegative for every finite and every complex family , and such that is summable and equals . Both suprema are taken in the extended nonnegative reals, with an empty supremum equal to zero; the finite set may be empty. Since , the admissible-state set is empty whenever , including every .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.entropyUpper
For a natural number and oscillator parameters , which include , a positive nonnegative real number , and positive nonnegative real frequencies for , put , , and . For every real , the definition assigns the real number
There is no assumption that or that . The logarithm is the total real logarithm used in the code: it is zero at zero and equals for negative . Although is implicitly quantified over all natural numbers, an cannot exist when .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.finiteMarginalEnergy
For every natural number , arbitrary type , oscillator parameters with , , and , and state on , where , this predicate means
The inner sum is the diagonal of the matrix obtained by summing over the second subsystem. A state here is a complex matrix having an expansion with square-summable complex vectors and , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal entries with sum one. No countability or nonemptiness assumption is made on ; if is empty, no such state exists. The sum over uses the total complex infinite sum, which is zero if its summands are not summable.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.geometricMean
For every natural number and parameter object consisting of , , and positive nonnegative real frequencies , this defines the real number
using real exponentiation. The parameter object requires , so the reciprocal exponent does not involve division by zero.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.ground
For every natural number and parameter object consisting of , , and positive nonnegative real frequencies , this defines the real number
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.level
For every natural number , parameter object consisting of , , and positive nonnegative real frequencies , and every occupation tuple , this defines the nonnegative real number
The tuple with every is included.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters
For each natural number , this structure consists of a proof that , a nonnegative real number with a proof that , and a family of nonnegative real numbers , indexed by , with proofs that every . Thus no such parameter object exists when .
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.meanEnergy
For every natural number , parameter object consisting of , , and positive nonnegative real frequencies , and arbitrary complex matrix indexed by , this defines
The matrix is not required to be positive, normalized, or trace class. Negative real diagonal entries contribute zero, and the sum may be infinite.
QAlgorithms.Papers.Independent.Support50.P18.OscillatorParameters.quantum
For every natural number , parameter object consisting of , , and positive nonnegative real frequencies , and every index , this defines the nonnegative real number .
QAlgorithms.Papers.Independent.Support50.P18.SubsystemBasis
For every natural number , every family of types , and every finite subset , this abbreviates the type of assignments that choose an element for each index , namely the dependent product . If is empty, this type has exactly one element, the empty assignment, including when ; if some selected type is empty, there are no such assignments.
QAlgorithms.Papers.Independent.Support50.P18.TraceUniformContinuousOn
For any type , set of states indexed by , and real-valued function on those states, this property says that for every there is a such that, for all ,
Here a state is a matrix with an expansion , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal entries are summable with sum one. The quantity is the infimum, over all such expansions of , of ; an empty family of expansions gives . Both the distance and its comparison are in , and . No countability assumption is imposed, and the property holds vacuously when is empty.
QAlgorithms.Papers.Independent.Support50.P18.additiveEnergy
For any index type , any function , any natural number , and any tuple , this defines its additive energy, as a finite nonnegative real number, by
No countability or nonemptiness assumption is imposed on . For , the unique empty tuple has energy .
QAlgorithms.Papers.Independent.Support50.P18.bipartiteTensorPower
For arbitrary index types , any natural number , and any complex matrix indexed by , this defines a matrix indexed by by
There are no state, positivity, normalization, finiteness, or countability assumptions. For , both function spaces are singletons and the empty product makes this the one by one matrix with entry , regardless of and even if or is empty.
QAlgorithms.Papers.Independent.Support50.P18.countableRelativeEntanglementNats
For arbitrary index types and an arbitrary complex matrix indexed by , this defines
where the infimum ranges over the separable states described below; no countability, positivity, normalization, or trace class assumption is imposed on . On any index set , a trace class expansion is , where and ; let be the infimum of these costs, or if there is no expansion. A state is a matrix with such an expansion, real nonnegative quadratic forms on every finite coordinate set, and summable real diagonal entries of sum . A state on is separable here precisely when, for every real , there is a finite real convex combination , with , , and states on , such that ; product entries are . The relative quantity is
where compressions are to the same coordinate set , logarithms use continuous functional calculus with , and . The supremum includes . If there is no separable state, the defining infimum is ; in particular this occurs when or is empty.
QAlgorithms.Papers.Independent.Support50.P18.entropyCombination
For all natural numbers , types , subsets and real coefficients for , and an arbitrary complex matrix indexed by , define
Here , with ranging over complementary assignments and joining performed coordinatewise; a nonsummable complex sum has value zero. For any matrix indexed by a type ,
where is its restriction to , is the continuous functional calculus applied to the real logarithm, and , viewed in . The conversion returns the corresponding real number for a finite extended value and returns zero at . Thus this definition does not require any entropy to be finite or any matrix to be a density matrix; coefficients may have either sign, and gives zero.
QAlgorithms.Papers.Independent.Support50.P18.entropyModulus
For any function and arbitrary real numbers , put . The entropy modulus is the real number
where converts finite extended values to their real values and converts to zero. No sign, finiteness, or regularity assumptions are imposed on the arguments. Division is total, so , the real logarithm satisfies , and the real square root is zero on negative arguments; consequently the modulus is zero whenever .
QAlgorithms.Papers.Independent.Support50.P18.extendedConditionalEntropy
For any types and arbitrary complex matrix indexed by , define its marginals and , and put . The extended conditional entropy is the real number
where
and
Finite coordinate restrictions are denoted by subscripts, denotes continuous functional calculus of the real logarithm, and . The conversion sends finite extended values to their real values and sends to zero, separately in both terms. No state or summability assumption is imposed, and nonsummable complex marginal sums are assigned zero.
QAlgorithms.Papers.Independent.Support50.P18.joinBasis
For every natural number , family of types , and subset , let assign an element of to each , and let assign an element of to each . Their joined assignment is defined coordinatewise by
When is empty this is the assignment supplied by ; when contains every index it is the assignment supplied by . The definition includes , when the resulting assignment is the unique empty assignment.
QAlgorithms.Papers.Independent.Support50.P18.logPowerLevel
For every real number and natural number , this defines the real number , where is the natural logarithm and the exponent denotes real power. The index is included: , while for every , including negative , under the total real-power convention.
QAlgorithms.Papers.Independent.Support50.P18.logPowerPartition
For every pair of real numbers , this defines the extended nonnegative real number
The sum may equal ; neither convergence nor positivity of is required. Real powers use the convention and for , so the summand is when and otherwise.
QAlgorithms.Papers.Independent.Support50.P18.marginalMutualInformation
For any types and arbitrary complex matrix indexed by , define
The marginal mutual information is , where
Here ranges over finite subsets of the common matrix index type, the subscript denotes coordinate restriction, is continuous functional calculus of the real logarithm, and . No countability, positivity, normalization, or summability assumption is required; the complex marginal sums return zero when they are not summable, including when their indexing type is empty.
QAlgorithms.Papers.Independent.Support50.P18.nuclearStateDistance
For every type and states on , this defines the extended nonnegative number
where
Each real cost is embedded in by taking its nonnegative part, and the infimum of an empty family is . A state means a matrix admitting at least one expansion of this form, whose quadratic form on every finite coordinate set is real and nonnegative, and whose real diagonal entries are summable with sum one. No countability or nonemptiness assumption is imposed on ; when is empty there are no states to supply as arguments.
QAlgorithms.Papers.Independent.Support50.P18.outputMutualInformation
For any types , channel from matrices indexed by to matrices indexed by , and arbitrary complex matrix indexed by , first define
The output mutual information is , where , , and . For matrices , the quantity is the supremum over finite coordinate sets of
with denoting continuous functional calculus of the real logarithm and . The channel assumption means that preserves trace-class matrices, is additive on pairs of trace-class matrices and complex homogeneous on trace-class matrices, and, for every natural number , its corresponding slice action sends every density matrix indexed by to a density matrix indexed by . Here trace class means admitting an expansion with square-summable vectors and ; a density matrix additionally has real, nonnegative finite quadratic forms and summable real diagonal entries summing to one. No countability or state assumption is imposed on , and nonsummable complex marginal sums have value zero.
QAlgorithms.Papers.Independent.Support50.P18.regularizedCountableEntanglementNats
For arbitrary index types and any complex matrix indexed by , this defines
with , , and arithmetic in . Here , over separable states on the relevant product index set. To specify these terms, a trace class matrix on admits an expansion with and ; its size is the infimum of expansion costs, with empty infimum . A state is such a matrix with real nonnegative finite coordinate quadratic forms and summable real diagonal entries of sum . A state on is separable when, for every , some finite convex combination of product states satisfies , with real and . Finally,
where ranges over all finite coordinate sets, compressions use the same , logarithms use continuous functional calculus with , and . No hypotheses are imposed on . Only positive tensor powers occur, so there is no division by zero or contribution from the zeroth tensor power; the definition is an infimum, not a stated limit or an assertion that the infimum is attained. If either original index type is empty, each positive tensor power has no state on its index set and the result is .
QAlgorithms.Papers.Independent.Support50.P18.spectralGround
For any type and any function , the spectral ground value is the real infimum
No countability or attainment assumption is imposed. If is empty, the real infimum of the empty set used here is zero.
QAlgorithms.Papers.Independent.Support50.P18.subsystemMarginal
For every natural number , family of types , subset , and arbitrary complex matrix indexed by , define a matrix indexed by through
where the joined assignment uses its first argument on and its second argument outside . No countability, positivity, normalization, or summability assumption is imposed. The sum is the total complex infinite-sum operation, which returns zero when the summand family is not summable. If the complementary assignment type is empty, the sum is zero; if contains every index, that type consists of one empty assignment and , under the corresponding identification of indices. For , the result is a one-by-one matrix whose entry is the total sum of the diagonal entries of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.