Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 5

Open
QAlgorithms.Papers.Independent.Gap48.P18.regularity_requirements_are_essential

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

prove2quantum

A decreasing family of nonempty closed subsets of a regular finite-capacity set, all with the same capacity as that set, must have capacities converging to the capacity of its intersection. Thus a failure of this conclusion certifies nonregularity. Also there exists a nonempty closed finite-capacity set AAA such that

no closed subset of A is minimal among those of capacity Cˉ(A).\text{no closed subset of }A\text{ is minimal among those of capacity }\bar C(A).no closed subset of A is minimal among those of capacity Cˉ(A).

These assertions show why the regularity requirements in Theorem 2G and 2I cannot simply be dropped.

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

/-- Remark 5, arXiv:quant-ph/0510073v2, PDF pp.31.
 -/
theorem regularity_requirements_are_essential {I : Type} [Countable I] [Infinite I] :
    (∀ (A : Set (State I)) (hA : A.Nonempty), setChiCapacity A < ⊤ → ChiRegular A →
      ∀ (B : ℕ → Set (State I)),
        (∀ n, (B n).Nonempty ∧ IsClosed (B n) ∧ B n ⊆ A ∧ setChiCapacity (B n) = setChiCapacity A) →
        (∀ n, B (n + 1) ⊆ B n) →
        Tendsto (fun n => setChiCapacity (B n)) atTop (𝓝 (setChiCapacity (⋂ n, B n)))) ∧
      (∃ A : Set (State I), A.Nonempty ∧ IsClosed A ∧ setChiCapacity A < ⊤ ∧
        ¬ ∃ B, MinimalClosedEqualCapacity A B) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 31, Remark 5
Read-back

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

Let III be a countable infinite label set. States on III are complex matrices XXX admitting expansions Xij=∑aua(i)va(j)‾X_{ij}=\sum_a u_a(i)\overline{v_a(j)}Xij​=∑a​ua​(i)va​(j)​ with ua,va∈ℓ2(I;C)u_a,v_a\in\ell^2(I;\mathbb C)ua​,va​∈ℓ2(I;C) and ∑a∥ua∥2∥va∥2<∞\sum_a\|u_a\|_2\|v_a\|_2<\infty∑a​∥ua​∥2​∥va​∥2​<∞, having real nonnegative finite quadratic forms and summable real diagonal of sum 111. Let τ(X)\tau(X)τ(X) be the infimum of these sums over all such expansions, with empty infimum +∞+\infty+∞, and equip states with the topology generated by {Y:τ(Y−X)<ε}\{Y:\tau(Y-X)<\varepsilon\}{Y:τ(Y−X)<ε}, for states XXX and ε>0\varepsilon>0ε>0, and with its Borel measurable structure. For finite principal compressions, define

H(X)=sup⁡s finite[(ℜtr⁡Xs)log⁡(ℜtr⁡Xs)−ℜ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[(\Re\operatorname{tr}X_s)\log(\Re\operatorname{tr}X_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​[(ℜtrXs​)log(ℜtrXs​)−ℜ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 logarithms use the total natural logarithm and its matrix continuous functional calculus. For a measure μ\muμ, set (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. Write H(S)\mathcal H(S)H(S) for the set of states XXX such that, for every real ε>0\varepsilon>0ε>0, some matrix YYY in the real convex hull of the coefficient matrices of SSS satisfies τ(X−Y)<ε\tau(X-Y)<\varepsilonτ(X−Y)<ε. The first assertion is that, for every nonempty set AAA of states, every specified witness of its nonemptiness, and under the assumptions C(A)<+∞C(A)<+\inftyC(A)<+∞ and the following regularity condition, every sequence B0,B1,…B_0,B_1,\ldotsB0​,B1​,… of sets satisfying the conditions below has the indicated capacity limit. The regularity condition is that there exists a state ω\omegaω with D(X∥ω)≤C(A)D(X\|\omega)\le C(A)D(X∥ω)≤C(A) for every X∈AX\in AX∈A, and either H(ω)<+∞H(\omega)<+\inftyH(ω)<+∞ and every sequence Xn∈H(A)X_n\in\mathcal H(A)Xn​∈H(A) with D(Xn∥ω)→0D(X_n\|\omega)\to0D(Xn​∥ω)→0 satisfies H(Xn)→H(ω)H(X_n)\to H(\omega)H(Xn​)→H(ω), or the function X↦D(X∥ω)X\mapsto D(X\|\omega)X↦D(X∥ω) is finite at every point of AAA and continuous on AAA. The required conditions on BnB_nBn​ are, for every n∈Nn\in\mathbb Nn∈N, that BnB_nBn​ is nonempty and closed, Bn⊆AB_n\subseteq ABn​⊆A, C(Bn)=C(A)C(B_n)=C(A)C(Bn​)=C(A), and Bn+1⊆BnB_{n+1}\subseteq B_nBn+1​⊆Bn​. The conclusion is

C(Bn)⟶C ⁣(⋂n∈NBn)in [0,∞].C(B_n)\longrightarrow C\!\left(\bigcap_{n\in\mathbb N}B_n\right) \quad\text{in }[0,\infty].C(Bn​)⟶C(n∈N⋂​Bn​)in [0,∞].

The second assertion is that there exists a nonempty closed set AAA with C(A)<+∞C(A)<+\inftyC(A)<+∞ for which there is no set BBB satisfying all of: BBB is closed, B⊆AB\subseteq AB⊆A, C(B)=C(A)C(B)=C(A)C(B)=C(A), and every closed S⊆BS\subseteq BS⊆B with C(S)=C(B)C(S)=C(B)C(S)=C(B) equals BBB. Neither BBB nor SSS is separately required to be nonempty.

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