Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.2: exact oscillator entropy maximum and upper bound (23)

Open
QAlgorithms.Papers.Independent.Support50.P18.oscillator_entropy_maximum

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

prove2quantum

Let ℓ≥1\ell\ge1ℓ≥1, ℏ>0\hbar>0ℏ>0, and ωi>0\omega_i>0ωi​>0 be the parameters of the ℓ\ellℓ-mode quantum oscillator on its full Fock space. Write ui=ℏωiu_i=\hbar\omega_iui​=ℏωi​, E0=12∑iuiE_0=\frac12\sum_i u_iE0​=21​∑i​ui​, E∗=(∏iui)1/ℓE_*=(\prod_i u_i)^{1/\ell}E∗​=(∏i​ui​)1/ℓ, and g(x)=(1+x)h2(x/(1+x))g(x)=(1+x)h_2(x/(1+x))g(x)=(1+x)h2​(x/(1+x)), where h2h_2h2​ is binary entropy in nats. For E≥E0E\ge E_0E≥E0​, let FH(E)F_H(E)FH​(E) be the supremum of von Neumann entropy over all normalized states with mean energy at most EEE. Then

FH(E)=max⁡∑iei=Eei≥ui/2∑i=1ℓg(ei/ui−1/2)≤ℓlog⁡E+E0ℓE∗+ℓ.F_H(E)=\max_{\substack{\sum_i e_i=E\\ e_i\ge u_i/2}}\sum_{i=1}^{\ell}g(e_i/u_i-1/2)\le\ell\log\frac{E+E_0}{\ell E_*}+\ell.FH​(E)=∑i​ei​=Eei​≥ui​/2​max​i=1∑ℓ​g(ei​/ui​−1/2)≤ℓlogℓE∗​E+E0​​+ℓ.

The maximum is attained. This gives both the exact allocation formula and the explicit entropy majorant, including the ground-energy budget.

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)

/-- Section 4.2, PDF p.9: exact attained allocation maximum and bound (23).
E=E0 is included. The undefined epsilon-sharp qualifier is separately deferred. -/
theorem oscillator_entropy_maximum {ell : ℕ} (O : OscillatorParameters ell) (E : ℝ)
    (hE : O.ground ≤ E) :
    (∃ e ∈ O.allocations E,
      O.entropyMaximum E = ENNReal.ofReal (O.allocationEntropy e) ∧
      ∀ v ∈ O.allocations E, O.allocationEntropy v ≤ O.allocationEntropy e) ∧
    O.entropyMaximum E ≤ ENNReal.ofReal (O.entropyUpper E) := 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, Section 4.2
Read-back

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

For every natural number ℓ\ellℓ, oscillator parameters OOO with ℓ>0\ell>0ℓ>0, ℏ>0\hbar>0ℏ>0, and ωi>0\omega_i>0ωi​>0, and real E≥G:=12∑iℏωiE\ge G:=\frac12\sum_i\hbar\omega_iE≥G:=21​∑i​ℏωi​, put A=NℓA=\mathbb N^\ellA=Nℓ, qi=ℏωiq_i=\hbar\omega_iqi​=ℏωi​, Q=(∏iqi)1/ℓQ=(\prod_iq_i)^{1/\ell}Q=(∏i​qi​)1/ℓ, and L(a)=∑iqi(ai+1/2)L(a)=\sum_iq_i(a_i+1/2)L(a)=∑i​qi​(ai​+1/2) for a∈Aa\in Aa∈A. Here a state on AAA is a complex matrix ρ\rhoρ admitting an expansion ρab=∑r=0∞ur(a)vr(b)‾\rho_{ab}=\sum_{r=0}^\infty u_r(a)\overline{v_r(b)}ρab​=∑r=0∞​ur​(a)vr​(b)​ with ur,vr∈ℓ2(A;C)u_r,v_r\in\ell^2(A;\mathbb C)ur​,vr​∈ℓ2(A;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, whose every finite quadratic form ∑a,b∈sza‾ρabzb\sum_{a,b\in s}\overline{z_a}\rho_{ab}z_b∑a,b∈s​za​​ρab​zb​ is real and nonnegative, and whose real diagonal entries are summable with sum one. Define its energy by EO(ρ)=∑a∈AL(a)max⁡(0,Re⁡ρaa)\mathcal E_O(\rho)=\sum_{a\in A}L(a)\max(0,\operatorname{Re}\rho_{aa})EO​(ρ)=∑a∈A​L(a)max(0,Reρaa​), as an extended nonnegative sum. For any matrix XXX on AAA, let

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​))),

where XsX_sXs​ is the coordinate compression to sss, and (log⁡)cfc(\log)_{\rm cfc}(log)cfc​ is the continuous functional calculus of the total real logarithm. Write MO(E)=sup⁡ρ: EO(ρ)≤ES(ρ)M_O(E)=\sup_{\rho:\,\mathcal E_O(\rho)\le E}S(\rho)MO​(E)=supρ:EO​(ρ)≤E​S(ρ), with the supremum over states just described, and g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(x)=(x+1)log(x+1)−xlogx. The theorem asserts that there exists a real vector eee with ∑iei=E\sum_i e_i=E∑i​ei​=E and ei≥qi/2e_i\ge q_i/2ei​≥qi​/2 for every iii, such that

MO(E)=max⁡ ⁣(0,∑ig(ei/qi−1/2)),∑ig(vi/qi−1/2)≤∑ig(ei/qi−1/2)M_O(E)=\max\!\left(0,\sum_i g(e_i/q_i-1/2)\right), \qquad \sum_i g(v_i/q_i-1/2)\le\sum_i g(e_i/q_i-1/2)MO​(E)=max(0,i∑​g(ei​/qi​−1/2)),i∑​g(vi​/qi​−1/2)≤i∑​g(ei​/qi​−1/2)

for every real vector vvv satisfying the same allocation conditions, and also

MO(E)≤max⁡ ⁣(0,ℓlog⁡ ⁣E+GℓQ+ℓ).M_O(E)\le \max\!\left(0,\ell\log\!\frac{E+G}{\ell Q}+\ell\right).MO​(E)≤max(0,ℓlogℓQE+G​+ℓ).

All displayed maxima and suprema defining entropies are interpreted in [0,∞][0,\infty][0,∞]. The case E=GE=GE=G is included; ℓ=0\ell=0ℓ=0 is excluded by the data of OOO.

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