Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Asymptotic state transformations of continuous variable resources

Definition
QAlgorithms_Papers_Independent_Intakethird100_P88

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

The objects the formalized statements of Asymptotic state transformations of continuous variable resources (arXiv:2010.00044) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • BoundedSelfAdjoint: PDF p.3: bounded self-adjoint operators on the entire Hilbert space.
  • weakPositiveTopology: PDF pp.3–4: the weak topology on the positive trace-class cone, tested against all bounded self-adjoint operators, rather than just compact ones.
  • normPositiveTopology: PDF p.4: restriction of the accepted nuclear trace-norm topology to the cone.
  • weakOperatorPositiveTopology: PDF p.3: WOT on the self-adjoint positive cone is generated by all quadratic forms.
  • weakStateTopology: PDF pp.3–4: weak topology restricted to trace-one positive states.
  • weakOperatorStateTopology: PDF pp.3–4: WOT restricted to trace-one positive states.
  • measuredKLSummand: PDF p.5: a single classical KL summand, extended on support failure. No trace-correction term is added for an unnormalized second argument.
  • FinitePOVM: PDF pp.3,5: exactly finite-outcome POVMs of positive bounded effects.
  • traceClassMeasuredEntropyBits: PDF p.5, (10), extended to the positive trace-class second argument of Lemma 20, p.11. EReal retains negative finite values when Tr sigma exceeds one. The input rho is always a positive trace-one state. The accepted Bridge50.P11 measuredEntropy is a natural-log variational program on algebra functionals, not this finite-POVM definition with an unnormalized trace-class reference. Source correction: printed (10), p.5, repeats P_rho in both arguments. Changed: the second distribution is P_sigma. Why: the surrounding two-state definition and the explicit Tr(sigma E_x) calculation on pp.19-20 require it; the literal printed expression would be identically zero on normalized rho.
  • StrictlyPositiveQuadraticForm: PDF pp.11,18: strict positivity means a positive quadratic form on every nonzero vector, without a uniform spectral lower bound. The accepted Dependency50.P37.StrictlyPositive is instead a predicate on CP maps.
  • UniformlyPositive: PDF p.18: L has some positive lower spectral bound depending on L. The proof explicitly uses L >= delta I. This is stronger than zero kernel.
  • twoPower: PDF pp.11,18: the bounded positive exponential 2^h, via real continuous functional calculus on the bounded spectrum of a self-adjoint h.
  • logarithmicExpectation: PDF pp.18–19: extended logarithmic expectation. The continuous bounded-below spectral cutoffs log2(max(x,1/(n+1))) decrease to log2(x). The infimum is in EReal, so nonintegrable negative logarithmic tails give minus infinity. Only positive L and trace-one rho are used; this is not cfc Real.log at zero.
  • exponentialProgram: PDF p.11, (23)–(24): optimization over all bounded self-adjoint h. The Bool selects the linear penalty (true) or logarithmic penalty (false). The false branch is used only with sigma nonzero.
  • positiveProgram: PDF p.11, (25)–(28): optimization over bounded uniformly positive L (uniform=true) or bounded strictly positive L (uniform=false), with either penalty. The logarithmic penalty is used only with sigma nonzero.
  • zeroPositive: PDF p.20, Remark 32: the zero positive trace-class operator, explicitly without a normalization or nonzero requirement.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P13
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P62

/-!
Ferrari, Lami, Theurer and Plenio, arXiv:2010.00044v3.
Drafted subset: Corollary 3, Remark 4, Lemma 20, Remark 32.
All remaining planned nodes are explicitly deferred in HARD.md and GAPS.json.
The independent-paper override permits the inspected accepted-library imports.
Only definition bodies are reused. Compilation and independent review are pending.
-/

noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P88

open Filter
open QAlgorithms.Papers.Independent.Dependency50.P13
open QAlgorithms.Papers.Independent.Dependency50.P39 (Fock fockKet fockDyad)
open QAlgorithms.Papers.Independent.Information100.P62 (logTwo)

