Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

EPR lower-bound monotonicity and the many-pair limit

Proved
QAlgorithms.Papers.Independent.Advance50.P35.epr_lower_bound_monotone_limit

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

prove2quantum

Fix 0≤κ0<10\leq\kappa_0<10≤κ0​<1 and a finite signal energy n≥0n\geq0n≥0, for the equal-prior ideal cell {κ0,1}\{\kappa_0,1\}{κ0​,1}. For each integer s≥1s\geq1s≥1 define

Θs=12[1+(n/s)(1−κ0)]2s,Qs=1−h2(Θs),θ=e−2n(1−κ0)2,Q∞=1−h2(θ).\Theta_s=\frac{1}{2[1+(n/s)(1-\sqrt{\kappa_0})]^{2s}},\quad Q_s=1-h_2(\Theta_s),\quad\theta=\frac{e^{-2n(1-\sqrt{\kappa_0})}}2,\quad Q_\infty=1-h_2(\theta).Θs​=2[1+(n/s)(1−κ0​​)]2s1​,Qs​=1−h2​(Θs​),θ=2e−2n(1−κ0​​)​,Q∞​=1−h2​(θ).

The sequence QsQ_sQs​ is nondecreasing, and

Θs⟶θ,Qs⟶Q∞,Q1≤Qs≤Q∞.\Theta_s\longrightarrow\theta,\qquad Q_s\longrightarrow Q_\infty,\qquad Q_1\leq Q_s\leq Q_\infty.Θs​⟶θ,Qs​⟶Q∞​,Q1​≤Qs​≤Q∞​.

At n=0n=0n=0 every rate is zero, so increasing means nondecreasing. The limits are scalar quantities, with no infinite-copy state or finite-pair optimizer asserted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P35
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators ENNReal NNReal Topology

namespace QAlgorithms.Papers.Independent.Advance50.P35

open QAlgorithms.RealRegisters (Hilbert)

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

open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel)

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

open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix coherentCoefficient)

open QAlgorithms.Papers.Independent.Support50.P20 (IsBinaryEffect)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Sec.VII, PDF p.13, (79), with theta from (33), PDF p.6: monotonicity,
both limits, and the two-sided bound. No infinite-copy state or optimizer is used. -/
theorem epr_lower_bound_monotone_limit (kappa0 n : ℝ)
    (hk : kappa0 ∈ Set.Ico (0 : ℝ) 1) (hn : 0 ≤ n) :
    (∀ s t : ℕ, 1 ≤ s → s ≤ t → eprLowerRate kappa0 s n ≤ eprLowerRate kappa0 t n) ∧
      Tendsto (fun s : ℕ => thetaFinite kappa0 s n) atTop (𝓝 (thetaLimit kappa0 n)) ∧
      Tendsto (fun s : ℕ => eprLowerRate kappa0 s n) atTop (𝓝 (eprLimitRate kappa0 n)) ∧
      ∀ s : ℕ, 1 ≤ s →
        eprLowerRate kappa0 1 n ≤ eprLowerRate kappa0 s n ∧
        eprLowerRate kappa0 s n ≤ eprLimitRate kappa0 n := by sorry

end QAlgorithms.Papers.Independent.Advance50.P35

end
Source
Quantum Reading Capacity, arXiv:1107.3500v1, PDF p. 13, §VII Eq.(79): EPR lower-bound monotonicity and the many-pair limit
Read-back

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

For every real κ0\kappa_0κ0​ satisfying 0≤κ0<10\leq\kappa_0<10≤κ0​<1 and every real n≥0n\geq0n≥0, define

h2(t)=−tlog⁡t−(1−t)log⁡(1−t)log⁡2,θs=12(1+(n/s)(1−κ0))2s,Rs=1−h2(θs),h_2(t)=\frac{-t\log t-(1-t)\log(1-t)}{\log2},\qquad \theta_s=\frac{1}{2\bigl(1+(n/s)(1-\sqrt{\kappa_0})\bigr)^{2s}}, \qquad R_s=1-h_2(\theta_s),h2​(t)=log2−tlogt−(1−t)log(1−t)​,θs​=2(1+(n/s)(1−κ0​​))2s1​,Rs​=1−h2​(θs​),

and

θ∞=e−2n(1−κ0)2,R∞=1−h2(θ∞).\theta_\infty=\frac{e^{-2n(1-\sqrt{\kappa_0})}}2, \qquad R_\infty=1-h_2(\theta_\infty).θ∞​=2e−2n(1−κ0​​)​,R∞​=1−h2​(θ∞​).

Here the logarithm is the total real logarithm with log⁡0=0\log0=0log0=0, and division by 000 is 000; thus the sequence also has the defined values θ0=12\theta_0=\tfrac12θ0​=21​ and R0=0R_0=0R0​=0. For all natural numbers s,ts,ts,t, if 1≤s≤t1\leq s\leq t1≤s≤t, then Rs≤RtR_s\leq R_tRs​≤Rt​. Furthermore, as natural sss tends to infinity,

θs⟶θ∞,Rs⟶R∞,\theta_s\longrightarrow\theta_\infty, \qquad R_s\longrightarrow R_\infty,θs​⟶θ∞​,Rs​⟶R∞​,

and every integer s≥1s\geq1s≥1 satisfies

R1≤Rs≤R∞.R_1\leq R_s\leq R_\infty.R1​≤Rs​≤R∞​.

The hypotheses include n=0n=0n=0, for which all the θs\theta_sθs​, including θ∞\theta_\inftyθ∞​, equal 12\tfrac1221​, and all the rates equal 000.

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

    Confirmed by the moderator at approval.

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