Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (21)–(22): harmonic-state smooth spectral entropies

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.harmonic_smooth_entropies

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For an integer n≥1n\ge1n≥1, let Hn=∑i=1n1/iH_n=\sum_{i=1}^n1/iHn​=∑i=1n​1/i, ∣μn⟩=Hn−1/2∑i=1ni−1/2∣i,i⟩|\mu_n\rangle=H_n^{-1/2}\sum_{i=1}^ni^{-1/2}|i,i\rangle∣μn​⟩=Hn−1/2​∑i=1n​i−1/2∣i,i⟩, and ρA\rho_AρA​ its Alice reduction. For 0≤δ<10\le\delta<10≤δ<1, the separately smoothed spectral entropies, optimized over eigenvalue subsets of retained mass at least 1−δ1-\delta1−δ, satisfy

S0,δ(ρA)=log⁡2min⁡{1≤k≤n:∑i=k+1n1iHn≤δ},S_{0,\delta}(\rho_A)=\log_2\min\left\{1\le k\le n:\sum_{i=k+1}^n\frac1{iH_n}\le\delta\right\},S0,δ​(ρA​)=log2​min{1≤k≤n:i=k+1∑n​iHn​1​≤δ}, S∞,δ(ρA)=log⁡2Hn+log⁡2max⁡{1≤k≤n:∑i=1k−11iHn≤δ}.S_{\infty,\delta}(\rho_A)=\log_2 H_n+\log_2\max\left\{1\le k\le n:\sum_{i=1}^{k-1}\frac1{iH_n}\le\delta\right\}.S∞,δ​(ρA​)=log2​Hn​+log2​max{1≤k≤n:i=1∑k−1​iHn​1​≤δ}.

The minima and maxima are over finite nonempty integer sets. The inclusive threshold and the index k−1k-1k−1 are part of the formulas.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P61

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)

open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

attribute [local instance] Classical.propDecidable

/-- PDF pp.7--8, (21)--(22) (displayed on p.8): exact finite harmonic-state
smooth spectral entropies, including delta=0 and n=1. -/
theorem harmonic_smooth_entropies (n : ℕ) (hn : 0 < n) (delta : ℝ)
    (hzero : 0 ≤ delta) (hone : delta < 1) :
    smoothZero (aliceDensity (harmonicState n)) delta =
      logTwo (finiteMin (harmonicTailCuts n delta) fun k => (k : ℝ)) ∧
    smoothInfinity (aliceDensity (harmonicState n)) delta =
      logTwo (harmonicSum n) + logTwo (finiteMax (harmonicHeadCuts n delta) fun k => (k : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 8, Equations (21)–(22): harmonic-state smooth spectral entropies
Read-back

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

For every natural n>0n>0n>0 and real 0≤δ<10\leq\delta<10≤δ<1, let Hn=∑i=1n1/iH_n=\sum_{i=1}^{n}1/iHn​=∑i=1n​1/i, let hn(i,j)h_n(i,j)hn​(i,j) equal 1/((i+1)Hn)\sqrt{1/((i+1)H_n)}1/((i+1)Hn​)​ when i=ji=ji=j and zero otherwise, and let ρi,j=∑bhn(i,b)hn(j,b)‾\rho_{i,j}=\sum_bh_n(i,b)\overline{h_n(j,b)}ρi,j​=∑b​hn​(i,b)hn​(j,b)​. Write λi\lambda_iλi​ for the eigenvalues of ρ\rhoρ, counted with multiplicity, and define

Rρ(δ)={S⊆{i:λi>0}:∑i∈Sλi≥1−δ},T={k:1≤k≤n, ∑i=k+1n1iHn≤δ},U={k:1≤k≤n, ∑i=1k−11iHn≤δ}.\mathcal R_\rho(\delta)= \left\{S\subseteq\{i:\lambda_i>0\}:\sum_{i\in S}\lambda_i\geq1-\delta\right\}, \quad T=\left\{k:1\leq k\leq n,\ \sum_{i=k+1}^{n}\frac1{iH_n}\leq\delta\right\}, \quad U=\left\{k:1\leq k\leq n,\ \sum_{i=1}^{k-1}\frac1{iH_n}\leq\delta\right\}.Rρ​(δ)={S⊆{i:λi​>0}:i∈S∑​λi​≥1−δ},T={k:1≤k≤n, i=k+1∑n​iHn​1​≤δ},U={k:1≤k≤n, i=1∑k−1​iHn​1​≤δ}.

Then both identities hold:

log⁡2 ⁣(min⁡S∈Rρ(δ)∣S∣)=log⁡2 ⁣(min⁡k∈Tk),−log⁡2 ⁣(min⁡S∈Rρ(δ)max⁡i∈Sλi)=log⁡2Hn+log⁡2 ⁣(max⁡k∈Uk).\log_2\!\left(\min_{S\in\mathcal R_\rho(\delta)}|S|\right) =\log_2\!\left(\min_{k\in T}k\right), \qquad -\log_2\!\left(\min_{S\in\mathcal R_\rho(\delta)} \max_{i\in S}\lambda_i\right) =\log_2H_n+\log_2\!\left(\max_{k\in U}k\right).log2​(S∈Rρ​(δ)min​∣S∣)=log2​(k∈Tmin​k),−log2​(S∈Rρ​(δ)min​i∈Smax​λi​)=log2​Hn​+log2​(k∈Umax​k).

Every finite minimum or maximum in these definitions is assigned zero if its indexing set is empty, and log⁡2x=log⁡x/log⁡2\log_2x=\log x/\log2log2​x=logx/log2 uses log⁡20=0\log_2 0=0log2​0=0; under the stated hypotheses, the retention sets contain the full positive spectrum, TTT contains nnn, and UUU contains 111. Zero error is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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