Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV, unnumbered: entropy of the harmonic embezzling family

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.harmonic_entanglement_asymptotic

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

prove2quantum

Let ∣μ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⟩, where Hn=∑i=1n1/iH_n=\sum_{i=1}^n1/iHn​=∑i=1n​1/i, and let E(μn)=S(Tr⁡B∣μn⟩⟨μn∣)E(\mu_n)=S(\operatorname{Tr}_B|\mu_n\rangle\langle\mu_n|)E(μn​)=S(TrB​∣μn​⟩⟨μn​∣) be its entropy of entanglement in bits. Then

lim⁡n→∞E(μn)log⁡2n=12.\lim_{n\to\infty}\frac{E(\mu_n)}{\log_2 n}=\frac12.n→∞lim​log2​nE(μn​)​=21​.

This is a first-order asymptotic, rather than an exact finite-size entropy identity. It compares the harmonic family's entanglement with its preparation cost.

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.7, unnumbered: first-order entropy asymptotic of the harmonic family.
The finite n=0,1 totalized quotient values do not affect the limit at infinity. -/
theorem harmonic_entanglement_asymptotic :
    Filter.Tendsto (fun n : ℕ => entropyOne (aliceDensity (harmonicState n)) / logTwo n)
      Filter.atTop (nhds (1 / 2)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 7, §IV, unnumbered: entropy of the harmonic embezzling family
Read-back

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

For each natural nnn, let Hn=∑i=1n1/iH_n=\sum_{i=1}^{n}1/iHn​=∑i=1n​1/i, let hnh_nhn​ be the vector on {0,…,n−1}2\{0,\ldots,n-1\}^2{0,…,n−1}2 with diagonal coefficients 1/((i+1)Hn)\sqrt{1/((i+1)H_n)}1/((i+1)Hn​)​ and off-diagonal coefficients zero, and define its first marginal by (ρn)i,j=∑bhn(i,b)hn(j,b)‾(\rho_n)_{i,j}=\sum_bh_n(i,b)\overline{h_n(j,b)}(ρn​)i,j​=∑b​hn​(i,b)hn​(j,b)​. If λn,i\lambda_{n,i}λn,i​ are the eigenvalues of ρn\rho_nρn​, counted with multiplicity, then

lim⁡n→∞−∑iλn,ilog⁡2λn,ilog⁡2n=12,log⁡2x=log⁡xlog⁡2.\lim_{n\to\infty} \frac{-\sum_i\lambda_{n,i}\log_2\lambda_{n,i}}{\log_2n} =\frac12, \qquad \log_2x=\frac{\log x}{\log2}.n→∞lim​log2​n−∑i​λn,i​log2​λn,i​​=21​,log2​x=log2logx​.

The sequence is defined at every natural nnn: the real logarithm has value zero at zero, division by zero has value zero, and consequently the displayed quotient is zero at both n=0n=0n=0 and n=1n=1n=1.

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