Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7

Open
QAlgorithms.Papers.Independent.Gap48.P18.increasing_union_relatively_compact

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

prove2quantum

Let An⊆An+1A_n\subseteq A_{n+1}An​⊆An+1​ be sets of density states. If one finite constant MMM, independent of nnn, satisfies Cˉ(An)≤M\bar C(A_n)\le MCˉ(An​)≤M for every nnn, then

⋃nAn‾ is compact in trace norm.\overline{\bigcup_n A_n}\ \text{is compact in trace norm}.n⋃​An​​ is compact in trace norm.

Thus a uniform capacity bound gives relative compactness of the entire increasing union.

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

/-- Corollary 7, arXiv:quant-ph/0510073v2, PDF pp.35.
 -/
theorem increasing_union_relatively_compact {I : Type} [Countable I] [Nonempty I]
    (A : ℕ → Set (State I)) (hmono : ∀ n, A n ⊆ A (n + 1))
    (M : ℝ≥0∞) (hM : M < ⊤) (hbound : ∀ n, setChiCapacity (A n) ≤ M) :
    IsCompact (closure (⋃ n, A n)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 35, Corollary 7
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 ∑m∥um∥∥vm∥<∞\sum_m\|u_m\|\|v_m\|<\infty∑m​∥um​∥∥vm​∥<∞, having real nonnegative finite quadratic forms and a summable real diagonal whose sum is 111. Define T(X)T(X)T(X) as the infimum of the expansion costs [∑m∥um∥∥vm∥]+[\sum_m\|u_m\|\|v_m\|]_+[∑m​∥um​∥∥vm​∥]+​, with value ∞\infty∞ when no expansion exists, and equip states with the topology generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, for real ε>0\varepsilon>0ε>0. Define D(X∥Y)D(X\|Y)D(X∥Y) by taking the supremum over all finite principal compressions B=Xs,C=YsB=X_s,C=Y_sB=Xs​,C=Ys​, including the empty compression, of

d(B∥C)={[Re⁡tr⁡(Blog⁡cfcB−Blog⁡cfcC+C−B)]+,ker⁡C⊆ker⁡B,∞,otherwise.d(B\|C)= \begin{cases} [\operatorname{Re}\operatorname{tr}(B\log_{\mathrm{cfc}}B-B\log_{\mathrm{cfc}}C+C-B)]_+, &\ker C\subseteq\ker B,\\ \infty,&\text{otherwise}. \end{cases}d(B∥C)={[Retr(Blogcfc​B−Blogcfc​C+C−B)]+​,∞,​kerC⊆kerB,otherwise.​

Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞], and the continuous functional calculus uses the total real logarithm with log⁡0=0\log0=0log0=0. For a Borel probability measure μ\muμ on states, put (mμ)ij=∫Rij dμ(R)(m_\mu)_{ij}=\int R_{ij}\,d\mu(R)(mμ​)ij​=∫Rij​dμ(R) and χ(μ)=∫−D(R∥mμ) dμ(R)\chi(\mu)=\int^-D(R\|m_\mu)\,d\mu(R)χ(μ)=∫−D(R∥mμ​)dμ(R); for any state set BBB, let C(B)C(B)C(B) be the supremum of χ(μ)\chi(\mu)χ(μ) over measures whose topological support is finite and contained in BBB, with an empty supremum equal to 000. For every sequence of state sets (An)n≥0(A_n)_{n\ge0}(An​)n≥0​ satisfying An⊆An+1A_n\subseteq A_{n+1}An​⊆An+1​ for every nnn, and every M∈[0,∞]M\in[0,\infty]M∈[0,∞] satisfying M<∞M<\inftyM<∞ and C(An)≤MC(A_n)\le MC(An​)≤M for every nnn, the closure of ⋃n≥0An\bigcup_{n\ge0}A_n⋃n≥0​An​ is compact. No nonemptiness assumption is imposed on the sets AnA_nAn​; they may all be empty.

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