Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4

Open
QAlgorithms.Papers.Independent.Gap48.P18.continuous_approximation_capacity

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

prove2quantum

Let Λ\LambdaΛ be a nonempty directed preordered index set. Suppose continuous state maps Ψλ\Psi_\lambdaΨλ​ tend pointwise to the identity on a nonempty set AAA. Then

lim inf⁡λCˉ(Ψλ(A))≥Cˉ(A).\liminf_\lambda\bar C(\Psi_\lambda(A))\ge\bar C(A).λliminf​Cˉ(Ψλ​(A))≥Cˉ(A).

If these capacities converge to the finite value Cˉ(A)\bar C(A)Cˉ(A) and the image capacities are eventually finite, their optimal averages converge in trace norm to Ω(A)\Omega(A)Ω(A). The maps need not be affine or channels.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState traceSize traceClosure IsTraceClassChannel productCoeff)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (GeneralizedEnsemble HasFiniteSupport HasAverage averageCoefficients
   extendedEntropyNats extendedRelativeEntropyNats
   finiteEnsembleCapacity pureStates)

open QAlgorithms.Papers.Independent.Frontier18.P01 (traceFirst traceSecond)

namespace QAlgorithms.Papers.Independent.Gap48.P18

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma 4, arXiv:quant-ph/0510073v2, PDF pp.37.
 -/
theorem continuous_approximation_capacity {I L : Type} [Countable I] [Nonempty I]
    [Preorder L] [Nonempty L] (hdirected : (∀ x y : L, ∃ z : L, x ≤ z ∧ y ≤ z))
    (A : Set (State I)) (hA : A.Nonempty) (Psi : L → State I → State I)
    (hcontinuous : ∀ l, Continuous (Psi l))
    (hpointwise : ∀ rho ∈ A, Tendsto (fun l => Psi l rho) atTop (𝓝 rho)) :
    setChiCapacity A ≤ Filter.liminf (fun l => setChiCapacity (Psi l '' A)) atTop ∧
      (setChiCapacity A < ⊤ →
        (∀ᶠ l in atTop, setChiCapacity (Psi l '' A) < ⊤) →
        Tendsto (fun l => setChiCapacity (Psi l '' A)) atTop (𝓝 (setChiCapacity A)) →
        Tendsto (fun l => optimalAverage (Psi l '' A) (hA.image (Psi l))) atTop
          (𝓝 (optimalAverage A hA))) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 37, Lemma 4
Read-back

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

Let III be an at most countable, nonempty index set. States are complex matrices RRR admitting expansions Rij=∑mum,ivm,j‾R_{ij}=\sum_m u_{m,i}\overline{v_{m,j}}Rij​=∑m​um,i​vm,j​​, with um,vm∈ℓ2(I;C)u_m,v_m\in\ell^2(I;\mathbb C)um​,vm​∈ℓ2(I;C) and summable products ∥um∥∥vm∥\|u_m\|\|v_m\|∥um​∥∥vm​∥, having real nonnegative finite quadratic forms and a summable real diagonal of sum 111. Let T(X)T(X)T(X) be the infimum of these expansion costs in [0,∞][0,\infty][0,∞], with empty infimum ∞\infty∞, and use the state topology generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>0. Define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over finite principal compressions B=Xs,C=YsB=X_s,C=Y_sB=Xs​,C=Ys​, including the empty one, of [Re⁡tr⁡(Blog⁡cfcB−Blog⁡cfcC+C−B)]+[\operatorname{Re}\operatorname{tr}(B\log_{\mathrm{cfc}}B-B\log_{\mathrm{cfc}}C+C-B)]_+[Retr(Blogcfc​B−Blogcfc​C+C−B)]+​ when ker⁡C⊆ker⁡B\ker C\subseteq\ker BkerC⊆kerB, and ∞\infty∞ otherwise; [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞], and the functional calculus uses the total real logarithm with log⁡0=0\log0=0log0=0. For any state set BBB, let C(B)C(B)C(B) be the supremum, over Borel probability measures μ\muμ whose topological support is finite and contained in BBB, of ∫−D(R∥mμ) dμ(R)\int^-D(R\|m_\mu)\,d\mu(R)∫−D(R∥mμ​)dμ(R), where (mμ)ij=∫Rij dμ(R)(m_\mu)_{ij}=\int R_{ij}\,d\mu(R)(mμ​)ij​=∫Rij​dμ(R). For nonempty BBB, define OBO_BOB​ by choosing a state ω\omegaω satisfying D(R∥ω)≤C(B)D(R\|\omega)\le C(B)D(R∥ω)≤C(B) for every R∈BR\in BR∈B, if one exists, and otherwise choosing a member of BBB. Let LLL be a nonempty preordered set such that every pair x,y∈Lx,y\in Lx,y∈L has an upper bound z∈Lz\in Lz∈L with x≤zx\le zx≤z and y≤zy\le zy≤z. Let AAA be a nonempty state set, and let Ψl\Psi_lΨl​ be a continuous map from states to states for every l∈Ll\in Ll∈L. Suppose Ψl(R)→R\Psi_l(R)\to RΨl​(R)→R along the filter of eventual upper tails of LLL, for every R∈AR\in AR∈A. Then

C(A)≤lim inf⁡l→atTopC(Ψl(A)).C(A)\le\liminf_{l\to\mathrm{atTop}}C(\Psi_l(A)).C(A)≤l→atTopliminf​C(Ψl​(A)).

Moreover, if C(A)<∞C(A)<\inftyC(A)<∞, if C(Ψl(A))<∞C(\Psi_l(A))<\inftyC(Ψl​(A))<∞ eventually, and if C(Ψl(A))→C(A)C(\Psi_l(A))\to C(A)C(Ψl​(A))→C(A), then OΨl(A)→OAO_{\Psi_l(A)}\to O_AOΨl​(A)​→OA​ in the state topology. Each image Ψl(A)\Psi_l(A)Ψl​(A) is nonempty, so its chosen state OΨl(A)O_{\Psi_l(A)}OΨl​(A)​ is defined. The maps Ψl\Psi_lΨl​ are only required to be continuous state maps.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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