Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2

Open
QAlgorithms.Papers.Independent.Gap48.P18.entropy_continuous_closed_hull

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

prove2quantum

Let AAA be a closed set of density states on which entropy is finite and continuous. Suppose a density state σ\sigmaσ makes D(ρ∥σ)D(\rho\|\sigma)D(ρ∥σ) finite, continuous, and bounded for ρ∈A\rho\in Aρ∈A. Then

H∣co⁡‾A is finite and continuous.H\big|_{\overline{\operatorname{co}}A}\ \text{is finite and continuous}.H​coA​ is finite and continuous.

The reference-relative-entropy hypothesis controls passage to the closed convex hull.

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 2, arXiv:quant-ph/0510073v2, PDF pp.20.
 -/
theorem entropy_continuous_closed_hull {I : Type} [Countable I] [Nonempty I]
    (A : Set (State I)) (hclosed : IsClosed A)
    (hentropy : FiniteContinuousOn stateEntropyNats A)
    (href : ∃ sigma : State I,
      FiniteContinuousOn (fun rho => stateRelativeEntropyNats rho sigma) A ∧
        (⨆ rho : A, stateRelativeEntropyNats rho.val sigma) < ⊤) :
    FiniteContinuousOn stateEntropyNats (stateClosedConvexHull A) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 20, Corollary 2
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. Here a state is a complex matrix RRR admitting a representation 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 quadratic forms on every finite coordinate set, and having a summable real diagonal whose sum is 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 value ∞\infty∞ if there are none; state topology is generated by the sets T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>0. With [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) embedded in [0,∞][0,\infty][0,∞], define

S(X)=sup⁡s⊆I finite[Re⁡tr⁡(Xs)log⁡ ⁣(Re⁡tr⁡(Xs))−Re⁡tr⁡(Xslog⁡cfcXs)]+,D(X∥Y)=sup⁡s⊆I finited(Xs∥Ys),S(X)=\sup_{s\subseteq I\text{ finite}} \left[ \operatorname{Re}\operatorname{tr}(X_s)\log\!\bigl(\operatorname{Re}\operatorname{tr}(X_s)\bigr) -\operatorname{Re}\operatorname{tr}(X_s\log_{\mathrm{cfc}}X_s) \right]_+, \quad D(X\|Y)=\sup_{s\subseteq I\text{ finite}}d(X_s\|Y_s),S(X)=s⊆I finitesup​[Retr(Xs​)log(Retr(Xs​))−Retr(Xs​logcfc​Xs​)]+​,D(X∥Y)=s⊆I finitesup​d(Xs​∥Ys​),

where Xs,YsX_s,Y_sXs​,Ys​ are principal compressions, including the empty ones, and

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.​

The logarithm is the total real logarithm, with log⁡0=0\log0=0log0=0, applied by continuous functional calculus. Let AAA be any closed set of states, possibly empty. Suppose SSS is finite at every member of AAA and continuous on AAA, and suppose there exists a state σ\sigmaσ such that R↦D(R∥σ)R\mapsto D(R\|\sigma)R↦D(R∥σ) is finite at every member of AAA, continuous on AAA, and satisfies sup⁡R∈AD(R∥σ)<∞\sup_{R\in A}D(R\|\sigma)<\inftysupR∈A​D(R∥σ)<∞. Define H(A)H(A)H(A) to consist of states RRR such that, for every real ε>0\varepsilon>0ε>0, there is a matrix YYY in the real convex hull of the coefficient matrices of AAA with T(R−Y)<εT(R-Y)<\varepsilonT(R−Y)<ε. Then SSS is finite at every state in H(A)H(A)H(A) and continuous on H(A)H(A)H(A). If AAA is empty, H(A)H(A)H(A) is empty and these finiteness and continuity conclusions apply vacuously.

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