Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 8: contractions and finite sums

Open
QAlgorithms.Papers.Independent.Support50.P34.corollary8_contractionSums

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

prove2quantum

Let n,m≥1n,m\ge1n,m≥1 and let A1,…,AnA_1,\ldots,A_nA1​,…,An​ be subsets of the positive trace-class cone with the uniform approximation property. For independently chosen contractions Vij∈B(H)V_{ij}\in B(\mathcal H)Vij​∈B(H), the homogeneous quantum entropy is finite continuous on

cl⁡ ⁣{∑i=1n∑j=1mVijXiVij∗:Xi∈Ai, ∥Vij∥≤1}.\operatorname{cl}\!\left\{\sum_{i=1}^n\sum_{j=1}^m V_{ij}X_iV_{ij}^*:X_i\in A_i,\ \|V_{ij}\|\le1\right\}.cl{i=1∑n​j=1∑m​Vij​Xi​Vij∗​:Xi​∈Ai​, ∥Vij​∥≤1}.

The same XiX_iXi​ occurs in each of its jjj summands, and the closure is in trace norm. This result requires no channel completeness relation among the contractions.

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 8, arXiv:0904.1963v3, PDF p.32: finite sums of arbitrary independent
contractions, followed by trace-norm closure. No Kraus completeness is required. -/
theorem corollary8_contractionSums (b : HilbertBasis I ℂ H) (n m : ℕ)
    (hn : 0 < n) (hm : 0 < m) (A : Fin n → Set (PositiveCone H))
    (hA : ∀ i, HasUA b (A i)) :
    FiniteEntropyContinuousOn (coneEntropy b) (closure (contractionSumSet (m := m) A)) := 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. 32, Corollary 8: contractions and finite sums
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​, let n,mn,mn,m be positive natural numbers, and let AiA_iAi​ be a set of positive trace-class operators for every i<ni<ni<n. Here trace class means a continuous complex-linear operator has a representation Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; positivity means T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for all xxx. Let τ(T)\tau(T)τ(T) be the real conversion of the infimum of the extended nonnegative sums of norm products over these representations, and give the positive cone the topology generated by T↦τ(T−S)T\mapsto\tau(T-S)T↦τ(T−S) for all trace-class SSS. For trace-class X,YX,YX,Y, define D(X,Y)D(X,Y)D(X,Y) as the supremum over every finite orthonormal family vvv of the following quantity for the compression matrices Xv=(⟨va,Xvb⟩)X_v=(\langle v_a,Xv_b\rangle)Xv​=(⟨va​,Xvb​⟩) and Yv=(⟨va,Yvb⟩)Y_v=(\langle v_a,Yv_b\rangle)Yv​=(⟨va​,Yvb​⟩): it is +∞+\infty+∞ unless ker⁡Yv⊆ker⁡Xv\ker Y_v\subseteq\ker X_vkerYv​⊆kerXv​, and otherwise it 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.

The matrix functions use continuous functional calculus, and ofReal⁡(a)=max⁡(a,0)\operatorname{ofReal}(a)=\max(a,0)ofReal(a)=max(a,0) in [0,∞][0,\infty][0,∞]. Let δr(T)\delta_r(T)δr​(T) be the infimum of ∑aofReal⁡(wa)D(Ta,T)\sum_a\operatorname{ofReal}(w_a)D(T_a,T)∑a​ofReal(wa​)D(Ta​,T) over positive trace-class TaT_aTa​ whose ranges each lie in the span of rrr vectors, and nonnegative summable real weights with ∑awa=1\sum_aw_a=1∑a​wa​=1 and τ(∑a<qwaTa−T)→0\tau(\sum_{a<q}w_aT_a-T)\to0τ(∑a<q​wa​Ta​−T)→0. Assume, for every i<ni<ni<n, that sup⁡T∈Aiδk+1(T)→0\sup_{T\in A_i}\delta_{k+1}(T)\to0supT∈Ai​​δk+1​(T)→0 as k→∞k\to\inftyk→∞. Then the function

Eb(T)=ofReal⁡(t)∑aofReal⁡ ⁣(Re⁡⟨ba,e(t−1T)ba⟩),t=Re⁡∑a⟨ba,Tba⟩,e(x)=−xlog⁡x,E_b(T)=\operatorname{ofReal}(t)\sum_a\operatorname{ofReal} \!\left(\operatorname{Re}\langle b_a,e(t^{-1}T)b_a\rangle\right), \qquad t=\operatorname{Re}\sum_a\langle b_a,Tb_a\rangle,\quad e(x)=-x\log x,Eb​(T)=ofReal(t)a∑​ofReal(Re⟨ba​,e(t−1T)ba​⟩),t=Rea∑​⟨ba​,Tba​⟩,e(x)=−xlogx,

is finite, with continuous real conversion, on the closure of the set of all operators ∑i<n∑j<mVijTiVij∗\sum_{i<n}\sum_{j<m}V_{ij}T_iV_{ij}^*∑i<n​∑j<m​Vij​Ti​Vij∗​, where Ti∈AiT_i\in A_iTi​∈Ai​ and each Vij:H→HV_{ij}:H\to HVij​:H→H is continuous complex linear with ∥Vij∥≤1\|V_{ij}\|\le1∥Vij​∥≤1. In the entropy formula 0−1=00^{-1}=00−1=0; the sets AiA_iAi​ may be empty, and 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