Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One-sided broad-prior limit and TMSS covariance

Open
QAlgorithms.Papers.Independent.Intakethird100.P89.broadPriorLimit

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix finite r≥0r\ge0r≥0. For every λ>0\lambda>0λ>0 use the normalized Gaussian prior, and let τopt(λ,r)\tau_{\rm opt}(\lambda,r)τopt​(λ,r), yopt(λ,r)y_{\rm opt}(\lambda,r)yopt​(λ,r) and F‾opt(λ,r)\overline F_{\rm opt}(\lambda,r)Fopt​(λ,r) be the optimizer and independently defined scalar maximum. As λ→0\lambda\to0λ→0 through positive values,

τopt→1,yopt→2e−2r,F‾opt→11+e−2r.\tau_{\rm opt}\to1,\qquad y_{\rm opt}\to2e^{-2r},\qquad \overline F_{\rm opt}\to\frac1{1+e^{-2r}}.τopt​→1,yopt​→2e−2r,Fopt​→1+e−2r1​.

The minimum-family coefficients (9), evaluated at τopt\tau_{\rm opt}τopt​, obey

amin⁡,bmin⁡→cosh⁡(2r),cmin⁡→sinh⁡(2r),τopt→1.a_{\min},b_{\min}\to\cosh(2r),\qquad c_{\min}\to\sinh(2r),\qquad \sqrt{\tau_{\rm opt}}\to1.amin​,bmin​→cosh(2r),cmin​→sinh(2r),τopt​​→1.

These are the pure TMSS covariance and unit displacement gain. This expresses the broad-prior limit of normalized ensembles, without asserting a uniform probability measure on C\mathbb CC or substituting λ=0\lambda=0λ=0 in (12). The source identifies the limiting fidelity with earlier results [17,29] and the unit-gain BK protocol [9].

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P89
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators ENNReal Topology ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P89

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsTraceClassChannel tensorApply traceSize)

open QAlgorithms.Papers.Independent.Dependency50.P39
  (coherentKet coherentCoefficient operatorOfMatrix husimiQ HasFockMatrix CoherentRealized)

open QAlgorithms.Papers.Independent.Frontier30.P14 (weylCharacteristic)

open QAlgorithms.Papers.Independent.Claimed50.P19
  (Cov FockIndex DensityKernel PhysicalCovariance CharacteristicSummable
   multimodeWeylTrace covarianceCharacteristicValue standardFormCovariance)

open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)

open QAlgorithms.Papers.Independent.Gap48.P26 (PhaseInsensitive coherentKernel)

open QAlgorithms.Entanglement (partialTransposeFirst)

/-- PDF p.4, (15): one-sided broad-prior limit of normalized lambda>0
ensembles and minimum-family covariances, not a uniform probability on C.
This recovers the cited earlier results [17,29] and unit-gain BK [9]. -/
theorem broadPriorLimit (r : ℝ) (hr : 0 ≤ r) :
    Tendsto (fun lambda => optimalTau lambda r) (nhdsWithin 0 (Set.Ioi 0)) (𝓝 1) ∧
    Tendsto (fun lambda => optimalNoise lambda r) (nhdsWithin 0 (Set.Ioi 0))
      (𝓝 (2 * Real.exp (-2 * r))) ∧
    Tendsto (fun lambda => scalarOptimum lambda r) (nhdsWithin 0 (Set.Ioi 0))
      (𝓝 (1 / (1 + Real.exp (-2 * r)))) ∧
    Tendsto (fun lambda => familyMinA r (optimalTau lambda r)) (nhdsWithin 0 (Set.Ioi 0))
      (𝓝 (Real.cosh (2 * r))) ∧
    Tendsto (fun lambda => familyMinB r (optimalTau lambda r)) (nhdsWithin 0 (Set.Ioi 0))
      (𝓝 (Real.cosh (2 * r))) ∧
    Tendsto (fun lambda => familyMinC r (optimalTau lambda r)) (nhdsWithin 0 (Set.Ioi 0))
      (𝓝 (Real.sinh (2 * r))) ∧
    Tendsto (fun lambda => Real.sqrt (optimalTau lambda r)) (nhdsWithin 0 (Set.Ioi 0)) (𝓝 1) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P89

end
Source
Optimal continuous variable quantum teleportation with limited resources, arXiv:1705.03017v5, PDF p. 4, Broad-prior one-sided limit of the optimum, Eq. (15)
Read-back

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

For every fixed real r≥0r\ge0r≥0, define

tλ=max⁡ ⁣(tanh⁡r,e2r(er+λcosh⁡r)2),yλ=e−2r(1+tλ),t_\lambda=\max\!\left(\tanh r,\frac{e^{2r}}{(e^r+\lambda\cosh r)^2}\right), \qquad y_\lambda=e^{-2r}(1+t_\lambda),tλ​=max(tanhr,(er+λcoshr)2e2r​),yλ​=e−2r(1+tλ​),

and let Sλ,rS_{\lambda,r}Sλ,r​ be the real supremum of

{2λ2(1−t)2+λ(1+y+t):t≥0, ∣1−t∣≤y, e−2r(1+t)≤y}.\left\{ \frac{2\lambda}{2(1-\sqrt t)^2+\lambda(1+y+t)}: t\ge0,\ |1-t|\le y,\ e^{-2r}(1+t)\le y \right\}.{2(1−t​)2+λ(1+y+t)2λ​:t≥0, ∣1−t∣≤y, e−2r(1+t)≤y}.

Also put

dr(t)=t+1−e2r∣t−1∣,Br(t)=e2rt+e−2r−∣t−1∣dr(t),Ar(t)=Br(t)+e−2r(t−1)t,Cr(t)=Br(t)−e−2rt.d_r(t)=t+1-e^{2r}|t-1|,\qquad B_r(t)=\frac{e^{2r}t+e^{-2r}-|t-1|}{d_r(t)},\qquad A_r(t)=\frac{B_r(t)+e^{-2r}(t-1)}t,\qquad C_r(t)=\frac{B_r(t)-e^{-2r}}{\sqrt t}.dr​(t)=t+1−e2r∣t−1∣,Br​(t)=dr​(t)e2rt+e−2r−∣t−1∣​,Ar​(t)=tBr​(t)+e−2r(t−1)​,Cr​(t)=t​Br​(t)−e−2r​.

As the real variable λ\lambdaλ tends to zero through positive values, all seven limits hold:

tλ⟶1,yλ⟶2e−2r,Sλ,r⟶11+e−2r,t_\lambda\longrightarrow1,\qquad y_\lambda\longrightarrow2e^{-2r},\qquad S_{\lambda,r}\longrightarrow\frac1{1+e^{-2r}},tλ​⟶1,yλ​⟶2e−2r,Sλ,r​⟶1+e−2r1​, Ar(tλ)⟶cosh⁡(2r),Br(tλ)⟶cosh⁡(2r),Cr(tλ)⟶sinh⁡(2r),tλ⟶1.A_r(t_\lambda)\longrightarrow\cosh(2r),\qquad B_r(t_\lambda)\longrightarrow\cosh(2r),\qquad C_r(t_\lambda)\longrightarrow\sinh(2r),\qquad \sqrt{t_\lambda}\longrightarrow1.Ar​(tλ​)⟶cosh(2r),Br​(tλ​)⟶cosh(2r),Cr​(tλ​)⟶sinh(2r),tλ​​⟶1.

These are one-sided limits and impose no assertion about the values at λ=0\lambda=0λ=0. They include r=0r=0r=0. All displayed scalar quotients are total, with division by zero equal to zero; the real supremum convention assigns zero to an empty or unbounded-above set.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me