Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Asymptotic relative entropy of entanglement across every receiver cut

Open
QAlgorithms.Papers.Independent.Support50.P48.ree_cut_limits

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

prove2quantum

Let m≥1m\ge1m≥1, ηi≥0\eta_i\ge0ηi​≥0, ∑iηi≤1\sum_i\eta_i\le1∑i​ηi​≤1, and ηE=1−∑iηi\eta_E=1-\sum_i\eta_iηE​=1−∑i​ηi​. Let ϕAB1⋯Bm(N)\phi^{(N)}_{AB_1\cdots B_m}ϕAB1​⋯Bm​(N)​ be the actual output obtained by transmitting half of a TMSV with finite mean photon number N≥0N\ge0N≥0 through the vacuum pure-loss broadcast channel. For a nonempty receiver subset TTT, let Tˉ\bar TTˉ be its receiver complement. Relative entropy of entanglement is the infimum of quantum relative entropy in bits over all normal separable states, using trace-norm closed separability. Then

lim⁡N→∞ER(T;ATˉ)ϕ(N)=F(T),\lim_{N\to\infty}E_R(T;A\bar T)_{\phi^{(N)}}=F(T),N→∞lim​ER​(T;ATˉ)ϕ(N)​=F(T),

where F(T)=0F(T)=0F(T)=0 if ηT=0\eta_T=0ηT​=0, F(T)=+∞F(T)=+\inftyF(T)=+∞ if ηT>0\eta_T>0ηT​>0 and ηE=0\eta_E=0ηE​=0, and otherwise F(T)=log⁡2((ηE+ηT)/ηE)F(T)=\log_2((\eta_E+\eta_T)/\eta_E)F(T)=log2​((ηE​+ηT​)/ηE​), with ηT=∑i∈Tηi\eta_T=\sum_{i\in T}\eta_iηT​=∑i∈T​ηi​.

For two receivers the three nonempty cuts give (21), (25), and (26). This is an energy limit of actual resource-state REEs, not an exact finite-energy formula or a finite-energy operational converse.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P48
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P48

open Filter

open scoped BigOperators ENNReal NNReal Topology

open QAlgorithms.Papers.Independent.Dependency50.P30
  (PureLossBroadcastParameters thermalEntropyBits)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsSeparable)

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

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, (21),(25)-(26); PDF p.6, (31), interpreted as an energy limit.
The printed numerator in (31) is 1-eta_complement(T), consistently with
(27) and the preceding line of (31); no numerator correction is made.
The limit is zero for a zero selected signal, and infinite for positive signal
with no loss, as inferred from the source proof at the allowed endpoints.
There is no exact finite-energy REE formula in this statement. -/
theorem ree_cut_limits {m : ℕ} (hm : 0 < m)
    (p : PureLossBroadcastParameters m) (T : Finset (Fin m)) (hT : T.Nonempty) :
    (∀ N : ℝ≥0, IsDensity (resourceCut p N T)) ∧
    Tendsto (fun N : ℝ≥0 => relativeEntanglementBits (resourceCut p N T))
      atTop (𝓝 (extendedCutBound p T)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P48

end
Source
Unconstrained distillation capacities of a pure-loss bosonic broadcast channel, arXiv:1601.05563v3, PDF p. 4, (21), (25)-(26); Appendix (31), p.6
Read-back

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

Let m>0m>0m>0 be a natural number, let ηi≥0\eta_i\ge0ηi​≥0 for 0≤i<m0\le i<m0≤i<m satisfy ∑iηi≤1\sum_i\eta_i\le1∑i​ηi​≤1, and let T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1} be nonempty. Set ℓ=1−∑iηi\ell=1-\sum_i\eta_iℓ=1−∑i​ηi​ and s=∑i∈Tηis=\sum_{i\in T}\eta_is=∑i∈T​ηi​, and define index sets L=T→NL=T\to\mathbb NL=T→N and M=N×({i:i∉T}→N)M=\mathbb N\times(\{i:i\notin T\}\to\mathbb N)M=N×({i:i∈/T}→N). For a∈La\in La∈L, b=(q,o)∈Mb=(q,o)\in Mb=(q,o)∈M, and e∈Ne\in\mathbb Ne∈N, set

