Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3: explicit oscillator continuity bound

Open
QAlgorithms.Papers.Independent.Support50.P18.oscillator_continuity

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let BBB be the oscillator described above, let RRR be any complementary separable system, and let fff be a real function on states of BRBRBR with finite mean BBB energy. Suppose a,b,c−,c+≥0a,b,c_-,c_+\ge0a,b,c−​,c+​≥0 are fixed constants such that, for every pair in this domain and every 0<p<10<p<10<p<1, its mixture defect lies between −ah2(p)-a h_2(p)−ah2​(p) and bh2(p)b h_2(p)bh2​(p), and −c−H(ρB)≤f(ρ)≤c+H(ρB)-c_-H(\rho_B)\le f(\rho)\le c_+H(\rho_B)−c−​H(ρB​)≤f(ρ)≤c+​H(ρB​). For E>E0E>E_0E>E0​, states with both marginal energies at most EEE, and 0<ε≤1/20<\varepsilon\le1/20<ε≤1/2 with 12∥ρ−σ∥1≤ε\frac12\|\rho-\sigma\|_1\le\varepsilon21​∥ρ−σ∥1​≤ε, one has

∣f(ρ)−f(σ)∣≤(c−+c+)2ε ℓ(log⁡E/ε+E0ℓE∗+1)+(a+b)g(2ε).|f(\rho)-f(\sigma)|\le(c_-+c_+)\sqrt{2\varepsilon}\,\ell\left(\log\frac{E/\varepsilon+E_0}{\ell E_*}+1\right)+(a+b)g(\sqrt{2\varepsilon}).∣f(ρ)−f(σ)∣≤(c−​+c+​)2ε​ℓ(logℓE∗​E/ε+E0​​+1)+(a+b)g(2ε​).

For pure inputs the same bound holds with its parameter replaced by ε2/2\varepsilon^2/2ε2/2, under the original distance hypothesis. This is the explicit oscillator form of the marginal-entropy AFW bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P18
Formal statement
noncomputable section

open Filter

open scoped ENNReal NNReal BigOperators Topology

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Support50.P18

open QAlgorithms.Papers.Independent.Dependency50.P33 (State PureState traceSize rankOne)

