Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4

Open
QAlgorithms.Papers.Independent.Gap48.P18.finite_ensemble_capacity_deficit

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

prove2quantum

Let AAA be nonempty with finite capacity and let μ\muμ be a finite ensemble of states in AAA, with average ρˉ\bar\rhoρˉ​. Then χ(μ)\chi(\mu)χ(μ) and D(ρˉ∥Ω(A))D(\bar\rho\|\Omega(A))D(ρˉ​∥Ω(A)) are finite, and

Cˉ(A)−χ(μ)≥D(ρˉ∥Ω(A))≥12∥ρˉ−Ω(A)∥12.\bar C(A)-\chi(\mu)\ge D(\bar\rho\|\Omega(A))\ge\tfrac12\|\bar\rho-\Omega(A)\|_1^2.Cˉ(A)−χ(μ)≥D(ρˉ​∥Ω(A))≥21​∥ρˉ​−Ω(A)∥12​.

No finite-entropy assumption on the average is required. The deficit controls its distance to the optimal average.

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 4, arXiv:quant-ph/0510073v2, PDF pp.27.
 -/
theorem finite_ensemble_capacity_deficit {I : Type} [Countable I] [Nonempty I]
    (A : Set (State I)) (hA : A.Nonempty) (hfinite : setChiCapacity A < ⊤)
    (mu : GeneralizedEnsemble I) (hmu : FiniteEnsembleOn mu A) :
    measureHolevo (mu : Measure (State I)) < ⊤ ∧
      stateRelativeEntropyNats (probabilityAverage mu) (optimalAverage A hA) < ⊤ ∧
      stateRelativeEntropyNats (probabilityAverage mu) (optimalAverage A hA) ≤
        ENNReal.ofReal ((setChiCapacity A).toReal - (measureHolevo (mu : Measure (State I))).toReal) ∧
      distanceSquared (probabilityAverage mu) (optimalAverage A hA) / 2 ≤
        stateRelativeEntropyNats (probabilityAverage mu) (optimalAverage A hA) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 27, Corollary 4
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. A state RRR is a complex matrix admitting 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 of sum 111. For any matrix XXX, let T(X)T(X)T(X) be the infimum of [∑m∥um∥∥vm∥]+[\sum_m\|u_m\|\|v_m\|]_+[∑m​∥um​∥∥vm​∥]+​ over these representations, with empty infimum ∞\infty∞; state topology is generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>0. Define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over finite principal compressions B=Xs,C=YsB=X_s,C=Y_sB=Xs​,C=Ys​, including the empty one, of [Re⁡tr⁡(Blog⁡cfcB−Blog⁡cfcC+C−B)]+[\operatorname{Re}\operatorname{tr}(B\log_{\mathrm{cfc}}B-B\log_{\mathrm{cfc}}C+C-B)]_+[Retr(Blogcfc​B−Blogcfc​C+C−B)]+​ when ker⁡C⊆ker⁡B\ker C\subseteq\ker BkerC⊆kerB, and ∞\infty∞ otherwise. Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞], and log⁡cfc\log_{\mathrm{cfc}}logcfc​ uses the total real logarithm with log⁡0=0\log0=0log0=0. For any Borel probability measure ν\nuν, write (mν)ij=∫Rij dν(R)(m_\nu)_{ij}=\int R_{ij}\,d\nu(R)(mν​)ij​=∫Rij​dν(R) and χ(ν)=∫−D(R∥mν) dν(R)\chi(\nu)=\int^-D(R\|m_\nu)\,d\nu(R)χ(ν)=∫−D(R∥mν​)dν(R). Let AAA be nonempty, and let C(A)<∞C(A)<\inftyC(A)<∞ be the supremum of χ(ν)\chi(\nu)χ(ν) over probability measures with finite topological support contained in AAA. Let OAO_AOA​ be the state chosen from those satisfying D(R∥OA)≤C(A)D(R\|O_A)\le C(A)D(R∥OA​)≤C(A) for all R∈AR\in AR∈A, if such states exist, and otherwise a chosen member of AAA. For every probability measure μ\muμ with finite topological support contained in AAA, let μˉ\bar\muμˉ​ be its state average, obtained from a fixed chosen continuous barycenter map; every coordinate is integrable and μˉij=∫Rij dμ(R)\bar\mu_{ij}=\int R_{ij}\,d\mu(R)μˉ​ij​=∫Rij​dμ(R). Then χ(μ)<∞\chi(\mu)<\inftyχ(μ)<∞, D(μˉ∥OA)<∞D(\bar\mu\|O_A)<\inftyD(μˉ​∥OA​)<∞, and

D(μˉ∥OA)≤[C(A)real−χ(μ)real]+,T(μˉ−OA)22≤D(μˉ∥OA).D(\bar\mu\|O_A) \le \bigl[C(A)^{\mathrm{real}}-\chi(\mu)^{\mathrm{real}}\bigr]_+, \qquad \frac{T(\bar\mu-O_A)^2}{2}\le D(\bar\mu\|O_A).D(μˉ​∥OA​)≤[C(A)real−χ(μ)real]+​,2T(μˉ​−OA​)2​≤D(μˉ​∥OA​).

The superscript “real” denotes the extended-nonnegative-real conversion to R\mathbb RR, which sends ∞\infty∞ to 000; both quantities converted in this displayed difference are asserted finite here.

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