rN(a,b,e)={Nq(N+1)q+1q!e!∏i∈Tai!∏i∉Toi! (ℓ)e∏i∈T(ηi)ai∏i∉T(ηi)oi,e+∑i∈Tai+∑i∉Toi=q,0,otherwise,CN((a,b),(a′,b′))=∑e=0∞rN(a,b,e)rN(a′,b′,e)∈C.r_N(a,b,e)= \begin{cases} \displaystyle \sqrt{\frac{N^q}{(N+1)^{q+1}}} \sqrt{\frac{q!}{e!\prod_{i\in T}a_i!\prod_{i\notin T}o_i!}}\, (\sqrt{\ell})^e \prod_{i\in T}(\sqrt{\eta_i})^{a_i} \prod_{i\notin T}(\sqrt{\eta_i})^{o_i}, &e+\sum_{i\in T}a_i+\sum_{i\notin T}o_i=q,\\ 0,&\text{otherwise}, \end{cases} \qquad C_N\bigl((a,b),(a',b')\bigr) =\sum_{e=0}^{\infty}r_N(a,b,e)r_N(a',b',e)\in\mathbb C.rN​(a,b,e)=⎩⎨⎧​(N+1)q+1Nq​​e!∏i∈T​ai​!∏i∈/T​oi​!q!​​(ℓ​)ei∈T∏​(ηi​​)ai​i∈/T∏​(ηi​​)oi​,0,​e+∑i∈T​ai​+∑i∈/T​oi​=q,otherwise,​CN​((a,b),(a′,b′))=e=0∑∞​rN​(a,b,e)rN​(a′,b′,e)∈C.

Formal infinite sums here take value zero if not summable. For any index set KKK, call a matrix DDD on KKK a density matrix when it admits an expansion Dij=∑nun(i)vn(j)‾D_{ij}=\sum_nu_n(i)\overline{v_n(j)}Dij​=∑n​un​(i)vn​(j)​ with un,vn∈ℓ2(K;C)u_n,v_n\in\ell^2(K;\mathbb C)un​,vn​∈ℓ2(K;C) and ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, every finite quadratic form ∑i,j∈Fzi‾Dijzj\sum_{i,j\in F}\overline{z_i}D_{ij}z_j∑i,j∈F​zi​​Dij​zj​ is real and nonnegative, and its real diagonal entries are summable with sum one. Define τ(Z)\tau(Z)τ(Z) as the infimum, over all such expansions of ZZZ, of max⁡{0,∑n∥un∥∥vn∥}\max\{0,\sum_n\|u_n\|\|v_n\|\}max{0,∑n​∥un​∥∥vn​∥}, with empty infimum ∞\infty∞. Let S\mathcal SS consist of the density matrices DDD on L×ML\times ML×M such that, for every ε>0\varepsilon>0ε>0, some finite real convex combination YYY of product density matrices Paa′Qbb′P_{aa'}Q_{bb'}Paa′​Qbb′​ satisfies τ(D−Y)<ε\tau(D-Y)<\varepsilonτ(D−Y)<ε. For matrices X,DX,DX,D on L×ML\times ML×M, set

Dext(X,D)=sup⁡F⊆L×MF finite{max⁡ ⁣{0,Re⁡tr⁡(XFlog⁡(XF)−XFlog⁡(DF)+DF−XF)},ker⁡DF⊆ker⁡XF,∞,otherwise,E(X)=inf⁡D∈SDext(X,D)log⁡2,D_{\mathrm{ext}}(X,D)= \sup_{\substack{F\subseteq L\times M\\F\text{ finite}}} \begin{cases} \max\!\left\{0,\operatorname{Re}\operatorname{tr} \bigl(X_F\log(X_F)-X_F\log(D_F)+D_F-X_F\bigr)\right\}, &\ker D_F\subseteq\ker X_F,\\ \infty,&\text{otherwise}, \end{cases} \qquad E(X)=\frac{\inf_{D\in\mathcal S}D_{\mathrm{ext}}(X,D)}{\log2},Dext​(X,D)=F⊆L×MF finite​sup​{max{0,Retr(XF​log(XF​)−XF​log(DF​)+DF​−XF​)},∞,​kerDF​⊆kerXF​,otherwise,​E(X)=log2infD∈S​Dext​(X,D)​,

where subscripts denote principal submatrices and matrix logarithms use the continuous functional calculus of the total real logarithm, for which log⁡0=0\log0=0log0=0. The theorem asserts that CNC_NCN​ is a density matrix for every nonnegative real NNN, including zero, and that, as N→∞N\to\inftyN→∞ through nonnegative real values,

E(CN)⟶{0,s=0,∞,s≠0, ℓ=0,max⁡{0,log⁡2((ℓ+s)/ℓ)},s≠0, ℓ≠0,E(C_N)\longrightarrow \begin{cases} 0,&s=0,\\ \infty,&s\ne0,\ \ell=0,\\ \max\{0,\log_2((\ell+s)/\ell)\},&s\ne0,\ \ell\ne0, \end{cases}E(CN​)⟶⎩⎨⎧​0,∞,max{0,log2​((ℓ+s)/ℓ)},​s=0,s=0, ℓ=0,s=0, ℓ=0,​

in [0,∞][0,\infty][0,∞]. Nonempty TTT is permitted to have total weight s=0s=0s=0, and its complement is permitted to be empty.

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