Definitions for Tight bound on relative entropy by entropy difference
DefinitionQAlgorithms_Papers_Independent_Support50_P15The objects the formalized statements of Tight bound on relative entropy by entropy difference (arXiv:1304.0036) are stated in. Each was checked against the paper by a blind read-back and a moderator.
EntropyState: Density matrices, including singular ones (PDF p.3, §1.1).stateRelativeNats: Eq. (3), PDF p.3: audited Umegaki entropy, embedded into the signed extended reals.difference: Eq. (2), PDF p.3, with the argument order of the source.klTerm: One term of classical relative entropy; support failure is infinity (PDF p.3).binaryRelative: Binary relative entropy, Eq. (5), PDF p.3, with endpoint limits.massLimit: Largest admissible small-eigenvalue mass in Eq. (6), PDF p.4.degenerateSpectrumEntropy: Entropy of the spectrum (10), PDF pp.3--4.entropyDifferenceFeasible: The scalar feasible set in Eq. (6), PDF p.4.tightBound: Eq. (6), PDF p.4. Infimum of the empty feasible set is +infinity (PDF p.21).minimizingPair: Attainment of the actual scalar optimization (PDF pp.4,20--22).familyProb: The probabilities in the explicitly computed witness (10), PDF p.4.family: The diagonal witness (10), PDF p.4; meaningful for d>=2 and 0<=s<=1.varianceObjective: The function maximized in Eq. (7), PDF p.4; the optimization excludes endpoints.maxVariance: Eq. (7), PDF p.4. On d>=2 the value set is nonempty and bounded.easyVariance: Eq. (8), PDF p.4.optimalMass: The unique maximizing scalar, when d>=2 (PDF pp.8,25).surprisalVariance: Eq. (19), PDF p.7: zero eigenvalues have zero sampling weight.stateObservableVariance: Variance of a Hermitian observable (PDF pp.7--9).exponentialBound: The exponential lower bound in (11), PDF p.4.cubicBound: The cubic polynomial in (11), PDF p.4.redundancyScale: The common denominator L in (46)--(54), PDF pp.14--16.redundancyBound: The explicit lower bound in (51), (52), (54), PDF pp.14--16.asymmetryConjecture: The unproved asymmetry conjecture in a fixed dimension (PDF pp.14--15).continuityEntropy: h_d in (16), PDF p.6.entropyInverse: Inverse on the increasing branch [0,(d-1)/d], PDF p.6, (18).inverseEstimate: The explicit inverse estimate in (18), with its continuous extension at zero (PDF p.6).thermalFinite: Gibbs state at a positive finite temperature, (23), PDF p.8.groundSpaceDensity: Normalized projector onto the entire ground space, PDF p.9.gibbsAtTemperature: Thermal states for all T in [0,infinity], with both endpoint conventions (PDF p.9).thermalExpectedEnergy: Mean energy E(T), PDF p.9.heatCapacity: Heat capacity defined by dE/dT, not by the variance identity (24), PDF p.9.optimalHamiltonian: One fixed optimal Hamiltonian, PDF p.9, Remark 11.fullRank: Full rank on the already restricted finite-dimensional support, PDF p.10.EntropyPathPartition: An arbitrary strict partition, for (38)--(40), PDF p.12.mesh: Mesh controls all subdivisions, not just uniform ones (PDF p.12).piecewiseC1: Piecewise C1 means globally continuous with C1 restrictions on a finite subdivision (p.12).entropyHeatSum: The right-endpoint Riemann sum in (38), PDF p.12.partitionHeat: Actual heat divided by bath temperature, H_j=-T_j log rho(t_j), (27),(38), pp.10,12.Process: The actual finite sequence of states and step Hamiltonians (PDF pp.10,13).isIsothermal: Isothermal equilibration, with final Hamiltonian equal to the fixed external H (p.13).processHeat: Heat is computed from the Hamiltonians and state increments (27), PDF pp.10,13.extractedWork: Extracted work = heat - internal energy increase (41)--(42), PDF p.13.helmholtzFreeEnergy: Free energy at the fixed Hamiltonian and temperature (41), PDF p.13.availableWork: Available work computed from free energies, not defined as a process optimum (41), p.13.extendedDomainInfimum: A minimum over a specified domain in the complete extended real order (pp.14--16).attainsMinimum: Actual attainment, retained whenever the source writes min (PDF p.14).minimaxRedundancy: Minimal redundancy (47), PDF p.14, over quantum states as also asserted on p.15.minEntropy: Minimal entropy of the finite nonempty source family (PDF p.14).sourceEntropyMaximum: Maximal entropy of the finite nonempty source family (PDF p.14).entropyRadius: The intermediate objective in (48), PDF p.14.isLaw: A normalized classical law in the paper's fixed basis (PDF p.3).shannonEntropyNats: Natural-log Shannon entropy, matching the diagonal density matrix (PDF p.3).FiniteOutputChannel: Classical channel, as in Proposition 13, PDF p.15; X need not be finite.finiteOutputCapacityNats: Nats capacity: supremum of mutual information over all finite-support input laws (p.15). For finite output this covers arbitrary nonempty discrete input alphabets by approximation.entropyConstraintDistance: Eq. (53), PDF p.16, with a strict entropy constraint and empty-set value infinity.chernoffCoefficient: Chernoff coefficient infimum including one-sided endpoint limits, PDF p.16. Using 0<s<1 avoids the spurious 0^0=1 at singular endpoints.chernoff: Classical Chernoff information; disjoint support gives infinity (54), PDF p.16.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_ExtendedQuantumEntropy
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P56
/-!
Reeb and Wolf, arXiv:1304.0036v3. All logarithms below are natural.
The accepted entropy in nats is imported from Information100.P56.
Distinct paper-local definitions have complete bodies; only result statements use `sorry`.
-/
noncomputable section
attribute [local instance] Classical.propDecidable
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P15
-- Exact accepted entropy in nats; no local redeclaration.
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
/-- Density matrices, including singular ones (PDF p.3, §1.1). -/
abbrev EntropyState (d : ℕ) := {a : Matrix (Fin d) (Fin d) ℂ // IsDensityMatrix a}
/-- Eq. (3), PDF p.3: audited Umegaki entropy, embedded into the signed extended reals. -/
def stateRelativeNats {d : ℕ} (a b : EntropyState d) : EReal :=
(QuantumLoss.umegakiEntropy a.val b.val a.property b.property).toEReal
/-- Eq. (2), PDF p.3, with the argument order of the source. -/
def difference {d : ℕ} (a b : Matrix (Fin d) (Fin d) ℂ) : ℝ := entropy a - entropy b
/-- One term of classical relative entropy; support failure is infinity (PDF p.3). -/
def klTerm (p q : ℝ) : EReal :=
if p = 0 then 0 else if q = 0 then ⊤ else (p * Real.log (p / q) : ℝ)
/-- Binary relative entropy, Eq. (5), PDF p.3, with endpoint limits. -/
def binaryRelative (s r : ℝ) : EReal := klTerm s r + klTerm (1 - s) (1 - r)
/-- Largest admissible small-eigenvalue mass in Eq. (6), PDF p.4. -/
def massLimit (d : ℕ) : ℝ := ((d : ℝ) - 1) / d
/-- Entropy of the spectrum (10), PDF pp.3--4. -/
def degenerateSpectrumEntropy (d : ℕ) (s : ℝ) : ℝ := Real.binEntropy s + s * Real.log ((d : ℝ) - 1)
/-- The scalar feasible set in Eq. (6), PDF p.4. -/
def entropyDifferenceFeasible (d : ℕ) (delta s r : ℝ) : Prop :=
s ∈ Set.Icc 0 (massLimit d) ∧ r ∈ Set.Icc 0 (massLimit d) ∧
degenerateSpectrumEntropy d s - degenerateSpectrumEntropy d r = delta
/-- Eq. (6), PDF p.4. Infimum of the empty feasible set is +infinity (PDF p.21). -/
def tightBound (d : ℕ) (delta : ℝ) : EReal :=
sInf {v | ∃ s r : ℝ, entropyDifferenceFeasible d delta s r ∧ v = binaryRelative s r}
/-- Attainment of the actual scalar optimization (PDF pp.4,20--22). -/
def minimizingPair (d : ℕ) (delta s r : ℝ) : Prop :=
entropyDifferenceFeasible d delta s r ∧ binaryRelative s r = tightBound d delta
/-- The probabilities in the explicitly computed witness (10), PDF p.4. -/
def familyProb (d : ℕ) (s : ℝ) (i : Fin d) : ℝ :=
if i.val = 0 then 1 - s else s / ((d : ℝ) - 1)
/-- The diagonal witness (10), PDF p.4; meaningful for d>=2 and 0<=s<=1. -/
def family (d : ℕ) (s : ℝ) : Matrix (Fin d) (Fin d) ℂ :=
Matrix.diagonal (fun i => (familyProb d s i : ℂ))
/-- The function maximized in Eq. (7), PDF p.4; the optimization excludes endpoints. -/
def varianceObjective (d : ℕ) (r : ℝ) : ℝ :=
r * (1 - r) * (Real.log ((1 - r) / r * ((d : ℝ) - 1))) ^ 2
/-- Eq. (7), PDF p.4. On d>=2 the value set is nonempty and bounded. -/
def maxVariance (d : ℕ) : ℝ :=
sSup (varianceObjective d '' Set.Ioo 0 (1 / 2))
/-- Eq. (8), PDF p.4. -/
def easyVariance (d : ℕ) : ℝ := (Real.log ((d : ℝ) - 1)) ^ 2 / 4 + 1
/-- The unique maximizing scalar, when d>=2 (PDF pp.8,25). -/
def optimalMass (d : ℕ) : ℝ :=
Classical.epsilon (fun r : ℝ => r ∈ Set.Ioo 0 (1 / 2) ∧ varianceObjective d r = maxVariance d)
/-- Eq. (19), PDF p.7: zero eigenvalues have zero sampling weight. -/
def surprisalVariance {d : ℕ} (a : Matrix (Fin d) (Fin d) ℂ) : ℝ :=
(cfc (fun x : ℝ => x * (Real.log x) ^ 2) a).trace.re - (entropy a) ^ 2
/-- Variance of a Hermitian observable (PDF pp.7--9). -/
def stateObservableVariance {d : ℕ} (a h : Matrix (Fin d) (Fin d) ℂ) : ℝ :=
(a * h ^ 2).trace.re - ((a * h).trace.re) ^ 2
/-- The exponential lower bound in (11), PDF p.4. -/
def exponentialBound (n delta : ℝ) : ℝ := n * (Real.exp (delta / n) - 1 - delta / n)
/-- The cubic polynomial in (11), PDF p.4. -/
def cubicBound (n delta : ℝ) : ℝ := delta ^ 2 / (2 * n) + delta ^ 3 / (6 * n ^ 2)
/-- The common denominator L in (46)--(54), PDF pp.14--16. -/
def redundancyScale (d : ℕ) : ℝ := (Real.log ((d : ℝ) - 1)) ^ 2 + 4
/-- The explicit lower bound in (51), (52), (54), PDF pp.14--16. -/
def redundancyBound (d : ℕ) (a : ℝ) : ℝ :=
a ^ 2 / (2 * redundancyScale d) - a ^ 3 / (3 * (redundancyScale d) ^ 2)
/-- The unproved asymmetry conjecture in a fixed dimension (PDF pp.14--15). -/
def asymmetryConjecture (d : ℕ) : Prop :=
∀ a ∈ Set.Icc 0 (Real.log d), tightBound d (-a) ≤ tightBound d a
/-- h_d in (16), PDF p.6. -/
def continuityEntropy (d : ℕ) (t : ℝ) : ℝ := t * Real.log ((d : ℝ) - 1) + Real.binEntropy t
/-- Inverse on the increasing branch [0,(d-1)/d], PDF p.6, (18). -/
def entropyInverse (d : ℕ) (a : ℝ) : ℝ :=
sInf {t | t ∈ Set.Icc 0 (massLimit d) ∧ a ≤ continuityEntropy d t}
/-- The explicit inverse estimate in (18), with its continuous extension at zero (PDF p.6). -/
def inverseEstimate (d : ℕ) (a : ℝ) : ℝ :=
if a = 0 then 0 else (Real.exp 1 - 1) / Real.exp 1 * a /
(1 + Real.log ((d : ℝ) - 1) - Real.log a)
/-- Gibbs state at a positive finite temperature, (23), PDF p.8. -/
def thermalFinite {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ) : Matrix (Fin d) (Fin d) ℂ :=
gibbsState (-((t : ℂ)⁻¹) • h)
/-- Normalized projector onto the entire ground space, PDF p.9. -/
def groundSpaceDensity {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) : Matrix (Fin d) (Fin d) ℂ :=
if hd : 0 < d then
let e := ascEigenvalues h ⟨0, by simpa only [Fintype.card_fin] using hd⟩
let p := cfc (fun x : ℝ => if x = e then 1 else 0) h
p.trace⁻¹ • p
else 0
/-- Thermal states for all T in [0,infinity], with both endpoint conventions (PDF p.9). -/
def gibbsAtTemperature {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ≥0∞) : Matrix (Fin d) (Fin d) ℂ :=
if t = ⊤ then (d : ℂ)⁻¹ • 1 else if t = 0 then groundSpaceDensity h else thermalFinite h t.toReal
/-- Mean energy E(T), PDF p.9. -/
def thermalExpectedEnergy {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ) : ℝ :=
(h * thermalFinite h t).trace.re
/-- Heat capacity defined by dE/dT, not by the variance identity (24), PDF p.9. -/
def heatCapacity {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ≥0∞) : ℝ :=
if t = 0 ∨ t = ⊤ then 0 else deriv (thermalExpectedEnergy h) t.toReal
/-- One fixed optimal Hamiltonian, PDF p.9, Remark 11. -/
def optimalHamiltonian (d : ℕ) : Matrix (Fin d) (Fin d) ℂ :=
Matrix.diagonal (fun i => if i.val = 0 then -1 else 0)
/-- Full rank on the already restricted finite-dimensional support, PDF p.10. -/
def fullRank {d : ℕ} (a : Matrix (Fin d) (Fin d) ℂ) : Prop :=
LinearMap.ker a.mulVecLin = ⊥
/-- An arbitrary strict partition, for (38)--(40), PDF p.12. -/
structure EntropyPathPartition where
k : ℕ
positive : 0 < k
point : Fin (k + 1) → ℝ
strict : StrictMono point
first : point 0 = 0
last : point (Fin.last k) = 1
/-- Mesh controls all subdivisions, not just uniform ones (PDF p.12). -/
def mesh (p : EntropyPathPartition) : ℝ :=
sSup (Set.range (fun j : Fin p.k => p.point j.succ - p.point j.castSucc))
/-- Piecewise C1 means globally continuous with C1 restrictions on a finite subdivision (p.12). -/
def piecewiseC1 {d : ℕ} (a : ℝ → Matrix (Fin d) (Fin d) ℂ) : Prop :=
ContinuousOn a (Set.Icc 0 1) ∧ ∃ p : EntropyPathPartition, ∀ j : Fin p.k,
ContDiffOn ℝ 1 a (Set.Icc (p.point j.castSucc) (p.point j.succ))
/-- The right-endpoint Riemann sum in (38), PDF p.12. -/
def entropyHeatSum {d : ℕ} (a : ℝ → Matrix (Fin d) (Fin d) ℂ) (p : EntropyPathPartition) : ℝ :=
∑ j : Fin p.k, ((-cfc Real.log (a (p.point j.succ))) *
(a (p.point j.succ) - a (p.point j.castSucc))).trace.re
/-- Actual heat divided by bath temperature, H_j=-T_j log rho(t_j), (27),(38), pp.10,12. -/
def partitionHeat {d : ℕ} (a : ℝ → Matrix (Fin d) (Fin d) ℂ) (p : EntropyPathPartition)
(t : Fin p.k → ℝ) : ℝ :=
∑ j : Fin p.k, ((-((t j : ℂ)) • cfc Real.log (a (p.point j.succ))) *
(a (p.point j.succ) - a (p.point j.castSucc))).trace.re / t j
/-- The actual finite sequence of states and step Hamiltonians (PDF pp.10,13). -/
structure Process (d : ℕ) where
k : ℕ
positive : 0 < k
state : Fin (k + 1) → EntropyState d
hamiltonian : Fin k → Matrix (Fin d) (Fin d) ℂ
/-- Isothermal equilibration, with final Hamiltonian equal to the fixed external H (p.13). -/
def isIsothermal {d : ℕ} (p : Process d) (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ)
(a : EntropyState d) : Prop :=
p.state 0 = a ∧ (∀ j, fullRank (p.state j).val) ∧
(∀ j, (p.hamiltonian j).IsHermitian ∧
(p.state j.succ).val = thermalFinite (p.hamiltonian j) t) ∧
p.hamiltonian ⟨p.k - 1, Nat.sub_lt p.positive (by decide)⟩ = h
/-- Heat is computed from the Hamiltonians and state increments (27), PDF pp.10,13. -/
def processHeat {d : ℕ} (p : Process d) : ℝ :=
∑ j : Fin p.k, (p.hamiltonian j * ((p.state j.succ).val - (p.state j.castSucc).val)).trace.re
/-- Extracted work = heat - internal energy increase (41)--(42), PDF p.13. -/
def extractedWork {d : ℕ} (p : Process d) (h : Matrix (Fin d) (Fin d) ℂ) : ℝ :=
processHeat p - (h * ((p.state (Fin.last p.k)).val - (p.state 0).val)).trace.re
/-- Free energy at the fixed Hamiltonian and temperature (41), PDF p.13. -/
def helmholtzFreeEnergy {d : ℕ} (h a : Matrix (Fin d) (Fin d) ℂ) (t : ℝ) : ℝ :=
(h * a).trace.re - t * entropy a
/-- Available work computed from free energies, not defined as a process optimum (41), p.13. -/
def availableWork {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) (t : ℝ) (a : EntropyState d) : ℝ :=
helmholtzFreeEnergy h a.val t - helmholtzFreeEnergy h (thermalFinite h t) t
/-- A minimum over a specified domain in the complete extended real order (pp.14--16). -/
def extendedDomainInfimum {α : Type*} (a : Set α) (f : α → EReal) : EReal := sInf (f '' a)
/-- Actual attainment, retained whenever the source writes min (PDF p.14). -/
def attainsMinimum {α : Type*} (a : Set α) (f : α → EReal) : Prop :=
∃ x ∈ a, f x = extendedDomainInfimum a f
/-- Minimal redundancy (47), PDF p.14, over quantum states as also asserted on p.15. -/
def minimaxRedundancy {d m : ℕ} (a : Fin m → EntropyState d) : EReal :=
⨅ b : EntropyState d, ⨆ j, stateRelativeNats (a j) b
/-- Minimal entropy of the finite nonempty source family (PDF p.14). -/
def minEntropy {d m : ℕ} (a : Fin m → EntropyState d) : ℝ := sInf (Set.range (fun j => entropy (a j).val))
/-- Maximal entropy of the finite nonempty source family (PDF p.14). -/
def sourceEntropyMaximum {d m : ℕ} (a : Fin m → EntropyState d) : ℝ := sSup (Set.range (fun j => entropy (a j).val))
/-- The intermediate objective in (48), PDF p.14. -/
def entropyRadius {d m : ℕ} (a : Fin m → EntropyState d) (s : ℝ) : EReal :=
⨆ j, tightBound d (entropy (a j).val - s)
/-- A normalized classical law in the paper's fixed basis (PDF p.3). -/
def isLaw {d : ℕ} (p : Fin d → ℝ) : Prop := (∀ i, 0 ≤ p i) ∧ ∑ i, p i = 1
/-- Natural-log Shannon entropy, matching the diagonal density matrix (PDF p.3). -/
def shannonEntropyNats {d : ℕ} (p : Fin d → ℝ) : ℝ := -∑ i, p i * Real.log (p i)
/-- Classical channel, as in Proposition 13, PDF p.15; X need not be finite. -/
structure FiniteOutputChannel (X : Type*) (d : ℕ) where
prob : X → Fin d → ℝ
normalized : ∀ x, isLaw (prob x)
/-- Nats capacity: supremum of mutual information over all finite-support input laws (p.15).
For finite output this covers arbitrary nonempty discrete input alphabets by approximation. -/
def finiteOutputCapacityNats {X : Type*} {d : ℕ} (c : FiniteOutputChannel X d) : ℝ :=
sSup {v | ∃ (m : ℕ) (x : Fin m → X) (q : Fin m → ℝ), isLaw q ∧
v = shannonEntropyNats (fun y => ∑ j, q j * c.prob (x j) y) -
∑ j, q j * shannonEntropyNats (c.prob (x j))}
/-- Eq. (53), PDF p.16, with a strict entropy constraint and empty-set value infinity. -/
def entropyConstraintDistance {d : ℕ} (r : ℝ) (a : EntropyState d) : EReal :=
⨅ b : {b : EntropyState d // r < entropy b.val}, stateRelativeNats b.val a
/-- Chernoff coefficient infimum including one-sided endpoint limits, PDF p.16.
Using 0<s<1 avoids the spurious 0^0=1 at singular endpoints. -/
def chernoffCoefficient {d : ℕ} (p q : Fin d → ℝ) : ℝ :=
sInf ((fun s : ℝ => ∑ i, (p i) ^ s * (q i) ^ (1 - s)) '' Set.Ioo 0 1)
/-- Classical Chernoff information; disjoint support gives infinity (54), PDF p.16. -/
def chernoff {d : ℕ} (p q : Fin d → ℝ) : EReal :=
let z := chernoffCoefficient p q
if z = 0 then ⊤ else (-Real.log z : ℝ)
/-! Definition-level boundary sanity tests. -/
example {d : ℕ} : entropy (1 : Matrix (Fin d) (Fin d) ℂ) = 0 := by
simp [entropy, cfc_one]
example (q : ℝ) : klTerm 0 q = 0 := by simp [klTerm]
example : binaryRelative 0 0 = 0 := by simp [binaryRelative, klTerm]
example {s : ℝ} (hs : s ≠ 0) : klTerm s 0 = ⊤ := by simp [klTerm, hs]
example : familyProb 2 (1 / 2) 0 = 1 / 2 := by norm_num [familyProb]
example (d : ℕ) : degenerateSpectrumEntropy d 0 = 0 := by simp [degenerateSpectrumEntropy]
example : easyVariance 2 = 1 := by norm_num [easyVariance]
example (n : ℝ) : exponentialBound n 0 = 0 ∧ cubicBound n 0 = 0 := by
simp [exponentialBound, cubicBound]
example (d : ℕ) : inverseEstimate d 0 = 0 := by simp [inverseEstimate]
example {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) :
gibbsAtTemperature h ⊤ = (d : ℂ)⁻¹ • 1 ∧ gibbsAtTemperature h 0 = groundSpaceDensity h := by simp [gibbsAtTemperature]
example {d : ℕ} (h : Matrix (Fin d) (Fin d) ℂ) :
heatCapacity h 0 = 0 ∧ heatCapacity h ⊤ = 0 := by simp [heatCapacity]
example {α : Type*} (f : α → EReal) : extendedDomainInfimum ∅ f = ⊤ := by simp [extendedDomainInfimum]
example (d : ℕ) : redundancyBound d 0 = 0 := by simp [redundancyBound]
open scoped ComplexOrder in
example : IsDensityMatrix (1 : Matrix (Fin 1) (Fin 1) ℂ) :=
⟨Matrix.PosSemidef.one, by simp⟩
example {d : ℕ} (a : EntropyState d) : difference a.val a.val = 0 := by
simp [difference]
example : surprisalVariance (1 : Matrix (Fin 1) (Fin 1) ℂ) = 0 := by
simp [surprisalVariance, entropy, cfc_one]
example {d : ℕ} (a : Matrix (Fin d) (Fin d) ℂ) (p : EntropyPathPartition) :
entropyHeatSum (fun _ => a) p = 0 := by
simp [entropyHeatSum]
example : isLaw (fun _ : Fin 1 => (1 : ℝ)) := by simp [isLaw]
example : ¬ isLaw (fun i : Fin 0 => (Fin.elim0 i : ℝ)) := by simp [isLaw]
example : shannonEntropyNats (fun _ : Fin 1 => (1 : ℝ)) = 0 := by
simp [shannonEntropyNats]
end QAlgorithms.Papers.Independent.Support50.P15
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P15.EntropyPathPartition
This structure consists of a natural number , a proof that , and real points satisfying whenever , together with and . Thus it specifies finitely many strictly increasing partition points with at least one interval; is excluded.
QAlgorithms.Papers.Independent.Support50.P15.EntropyState
For every natural number , is the type of complex matrices , indexed by , together with the requirements that is positive semidefinite and . When , this type is empty, since the empty matrix has trace zero.
QAlgorithms.Papers.Independent.Support50.P15.FiniteOutputChannel
For any type and natural number , this structure consists of a function together with the requirements that, for every ,
There is no finiteness or nonemptiness requirement on . If and is nonempty, these requirements cannot be satisfied; if is empty, they are vacuous.
QAlgorithms.Papers.Independent.Support50.P15.Process
For a natural number , a process consists of a natural number , a sequence of complex positive semidefinite matrices of trace one, and a sequence of arbitrary complex matrices. No Hermiticity or other condition is imposed on the , and no relation between successive states is required. For , no such process exists because a matrix of trace one does not exist.
QAlgorithms.Papers.Independent.Support50.P15.asymmetryConjecture
For every natural number , this defines the proposition that, for every real with , one has in the extended real numbers, where
Finite values of are regarded as extended real numbers, and the infimum of an empty feasible set is . All subtraction involving here is real subtraction; division by zero is zero, , and the logarithm of a negative real is the logarithm of its absolute value. For or , the quantified interval for consists only of zero. This declaration defines the proposition; it does not assert that it holds.
QAlgorithms.Papers.Independent.Support50.P15.attainsMinimum
For any type , any subset , and any extended-real-valued function , this predicate states that there exists such that
The attained value may be either infinity. The predicate is false when is empty.
QAlgorithms.Papers.Independent.Support50.P15.availableWork
For any natural number , any complex matrix , any real number , and any positive semidefinite trace-one matrix , set
This defines
using real functional calculus for , the convention , and total scalar inversion, including inverse zero equal to zero. No Hermiticity of or positivity of is assumed; at , . The argument cannot exist for .
QAlgorithms.Papers.Independent.Support50.P15.binaryRelative
For arbitrary real numbers , this defines
with addition in the extended reals and the natural logarithm, interpreted on negative arguments as . Neither nor is restricted to . In particular, the value is if and , or if and ; it is zero at and .
QAlgorithms.Papers.Independent.Support50.P15.chernoff
For any natural number and arbitrary real-valued vectors indexed by , let
using the total real-power operation and the real infimum, which returns for a set unbounded below. This defines an extended-real value equal to if , and otherwise equal to the finite real number . No nonnegativity or normalization assumptions are imposed on ; if , the total real logarithm uses . In particular, when , the value is .
QAlgorithms.Papers.Independent.Support50.P15.chernoffCoefficient
For any natural number and arbitrary real-valued vectors indexed by , this defines the real infimum
Neither nonnegativity nor normalization of or is assumed. Powers are the total real-power operation, including its defined values for zero or negative bases. The endpoints and are excluded, and no attainment is asserted. When , every sum is , so the coefficient is ; if the set of values is unbounded below, the real infimum operation also returns .
QAlgorithms.Papers.Independent.Support50.P15.continuityEntropy
For every natural number and every real number , this defines
There is no restriction that or that . The subtraction is real subtraction, and every logarithm uses the total real convention and for negative .
QAlgorithms.Papers.Independent.Support50.P15.cubicBound
For all real numbers and , with no sign or nonzero restrictions, this defines
Division by zero is defined as zero, so the value is zero when , for every .
QAlgorithms.Papers.Independent.Support50.P15.degenerateSpectrumEntropy
For every natural number and arbitrary real number , this defines
All logarithms are natural and use the total real logarithm, with and for negative . No restriction on or lower bound on is imposed; at both and , the final term is zero.
QAlgorithms.Papers.Independent.Support50.P15.difference
For every natural number and arbitrary complex matrices , this defines the real number
where and use continuous functional calculus and is the natural logarithm with . Neither matrix is required to be Hermitian, positive semidefinite, or of trace one. For , the value is zero.
QAlgorithms.Papers.Independent.Support50.P15.easyVariance
For every natural number , including and , this defines
where is subtraction in the real numbers. The real logarithm satisfies and for negative , so the value is when or .
QAlgorithms.Papers.Independent.Support50.P15.entropyConstraintDistance
For any natural number , real number , and complex positive semidefinite matrix of trace , this defines
in the extended reals. Here with , and
with matrix functions interpreted by continuous functional calculus and . The entropy constraint is strict. If no such exists, the infimum is . The parameter is allowed syntactically, but no input state then exists.
QAlgorithms.Papers.Independent.Support50.P15.entropyDifferenceFeasible
For every natural number and real numbers , this predicate means precisely
where . Subtraction in is real subtraction, division by zero is zero, and the natural logarithm has and for negative . In particular, when or , the predicate holds exactly when and .
QAlgorithms.Papers.Independent.Support50.P15.entropyHeatSum
For any natural number , any function , and any partition consisting of a positive integer and strictly increasing real points with and , this defines the real number
Here the matrix logarithm means the real functional calculus applied to the total real logarithm, for which . No continuity, positivity, Hermiticity, normalization, or invertibility is required of . The dimension is included, in which case the value is zero.
QAlgorithms.Papers.Independent.Support50.P15.entropyInverse
For every natural number , including , and real number , this defines
Here is subtraction in , division by zero is , and the real logarithm satisfies and for negative . There are no restrictions on or . The infimum of an empty set is assigned the real value ; in particular, the definition gives for both and , for every .
QAlgorithms.Papers.Independent.Support50.P15.entropyRadius
For natural numbers , a family of complex positive semidefinite matrices of trace , and any real number , this defines the extended-real quantity
Here , with applied by continuous functional calculus, and
where in these real expressions is real subtraction, , and
The infimum and outer supremum are in the extended reals: an empty feasible set gives , and gives an entropy radius of . Real division by and both have value . The parameters include , for which a family of the required states can exist only if .
QAlgorithms.Papers.Independent.Support50.P15.exponentialBound
For all real numbers and , with no sign or nonzero restrictions, this defines
Division by zero is defined as zero, so the value is zero when , for every .
QAlgorithms.Papers.Independent.Support50.P15.extendedDomainInfimum
For any type , any subset , and any function , this defines the extended-real infimum
The set may be empty, in which case the value is ; no attainment or finiteness is required.
QAlgorithms.Papers.Independent.Support50.P15.extractedWork
For any natural number , any process consisting of , positive semidefinite trace-one matrices , and arbitrary complex matrices , and any further complex matrix , this defines
There is no requirement that , that these matrices be Hermitian, or that the process satisfy the isothermal predicate. A process cannot exist when .
QAlgorithms.Papers.Independent.Support50.P15.family
For every natural number and arbitrary real number , this defines the complex diagonal matrix
The real entries are embedded into the complex numbers, and no positivity or trace-one requirement is imposed. For , this is the empty matrix; for , it is the one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P15.familyProb
For every natural number , arbitrary real number , and index , this defines
There is no restriction on , so these values are not required to form a probability distribution. When , there is no index ; when , only the first branch occurs, giving .
QAlgorithms.Papers.Independent.Support50.P15.finiteOutputCapacityNats
For any type , natural number , and function whose values are nonnegative and sum to over for each , this defines the real supremum of
over every natural number , every list of inputs from , and every real vector satisfying and , where , using natural logarithms and the convention . Inputs in the list may repeat. Although is quantified over, it supplies no candidate because its normalization condition would be . If is empty, the candidate set is empty and this real supremum is .
QAlgorithms.Papers.Independent.Support50.P15.fullRank
For every natural number and complex matrix , this predicate means that the kernel of the linear map is the zero subspace; equivalently, implies for every . No Hermitian or density-matrix assumption is required. For , the predicate holds for the unique empty matrix.
QAlgorithms.Papers.Independent.Support50.P15.gibbsAtTemperature
For every natural number , arbitrary complex matrix , and extended nonnegative real , this defines when ; when , it defines zero if , and otherwise , where is the real functional calculus of for the indicator of its smallest eigenvalue if is Hermitian, and is zero if is non-Hermitian. For finite positive , it defines
All scalar inverses are total, with ; no Hermitian assumption is imposed, and is included.
QAlgorithms.Papers.Independent.Support50.P15.groundSpaceDensity
For every natural number and arbitrary complex matrix , this defines the zero matrix when . When , let be the first entry of the ascending eigenvalue list of : for Hermitian , this is its smallest eigenvalue, while for non-Hermitian , that list is defined to be identically zero. Apply the real functional calculus to with the function if and otherwise, obtaining ; the result is
For Hermitian , is the orthogonal projection onto its smallest-eigenvalue eigenspace. The functional calculus gives zero for non-Hermitian , and a zero trace also makes the normalization zero.
QAlgorithms.Papers.Independent.Support50.P15.heatCapacity
For every natural number , arbitrary complex matrix , and extended nonnegative real , this defines when or . For finite positive , it is the ordinary real derivative at of the function
No Hermitian assumption or differentiability hypothesis is imposed; the derivative operator returns where the function is not differentiable. All inverses send zero to zero, and is included.
QAlgorithms.Papers.Independent.Support50.P15.helmholtzFreeEnergy
For any natural number , any complex matrices , and any real number , this defines
where is obtained by real functional calculus and the real logarithm has . Neither matrix is required to be Hermitian, positive, normalized, or invertible, and may be zero or negative. For , the value is zero.
QAlgorithms.Papers.Independent.Support50.P15.inverseEstimate
For every natural number , including , and every real , this defines
The subtraction is in . No positivity assumptions are imposed: the logarithms are total real logarithms, with and for negative , and a zero denominator makes the quotient .
QAlgorithms.Papers.Independent.Support50.P15.isIsothermal
For any natural number , a process with , density matrices , and matrices , an arbitrary matrix , a real number , and a density matrix , this predicate means that , every , including both endpoints, has zero kernel, every is Hermitian, and
There is no requirement that . In particular, at , the convention makes every displayed thermal state equal to . For , the process and density-matrix arguments cannot exist.
QAlgorithms.Papers.Independent.Support50.P15.isLaw
For any natural number and any real-valued vector , this is the proposition
When , the sum is , so no vector satisfies this proposition.
QAlgorithms.Papers.Independent.Support50.P15.klTerm
For arbitrary real numbers , this defines the extended real number
The first branch takes precedence, so the value at is zero. There are no nonnegativity or probability assumptions on ; for negative arguments, the total real logarithm satisfies .
QAlgorithms.Papers.Independent.Support50.P15.massLimit
For every natural number , this defines the real number
where subtraction and division are performed in the reals after converting . Thus the numerator at is , and total real division by zero makes the value zero; the value is also zero at .
QAlgorithms.Papers.Independent.Support50.P15.maxVariance
For every natural number , including and , this defines the real number
The endpoints and are excluded. The logarithm uses its total real convention, including and for negative . This definition does not assert that the supremum is attained; the real supremum operation returns zero for an empty set or a set unbounded above.
QAlgorithms.Papers.Independent.Support50.P15.mesh
For every partition consisting of a positive integer and strictly increasing real points , this defines
The set is finite and nonempty, so this supremum is its largest interval length.
QAlgorithms.Papers.Independent.Support50.P15.minEntropy
For any natural numbers and any family of complex positive semidefinite trace-one matrices, this defines the real infimum
where is given by real functional calculus using the natural logarithm and . When , the real infimum of the empty set is defined to be zero. If , such a family exists only for .
QAlgorithms.Papers.Independent.Support50.P15.minimaxRedundancy
For any natural numbers and any family of complex positive semidefinite trace-one matrices, this defines the extended-real number
where if , and otherwise
Both matrix functions use real functional calculus with the total real logarithm, including . No minimizer is asserted. If and , the value is , since the inner supremum is empty. For , a supplied family can exist only when , and the outer infimum is empty, giving .
QAlgorithms.Papers.Independent.Support50.P15.minimizingPair
For every natural number and real numbers , this predicate requires that , that , and that
where , and equals zero when , equals when and , and otherwise equals . These are extended real values; the natural logarithm has and for negative , real division by zero is zero, and an empty infimum is . This requires attainment but not uniqueness or finiteness. For or , it holds exactly when .
QAlgorithms.Papers.Independent.Support50.P15.optimalHamiltonian
For every natural number , this defines the complex diagonal matrix whose diagonal entry at index is and whose other diagonal entries are , with every off-diagonal entry also . When , there is no index , and the result is the empty matrix.
QAlgorithms.Papers.Independent.Support50.P15.optimalMass
For every natural number , this selects a real number satisfying
if such a number exists. The selection is by classical choice and need not be unique; if no such number exists, it selects an unspecified real number without the displayed properties. Existence is not asserted by this definition. The logarithm is total, with and for negative , and the real supremum returns zero on sets unbounded above. In particular, when , every satisfies the selection condition.
QAlgorithms.Papers.Independent.Support50.P15.partitionHeat
For any natural number , any function , any partition with a positive integer and strictly increasing points , and any real numbers , this defines
The matrix logarithm is the real functional calculus of the total real logarithm, with . No regularity or matrix properties are assumed for , and the need not be positive or nonzero: a term with equals zero because division by zero is defined to be zero. Dimension is allowed and gives zero.
QAlgorithms.Papers.Independent.Support50.P15.piecewiseC1
For every natural number , including , and function , this predicate means that is continuous on and that there exist a positive integer and strictly increasing real points such that is continuously differentiable over on each closed interval , for every , in the within-set sense of differentiability. It imposes no density-matrix, Hermitian, or rank conditions on the values of , and no conditions outside .
QAlgorithms.Papers.Independent.Support50.P15.processHeat
For any natural number and any process consisting of , density matrices that are positive semidefinite with trace one, and arbitrary complex matrices , this defines
No isothermal condition or Hermiticity of the is assumed. There are no processes in dimension zero.
QAlgorithms.Papers.Independent.Support50.P15.redundancyBound
For every natural number and every real number , this defines
There is no sign restriction on , and are included. Here is real subtraction, , and for negative ; both denominators are strictly positive.
QAlgorithms.Papers.Independent.Support50.P15.redundancyScale
For every natural number , including and , this defines
where is real subtraction and the real logarithm satisfies and for negative . The value is always at least , and equals when or .
QAlgorithms.Papers.Independent.Support50.P15.shannonEntropyNats
For any natural number and any real-valued vector , this defines
No nonnegativity or normalization assumption is imposed on . The logarithm is the total real logarithm: and for negative . Thus zero entries contribute , and when the value is .
QAlgorithms.Papers.Independent.Support50.P15.sourceEntropyMaximum
For natural numbers and a family of complex positive semidefinite matrices of trace , this defines
where is defined by continuous functional calculus and is the natural logarithm, with . The supremum is taken in ; when , its defining set is empty and the value is . The parameters permit , but then such a family can exist only when , since a matrix has trace .
QAlgorithms.Papers.Independent.Support50.P15.stateObservableVariance
For every natural number and all complex matrices and , this defines
Here is the matrix product . There are no Hermitian, positivity, normalization, or commutation hypotheses on either matrix. The case is included and gives zero.
QAlgorithms.Papers.Independent.Support50.P15.stateRelativeNats
For every natural number and every pair of positive semidefinite complex matrices of trace one, this defines an extended real number by
where the matrix functions use continuous functional calculus and the logarithm is natural, with in these functions. The maximum with zero comes from conversion to the extended nonnegative reals before embedding into the extended reals. There are no possible arguments when .
QAlgorithms.Papers.Independent.Support50.P15.surprisalVariance
For every natural number and every complex matrix , this defines
where and are formed using the real continuous functional calculus, including its total default convention outside its applicability conditions. The real logarithm has and for negative . No Hermitian, positivity, or trace-one hypothesis is imposed on . The case is included and gives zero.
QAlgorithms.Papers.Independent.Support50.P15.thermalExpectedEnergy
For every natural number , arbitrary complex matrix , and real , this defines
There are no Hermitian or temperature restrictions. Scalar inverses, including the complex inverse of the trace, send zero to zero. Thus at the expression is , and for it is .
QAlgorithms.Papers.Independent.Support50.P15.thermalFinite
For every natural number , arbitrary complex matrix , and real , this defines
where is the matrix exponential and the trace and its inverse are complex-valued. No Hermitian or positivity assumption on , or positivity assumption on , is required. Inverses of zero are , so a zero trace gives the zero matrix; at , the value is . For , the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Support50.P15.tightBound
For every natural number and real number , this defines the extended real infimum
where , and is zero if , is if and , and otherwise is . The logarithm is natural, with and for negative , and real division by zero is zero. The infimum of an empty feasible set is ; no attainment is required. For or , the value is zero when and otherwise.
QAlgorithms.Papers.Independent.Support50.P15.varianceObjective
For every natural number , including and , and every real number , this defines
There is no restriction on . Division by zero is defined as zero, and the real logarithm is total: and for negative . In particular, , and for every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.