Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3 (A–B): sums and convex unions preserve UA

Open
QAlgorithms.Papers.Independent.Support50.P34.corollary3_UASums

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

prove2quantum

Let A,BA,BA,B be subsets of the positive trace-class cone with the uniform approximation property, meaning sup⁡T∈AΔk(T)→0\sup_{T\in A}\Delta_k(T)\to0supT∈A​Δk​(T)→0 and the analogous condition for BBB, where Δk\Delta_kΔk​ is the rank-constrained relative-entropy defect. Then

A⊞B={X+Y:X∈A, Y∈B}A\boxplus B=\{X+Y:X\in A,\ Y\in B\}A⊞B={X+Y:X∈A, Y∈B}

has the same property. If AAA and BBB are convex, their trace-norm closed convex hull co⁡‾(A∪B)\overline{\operatorname{co}}(A\cup B)co(A∪B) also has the property. This gives both closure operations without imposing compactness.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal NNReal BigOperators

namespace QAlgorithms.Papers.Independent.Support50.P34

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
   operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)

open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)

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

attribute [local instance] Classical.propDecidable Classical.decEq

section Operators

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable {I : Type*}

section Statements

variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]

include hsep hI

/-- Corollary 3 A–B, arXiv:0904.1963v3, PDF p.27: sums and closed convex unions. -/
theorem corollary3_UASums (b : HilbertBasis I ℂ H)
    (A B : Set (PositiveCone H)) (hA : HasUA b A) (hB : HasUA b B) :
    HasUA b (coneSumSet A B) ∧
    (ConeConvex A → ConeConvex B → HasUA b (coneClosedHull (A ∪ B))) := by sorry

end Statements

end Operators

end QAlgorithms.Papers.Independent.Support50.P34

end
Source
Continuity of the von Neumann entropy, arXiv:0904.1963v3, PDF p. 27, Corollary 3 (A–B): sums and convex unions preserve UA
Read-back

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

Let HHH be a complete complex inner product space with Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​. Here a continuous complex-linear operator TTT is trace class if Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for sequences with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; let τ(T)\tau(T)τ(T) be the real conversion of the infimum of the corresponding extended nonnegative sums of these norm products. Let C\mathcal CC be the trace-class operators satisfying T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for all xxx, equipped with the topology generated by T↦τ(T−S)T\mapsto\tau(T-S)T↦τ(T−S) for trace-class SSS. Define the extended nonnegative quantity D(X,Y)D(X,Y)D(X,Y) as follows: take the supremum over all natural numbers nnn, including 000, and all orthonormal families (v1,…,vn)(v_1,\ldots,v_n)(v1​,…,vn​) in HHH; form Xv=(⟨vi,Xvj⟩)ijX_v=(\langle v_i,Xv_j\rangle)_{ij}Xv​=(⟨vi​,Xvj​⟩)ij​ and Yv=(⟨vi,Yvj⟩)ijY_v=(\langle v_i,Yv_j\rangle)_{ij}Yv​=(⟨vi​,Yvj​⟩)ij​; the quantity for this family is +∞+\infty+∞ if ker⁡Yv⊈ker⁡Xv\ker Y_v\not\subseteq\ker X_vkerYv​⊆kerXv​, and otherwise is

ofReal⁡ ⁣(Re⁡Tr⁡(f(Xv)−Xvlog⁡(Yv)−Xv+Yv)),f(x)=xlog⁡x,\operatorname{ofReal}\!\left( \operatorname{Re}\operatorname{Tr}\bigl(f(X_v)-X_v\log(Y_v)-X_v+Y_v\bigr) \right),\qquad f(x)=x\log x,ofReal(ReTr(f(Xv​)−Xv​log(Yv​)−Xv​+Yv​)),f(x)=xlogx,

using continuous functional calculus and ofReal⁡(a)=max⁡(a,0)\operatorname{ofReal}(a)=\max(a,0)ofReal(a)=max(a,0) as an extended nonnegative real. For a natural number rrr, let δr(T)\delta_r(T)δr​(T) be the infimum of ∑iofReal⁡(wi)D(Ti,T)\sum_i\operatorname{ofReal}(w_i)D(T_i,T)∑i​ofReal(wi​)D(Ti​,T) over nonnegative summable real weights with ∑iwi=1\sum_iw_i=1∑i​wi​=1 and sequences Ti∈CT_i\in\mathcal CTi​∈C such that each TiT_iTi​ has range in the span of rrr vectors and τ(∑i<nwiTi−T)→0\tau(\sum_{i<n}w_iT_i-T)\to0τ(∑i<n​wi​Ti​−T)→0; an empty infimum is +∞+\infty+∞. Suppose A,B⊆CA,B\subseteq\mathcal CA,B⊆C satisfy sup⁡T∈Aδk+1(T)→0\sup_{T\in A}\delta_{k+1}(T)\to0supT∈A​δk+1​(T)→0 and sup⁡T∈Bδk+1(T)→0\sup_{T\in B}\delta_{k+1}(T)\to0supT∈B​δk+1​(T)→0 as k→∞k\to\inftyk→∞. Then the same limit holds for {X+Y:X∈A, Y∈B}\{X+Y:X\in A,\ Y\in B\}{X+Y:X∈A, Y∈B}. Moreover, if the operator sets AAA and BBB are each convex over R\mathbb RR, the same limit holds for the set of all T∈CT\in\mathcal CT∈C such that, for every ε>0\varepsilon>0ε>0, some X∈conv⁡R(A∪B)X\in\operatorname{conv}_{\mathbb R}(A\cup B)X∈convR​(A∪B) satisfies τ(T−X)<ε\tau(T-X)<\varepsilonτ(T−X)<ε. The sets may be empty; the supremum over an empty set is 000.

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

    Confirmed by the moderator at approval.

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