Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 6

Open
QAlgorithms.Papers.Independent.Gap48.P18.bounded_entropy_zero_decrease_continuous

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

prove2quantum

Let AAA be a nonempty closed convex set of states, each with zero decrease coefficient. Boundedness of entropy on AAA implies

H∣A is finite and continuous.H\big|_A\ \text{is finite and continuous}.H​A​ is finite and continuous.

The Gaussian-state parenthesis in the source is an illustration, not an additional Gaussian theorem.

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

/-- Remark 6, arXiv:quant-ph/0510073v2, PDF pp.35.
 -/
theorem bounded_entropy_zero_decrease_continuous {I : Type} [Countable I] [Nonempty I]
    (A : Set (State I)) (hA : A.Nonempty) (hclosed : IsClosed A)
    (hconvex : CoefficientConvexStates A) (hbounded : entropySup A < ⊤)
    (hdecrease : ∀ rho ∈ A, decreaseCoefficient rho = 0) :
    FiniteContinuousOn stateEntropyNats A := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 35, Remark 6
Read-back

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

Let III be a countable nonempty label set and AAA a nonempty closed set of states on III, with a specified nonemptiness witness, such that its coefficient matrices form a convex set over R\mathbb RR. A state XXX is a complex matrix admitting an expansion Xij=∑aua(i)va(j)‾X_{ij}=\sum_a u_a(i)\overline{v_a(j)}Xij​=∑a​ua​(i)va​(j)​, where ua,va∈ℓ2(I;C)u_a,v_a\in\ell^2(I;\mathbb C)ua​,va​∈ℓ2(I;C) and ∑a∥ua∥2∥va∥2<∞\sum_a\|u_a\|_2\|v_a\|_2<\infty∑a​∥ua​∥2​∥va​∥2​<∞, whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum 111. Write τ(X)\tau(X)τ(X) for the infimum of those sums over all such expansions, with empty infimum +∞+\infty+∞; the state topology is generated by the sets {Y:τ(Y−X)<ε}\{Y:\tau(Y-X)<\varepsilon\}{Y:τ(Y−X)<ε} for states XXX and ε>0\varepsilon>0ε>0. For a finite principal compression XsX_sXs​, define

H(X)=sup⁡s finite[(ℜtr⁡Xs)log⁡(ℜtr⁡Xs)−ℜtr⁡(Xslog⁡Xs)]+,H(X)=\sup_{s\text{ finite}} \left[(\Re\operatorname{tr}X_s)\log(\Re\operatorname{tr}X_s) -\Re\operatorname{tr}(X_s\log X_s)\right]_+,H(X)=s finitesup​[(ℜtrXs​)log(ℜtrXs​)−ℜtr(Xs​logXs​)]+​,

where [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), the logarithm is natural with log⁡0=0\log0=0log0=0, and matrix logarithms use continuous functional calculus. Also define

TX(t)=sup⁡s finite[ℜtr⁡(ft(Xs))]+,ft(x)={0,x=0,xt,x≠0,d(X)=inf⁡t∈Rt>0, TX(t)<+∞t,T_X(t)=\sup_{s\text{ finite}}\left[\Re\operatorname{tr}(f_t(X_s))\right]_+, \qquad f_t(x)=\begin{cases}0,&x=0,\\x^t,&x\ne0,\end{cases} \qquad d(X)=\inf_{\substack{t\in\mathbb R\\t>0,\ T_X(t)<+\infty}}t,TX​(t)=s finitesup​[ℜtr(ft​(Xs​))]+​,ft​(x)={0,xt,​x=0,x=0,​d(X)=t∈Rt>0, TX​(t)<+∞​inf​t,

where ft(Xs)f_t(X_s)ft​(Xs​) uses continuous functional calculus and an empty infimum in [0,∞][0,\infty][0,∞] is +∞+\infty+∞. If sup⁡X∈AH(X)<+∞\sup_{X\in A}H(X)<+\inftysupX∈A​H(X)<+∞ and d(X)=0d(X)=0d(X)=0 for every X∈AX\in AX∈A, then H(X)<+∞H(X)<+\inftyH(X)<+∞ for every X∈AX\in AX∈A and H:A→[0,∞]H:A\to[0,\infty]H:A→[0,∞] is continuous in the stated state topology and the usual topology of [0,∞][0,\infty][0,∞].

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