Definitions for Entropic characteristics of subsets of states
DefinitionQAlgorithms_Papers_Independent_Gap48_P18The objects the formalized statements of Entropic characteristics of subsets of states (arXiv:quant-ph/0510073) are stated in. Each was checked against the paper by a blind read-back and a moderator.
stateEntropyNats: Normalized-state entropy in nats, PDF pp.4–5; infinity is retained.stateRelativeEntropyNats: Umegaki relative entropy with its support guard, PDF p.4.distanceSquared: Squared trace distance, PDF p.4, (1); not half trace distance.meanCoefficients: Coefficients of a measure's average, PDF p.5. Only probability laws are used for barycenters; scalar integrability follows from bounded state entries.measureHolevo: The integral definition of chi, PDF p.5. This extends the accepted probability-law functional to measures so finite mixtures can be constructed without extra normalization witnesses. Every theorem uses probability mass one.probabilityAverage: The actual normalized average, selected from the accepted barycenter existence theorem; PDF p.5. No new existence or continuity assumption is made.MeasureConcentratedOn: A law concentrated on A, PDF p.5. For closed A this is equivalent to its topological support being contained in A.FiniteEnsembleOn: Conventional finite ensembles whose signals lie in A, PDF pp.5,24.setChiCapacity: Per-signal set capacity, PDF p.24, (24), distinct from average constraints.stateClosedConvexHull: The trace-norm closed real convex hull, PDF p.4.CoefficientConvexStates: Convexity of actual operator coefficients, PDF p.4.entropySup: Entropy supremum in the complete extended nonnegative reals, PDF p.7.FiniteContinuousOn: Source continuity is finite-valued continuity, explicitly used on PDF p.18.FiniteContinuousWithinAt: Finite-valued relative continuity at a point, PDF p.7.HConverges: H-convergence has its fixed reference in the SECOND slot, PDF p.4.RadiusCenter: The information-radius condition defining the unique optimal average, PDF pp.24,27. Theorem 1 establishes existence and uniqueness.optimalAverage: Canonical choice by the source's defining radius condition, PDF p.27, Definition 1. On a nonempty finite-capacity set Theorem 1 makes this choice unique. Elsewhere this total helper has no claimed meaning as an optimal average: its fallback is an element of A, not an assumed radius minimizer.radius: Radius about a reference state, PDF p.25, (25); the empty supremum is zero.RegularityOne: First regularity alternative, PDF p.28: finite entropy at the center and entropy convergence along every H-convergent sequence in the CLOSED hull.RegularityTwo: Second regularity alternative, PDF p.28; no conjunction with the first.ChiRegular: Regular sets, PDF p.28, Definition 2, with the implicit nonempty domain.OptimalMeasure: Optimal generalized measure, PDF p.39, Definition 3.extremeClosure: Trace closure of extreme points, PDF p.40 (both overlines are essential).StateChannel: A concrete CPTP map packaged with its normalized state action, PDF pp.3,35. The action is tied coefficient by coefficient to the accepted full trace-class map; no finite Kraus or finite-dimensional restriction is imposed.PreservingChannels: Capacity-preserving channels mapping into the closed hull, PDF p.35.CommonChannelInvariant: Common invariant states, PDF p.35; no commutativity is assumed.countableLaw: Countable ensemble as its actual atomic probability law, PDF pp.39–40. Normalization of w is required at each use, and zero weights contribute zero.jointMarginalConstraintSet: All joint states with marginal membership, including entangled states, PDF p.61. The two marginals are identified with actual normalized states.couplingSet: Fixed-marginal coupling set C(rho,sigma), PDF p.62.layer: A layer in a CHOSEN eigenbasis, PDF p.22 and footnote 10. The theorems explicitly require sigma diagonal in these coordinates, leaving repeated eigenvalues and their basis choice visible.Diagonal: Chosen coordinates are an eigenbasis of sigma, PDF p.22.InSimplex: Finite probability simplex, PDF p.36. The equation excludes n=0.finiteLaw: The actual finite ensemble of specified states, PDF pp.5,36.unionObjective: The objective whose maximum appears in Proposition 7, PDF p.36.tailLayer: Layer with the first n-1 rows and columns diagonal, PDF p.59. Source indices start at one, so coordinate i corresponds to source i+1.decreasingFamily: The concrete decreasing family of PDF p.61, not an arbitrary family satisfying capacity conclusions: L_(n+1)(sigma) intersect V_(sigma,c).MinimalClosedEqualCapacity: Minimal closed equal-capacity subset, PDF p.30, footnote 19.spectralPowerTrace: Actual spectral-power trace by finite-compression exhaustion, PDF p.13. For positive exponents finite-compression eigenvalue interlacing gives the extended trace of sigma^t. At t=0 this is the rank of the support projection, not the ambient dimension. The scalar zero-eigenvalue branch is explicit.decreaseCoefficient: Decrease coefficient, PDF p.13. Extended infima avoid a real junk value when a convergence set is empty; state normalization makes t=1 admissible.PositiveFiniteRankState: Finite-dimensional operator support, PDF p.13. A finite positive rank-one sum characterizes positive finite rank in any coordinate basis; this does NOT require finite coordinate support.BoundedOrthogonalProjection: Any bounded orthogonal projection, PDF pp.71–73. Neither finite rank nor a monotone-sequence condition is built into this type.projectionMass: Positive compression mass Tr(P rho), PDF p.71. On states the bounded conjugation is trace class, hence the real trace series is summable.compressedCoefficients: The source's normalized coefficients, PDF p.71. Uses are restricted to positive mass, so inverse at zero is never asserted to produce a state.projectionImage: Actual positive-domain image under Theta_P, PDF pp.71–72. Output states are identified by the formula, not supplied with assumed capacity properties.projectionSuccessInfimum: Uniform retained mass, PDF p.72. The extended empty infimum is infinity; all theorem uses explicitly require A nonempty.projectedAverage: Optimal average of a compression image on the eventual valid domain, PDF p.73. An empty early image uses the original set's average only to make the sequence total; Theorem 4 concludes that this branch eventually disappears.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P01
/-!
Shirokov, arXiv:quant-ph/0510073v2. Statements use countable orthonormal
coordinates for arbitrary separable complex Hilbert spaces, trace-norm topology,
and natural logarithms. All entropic quantities retain positive infinity.
Deferred full nodes are recorded in HARD.md; no partial substitute is stated.
Compilation is pending the separately authorized batch handoff.
-/
noncomputable section
open MeasureTheory Filter
open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator
open QAlgorithms.Papers.Independent.Dependency50.P33
(State PureState traceSize traceClosure IsTraceClassChannel productCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble HasFiniteSupport HasAverage averageCoefficients
extendedEntropyNats extendedRelativeEntropyNats
finiteEnsembleCapacity pureStates)
open QAlgorithms.Papers.Independent.Frontier18.P01 (traceFirst traceSecond)
namespace QAlgorithms.Papers.Independent.Gap48.P18
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Normalized-state entropy in nats, PDF pp.4–5; infinity is retained. -/
def stateEntropyNats {I : Type} (rho : State I) : ℝ≥0∞ :=
extendedEntropyNats rho.coefficients
/-- Umegaki relative entropy with its support guard, PDF p.4. -/
def stateRelativeEntropyNats {I : Type} (rho sigma : State I) : ℝ≥0∞ :=
extendedRelativeEntropyNats rho.coefficients sigma.coefficients
/-- Squared trace distance, PDF p.4, (1); not half trace distance. -/
def distanceSquared {I : Type} (rho sigma : State I) : ℝ≥0∞ :=
traceSize (rho.coefficients - sigma.coefficients) ^ 2
/-- Coefficients of a measure's average, PDF p.5. Only probability laws are
used for barycenters; scalar integrability follows from bounded state entries. -/
def meanCoefficients {I : Type} (mu : Measure (State I)) : Matrix I I ℂ :=
fun i j => ∫ rho, rho.coefficients i j ∂mu
/-- The integral definition of chi, PDF p.5. This extends the accepted
probability-law functional to measures so finite mixtures can be constructed
without extra normalization witnesses. Every theorem uses probability mass one. -/
def measureHolevo {I : Type} (mu : Measure (State I)) : ℝ≥0∞ :=
∫⁻ rho, extendedRelativeEntropyNats rho.coefficients (meanCoefficients mu) ∂mu
/-- The actual normalized average, PDF p.5: the barycenter map whose existence is
the accepted theorem `Frontier18.P07.barycenter_continuous`, chosen under that
theorem's statement as a guard (a definition may import only proved theorems).
Whenever the statement holds this is the map that theorem selects; no new
existence or continuity assumption is made. -/
def probabilityAverage {I : Type} [Countable I] (mu : GeneralizedEnsemble I) : State I :=
if h : ∃ average : GeneralizedEnsemble I → State I,
(∀ mu, HasAverage mu (average mu)) ∧ Continuous average then
Classical.choose h mu
else
Classical.choice (MeasureTheory.nonempty_of_isProbabilityMeasure (mu : Measure (State I)))
/-- A law concentrated on A, PDF p.5. For closed A this is equivalent to
its topological support being contained in A. -/
def MeasureConcentratedOn {I : Type} (mu : Measure (State I)) (A : Set (State I)) : Prop :=
∀ᵐ rho ∂mu, rho ∈ A
/-- Conventional finite ensembles whose signals lie in A, PDF pp.5,24. -/
def FiniteEnsembleOn {I : Type} (mu : GeneralizedEnsemble I)
(A : Set (State I)) : Prop :=
HasFiniteSupport mu ∧ (mu : Measure (State I)).support ⊆ A
/-- Per-signal set capacity, PDF p.24, (24), distinct from average constraints. -/
def setChiCapacity {I : Type} (A : Set (State I)) : ℝ≥0∞ :=
⨆ mu : {mu : GeneralizedEnsemble I // FiniteEnsembleOn mu A},
measureHolevo (mu.val : Measure (State I))
/-- The trace-norm closed real convex hull, PDF p.4. -/
def stateClosedConvexHull {I : Type} (A : Set (State I)) : Set (State I) :=
{rho | rho.coefficients ∈ traceClosure (convexHull ℝ (State.coefficients '' A))}
/-- Convexity of actual operator coefficients, PDF p.4. -/
def CoefficientConvexStates {I : Type} (A : Set (State I)) : Prop :=
Convex ℝ (State.coefficients '' A)
/-- Entropy supremum in the complete extended nonnegative reals, PDF p.7. -/
def entropySup {I : Type} (A : Set (State I)) : ℝ≥0∞ :=
⨆ rho : A, stateEntropyNats rho.val
/-- Source continuity is finite-valued continuity, explicitly used on PDF p.18. -/
def FiniteContinuousOn {I : Type} (f : State I → ℝ≥0∞)
(A : Set (State I)) : Prop :=
(∀ rho ∈ A, f rho < ⊤) ∧ ContinuousOn f A
/-- Finite-valued relative continuity at a point, PDF p.7. -/
def FiniteContinuousWithinAt {I : Type} (f : State I → ℝ≥0∞)
(A : Set (State I)) (rho : State I) : Prop :=
f rho < ⊤ ∧ ContinuousWithinAt f A rho
/-- H-convergence has its fixed reference in the SECOND slot, PDF p.4. -/
def HConverges {I : Type} (seq : ℕ → State I) (rho : State I) : Prop :=
Tendsto (fun n => stateRelativeEntropyNats (seq n) rho) atTop (𝓝 0)
/-- The information-radius condition defining the unique optimal average,
PDF pp.24,27. Theorem 1 establishes existence and uniqueness. -/
def RadiusCenter {I : Type} (A : Set (State I)) (omega : State I) : Prop :=
∀ rho ∈ A, stateRelativeEntropyNats rho omega ≤ setChiCapacity A
/-- Canonical choice by the source's defining radius condition, PDF p.27,
Definition 1. On a nonempty finite-capacity set Theorem 1 makes this choice
unique. Elsewhere this total helper has no claimed meaning as an optimal
average: its fallback is an element of A, not an assumed radius minimizer. -/
def optimalAverage {I : Type} (A : Set (State I)) (hA : A.Nonempty) : State I :=
if h : ∃ omega, RadiusCenter A omega then Classical.choose h else hA.choose
/-- Radius about a reference state, PDF p.25, (25); the empty supremum is zero. -/
def radius {I : Type} (A : Set (State I)) (sigma : State I) : ℝ≥0∞ :=
⨆ rho : A, stateRelativeEntropyNats rho.val sigma
/-- First regularity alternative, PDF p.28: finite entropy at the center and
entropy convergence along every H-convergent sequence in the CLOSED hull. -/
def RegularityOne {I : Type} (A : Set (State I)) (omega : State I) : Prop :=
stateEntropyNats omega < ⊤ ∧ ∀ seq : ℕ → State I,
(∀ n, seq n ∈ stateClosedConvexHull A) → HConverges seq omega →
Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (stateEntropyNats omega))
/-- Second regularity alternative, PDF p.28; no conjunction with the first. -/
def RegularityTwo {I : Type} (A : Set (State I)) (omega : State I) : Prop :=
FiniteContinuousOn (fun rho => stateRelativeEntropyNats rho omega) A
/-- Regular sets, PDF p.28, Definition 2, with the implicit nonempty domain. -/
def ChiRegular {I : Type} (A : Set (State I)) : Prop :=
A.Nonempty ∧ setChiCapacity A < ⊤ ∧ ∃ omega,
RadiusCenter A omega ∧ (RegularityOne A omega ∨ RegularityTwo A omega)
/-- Optimal generalized measure, PDF p.39, Definition 3. -/
def OptimalMeasure {I : Type} (A : Set (State I)) (mu : GeneralizedEnsemble I) : Prop :=
MeasureConcentratedOn (mu : Measure (State I)) A ∧ measureHolevo (mu : Measure (State I)) = setChiCapacity A
/-- Trace closure of extreme points, PDF p.40 (both overlines are essential). -/
def extremeClosure {I : Type} (A : Set (State I)) : Set (State I) :=
closure {rho | rho.coefficients ∈ (State.coefficients '' A).extremePoints ℝ}
/-- A concrete CPTP map packaged with its normalized state action, PDF pp.3,35.
The action is tied coefficient by coefficient to the accepted full trace-class
map; no finite Kraus or finite-dimensional restriction is imposed. -/
structure StateChannel (I J : Type) where
map : Matrix I I ℂ → Matrix J J ℂ
channel : IsTraceClassChannel map
action : State I → State J
action_eq : ∀ rho, (action rho).coefficients = map rho.coefficients
/-- Capacity-preserving channels mapping into the closed hull, PDF p.35. -/
def PreservingChannels {I : Type} (A : Set (State I)) : Set (StateChannel I I) :=
{Phi | Phi.action '' A ⊆ stateClosedConvexHull A ∧ setChiCapacity (Phi.action '' A) = setChiCapacity A}
/-- Common invariant states, PDF p.35; no commutativity is assumed. -/
def CommonChannelInvariant {I : Type} (F : Set (StateChannel I I)) (rho : State I) : Prop :=
∀ Phi ∈ F, Phi.action rho = rho
/-- Countable ensemble as its actual atomic probability law, PDF pp.39–40.
Normalization of w is required at each use, and zero weights contribute zero. -/
def countableLaw {I : Type} (w : ℕ → ℝ≥0) (rho : ℕ → State I) : Measure (State I) :=
Measure.sum (fun n => (w n : ℝ≥0∞) • Measure.dirac (rho n))
/-- All joint states with marginal membership, including entangled states,
PDF p.61. The two marginals are identified with actual normalized states. -/
def jointMarginalConstraintSet {I J : Type} (A : Set (State I)) (B : Set (State J)) :
Set (State (I × J)) :=
{omega | (∃ rho ∈ A, traceSecond omega.coefficients = rho.coefficients) ∧
(∃ sigma ∈ B, traceFirst omega.coefficients = sigma.coefficients)}
/-- Fixed-marginal coupling set C(rho,sigma), PDF p.62. -/
def couplingSet {I J : Type} (rho : State I) (sigma : State J) :
Set (State (I × J)) := jointMarginalConstraintSet {rho} {sigma}
/-- A layer in a CHOSEN eigenbasis, PDF p.22 and footnote 10. The theorems
explicitly require sigma diagonal in these coordinates, leaving repeated
eigenvalues and their basis choice visible. -/
def layer {I : Type} (sigma : State I) : Set (State I) :=
{rho | ∀ i, rho.coefficients i i = sigma.coefficients i i}
/-- Chosen coordinates are an eigenbasis of sigma, PDF p.22. -/
def Diagonal {I : Type} (sigma : State I) : Prop :=
∀ i j, i ≠ j → sigma.coefficients i j = 0
/-- Finite probability simplex, PDF p.36. The equation excludes n=0. -/
def InSimplex {n : ℕ} (w : Fin n → ℝ≥0) : Prop := (∑ k, w k) = 1
/-- The actual finite ensemble of specified states, PDF pp.5,36. -/
def finiteLaw {I : Type} {n : ℕ} (w : Fin n → ℝ≥0) (rho : Fin n → State I) :
Measure (State I) := ∑ k, (w k : ℝ≥0∞) • Measure.dirac (rho k)
/-- The objective whose maximum appears in Proposition 7, PDF p.36. -/
def unionObjective {I : Type} {n : ℕ} (A : Fin n → Set (State I))
(hA : ∀ k, (A k).Nonempty) (w : Fin n → ℝ≥0) : ℝ≥0∞ :=
(∑ k, (w k : ℝ≥0∞) * setChiCapacity (A k)) +
measureHolevo (finiteLaw w (fun k => optimalAverage (A k) (hA k)))
/-- Layer with the first n-1 rows and columns diagonal, PDF p.59.
Source indices start at one, so coordinate i corresponds to source i+1. -/
def tailLayer (sigma : State ℕ) (n : ℕ) : Set (State ℕ) :=
{rho | rho ∈ layer sigma ∧ ∀ i j, i ≠ j →
(i + 1 < n ∨ j + 1 < n) → rho.coefficients i j = 0}
/-- The concrete decreasing family of PDF p.61, not an arbitrary family
satisfying capacity conclusions: L_(n+1)(sigma) intersect V_(sigma,c). -/
def decreasingFamily (sigma : State ℕ) (c : ℝ≥0) (n : ℕ) : Set (State ℕ) :=
tailLayer sigma (n + 1) ∩ {rho | stateRelativeEntropyNats rho sigma ≤ (c : ℝ≥0∞)}
/-- Minimal closed equal-capacity subset, PDF p.30, footnote 19. -/
def MinimalClosedEqualCapacity {I : Type} (A B : Set (State I)) : Prop :=
IsClosed B ∧ B ⊆ A ∧ setChiCapacity B = setChiCapacity A ∧
∀ C : Set (State I), IsClosed C → C ⊆ B → setChiCapacity C = setChiCapacity B → C = B
/-- Actual spectral-power trace by finite-compression exhaustion, PDF p.13.
For positive exponents finite-compression eigenvalue interlacing gives the
extended trace of sigma^t. At t=0 this is the rank of the support projection,
not the ambient dimension. The scalar zero-eigenvalue branch is explicit. -/
def spectralPowerTrace {I : Type} (sigma : State I) (t : ℝ) : ℝ≥0∞ :=
⨆ s : Finset I, ENNReal.ofReal
((cfc (fun x : ℝ => if x = 0 then 0 else x ^ t)
(sigma.coefficients.submatrix (fun i : s => i.val) (fun i : s => i.val))).trace.re)
/-- Decrease coefficient, PDF p.13. Extended infima avoid a real junk value
when a convergence set is empty; state normalization makes t=1 admissible. -/
def decreaseCoefficient {I : Type} (sigma : State I) : ℝ≥0∞ :=
⨅ t : {t : ℝ // 0 < t ∧ spectralPowerTrace sigma t < ⊤}, ENNReal.ofReal t.val
/-- Finite-dimensional operator support, PDF p.13. A finite positive
rank-one sum characterizes positive finite rank in any coordinate basis;
this does NOT require finite coordinate support. -/
def PositiveFiniteRankState {I : Type} (rho : State I) : Prop :=
∃ (n : ℕ) (v : Fin n → QAlgorithms.RealRegisters.Hilbert I),
∀ i j, rho.coefficients i j = ∑ k, v k i * star (v k j)
/-- Any bounded orthogonal projection, PDF pp.71–73. Neither finite rank
nor a monotone-sequence condition is built into this type. -/
structure BoundedOrthogonalProjection (I : Type) where
operator : QAlgorithms.RealRegisters.Hilbert I →L[ℂ] QAlgorithms.RealRegisters.Hilbert I
idempotent : operator.comp operator = operator
selfAdjoint : operator.adjoint = operator
/-- Positive compression mass Tr(P rho), PDF p.71. On states the bounded
conjugation is trace class, hence the real trace series is summable. -/
def projectionMass {I : Type} (P : BoundedOrthogonalProjection I) (rho : State I) : ℝ :=
∑' i, (QAlgorithms.Papers.Independent.Frontier18.P01.boundedConjugation
P.operator rho.coefficients i i).re
/-- The source's normalized coefficients, PDF p.71. Uses are restricted to
positive mass, so inverse at zero is never asserted to produce a state. -/
def compressedCoefficients {I : Type} (P : BoundedOrthogonalProjection I)
(rho : State I) : Matrix I I ℂ :=
((projectionMass P rho)⁻¹ : ℂ) •
QAlgorithms.Papers.Independent.Frontier18.P01.boundedConjugation P.operator rho.coefficients
/-- Actual positive-domain image under Theta_P, PDF pp.71–72. Output states
are identified by the formula, not supplied with assumed capacity properties. -/
def projectionImage {I : Type} (P : BoundedOrthogonalProjection I) (A : Set (State I)) :
Set (State I) :=
{sigma | ∃ rho ∈ A, 0 < projectionMass P rho ∧
sigma.coefficients = compressedCoefficients P rho}
/-- Uniform retained mass, PDF p.72. The extended empty infimum is infinity;
all theorem uses explicitly require A nonempty. -/
def projectionSuccessInfimum {I : Type} (P : BoundedOrthogonalProjection I)
(A : Set (State I)) : ℝ≥0∞ :=
⨅ rho : A, ENNReal.ofReal (projectionMass P rho.val)
/-- Optimal average of a compression image on the eventual valid domain,
PDF p.73. An empty early image uses the original set's average only to make
the sequence total; Theorem 4 concludes that this branch eventually disappears. -/
def projectedAverage {I : Type} (P : BoundedOrthogonalProjection I) (A : Set (State I))
(hA : A.Nonempty) : State I :=
if h : (projectionImage P A).Nonempty then optimalAverage (projectionImage P A) h
else optimalAverage A hA
/-! Sanity tests for the defining conventions; no source theorem is proved. -/
example {I : Type} : entropySup (∅ : Set (State I)) = 0 := by simp [entropySup]
example {I : Type} : measureHolevo (0 : Measure (State I)) = 0 := by simp [measureHolevo]
example {I : Type} (mu : Measure (State I)) :
MeasureConcentratedOn mu Set.univ := by simp [MeasureConcentratedOn]
example {I : Type} (sigma : State I) : sigma ∈ layer sigma := by
intro i
rfl
example {I : Type} (X : Matrix I I ℂ) (i : I) : (Matrix.diagonal (Matrix.diag X)) i i = X i i := by
simp
example {I : Type} (Phi : StateChannel I I) (rho : State I) :
(Phi.action rho).coefficients = Phi.map rho.coefficients := Phi.action_eq rho
example {I J : Type} (rho : State I) (sigma : State J) (omega : State (I × J)) :
omega ∈ couplingSet rho sigma ↔
traceSecond omega.coefficients = rho.coefficients ∧
traceFirst omega.coefficients = sigma.coefficients := by
simp [couplingSet, jointMarginalConstraintSet]
example (t : ℝ) : (if (0 : ℝ) = 0 then 0 else (0 : ℝ) ^ t) = (0 : ℝ) := by
simp
example {I : Type} (rho : PureState I) : PositiveFiniteRankState rho.val := by
rcases rho.property with ⟨u, hu, heq⟩
refine ⟨1, fun _ => u, ?_⟩
intro i j
simp [heq, QAlgorithms.Papers.Independent.Dependency50.P33.rankOne]
example (sigma : State ℕ) (hdiag : Diagonal sigma) (n : ℕ) :
sigma ∈ tailLayer sigma n := by
refine ⟨fun _ => rfl, ?_⟩
intro i j hne hbelow
exact hdiag i j hne
example {I : Type} [Countable I] (mu : GeneralizedEnsemble I)
(hb : ∃ average : GeneralizedEnsemble I → State I,
(∀ mu, HasAverage mu (average mu)) ∧ Continuous average) :
HasAverage mu (probabilityAverage mu) := by
unfold probabilityAverage
rw [dif_pos hb]
exact (Classical.choose_spec hb).1 mu
example {I : Type} [Countable I] (mu : GeneralizedEnsemble I)
(hb : ∃ average : GeneralizedEnsemble I → State I,
(∀ mu, HasAverage mu (average mu)) ∧ Continuous average) :
meanCoefficients (mu : Measure (State I)) = (probabilityAverage mu).coefficients := by
unfold probabilityAverage
rw [dif_pos hb]
funext i j
exact ((Classical.choose_spec hb).1 mu i j).2.symm
example {I : Type} (A : Set (State I)) (hA : A.Nonempty)
(h : ∃ omega, RadiusCenter A omega) : RadiusCenter A (optimalAverage A hA) := by
unfold optimalAverage
rw [dif_pos h]
exact Classical.choose_spec h
example : ¬ InSimplex (fun _ : Fin 0 => (0 : ℝ≥0)) := by simp [InSimplex]
example : InSimplex (fun _ : Fin 1 => (1 : ℝ≥0)) := by simp [InSimplex]
example {I : Type} (rho : ℕ → State I) :
countableLaw (fun _ => 0) rho = 0 := by simp [countableLaw]
example {I J : Type} (B : Set (State J)) :
jointMarginalConstraintSet (∅ : Set (State I)) B = ∅ := by
ext omega
simp [jointMarginalConstraintSet]
/-! Source statement batch. -/
end QAlgorithms.Papers.Independent.Gap48.P18
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P18.BoundedOrthogonalProjection
For any index type , including an empty or uncountable one, this structure consists of a bounded complex-linear operator , together with the conditions and , where is its Hilbert-space adjoint. No nonzero, finite-rank, or proper-range condition is imposed; in particular, the zero and identity operators are permitted.
QAlgorithms.Papers.Independent.Gap48.P18.ChiRegular
For any index type , let consist of complex arrays with an expansion , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Let be the infimum of these expansion costs, taking the empty infimum as , and give the topology generated by , , and its Borel measurable structure. For coordinate compressions to finite , define
using , natural logarithms with , and continuous functional calculus for matrix logarithms. Set and
and let consist of states such that every admits a real convex combination of coefficient arrays from with . The defined property of means that , , and there exists a state such that for every , together with at least one of the following two conditions: and every sequence satisfying also satisfies ; or for every and is continuous on . Limits and continuity of entropy quantities use . The alternatives are joined by inclusive “or”; neither membership nor uniqueness is required.
QAlgorithms.Papers.Independent.Gap48.P18.CoefficientConvexStates
For any index type and any subset of its state space, this predicate says that the set of coefficient matrices of states in is convex over : for every and every pair of real numbers with , there exists whose coefficient matrix is , where are the coefficient matrices of , and real scalars act through their inclusion in . A state matrix here admits a representation with and , has every finite quadratic form real and nonnegative, and has summable real diagonal with sum . No countability or nonemptiness hypothesis is imposed. In particular, the predicate holds vacuously for , and it includes convex combinations with either coefficient equal to zero.
QAlgorithms.Papers.Independent.Gap48.P18.CommonChannelInvariant
For any type , any set of state channels on , and any state on , this predicate means that for every . Here a state on any index type is a complex matrix with an expansion , where and , with real nonnegative quadratic form for every finite and every , and with summable real diagonal of sum . Each state channel has a matrix map , additive and complex homogeneous on matrices admitting such expansions and preserving that class, together with a state map whose coefficient matrix at each state is its image under ; furthermore, for every natural number and every state on , the matrix with entries is a state. The predicate is vacuously true when ; no countability assumption on is made.
QAlgorithms.Papers.Independent.Gap48.P18.Diagonal
For any type and any state on , this predicate means that for every pair of distinct indices . Here a state is a complex matrix admitting with and , whose quadratic form is real and nonnegative for every finite and every , and whose real diagonal is summable with sum . No countability assumption is made. The off-diagonal condition is vacuous when has at most one element, although an empty admits no state.
QAlgorithms.Papers.Independent.Gap48.P18.FiniteContinuousOn
For any index type , let be the space of states: complex arrays admitting an expansion , where and , such that every finite quadratic form , for finite and , is real and nonnegative, and the real diagonal is summable with . For any complex array , define as the infimum of over all expansions of this same kind representing , with infimum if there are none. Equip with the topology generated by the sets , for and real . For a function and a subset , the defined property means that for every and that is continuous on , using the usual topology on . If , both requirements hold vacuously; no countability or nonemptiness assumption is imposed on .
QAlgorithms.Papers.Independent.Gap48.P18.FiniteContinuousWithinAt
For any index type , let consist of complex arrays admitting an expansion , with and , whose finite quadratic forms are real and nonnegative for every finite and every , and whose real diagonal is summable with sum . Write for the infimum of the costs of all such expansions of an array , taking the empty infimum to be , and give the topology generated by , with and . For , , and , the defined property is together with continuity of at when its argument is restricted to . Membership is not required, and no finiteness condition is imposed on other values of . For , the continuity condition is vacuous, while remains required.
QAlgorithms.Papers.Independent.Gap48.P18.FiniteEnsembleOn
For any index type , any Borel probability measure on its state space, and any subset of that space, this predicate means that the topological support of is a finite set and is contained in . States are complex matrices admitting expansions , where and , having real nonnegative finite quadratic forms and summable real diagonal of sum . The topology is generated by , for states and , where is the infimum of the expansion sums for , with empty infimum . Support means the set of states every open neighborhood of which has positive measure. Thus finiteness concerns this topological support, and containment requires every point of that support to lie in . Neither countability of nor measurability of is assumed; when , the predicate requires empty support.
QAlgorithms.Papers.Independent.Gap48.P18.HConverges
For any index type , a state is a complex array admitting a countable expansion , with and , such that every finite quadratic form is real and nonnegative and the real diagonal is summable with sum . For finite , write . Define
where and the matrix logarithms are obtained by continuous functional calculus from the natural logarithm, with its total convention . For a sequence of states and a state , the defined property means precisely that as , in . The order of the two arguments is as displayed, and no separate convergence of the coefficient arrays is included in the definition.
QAlgorithms.Papers.Independent.Gap48.P18.InSimplex
For every natural number , including , and every family of finite nonnegative real numbers, this predicate means exactly
Nonnegativity is already part of the weights’ type. When , the sum is , so the predicate is false.
QAlgorithms.Papers.Independent.Gap48.P18.MeasureConcentratedOn
For any index type , any measure on its state space, and any subset of that state space, this predicate means
equivalently, for -almost every state . States here are matrices admitting expansions with and summable , having real nonnegative finite quadratic forms, and having summable real diagonal with sum . The measure is on the Borel space for the topology generated by , where is a state, , and is the infimum of the expansion sums for its argument, with empty infimum . No measurability assumption on , probability assumption on , or countability assumption on is required. The zero measure satisfies the predicate for every , including ; for , the predicate requires that the whole state space have measure zero.
QAlgorithms.Papers.Independent.Gap48.P18.MinimalClosedEqualCapacity
For any index type , possibly empty or uncountable, and sets of states on , this predicate says that is closed, , its capacity equals that of , and every closed subset with the same capacity as is equal to . Here a state has a complex coefficient matrix admitting an expansion , with and ; every finite quadratic form is real and nonnegative; and the real diagonal entries are summable with sum . Define to be the infimum, over all such expansions of , of , regarded in ; an empty infimum is . Closedness uses the topology generated by the sets , for states and real . To specify the capacity, for finite matrices put
where matrix logarithms use the continuous functional calculus with the total real logarithm, for which . For a Borel probability measure on the state space, set and ; the coordinate integrals are the total complex integrals, equal to zero when the corresponding function is not integrable. The capacity of a set is , over probability measures whose topological support is finite and contained in . Thus the asserted minimality concerns all closed subsets of , including the empty set. No nonemptiness or finite-capacity condition is imposed; the capacity of the empty set is .
QAlgorithms.Papers.Independent.Gap48.P18.OptimalMeasure
For any index type , let be the space of complex arrays admitting an expansion with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Let be the infimum of these expansion costs for , with empty infimum ; use the topology generated by , , and its Borel measurable structure. For arrays , define as the supremum over finite coordinate compressions of when , and otherwise, using and natural logarithms through continuous functional calculus. For any measure on , put
For and a probability measure on , the defined property means that for -almost every and that . It requires neither finite support of nor containment of its topological support in , and it imposes no finiteness requirement on the common value of this equality. No measurability assumption on is explicitly included.
QAlgorithms.Papers.Independent.Gap48.P18.PositiveFiniteRankState
For any index type and state with coefficient matrix , this predicate says that there exist a natural number and vectors such that
The state argument already requires a countable expansion with , real nonnegative quadratic forms on every finite coordinate subset, and summable real diagonal entries of total sum . The finitely many vectors have no individual normalization, orthogonality, or nonzero requirement. The quantified value gives the zero matrix through the empty sum and therefore cannot represent a state with diagonal sum . No finiteness or countability assumption on is made.
QAlgorithms.Papers.Independent.Gap48.P18.PreservingChannels
For any type and set of states on , this defines the set of state channels such that every , for , belongs to the closure described below of the real convex hull of , and . Here a state on any index type is a complex matrix admitting an expansion , where and , whose quadratic form is real and nonnegative for every finite and every , and whose real diagonal entries form a summable family with sum . A state channel consists of a matrix map and a state map with coefficients : preserves matrices admitting the stated expansions, is additive and complex homogeneous on those matrices, and, for every natural number , sends every state on to a state by the rule . The case has no such input states. Define as the infimum, over all stated expansions of , of , with infimum if there is no expansion. The closure requirement means that for every and every , there is a finite real convex combination of coefficient matrices of states in such that . To define , equip states with the Borel measurable structure of the topology generated by the sets , for states and ; then is the supremum of
over probability measures with finite topological support contained in . These outer integrals are nonnegative extended integrals, and the coordinate integrals defining are complex Bochner integrals. For arbitrary matrices , is the supremum over all finite , including , of
where are coordinate restrictions and matrix logarithms use continuous functional calculus with the total real logarithm, including . No countability, nonemptiness, or finite-capacity assumption is imposed; an empty supremum defining is , and capacities may be infinite.
QAlgorithms.Papers.Independent.Gap48.P18.RadiusCenter
For any index type , let consist of complex arrays admitting an expansion with and , with all finite quadratic forms real and nonnegative and with summable real diagonal of sum . Let be the infimum of these expansion costs for , with empty infimum , and give the topology generated by for , together with its Borel measurable structure. For arrays , define as the supremum over finite of when , and otherwise; here are coordinate compressions, , and logarithms use continuous functional calculus of the natural logarithm. For a probability measure on , put and
For and , the defined property is . It does not require or uniqueness of . For empty , and the property is vacuous; if , every state satisfies the inequality.
QAlgorithms.Papers.Independent.Gap48.P18.RegularityOne
For any index type , let consist of complex arrays admitting an expansion , with and , having real, nonnegative finite quadratic forms and a summable real diagonal of sum . Write for the infimum of such expansion costs for , with empty infimum . For finite , write for coordinate compression and define
Here , logarithms are natural, matrix logarithms use continuous functional calculus, and . For , let be the states such that for every real there exists in the real convex hull of the coefficient arrays of members of with . For a state , the defined property means that and, for every sequence of states with for all , the implication holds, with both limits taken in . It does not require or . If , then , so the sequence condition is vacuous and only remains.
QAlgorithms.Papers.Independent.Gap48.P18.RegularityTwo
For any index type , states are complex arrays admitting an expansion , where and , with every finite quadratic form real and nonnegative and with summable real diagonal of sum . Let be the infimum of these expansion costs for , with empty infimum , and equip the state space with the topology generated by for . For finite coordinate compressions , define as the supremum over finite of if , and otherwise, where and matrix logarithms use continuous functional calculus of the natural logarithm. For and , the defined property means that for every and that , valued in , is continuous on . Membership and finiteness of the entropy of are not required; for empty , the property is vacuous.
QAlgorithms.Papers.Independent.Gap48.P18.StateChannel
For arbitrary index types , call a complex array on an index type trace class when it admits sequences such that and . A state on is such an array for which every finite quadratic form , for finite and , is real and nonnegative, and whose real diagonal is summable with sum . The structure consists of a function , proofs that it maps every trace-class array to a trace-class array, satisfies for trace-class , and satisfies for every and trace-class , together with the requirement that for every and every state on , the array
is a state on ; it also contains a function and a proof that the coefficient array of equals for every state . The additivity and homogeneity requirements apply only to trace-class inputs. No countability or nonemptiness of is assumed, and the requirement is vacuous because there are no states on the empty index type.
QAlgorithms.Papers.Independent.Gap48.P18.compressedCoefficients
For any index type , bounded complex-linear operator on with , and state with coefficient matrix , define
This declaration returns the complex matrix with entries , where the real inverse is then embedded into , and is the coordinate unit vector at . A state admits an expansion with and , has real nonnegative quadratic forms on every finite coordinate subset, and has summable real diagonal entries of sum . The definition requires neither nor ; under the total inverse convention , it returns the zero matrix when . It returns a matrix without separately asserting that this matrix is a state. Infinite sums are total sums, equal to zero for nonsummable families, and no countability assumption on is imposed.
QAlgorithms.Papers.Independent.Gap48.P18.countableLaw
For any type , any sequence of finite nonnegative real weights , and any sequence of states on , this defines the measure
Thus, for every measurable set of states, , with the sum taken in ; repeated states contribute repeatedly. A state is a complex matrix admitting an expansion with and , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum . The measurable structure is Borel for the topology generated by , where is a state, , and is the infimum of the expansion costs for , or if there is no expansion. The weights are not required to be summable or to sum to : the total mass is , which may be infinite, and all-zero weights give the zero measure.
QAlgorithms.Papers.Independent.Gap48.P18.couplingSet
For any types and states on and on , this defines the set of states on satisfying exactly
The sums use the total complex infinite-sum operation, with value on nonsummable families, and no additional summability assumptions are stated. A state on any index type is a complex matrix admitting for sequences with , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum . The definition makes no countability assumption and does not assert uniqueness of .
QAlgorithms.Papers.Independent.Gap48.P18.decreaseCoefficient
For any index type and state on , this defines
as an element of , where , for , and the matrix function is obtained by continuous functional calculus. A state is a complex matrix admitting with and , having real nonnegative finite quadratic forms, and having summable real diagonal entries with sum . Each eligible is embedded into by taking its nonnegative part, which is just because . If there are no eligible exponents, the infimum is ; an infimum of eligible positive exponents can be without itself being eligible. The finite subsets include the empty subset, and no countability assumption on is imposed.
QAlgorithms.Papers.Independent.Gap48.P18.decreasingFamily
For any state indexed by , any finite nonnegative real number , and any natural number , this defines the set of states satisfying all three conditions
A state is a complex matrix admitting , with and , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum . The extended nonnegative quantity is the supremum over every finite , including , of
where are the coordinate restrictions and logarithms use continuous functional calculus with the total real logarithm, including . Because is finite, the inequality excludes . At , the off-diagonal condition is vacuous, leaving equality of the diagonals and the entropy bound.
QAlgorithms.Papers.Independent.Gap48.P18.distanceSquared
For any index type and states with coefficient matrices , the definition gives , where
The infimum is over countably indexed expansions, and an empty family of admissible expansions has infimum . A state matrix itself must admit such an expansion, must have every finite quadratic form real and nonnegative, and must have summable real diagonal entries with sum . The square is taken in the extended nonnegative reals, so squares to . The definition includes coinciding states, for which the value is , and imposes no countability assumption on ; there are no state arguments when is empty.
QAlgorithms.Papers.Independent.Gap48.P18.entropySup
For any index type and any subset of its state space, this definition assigns the extended nonnegative real supremum
where is the finite coordinate restriction and the matrix logarithm is obtained by continuous functional calculus for the total real logarithm, with . A state matrix admits an expansion with and , has real nonnegative finite quadratic forms, and has summable real diagonal of sum . No countability, compactness, measurability, or nonemptiness assumption is imposed on or . The empty coordinate restriction contributes , the value may be , and gives value .
QAlgorithms.Papers.Independent.Gap48.P18.extremeClosure
For any index type , let consist of complex arrays admitting expansions , where and , with every finite quadratic form real and nonnegative and with summable real diagonal of sum . For any complex array , let be the infimum of these expansion costs for , with empty infimum , and equip with the topology generated by for . For a subset , form the set of its coefficient arrays, view that set in the real vector space of complex arrays, and take its extreme points: those members that do not lie strictly between two distinct members of that set. The defined set is the closure, in , of the states whose coefficient arrays are such extreme points. No convexity, closedness, or nonemptiness of is assumed; for empty , the resulting set is empty.
QAlgorithms.Papers.Independent.Gap48.P18.finiteLaw
For any type , any natural number , any family of finite nonnegative real weights , and any family of states on , this defines the measure
For every measurable set , its mass is ; repeated states contribute repeatedly. A state is a complex matrix admitting with and , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum . States carry the Borel measurable structure of the topology generated by , where is a state, , and is the infimum of the stated expansion costs for , with value if there is no expansion. No normalization of the weights is required: the measure has finite total mass , and for it is the zero measure.
QAlgorithms.Papers.Independent.Gap48.P18.jointMarginalConstraintSet
For any types , any set of states on , and any set of states on , this defines the set of states on for which there exist and satisfying
Every displayed sum is the total complex infinite-sum operation, which returns for a nonsummable family; no separate summability hypotheses on these sums are included. Here a state on any index type is a complex matrix admitting an expansion , with and , whose quadratic forms are real and nonnegative for every finite and every , and whose real diagonal is summable with sum . No countability assumptions are imposed. The defined set is empty if either or is empty.
QAlgorithms.Papers.Independent.Gap48.P18.layer
For any type and any state on , this defines the set of all states on satisfying as complex numbers for every , with no further equality required between off-diagonal entries. Here a state is a complex matrix admitting an expansion , where and , such that is real and nonnegative for every finite and every , and such that its real diagonal entries are summable with sum . No countability assumption is imposed; if is empty, there is no state satisfying this diagonal-sum requirement.
QAlgorithms.Papers.Independent.Gap48.P18.meanCoefficients
For any index type and any measure on its state space, the definition produces the complex matrix given entrywise by
The state space consists of matrices admitting expansions with and summable , having real nonnegative finite quadratic forms, and having summable real diagonal entries with sum . Its measurable sets are the Borel sets for the topology generated by the sets , for states and real , where is the infimum of over all such expansions of , with empty infimum . The integral is the complex Bochner integral. No probability, finiteness, or entrywise integrability hypothesis is imposed on ; a nonintegrable entry has integral under the total integral convention. The resulting matrix is not required by this definition to be a state. In particular, the zero measure gives the zero matrix.
QAlgorithms.Papers.Independent.Gap48.P18.measureHolevo
For any index type and any Borel measure on its state space, the definition gives the extended nonnegative integral
where, writing for finite coordinate restrictions, if , and otherwise
The logarithms use continuous functional calculus for the total real logarithm, with , and the empty restriction contributes . States are matrices with summable countable expansions , , , real nonnegative finite quadratic forms, and summable real diagonal of sum . The state topology is generated by , where is a state, , and is the infimum of the expansion sums just described; the measure uses its Borel sets. No probability or integrability assumption is imposed on , and need not be a state; its nonintegrable entries are defined to be . The outer integral is the lower Lebesgue integral and may be ; the zero measure gives value .
QAlgorithms.Papers.Independent.Gap48.P18.optimalAverage
For any index type , states are complex arrays with an expansion , where and , all finite quadratic forms are real and nonnegative, and the real diagonal is summable with sum . Define as the infimum of these expansion costs, with empty infimum , and equip the state space with the topology generated by , , and its Borel measurable structure. For arrays , let be the supremum over finite coordinate sets of if , and otherwise, using natural logarithms through continuous functional calculus and . For a probability measure , set , and define
Given and a supplied proof that , the defined state is an arbitrary classically chosen satisfying for every , if such a state exists; otherwise it is an arbitrary element of , chosen using the supplied nonemptiness proof. In the first branch, membership in is not required, and neither branch asserts uniqueness.
QAlgorithms.Papers.Independent.Gap48.P18.probabilityAverage
For any countable index type and any Borel probability measure on its state space, the definition returns , where is one continuous map chosen from the existence assertion that a continuous state-valued averaging map exists for all such probability measures. Specifically, for every probability measure , every coefficient function is integrable and
Here states are complex matrices admitting expansions with and , having real nonnegative finite quadratic forms, and having summable real diagonal of sum . The state topology is generated by the sets , where is the infimum of those expansion sums for , is a state, and ; probability measures carry their usual weak topology. The choice is of the whole continuous averaging map and is not an additional uniqueness assertion. Countable includes finite and empty types, although an empty has neither states nor probability measures on its state space.
QAlgorithms.Papers.Independent.Gap48.P18.projectedAverage
For any index type , bounded complex-linear operator on with , set of states on , and supplied witness that , this defines a state by the following choices. For a state matrix , put and , where is the coordinate unit vector; let be the set of states with coefficients for some with . If , apply the following selection rule to ; otherwise apply it to . For a nonempty set , if there exists a state such that for every , choose one such ; if none exists, choose a member of using its nonemptiness witness. The first choice is not required by this definition to belong to . Here states are complex matrices admitting countable expansions with and , having real nonnegative finite-coordinate quadratic forms and summable real diagonal entries of sum . For any matrix , let be the infimum of over such expansions of , with value when there is none; the state topology is generated by for states and . Define
where are coordinate compressions and logarithms use continuous functional calculus with . The number is the supremum of over Borel probability measures with finite topological support contained in , where . All these infinite sums and coordinate integrals use total conventions, assigning zero to nonsummable families or nonintegrable coordinate functions, respectively. No countability, finite-capacity, or existence-of-center hypothesis is imposed; if , then is empty and the selection rule is applied to .
QAlgorithms.Papers.Independent.Gap48.P18.projectionImage
For any index type , bounded complex-linear operator on satisfying , and set of states on , this defines the set of states for which there exists such that, writing for 's coefficient matrix,
one has and for every . Here is the coordinate unit vector, and a state is a complex matrix admitting an expansion with and , having real nonnegative finite-coordinate quadratic forms, and having summable real diagonal entries of sum . Infinite sums use their total conventions, with nonsummable families assigned sum zero. Only inputs of strictly positive mass are admitted; the set is empty when is empty or . No countability assumption on is made.
QAlgorithms.Papers.Independent.Gap48.P18.projectionMass
For any index type , bounded complex-linear operator satisfying , and state with coefficient matrix , this defines the real number
where has coordinate at and elsewhere. The state condition means that for vectors with , every finite-coordinate quadratic form of is real and nonnegative, and its real diagonal entries are summable with sum . The displayed sums are taken in their specified nested order and use total infinite-sum conventions: a nonsummable real or complex family has total sum . The definition imposes no additional positive-mass hypothesis; for its value is . No countability assumption on is made.
QAlgorithms.Papers.Independent.Gap48.P18.projectionSuccessInfimum
For any index type , bounded complex-linear operator on satisfying , and set of states on , this defines
in , where is the coordinate unit vector. A state matrix has an expansion with and , has real nonnegative finite-coordinate quadratic forms, and has summable real diagonal entries totaling . The infimum ranges over every member of , without restricting to states of positive mass. The maximum with zero is the conversion from a real number to an extended nonnegative number. If , the value is ; if and , it is . The infinite sums are total sums, zero for nonsummable families, and need not be countable.
QAlgorithms.Papers.Independent.Gap48.P18.radius
For any index type , states are complex arrays admitting expansions with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . For a finite , denote coordinate compression by , and define
where and the logarithms are given by continuous functional calculus of the natural logarithm. For a set of states and a state , the defined value is . The state need not belong to ; the value may be infinite, and for the supremum is .
QAlgorithms.Papers.Independent.Gap48.P18.setChiCapacity
For any index type and any subset of its state space, this definition assigns
Here ; when , and otherwise
The restrictions are coordinate restrictions, logarithms use continuous functional calculus for the total real logarithm with , and the empty restriction contributes . States are matrices admitting expansions with and summable , having real nonnegative finite quadratic forms and summable real diagonal of sum . Their topology is generated by , where is the infimum of such expansion sums, is a state, and ; support consists of points whose every open neighborhood has positive measure. The averages use Bochner integrals, with nonintegrable entries assigned , and the displayed outer integral is the lower Lebesgue integral. There is no countability assumption on , measurability assumption on , or requirement that an average lie in . The value belongs to ; if there are no eligible probability measures, the supremum is .
QAlgorithms.Papers.Independent.Gap48.P18.spectralPowerTrace
For any index type , a state on , and any real number , this defines the extended nonnegative number
where is applied by the continuous functional calculus. A state here is a complex matrix with an expansion , where and , whose finite quadratic forms are real and nonnegative, and whose real diagonal entries are summable with sum . The supremum includes the empty compression, which contributes , and may be infinite. There is no restriction : at the scalar function still takes value at zero and value on positive eigenvalues; for negative , zero eigenvalues also contribute . No countability assumption on is made; if is empty, no state satisfies the stated state conditions.
QAlgorithms.Papers.Independent.Gap48.P18.stateClosedConvexHull
For any index type and any subset of its state space, this definition gives the set of states , with coefficient matrix , such that for every real there is a matrix in the real convex hull of the coefficient matrices of satisfying
That real convex hull consists of finite convex combinations of matrices from . For any matrix , is the infimum of over all representations , with and summable norm products; an empty infimum is . A state matrix must itself admit such a representation, have every finite quadratic form real and nonnegative, and have summable real diagonal entries with sum . The approximation inequality is strict, and no countability, nonemptiness, closedness, or convexity assumption is imposed on or . For , the resulting set is empty.
QAlgorithms.Papers.Independent.Gap48.P18.stateEntropyNats
For any index type and state , write for its complex coefficient matrix. Here a state means that admits a representation with and , every finite quadratic form is real and nonnegative, and the real diagonal entries are summable with sum . The definition assigns the extended nonnegative real number
where , and denotes continuous functional calculus applied to the real logarithm. The logarithm is the total real logarithm, with . The empty finite subset is included and contributes ; the supremum may be . No countability or nonemptiness assumption on is imposed, although no state exists when is empty.
QAlgorithms.Papers.Independent.Gap48.P18.stateRelativeEntropyNats
For any index type and states with complex coefficient matrices , the definition assigns , valued in . A state matrix here admits an expansion with and , has real nonnegative finite quadratic forms, and has summable real diagonal entries whose sum is . For the finite restrictions , the quantity in the supremum is
The matrix logarithms use continuous functional calculus for the total real logarithm, including . The kernel condition is tested separately on every finite restriction. The empty restriction contributes ; the result may be infinite even though each finite value is finite. There is no countability assumption on ; an empty admits no state arguments.
QAlgorithms.Papers.Independent.Gap48.P18.tailLayer
For any state indexed by and any natural number , this defines the set of states satisfying for every , together with
Here a state is a complex matrix admitting , where and , whose quadratic form is real and nonnegative for every finite and every , and whose real diagonal is summable with sum . For or , the additional off-diagonal condition is vacuous, so only equality of the diagonals is required.
QAlgorithms.Papers.Independent.Gap48.P18.unionObjective
For any type , any natural number , any family of sets of states on , supplied with the assumption that every is nonempty, and any finite nonnegative real weights , , this defines the extended nonnegative number
The outer integral is the nonnegative extended integral, and each coordinate integral is the complex Bochner integral. Here a state is a complex matrix admitting , with and , having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum . States carry the Borel structure of the topology generated by , where is the infimum of these expansion costs, or when no expansion exists. For arbitrary matrices , define , including the empty restriction, where
Matrix logarithms use continuous functional calculus with the total real logarithm, including . The quantity is the supremum of over probability measures whose topological support is finite and contained in , with defined by the same coordinate integrals; an empty supremum is . For each , if there exists a state satisfying for every , then is a classically chosen such state, without an additional requirement that it belong to ; otherwise, is a classically chosen member of , using the supplied nonemptiness assumption. The weights need not sum to , capacities may be infinite, and extended arithmetic uses . For , the nonemptiness assumption is vacuous and the defined value is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.