Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.3: constant positive capacities collapse at intersection

Open
QAlgorithms.Papers.Independent.Gap48.P18.decreasing_constant_capacity_singleton_intersection

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

prove2quantum

Let σ\sigmaσ have infinite entropy and retain its chosen eigenbasis. Fix a finite c>0c>0c>0 and define An=Ln+1(σ)∩{ρ:D(ρ∥σ)≤c}A_n=L_{n+1}(\sigma)\cap\{\rho:D(\rho\|\sigma)\le c\}An​=Ln+1​(σ)∩{ρ:D(ρ∥σ)≤c} for n≥0n\ge0n≥0. These sets are nonempty, compact, convex, and decreasing, and

Cˉ(An)=c,Ω(An)=σ,⋂nAn={σ},Cˉ(⋂nAn)=0.\bar C(A_n)=c,\qquad\Omega(A_n)=\sigma,\qquad\bigcap_nA_n=\{\sigma\},\qquad\bar C(\bigcap_nA_n)=0.Cˉ(An​)=c,Ω(An​)=σ,n⋂​An​={σ},Cˉ(n⋂​An​)=0.

This concrete family shows that capacity need not be continuous under decreasing intersections.

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

/-- §5.3: constant positive capacities collapse at intersection, arXiv:quant-ph/0510073v2, PDF pp.61.
 -/
theorem decreasing_constant_capacity_singleton_intersection (sigma : State ℕ)
    (hdiag : Diagonal sigma) (hinfinite : stateEntropyNats sigma = ⊤)
    (c : ℝ≥0) (hc : 0 < c) :
    (∀ n, decreasingFamily sigma c (n + 1) ⊆ decreasingFamily sigma c n) ∧
      (∀ n, (decreasingFamily sigma c n).Nonempty ∧
        IsCompact (decreasingFamily sigma c n) ∧ CoefficientConvexStates (decreasingFamily sigma c n) ∧
        setChiCapacity (decreasingFamily sigma c n) = (c : ℝ≥0∞) ∧
        ∀ hA : (decreasingFamily sigma c n).Nonempty,
          optimalAverage (decreasingFamily sigma c n) hA = sigma) ∧
      (⋂ n, decreasingFamily sigma c n) = {sigma} ∧
      setChiCapacity (⋂ n, decreasingFamily sigma c n) = 0 := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 61, §5.3: constant positive capacities collapse at intersection
Read-back

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

Let σ\sigmaσ be a state on N\mathbb NN, meaning a complex matrix with a representation Xij=∑aua(i)va(j)‾X_{ij}=\sum_a u_a(i)\overline{v_a(j)}Xij​=∑a​ua​(i)va​(j)​, where ua,va∈ℓ2(N;C)u_a,v_a\in\ell^2(\mathbb N;\mathbb C)ua​,va​∈ℓ2(N;C) and ∑a∥ua∥2∥va∥2<∞\sum_a\|u_a\|_2\|v_a\|_2<\infty∑a​∥ua​∥2​∥va​∥2​<∞, whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum 111. Define τ(X)\tau(X)τ(X) as the infimum of these sums over all such representations of XXX, with empty infimum +∞+\infty+∞; use the state topology generated by {Y:τ(Y−X)<ε}\{Y:\tau(Y-X)<\varepsilon\}{Y:τ(Y−X)<ε}, for states XXX and ε>0\varepsilon>0ε>0, and its Borel measurable structure. For finite principal compressions Xs,YsX_s,Y_sXs​,Ys​, put ts=ℜtr⁡Xst_s=\Re\operatorname{tr}X_sts​=ℜtrXs​ and

H(X)=sup⁡s finite[tslog⁡ts−ℜtr⁡(Xslog⁡Xs)]+,D(X∥Y)=sup⁡s finite{[ℜtr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+,ker⁡Ys⊆ker⁡Xs,+∞,otherwise.H(X)=\sup_{s\text{ finite}}\bigl[t_s\log t_s-\Re\operatorname{tr}(X_s\log X_s)\bigr]_+, \quad D(X\|Y)=\sup_{s\text{ finite}} \begin{cases} \bigl[\Re\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)\bigr]_+, &\ker Y_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}. \end{cases}H(X)=s finitesup​[ts​logts​−ℜtr(Xs​logXs​)]+​,D(X∥Y)=s finitesup​{[ℜtr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​,+∞,​kerYs​⊆kerXs​,otherwise.​

Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), and matrix logarithms use continuous functional calculus with the total real logarithm. For a measure μ\muμ, let (Xˉμ)ij=∫Xij dμ(X)(\bar X_\mu)_{ij}=\int X_{ij}\,d\mu(X)(Xˉμ​)ij​=∫Xij​dμ(X) and χ(μ)=∫D(X∥Xˉμ) dμ(X)\chi(\mu)=\int D(X\|\bar X_\mu)\,d\mu(X)χ(μ)=∫D(X∥Xˉμ​)dμ(X). Let C(S)C(S)C(S) be the supremum of χ(μ)\chi(\mu)χ(μ) over Borel probability measures with finite topological support contained in SSS, with empty supremum 000. For a nonempty SSS and a specified witness hSh_ShS​ of this fact, OS,hSO_{S,h_S}OS,hS​​ selects a state ω\omegaω satisfying D(X∥ω)≤C(S)D(X\|\omega)\le C(S)D(X∥ω)≤C(S) for every X∈SX\in SX∈S, if one exists, and otherwise selects a member of SSS using hSh_ShS​. Assume σij=0\sigma_{ij}=0σij​=0 for i≠ji\ne ji=j, H(σ)=+∞H(\sigma)=+\inftyH(σ)=+∞, and let ccc be a strictly positive real number. For each n∈Nn\in\mathbb Nn∈N, define

Fn={ρ: ρii=σii ∀i,D(ρ∥σ)≤c,∀i≠j, (i+1<n+1 or j+1<n+1)⇒ρij=0}.F_n=\left\{\rho:\ \rho_{ii}=\sigma_{ii}\ \forall i,\quad D(\rho\|\sigma)\le c,\quad \forall i\ne j,\ (i+1<n+1\ \text{or}\ j+1<n+1)\Rightarrow\rho_{ij}=0\right\}.Fn​={ρ: ρii​=σii​ ∀i,D(ρ∥σ)≤c,∀i=j, (i+1<n+1 or j+1<n+1)⇒ρij​=0}.

Then Fn+1⊆FnF_{n+1}\subseteq F_nFn+1​⊆Fn​ for every nnn; each FnF_nFn​ is nonempty and compact in the stated topology; its set of coefficient matrices is convex over R\mathbb RR; and C(Fn)=cC(F_n)=cC(Fn​)=c. For every nnn and every nonemptiness witness hnh_nhn​ for FnF_nFn​, one has OFn,hn=σO_{F_n,h_n}=\sigmaOFn​,hn​​=σ. Finally,

⋂n∈NFn={σ},C ⁣(⋂n∈NFn)=0.\bigcap_{n\in\mathbb N}F_n=\{\sigma\}, \qquad C\!\left(\bigcap_{n\in\mathbb N}F_n\right)=0.n∈N⋂​Fn​={σ},C(n∈N⋂​Fn​)=0.

The family starts at n=0n=0n=0, when its off-diagonal vanishing condition is vacuous.

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