attribute [local instance] Classical.propDecidable

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- PDF p.3: bounded self-adjoint operators on the entire Hilbert space. -/
abbrev BoundedSelfAdjoint (H : Type*) [NormedAddCommGroup H] [InnerProductSpace ℂ H]
    [CompleteSpace H] := {A : H →L[ℂ] H // A.adjoint = A}

/-- PDF pp.3–4: the weak topology on the positive trace-class cone, tested
against all bounded self-adjoint operators, rather than just compact ones. -/
def weakPositiveTopology {I : Type*} (b : HilbertBasis I ℂ H) :
    TopologicalSpace (PositiveTraceClass H) :=
  TopologicalSpace.induced
    (fun T : PositiveTraceClass H => fun A : BoundedSelfAdjoint H =>
      (operatorTrace b (T.val.val.comp A.val)).re) inferInstance

/-- PDF p.4: restriction of the accepted nuclear trace-norm topology to the cone. -/
def normPositiveTopology : TopologicalSpace (PositiveTraceClass H) :=
  TopologicalSpace.induced (fun T : PositiveTraceClass H => T.val) traceNormTopology

/-- PDF p.3: WOT on the self-adjoint positive cone is generated by all quadratic forms. -/
def weakOperatorPositiveTopology : TopologicalSpace (PositiveTraceClass H) :=
  TopologicalSpace.induced
    (fun T : PositiveTraceClass H => fun x : H => (inner ℂ x (T.val.val x)).re)
    inferInstance

/-- PDF pp.3–4: weak topology restricted to trace-one positive states. -/
def weakStateTopology {I : Type*} (b : HilbertBasis I ℂ H) : TopologicalSpace (State b) :=
  TopologicalSpace.induced
    (fun rho : State b => fun A : BoundedSelfAdjoint H =>
      (operatorTrace b (rho.val.val.comp A.val)).re) inferInstance

/-- PDF pp.3–4: WOT restricted to trace-one positive states. -/
def weakOperatorStateTopology {I : Type*} (b : HilbertBasis I ℂ H) :
    TopologicalSpace (State b) :=
  TopologicalSpace.induced
    (fun rho : State b => fun x : H => (inner ℂ x (rho.val.val x)).re) inferInstance

/-- PDF p.5: a single classical KL summand, extended on support failure.
No trace-correction term is added for an unnormalized second argument. -/
def measuredKLSummand (p q : ℝ) : EReal :=
  if p = 0 then 0 else if q = 0 then ⊤ else (p * (logTwo p - logTwo q) : ℝ)

/-- PDF pp.3,5: exactly finite-outcome POVMs of positive bounded effects. -/
def FinitePOVM {n : ℕ} (M : Fin n → H →L[ℂ] H) : Prop :=
  (∀ i, IsPositive (M i)) ∧ ∑ i, M i = 1

/-- PDF p.5, (10), extended to the positive trace-class second argument of
Lemma 20, p.11. EReal retains negative finite values when Tr sigma exceeds one.
The input rho is always a positive trace-one state. The accepted Bridge50.P11
measuredEntropy is a natural-log variational program on algebra functionals,
not this finite-POVM definition with an unnormalized trace-class reference.
Source correction: printed (10), p.5, repeats P_rho in both arguments.
Changed: the second distribution is P_sigma. Why: the surrounding two-state
definition and the explicit Tr(sigma E_x) calculation on pp.19-20 require it;
the literal printed expression would be identically zero on normalized rho. -/
def traceClassMeasuredEntropyBits {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b)
    (sigma : PositiveTraceClass H) : EReal :=
  ⨆ n : ℕ, ⨆ M : {M : Fin n → H →L[ℂ] H // FinitePOVM M},
    ∑ i, measuredKLSummand
      (operatorTrace b (rho.val.val.comp (M.val i))).re
      (operatorTrace b (sigma.val.val.comp (M.val i))).re

/-- PDF pp.11,18: strict positivity means a positive quadratic form on every
nonzero vector, without a uniform spectral lower bound. The accepted
Dependency50.P37.StrictlyPositive is instead a predicate on CP maps. -/
def StrictlyPositiveQuadraticForm (L : H →L[ℂ] H) : Prop :=
  IsPositive L ∧ ∀ x : H, x ≠ 0 → 0 < (inner ℂ x (L x)).re

/-- PDF p.18: L has some positive lower spectral bound depending on L.
The proof explicitly uses L >= delta I. This is stronger than zero kernel. -/
def UniformlyPositive (L : H →L[ℂ] H) : Prop :=
  IsPositive L ∧ ∃ delta : ℝ, 0 < delta ∧
    ∀ x : H, delta * ‖x‖ ^ 2 ≤ (inner ℂ x (L x)).re

/-- PDF pp.11,18: the bounded positive exponential 2^h, via real continuous
functional calculus on the bounded spectrum of a self-adjoint h. -/
def twoPower (h : BoundedSelfAdjoint H) : H →L[ℂ] H :=
  cfc (fun x : ℝ => Real.rpow 2 x) h.val

/-- PDF pp.18–19: extended logarithmic expectation. The continuous bounded-below
spectral cutoffs log2(max(x,1/(n+1))) decrease to log2(x). The infimum is in
EReal, so nonintegrable negative logarithmic tails give minus infinity.
Only positive L and trace-one rho are used; this is not cfc Real.log at zero. -/
def logarithmicExpectation {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b)
    (L : H →L[ℂ] H) : EReal :=
  ⨅ n : ℕ, ((operatorTrace b
    (rho.val.val.comp (cfc
      (fun x : ℝ => logTwo (max x ((n + 1 : ℝ)⁻¹))) L))).re : EReal)

/-- PDF p.11, (23)–(24): optimization over all bounded self-adjoint h.
The Bool selects the linear penalty (true) or logarithmic penalty (false).
The false branch is used only with sigma nonzero. -/
def exponentialProgram {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b)
    (sigma : PositiveTraceClass H) (linear : Bool) : EReal :=
  ⨆ h : BoundedSelfAdjoint H,
    let t := (operatorTrace b (sigma.val.val.comp (twoPower h))).re
    (((operatorTrace b (rho.val.val.comp h.val)).re +
      if linear then (1 - t) / Real.log 2 else -logTwo t : ℝ) : EReal)

/-- PDF p.11, (25)–(28): optimization over bounded uniformly positive L
(uniform=true) or bounded strictly positive L (uniform=false), with either
penalty. The logarithmic penalty is used only with sigma nonzero. -/
def positiveProgram {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b)
    (sigma : PositiveTraceClass H) (uniform linear : Bool) : EReal :=
  ⨆ L : {L : H →L[ℂ] H // if uniform then UniformlyPositive L else StrictlyPositiveQuadraticForm L},
    let t := (operatorTrace b (sigma.val.val.comp L.val)).re
    logarithmicExpectation b rho L.val +
      ((if linear then (1 - t) / Real.log 2 else -logTwo t : ℝ) : EReal)

/-- PDF p.20, Remark 32: the zero positive trace-class operator, explicitly
without a normalization or nonzero requirement. -/
def zeroPositive : PositiveTraceClass H :=
  ⟨⟨0, by
    unfold IsTraceClass NuclearRepresentation
    refine ⟨fun _ => 0, fun _ => 0, ?_, ?_⟩
    · simp
    · intro x
      simp⟩, by
    constructor
    · simp
    · intro x
      simp⟩

example : logTwo 1 = 0 := by simp [logTwo]

example (q : ℝ) : measuredKLSummand 0 q = 0 := by simp [measuredKLSummand]

example (p : ℝ) (hp : p ≠ 0) : measuredKLSummand p 0 = ⊤ := by
  simp [measuredKLSummand, hp]

example : measuredKLSummand 1 1 = 0 := by simp [measuredKLSummand, logTwo]

example : measuredKLSummand 1 2 = (-1 : EReal) := by
  have hlog : Real.log 2 ≠ 0 := Real.log_ne_zero_of_pos_of_ne_one (by norm_num) (by norm_num)
  simp [measuredKLSummand, logTwo, hlog]

example : IsPositive (0 : H →L[ℂ] H) := by
  constructor
  · simp
  · intro x
    simp

example : (zeroPositive (H := H)).val.val = 0 := rfl

example (x : H) : (inner ℂ x ((zeroPositive (H := H)).val.val x)).re = 0 := by simp [zeroPositive]

example (L : H →L[ℂ] H) (h : UniformlyPositive L) : IsPositive L := h.1

example (L : H →L[ℂ] H) (h : StrictlyPositiveQuadraticForm L) : IsPositive L := h.1

end QAlgorithms.Papers.Independent.Intakethird100.P88
Source
Asymptotic state transformations of continuous variable resources, arXiv:2010.00044v3, https://arxiv.org/abs/2010.00044v3
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

QAlgorithms.Papers.Independent.Intakethird100.P88.BoundedSelfAdjoint

For any type HHH equipped with a normed additive commutative group structure, a complex inner product space structure, and completeness, this denotes the type of continuous complex-linear operators A:H→HA:H\to HA:H→H satisfying A∗=AA^*=AA∗=A, where A∗A^*A∗ is the Hilbert-space adjoint. There is no restriction on the dimension of HHH, and the zero Hilbert space is included.

QAlgorithms.Papers.Independent.Intakethird100.P88.FinitePOVM

For a complex Hilbert space HHH, any natural number nnn, and a family of continuous complex-linear operators M0,…,Mn−1:H→HM_0,\ldots,M_{n-1}:H\to HM0​,…,Mn−1​:H→H, this property means that every MiM_iMi​ is self-adjoint and satisfies Re⁡⟨x,Mix⟩≥0\operatorname{Re}\langle x,M_ix\rangle\ge0Re⟨x,Mi​x⟩≥0 for all x∈Hx\in Hx∈H, and that

∑i=0n−1Mi=id⁡H.\sum_{i=0}^{n-1}M_i=\operatorname{id}_H.i=0∑n−1​Mi​=idH​.

The value n=0n=0n=0 is included: then positivity is vacuous and the sum condition requires the zero operator to equal the identity, which holds precisely when HHH is the zero space.

QAlgorithms.Papers.Independent.Intakethird100.P88.StrictlyPositiveQuadraticForm

For any complex Hilbert space HHH and continuous complex-linear operator L:H→HL:H\to HL:H→H, this property means that L∗=LL^*=LL∗=L, that Re⁡⟨x,Lx⟩≥0\operatorname{Re}\langle x,Lx\rangle\ge0Re⟨x,Lx⟩≥0 for every x∈Hx\in Hx∈H, and that

x≠0⟹Re⁡⟨x,Lx⟩>0x\ne0\quad\Longrightarrow\quad \operatorname{Re}\langle x,Lx\rangle>0x=0⟹Re⟨x,Lx⟩>0

for every x∈Hx\in Hx∈H. No uniform positive lower bound in terms of ∥x∥2\|x\|^2∥x∥2 is required. The zero Hilbert space is included, where the condition concerning nonzero vectors is vacuous and its unique operator satisfies the property.

QAlgorithms.Papers.Independent.Intakethird100.P88.UniformlyPositive

For a complex Hilbert space HHH and a bounded complex-linear operator L:H→HL:H\to HL:H→H, this predicate means that L=L∗L=L^*L=L∗, that Re⁡⟨x,Lx⟩≥0\operatorname{Re}\langle x,Lx\rangle\ge0Re⟨x,Lx⟩≥0 for every x∈Hx\in Hx∈H, and that there exists a real number δ>0\delta>0δ>0 such that

δ∥x∥2≤Re⁡⟨x,Lx⟩for every x∈H.\delta\|x\|^2\le \operatorname{Re}\langle x,Lx\rangle \qquad\text{for every }x\in H.δ∥x∥2≤Re⟨x,Lx⟩for every x∈H.

The same δ\deltaδ must work for all vectors, including x=0x=0x=0. No assumption that HHH is nonzero is imposed; on the zero space these conditions hold.

QAlgorithms.Papers.Independent.Intakethird100.P88.exponentialProgram

Let HHH be a complex Hilbert space, III any index type, and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ a Hilbert basis, with τb(T)=∑i′⟨bi,Tbi⟩\tau_b(T)=\sum'_i\langle b_i,Tb_i\rangleτb​(T)=∑i′​⟨bi​,Tbi​⟩. An operator TTT is trace class here when there exist sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H with ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ summable and Tx=∑r′⟨vr,x⟩urTx=\sum'_r\langle v_r,x\rangle u_rTx=∑r′​⟨vr​,x⟩ur​ for every xxx; positivity means T=T∗T=T^*T=T∗ and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for all xxx. Given a positive trace-class operator ρ\rhoρ with τb(ρ)=1\tau_b(\rho)=1τb​(ρ)=1, any positive trace-class operator σ\sigmaσ, and a Boolean parameter ℓ\ellℓ, this definition is

sup⁡h:H→H bounded complex-linearh=h∗[Re⁡τb(ρ∘h)+{(1−th)/log⁡2,ℓ=true,−log⁡(th)/log⁡2,ℓ=false,],th=Re⁡τb ⁣(σ∘cfc⁡(x↦2x,h)).\sup_{\substack{h:H\to H\ \text{bounded complex-linear}\\h=h^*}} \left[ \operatorname{Re}\tau_b(\rho\circ h)+ \begin{cases} (1-t_h)/\log 2,&\ell=\mathrm{true},\\ -\log(t_h)/\log 2,&\ell=\mathrm{false}, \end{cases} \right], \qquad t_h=\operatorname{Re}\tau_b\!\left(\sigma\circ \operatorname{cfc}(x\mapsto 2^x,h)\right).h:H→H bounded complex-linearh=h∗​sup​[Reτb​(ρ∘h)+{(1−th​)/log2,−log(th​)/log2,​ℓ=true,ℓ=false,​],th​=Reτb​(σ∘cfc(x↦2x,h)).

Each bracketed expression is calculated in R\mathbb RR, then embedded into the extended reals before taking the supremum. There is no trace-one or nonzero assumption on σ\sigmaσ. In particular, σ=0\sigma=0σ=0 is allowed, and the logarithmic branch uses the total real logarithm, for which log⁡0=0\log 0=0log0=0.

QAlgorithms.Papers.Independent.Intakethird100.P88.logarithmicExpectation

Let HHH be a complex Hilbert space, III any index type, and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ a Hilbert basis. Write τb(T)=∑i∈I′⟨bi,Tbi⟩\tau_b(T)=\sum'_{i\in I}\langle b_i,Tb_i\rangleτb​(T)=∑i∈I′​⟨bi​,Tbi​⟩. Let ρ:H→H\rho:H\to Hρ:H→H be a bounded complex-linear operator that is self-adjoint, satisfies Re⁡⟨x,ρx⟩≥0\operatorname{Re}\langle x,\rho x\rangle\ge0Re⟨x,ρx⟩≥0 for every xxx, has τb(ρ)=1\tau_b(\rho)=1τb​(ρ)=1, and admits sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H, indexed by r∈Nr\in\mathbb Nr∈N, such that ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ is summable and ρx=∑r′⟨vr,x⟩ur\rho x=\sum'_r\langle v_r,x\rangle u_rρx=∑r′​⟨vr​,x⟩ur​ for every xxx. For any bounded complex-linear operator L:H→HL:H\to HL:H→H, this definition is the extended real number

inf⁡n∈NRe⁡τb ⁣(ρ∘cfc⁡ ⁣(x↦log⁡ ⁣(max⁡{x,(n+1)−1})log⁡2,L)),\inf_{n\in\mathbb N} \operatorname{Re}\tau_b\!\left( \rho\circ\operatorname{cfc}\!\left( x\mapsto\frac{\log\!\left(\max\{x,(n+1)^{-1}\}\right)}{\log 2},L \right)\right),n∈Ninf​Reτb​(ρ∘cfc(x↦log2log(max{x,(n+1)−1})​,L)),

where each real value is embedded into the extended reals before taking the infimum. The index includes n=0n=0n=0, whose cutoff is 111. No positivity or self-adjointness hypothesis is imposed on LLL; the expression uses the total continuous-functional-calculus operation on every such input.

QAlgorithms.Papers.Independent.Intakethird100.P88.measuredKLSummand

For arbitrary real numbers p,qp,qp,q, this defines an extended-real value by

K(p,q)={0,p=0,+∞,p≠0 and q=0,p log⁡p−log⁡qlog⁡2,p≠0 and q≠0.K(p,q)= \begin{cases} 0,&p=0,\\ +\infty,&p\ne0\ \text{and }q=0,\\ p\,\dfrac{\log p-\log q}{\log2},&p\ne0\ \text{and }q\ne0. \end{cases}K(p,q)=⎩⎨⎧​0,+∞,plog2logp−logq​,​p=0,p=0 and q=0,p=0 and q=0.​

The finite expression uses the total real logarithm: at a negative argument it equals the logarithm of the absolute value. No nonnegativity assumptions are imposed on ppp or qqq. In particular, the first branch takes precedence, so K(0,0)=0K(0,0)=0K(0,0)=0.

QAlgorithms.Papers.Independent.Intakethird100.P88.normPositiveTopology

Let HHH be a complex Hilbert space. Call a continuous complex-linear operator TTT trace class when it has a representation Tx=∑r∈N⟨vr,x⟩urTx=\sum_{r\in\mathbb N}\langle v_r,x\rangle u_rTx=∑r∈N​⟨vr​,x⟩ur​ for every xxx, with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, and call it positive when T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx. Define

N(R)=(inf⁡{∑r∈NofReal⁡(∥ur∥∥vr∥):∑r∥ur∥∥vr∥<∞, Rx=∑r⟨vr,x⟩ur for every x})R,N(R)=\left(\inf\left\{\sum_{r\in\mathbb N}\operatorname{ofReal}(\|u_r\|\|v_r\|): \sum_r\|u_r\|\|v_r\|<\infty,\ Rx=\sum_r\langle v_r,x\rangle u_r\ \text{for every }x\right\}\right)_{\mathbb R},N(R)=(inf{r∈N∑​ofReal(∥ur​∥∥vr​∥):r∑​∥ur​∥∥vr​∥<∞, Rx=r∑​⟨vr​,x⟩ur​ for every x})R​,

where the infimum is in [0,∞][0,\infty][0,∞], ofReal⁡(a)=max⁡(a,0)\operatorname{ofReal}(a)=\max(a,0)ofReal(a)=max(a,0), and conversion to R\mathbb RR sends +∞+\infty+∞ to 000. This defines the topology on positive trace-class operators induced by their inclusion into the trace-class operators, whose topology is itself induced by T↦(S↦N(T−S))T\mapsto(S\mapsto N(T-S))T↦(S↦N(T−S)) into a product of copies of R\mathbb RR. Equivalently, it is the coarsest topology making T↦N(T−S)T\mapsto N(T-S)T↦N(T−S) continuous for every trace-class operator SSS. Positive operators of arbitrary trace, including zero, are included.

QAlgorithms.Papers.Independent.Intakethird100.P88.positiveProgram

Let HHH be a complex Hilbert space, III any index type, and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ a Hilbert basis, and put τb(T)=∑i′⟨bi,Tbi⟩\tau_b(T)=\sum'_i\langle b_i,Tb_i\rangleτb​(T)=∑i′​⟨bi​,Tbi​⟩. Trace class means admitting sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H such that ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ is summable and Tx=∑r′⟨vr,x⟩urTx=\sum'_r\langle v_r,x\rangle u_rTx=∑r′​⟨vr​,x⟩ur​ for every xxx; positivity means self-adjointness and nonnegative real quadratic form. Given a positive trace-class operator ρ\rhoρ with τb(ρ)=1\tau_b(\rho)=1τb​(ρ)=1, any positive trace-class operator σ\sigmaσ, and Boolean parameters u,ℓu,\ellu,ℓ, define Lu\mathcal L_uLu​ to consist of bounded complex-linear positive operators LLL satisfying, if u=trueu=\mathrm{true}u=true, the existence of a real δ>0\delta>0δ>0 with δ∥x∥2≤Re⁡⟨x,Lx⟩\delta\|x\|^2\le\operatorname{Re}\langle x,Lx\rangleδ∥x∥2≤Re⟨x,Lx⟩ for every xxx, and, if u=falseu=\mathrm{false}u=false, the condition Re⁡⟨x,Lx⟩>0\operatorname{Re}\langle x,Lx\rangle>0Re⟨x,Lx⟩>0 for every nonzero xxx. The definition returns

sup⁡L∈Lu[inf⁡n∈NRe⁡τb ⁣(ρ∘cfc⁡ ⁣(x↦log⁡(max⁡{x,(n+1)−1})log⁡2,L))+{(1−tL)/log⁡2,ℓ=true,−log⁡(tL)/log⁡2,ℓ=false,],tL=Re⁡τb(σ∘L).\sup_{L\in\mathcal L_u} \left[ \inf_{n\in\mathbb N} \operatorname{Re}\tau_b\!\left( \rho\circ\operatorname{cfc}\!\left( x\mapsto\frac{\log(\max\{x,(n+1)^{-1}\})}{\log 2},L \right)\right) + \begin{cases} (1-t_L)/\log 2,&\ell=\mathrm{true},\\ -\log(t_L)/\log 2,&\ell=\mathrm{false}, \end{cases} \right], \qquad t_L=\operatorname{Re}\tau_b(\sigma\circ L).L∈Lu​sup​[n∈Ninf​Reτb​(ρ∘cfc(x↦log2log(max{x,(n+1)−1})​,L))+{(1−tL​)/log2,−log(tL​)/log2,​ℓ=true,ℓ=false,​],tL​=Reτb​(σ∘L).

The inner real trace values and the real correction term are embedded into the extended reals, where the infimum, addition, and outer supremum are taken. The inner index includes n=0n=0n=0. No trace-one or nonzero condition is imposed on σ\sigmaσ, and log⁡0=0\log 0=0log0=0 in the logarithmic correction.

QAlgorithms.Papers.Independent.Intakethird100.P88.traceClassMeasuredEntropyBits

Let HHH be a complex Hilbert space, III any type, and b=(bj)j∈Ib=(b_j)_{j\in I}b=(bj​)j∈I​ a Hilbert basis. A trace-class operator here admits a representation Tx=∑r∈N⟨vr,x⟩urTx=\sum_{r\in\mathbb N}\langle v_r,x\rangle u_rTx=∑r∈N​⟨vr​,x⟩ur​ for every xxx, with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; positivity means self-adjointness and nonnegative real quadratic form. Let ρ\rhoρ be a positive trace-class operator with τb(ρ)=1\tau_b(\rho)=1τb​(ρ)=1, where τb(T)=∑j⟨bj,Tbj⟩\tau_b(T)=\sum_j\langle b_j,Tb_j\rangleτb​(T)=∑j​⟨bj​,Tbj​⟩, and let σ\sigmaσ be any positive trace-class operator, with no trace normalization required. This defines the extended-real quantity

sup⁡n∈N sup⁡M0,…,Mn−1 continuous complex-linearMi∗=Mi, Re⁡⟨x,Mix⟩≥0 ∀i,x∑iMi=id⁡H ∑i=0n−1K ⁣(Re⁡τb(ρMi),Re⁡τb(σMi)),\sup_{n\in\mathbb N}\ \sup_{\substack{M_0,\ldots,M_{n-1}\text{ continuous complex-linear}\\ M_i^*=M_i,\ \operatorname{Re}\langle x,M_ix\rangle\ge0\ \forall i,x\\ \sum_iM_i=\operatorname{id}_H}} \ \sum_{i=0}^{n-1}K\!\left(\operatorname{Re}\tau_b(\rho M_i), \operatorname{Re}\tau_b(\sigma M_i)\right),n∈Nsup​ M0​,…,Mn−1​ continuous complex-linearMi∗​=Mi​, Re⟨x,Mi​x⟩≥0 ∀i,x∑i​Mi​=idH​​sup​ i=0∑n−1​K(Reτb​(ρMi​),Reτb​(σMi​)),

where K(p,q)=0K(p,q)=0K(p,q)=0 if p=0p=0p=0, K(p,q)=+∞K(p,q)=+\inftyK(p,q)=+∞ if p≠0p\ne0p=0 and q=0q=0q=0, and otherwise K(p,q)=p(log⁡p−log⁡q)/log⁡2K(p,q)=p(\log p-\log q)/\log2K(p,q)=p(logp−logq)/log2, using the total real logarithm. Thus a zero first argument contributes zero even when the second argument is also zero; σ=0\sigma=0σ=0 is allowed. The supremum includes n=0n=0n=0, although an empty operator family cannot sum to the identity on a nonzero HHH, and no countability assumption on III is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P88.twoPower

For a complex Hilbert space HHH and a bounded complex-linear self-adjoint operator h:H→Hh:H\to Hh:H→H, this definition returns the bounded operator obtained by applying continuous functional calculus to hhh with the real function x↦2xx\mapsto 2^xx↦2x:

2h=cfc⁡(x↦2x,h).2^h=\operatorname{cfc}(x\mapsto 2^x,h).2h=cfc(x↦2x,h).

Here the input includes the condition h∗=hh^*=hh∗=h. There is no positivity assumption on hhh, and no nonzero or finite-dimensional assumption on HHH.

QAlgorithms.Papers.Independent.Intakethird100.P88.weakOperatorPositiveTopology

For any complex Hilbert space HHH, consider the continuous complex-linear operators T:H→HT:H\to HT:H→H that satisfy T∗=TT^*=TT∗=T, Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx, and admit sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H with ∑r∈N∥ur∥∥vr∥<∞\sum_{r\in\mathbb N}\|u_r\|\|v_r\|<\infty∑r∈N​∥ur​∥∥vr​∥<∞ and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every xxx. This defines on these positive trace-class operators the coarsest topology making

T⟼Re⁡⟨x,Tx⟩T\longmapsto\operatorname{Re}\langle x,Tx\rangleT⟼Re⟨x,Tx⟩

continuous for each x∈Hx\in Hx∈H, by mapping TTT into the product space RH\mathbb R^HRH of all these values. There is no trace normalization, and both the zero operator and the zero Hilbert space are allowed.

QAlgorithms.Papers.Independent.Intakethird100.P88.weakOperatorStateTopology

Let HHH be a complex Hilbert space and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ any Hilbert basis. A state means a continuous complex-linear operator ρ\rhoρ that has a representation ρx=∑r∈N⟨vr,x⟩ur\rho x=\sum_{r\in\mathbb N}\langle v_r,x\rangle u_rρx=∑r∈N​⟨vr​,x⟩ur​ for every xxx, with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, and satisfies ρ∗=ρ\rho^*=\rhoρ∗=ρ, Re⁡⟨x,ρx⟩≥0\operatorname{Re}\langle x,\rho x\rangle\ge0Re⟨x,ρx⟩≥0 for every xxx, and ∑i∈I⟨bi,ρbi⟩=1\sum_{i\in I}\langle b_i,\rho b_i\rangle=1∑i∈I​⟨bi​,ρbi​⟩=1. This defines on the type of such states the topology induced by

ρ⟼(x⟼Re⁡⟨x,ρx⟩)∈RH,\rho\longmapsto\bigl(x\longmapsto\operatorname{Re}\langle x,\rho x\rangle\bigr)\in\mathbb R^H,ρ⟼(x⟼Re⟨x,ρx⟩)∈RH,

where RH\mathbb R^HRH has the product topology; thus it is the coarsest topology making every displayed quadratic-form evaluation continuous. No countability or nonzero-dimension assumption is imposed; in zero dimension the state type is empty.

QAlgorithms.Papers.Independent.Intakethird100.P88.weakPositiveTopology

Let HHH be a complex Hilbert space, III any index type, and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ a Hilbert basis of HHH. An operator T:H→HT:H\to HT:H→H is called trace class here if there exist sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H, indexed by N\mathbb NN, such that ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞ and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every x∈Hx\in Hx∈H; it is positive if T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx. On the type of positive trace-class operators, this defines the coarsest topology making every real-valued function

T⟼Re⁡∑i∈I⟨bi,T(Abi)⟩T\longmapsto \operatorname{Re}\sum_{i\in I}\langle b_i,T(A b_i)\rangleT⟼Rei∈I∑​⟨bi​,T(Abi​)⟩

continuous, as AAA ranges over all continuous complex-linear self-adjoint operators on HHH. The target function space carries the product topology. No trace normalization is imposed on TTT, so the zero operator is included, and no countability assumption on III is made.

QAlgorithms.Papers.Independent.Intakethird100.P88.weakStateTopology

Let HHH be a complex Hilbert space and b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ a Hilbert basis indexed by any type III. A state here is a continuous complex-linear operator ρ:H→H\rho:H\to Hρ:H→H admitting sequences ur,vru_r,v_rur​,vr​ with ∑r∈N∥ur∥∥vr∥<∞\sum_{r\in\mathbb N}\|u_r\|\|v_r\|<\infty∑r∈N​∥ur​∥∥vr​∥<∞ and ρx=∑r⟨vr,x⟩ur\rho x=\sum_r\langle v_r,x\rangle u_rρx=∑r​⟨vr​,x⟩ur​ for every xxx, satisfying ρ∗=ρ\rho^*=\rhoρ∗=ρ, Re⁡⟨x,ρx⟩≥0\operatorname{Re}\langle x,\rho x\rangle\ge0Re⟨x,ρx⟩≥0 for every xxx, and ∑i∈I⟨bi,ρbi⟩=1\sum_{i\in I}\langle b_i,\rho b_i\rangle=1∑i∈I​⟨bi​,ρbi​⟩=1. This defines on these states the coarsest topology making

ρ⟼Re⁡∑i∈I⟨bi,ρ(Abi)⟩\rho\longmapsto\operatorname{Re}\sum_{i\in I}\langle b_i,\rho(A b_i)\rangleρ⟼Rei∈I∑​⟨bi​,ρ(Abi​)⟩

continuous for every continuous complex-linear self-adjoint operator A:H→HA:H\to HA:H→H, using the product topology on the collection of these real values. There is no countability assumption on III; if HHH is zero, there are no states satisfying the trace-one condition.

QAlgorithms.Papers.Independent.Intakethird100.P88.zeroPositive

For any complex Hilbert space HHH, this definition constructs the zero bounded complex-linear operator 0:H→H0:H\to H0:H→H, packaged together with its trace-class and positivity properties. Its trace-class representation uses the two sequences ur=vr=0u_r=v_r=0ur​=vr​=0 for every r∈Nr\in\mathbb Nr∈N, so that ∑r∥ur∥∥vr∥=0\sum_r\|u_r\|\|v_r\|=0∑r​∥ur​∥∥vr​∥=0 and 0x=∑r′⟨vr,x⟩ur0x=\sum'_r\langle v_r,x\rangle u_r0x=∑r′​⟨vr​,x⟩ur​ for every xxx. Its positivity properties are 0∗=00^*=00∗=0 and Re⁡⟨x,0x⟩=0≥0\operatorname{Re}\langle x,0x\rangle=0\ge0Re⟨x,0x⟩=0≥0 for every xxx. No trace-one condition is part of this construction.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me