Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (23): harmonic-state smooth-spread lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.harmonic_smooth_spread

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

prove2quantum

For 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. With joint spectral-subset smooth spread Δδ\Delta_\deltaΔδ​ and 0≤δ<10\le\delta<10≤δ<1,

Δδ(ρA)≥(1−2δ)log⁡2n−4−log⁡2log⁡2(n+1).\Delta_\delta(\rho_A)\ge(1-2\delta)\log_2 n-4-\log_2\log_2(n+1).Δδ​(ρA​)≥(1−2δ)log2​n−4−log2​log2​(n+1).

The explicit constant is retained, and log⁡2(n+1)≥1\log_2(n+1)\ge1log2​(n+1)≥1 makes the iterated logarithm well-defined. The source's preceding harmonic-number estimate is not assumed.

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 p.8, (23): the explicit harmonic-state bound, including its constant -4.
The preceding printed harmonic-number estimate has a base-convention error;
it is not used as a hypothesis or asserted here. -/
theorem harmonic_smooth_spread (n : ℕ) (hn : 0 < n) (delta : ℝ)
    (hzero : 0 ≤ delta) (hone : delta < 1) :
    smoothSpread (aliceDensity (harmonicState n)) delta ≥
      (1 - 2 * delta) * logTwo n - 4 - logTwo (logTwo (n + 1)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 8, Equation (23): harmonic-state smooth-spread lower bound
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) be 1/((i+1)Hn)\sqrt{1/((i+1)H_n)}1/((i+1)Hn​)​ for 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)​. If λi\lambda_iλi​ are the eigenvalues of ρ\rhoρ, counted with multiplicity, then

log⁡2 ⁣(min⁡S⊆{i:λi>0}∑i∈Sλi≥1−δ∣S∣max⁡i∈Sλi)≥(1−2δ)log⁡2n−4−log⁡2 ⁣(log⁡2(n+1)).\log_2\!\left( \min_{\substack{S\subseteq\{i:\lambda_i>0\}\\ \sum_{i\in S}\lambda_i\geq1-\delta}} |S|\max_{i\in S}\lambda_i \right) \geq (1-2\delta)\log_2n-4-\log_2\!\bigl(\log_2(n+1)\bigr).log2​​S⊆{i:λi​>0}∑i∈S​λi​≥1−δ​min​∣S∣i∈Smax​λi​​≥(1−2δ)log2​n−4−log2​(log2​(n+1)).

The eigenvalues retained in SSS are not renormalized. An empty finite maximum or minimum is assigned zero, 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; here the family of retained subsets is nonempty and none of its members is empty. The cases n=1n=1n=1 and δ=0\delta=0δ=0 are 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