open QAlgorithms.Papers.Independent.Frontier18.P01 (convexOperatorMixture traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (extendedEntropyNats extendedRelativeEntropyNats)

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Renew46.P08
  (coefficientEnergy entropySupremum extendedHalfTraceDistance)

/-- Corollary 3, PDF p.9: (24) and its pure-state refinement under the original
hypothesis d(rho,sigma)≤eps; only the bound parameter becomes eps^2/2. -/
theorem oscillator_continuity {ell : ℕ} {R : Type} [Countable R] [Nonempty R]
    (O : OscillatorParameters ell) (C : AFWConstants)
    (f : Matrix ((Fin ell → ℕ) × R) ((Fin ell → ℕ) × R) ℂ → ℝ)
    (hf : O.EntropyControlled C f) (E : ℝ) (hE : O.ground < E) :
    ∀ (rho sigma : State ((Fin ell → ℕ) × R)) (eps : ℝ),
      O.meanEnergy (traceSecond rho.coefficients) ≤ ENNReal.ofReal E →
      O.meanEnergy (traceSecond sigma.coefficients) ≤ ENNReal.ofReal E →
      0 < eps → eps ≤ 1 / 2 → nuclearStateDistance rho sigma ≤ ENNReal.ofReal eps →
      |f rho.coefficients - f sigma.coefficients| ≤ O.continuityBound C E eps ∧
      ((∃ u : Hilbert ((Fin ell → ℕ) × R), ‖u‖ = 1 ∧ rho.coefficients = rankOne u) →
       (∃ u : Hilbert ((Fin ell → ℕ) × R), ‖u‖ = 1 ∧ sigma.coefficients = rankOne u) →
       |f rho.coefficients - f sigma.coefficients| ≤
         O.continuityBound C E (eps ^ 2 / 2)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P18

end
Source
Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use, arXiv:1609.07044v5, PDF p. 9, Corollary 3
Read-back

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

Let ℓ\ellℓ be a natural number, let RRR be a countable nonempty type, let OOO consist of ℓ>0\ell>0ℓ>0, ℏ>0\hbar>0ℏ>0, and ωi>0\omega_i>0ωi​>0, let C=(a,b,c−,c+)C=(a,b,c_-,c_+)C=(a,b,c−​,c+​) consist of four nonnegative real constants, and let fff be a real-valued function on all complex matrices indexed by A×RA\times RA×R, where A=NℓA=\mathbb N^\ellA=Nℓ. A state on a label set BBB means a matrix XXX admitting an expansion Xxy=∑nun(x)vn(y)‾X_{xy}=\sum_nu_n(x)\overline{v_n(y)}Xxy​=∑n​un​(x)vn​(y)​ with un,vn∈ℓ2(B;C)u_n,v_n\in\ell^2(B;\mathbb C)un​,vn​∈ℓ2(B;C) and ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, having real nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal entries with sum one. Put qi=ℏωiq_i=\hbar\omega_iqi​=ℏωi​, G=12∑iqiG=\frac12\sum_iq_iG=21​∑i​qi​, Q=(∏iqi)1/ℓQ=(\prod_iq_i)^{1/\ell}Q=(∏i​qi​)1/ℓ, ρA(a,a′)=∑r∈Rρ(a,r),(a′,r)\rho_A(a,a')=\sum_{r\in R}\rho_{(a,r),(a',r)}ρA​(a,a′)=∑r∈R​ρ(a,r),(a′,r)​, and

E(ρA)=∑a∈A(∑iqi(ai+1/2))max⁡(0,Re⁡(ρA)aa).\mathcal E(\rho_A)= \sum_{a\in A}\left(\sum_iq_i(a_i+1/2)\right) \max(0,\operatorname{Re}(\rho_A)_{aa}).E(ρA​)=a∈A∑​(i∑​qi​(ai​+1/2))max(0,Re(ρA​)aa​).

For matrices on AAA, define

S(X)=sup⁡s⊆A finitemax⁡ ⁣(0, Re⁡tr⁡(Xs)log⁡ ⁣(Re⁡tr⁡(Xs))−Re⁡tr⁡ ⁣(Xs(log⁡)cfc(Xs))),S(X)=\sup_{s\subseteq A\ {\rm finite}} \max\!\left(0,\, \operatorname{Re}\operatorname{tr}(X_s)\log\!\bigl(\operatorname{Re}\operatorname{tr}(X_s)\bigr) -\operatorname{Re}\operatorname{tr}\!\bigl(X_s(\log)_{\rm cfc}(X_s)\bigr)\right),S(X)=s⊆A finitesup​max(0,Retr(Xs​)log(Retr(Xs​))−Retr(Xs​(log)cfc​(Xs​))),

using coordinate compressions and continuous functional calculus of the total real logarithm. Assume that, for every pair of states ρ,σ\rho,\sigmaρ,σ with finite marginal energies and every 0<p<10<p<10<p<1,

−a h(p)≤f(pρ+(1−p)σ)−pf(ρ)−(1−p)f(σ)≤b h(p),h(p)=−plog⁡p−(1−p)log⁡(1−p),-a\,h(p)\le f(p\rho+(1-p)\sigma)-p f(\rho)-(1-p)f(\sigma)\le b\,h(p), \quad h(p)=-p\log p-(1-p)\log(1-p),−ah(p)≤f(pρ+(1−p)σ)−pf(ρ)−(1−p)f(σ)≤bh(p),h(p)=−plogp−(1−p)log(1−p),

and that every state ρ\rhoρ of finite marginal energy satisfies −c−S(ρA)≤f(ρ)≤c+S(ρA)-c_-S(\rho_A)\le f(\rho)\le c_+S(\rho_A)−c−​S(ρA​)≤f(ρ)≤c+​S(ρA​) in the extended real numbers, with the products formed in [0,∞][0,\infty][0,∞] and 0⋅∞=00\cdot\infty=00⋅∞=0. For any matrix XXX, let T(X)\mathcal T(X)T(X) be the infimum, in [0,∞][0,\infty][0,∞], of the costs ∑n∥un∥∥vn∥\sum_n\|u_n\|\|v_n\|∑n​∥un​∥∥vn​∥ over all expansions of the form above, with empty infimum ∞\infty∞, and set d(ρ,σ)=T(ρ−σ)/2d(\rho,\sigma)=\mathcal T(\rho-\sigma)/2d(ρ,σ)=T(ρ−σ)/2. Define

g(x)=(x+1)log⁡(x+1)−xlog⁡x,B(E,x)=(c−+c+)2x ℓ(log⁡ ⁣E/x+GℓQ+1)+(a+b)g(2x).g(x)=(x+1)\log(x+1)-x\log x,\qquad B(E,x)=(c_-+c_+)\sqrt{2x}\,\ell \left(\log\!\frac{E/x+G}{\ell Q}+1\right) +(a+b)g(\sqrt{2x}).g(x)=(x+1)log(x+1)−xlogx,B(E,x)=(c−​+c+​)2x​ℓ(logℓQE/x+G​+1)+(a+b)g(2x​).

Then, for every real E>GE>GE>G, every two states ρ,σ\rho,\sigmaρ,σ with E(ρA)≤E\mathcal E(\rho_A)\le EE(ρA​)≤E and E(σA)≤E\mathcal E(\sigma_A)\le EE(σA​)≤E, and every real 0<ε≤1/20<\varepsilon\le1/20<ε≤1/2 satisfying d(ρ,σ)≤εd(\rho,\sigma)\le\varepsilond(ρ,σ)≤ε, the theorem asserts

∣f(ρ)−f(σ)∣≤B(E,ε).|f(\rho)-f(\sigma)|\le B(E,\varepsilon).∣f(ρ)−f(σ)∣≤B(E,ε).

It also asserts that if each state is of the form ρxy=uxuy‾\rho_{xy}=u_x\overline{u_y}ρxy​=ux​uy​​, respectively σxy=vxvy‾\sigma_{xy}=v_x\overline{v_y}σxy​=vx​vy​​, for some unit vectors u,v∈ℓ2(A×R;C)u,v\in\ell^2(A\times R;\mathbb C)u,v∈ℓ2(A×R;C), then

∣f(ρ)−f(σ)∣≤B(E,ε2/2).|f(\rho)-f(\sigma)|\le B(E,\varepsilon^2/2).∣f(ρ)−f(σ)∣≤B(E,ε2/2).

The two unit vectors may differ; their existence is an additional hypothesis only for the second bound. The endpoint ε=1/2\varepsilon=1/2ε=1/2 is included, while ε=0\varepsilon=0ε=0, E=GE=GE=G, and ℓ=0\ell=0ℓ=0 are excluded.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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