Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 6

Open
QAlgorithms.Papers.Independent.Gap48.P18.pointwise_decrease_coefficients_control_entropy

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

prove2quantum

Let AAA be a nonempty closed convex finite-capacity set. If every ρ∈A\rho\in Aρ∈A has dc⁡(ρ)<1\operatorname{dc}(\rho)<1dc(ρ)<1, then AAA is regular and entropy is bounded on AAA. If every decrease coefficient is zero, then

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

These are pointwise assumptions; no uniform gap of the coefficients below one is imposed.

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 6, arXiv:quant-ph/0510073v2, PDF pp.34.
 -/
theorem pointwise_decrease_coefficients_control_entropy {I : Type}
    [Countable I] [Nonempty I] (A : Set (State I)) (hA : A.Nonempty)
    (hclosed : IsClosed A) (hconvex : CoefficientConvexStates A) (hfinite : setChiCapacity A < ⊤) :
    ((∀ rho ∈ A, decreaseCoefficient rho < 1) → ChiRegular A ∧ entropySup A < ⊤) ∧
      ((∀ 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. 34, Corollary 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, whose coefficient matrices form a convex set over R\mathbb RR. A state XXX is a complex matrix with a representation 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​<∞, having real nonnegative finite quadratic forms and summable real diagonal of sum 111. Let τ(X)\tau(X)τ(X) be the infimum of those sums over all such representations, with empty infimum +∞+\infty+∞; closedness and continuity use the state topology generated by {Y:τ(Y−X)<ε}\{Y:\tau(Y-X)<\varepsilon\}{Y:τ(Y−X)<ε} for states XXX and ε>0\varepsilon>0ε>0. For finite principal compressions define

H(X)=sup⁡s finite[(ℜtr⁡Xs)log⁡(ℜtr⁡Xs)−ℜtr⁡(Xslog⁡Xs)]+,D(X∥Y)=sup⁡s finite{[ℜtr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+,ker⁡Ys⊆ker⁡Xs,+∞,otherwise,H(X)=\sup_{s\text{ finite}} \bigl[(\Re\operatorname{tr}X_s)\log(\Re\operatorname{tr}X_s) -\Re\operatorname{tr}(X_s\log X_s)\bigr]_+, \quad D(X\|Y)=\sup_{s\text{ finite}} \begin{cases} \bigl[\Re\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)\bigr]_+, &\ker Y_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}, \end{cases}H(X)=s finitesup​[(ℜtrXs​)log(ℜtrXs​)−ℜtr(Xs​logXs​)]+​,D(X∥Y)=s finitesup​{[ℜtr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​,+∞,​kerYs​⊆kerXs​,otherwise,​

where [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), and matrix logarithms use continuous functional calculus with the total natural logarithm. For a Borel measure μ\muμ on states, put (Xˉμ)ij=∫Xij dμ(X)(\bar X_\mu)_{ij}=\int X_{ij}\,d\mu(X)(Xˉμ​)ij​=∫Xij​dμ(X) and χ(μ)=∫D(X∥Xˉμ) dμ(X)\chi(\mu)=\int D(X\|\bar X_\mu)\,d\mu(X)χ(μ)=∫D(X∥Xˉμ​)dμ(X), and let C(S)C(S)C(S) be the supremum of χ(μ)\chi(\mu)χ(μ) over probability measures with finite topological support contained in SSS, with empty supremum 000. Assume C(A)<+∞C(A)<+\inftyC(A)<+∞. For a state XXX, define

TX(t)=sup⁡s finite[ℜtr⁡(ft(Xs))]+,ft(x)={0,x=0,xt,x≠0,d(X)=inf⁡t>0TX(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>0\\T_X(t)<+\infty}}t,TX​(t)=s finitesup​[ℜtr(ft​(Xs​))]+​,ft​(x)={0,xt,​x=0,x=0,​d(X)=t>0TX​(t)<+∞​inf​t,

where ft(Xs)f_t(X_s)ft​(Xs​) is given by continuous functional calculus and the infimum is in [0,∞][0,\infty][0,∞], with empty infimum +∞+\infty+∞. If d(X)<1d(X)<1d(X)<1 for every X∈AX\in AX∈A, then sup⁡X∈AH(X)<+∞\sup_{X\in A}H(X)<+\inftysupX∈A​H(X)<+∞, and AAA has the following regularity property: it is nonempty, C(A)<+∞C(A)<+\inftyC(A)<+∞, and there exists a state ω\omegaω such that D(X∥ω)≤C(A)D(X\|\omega)\le C(A)D(X∥ω)≤C(A) for every X∈AX\in AX∈A, and either H(ω)<+∞H(\omega)<+\inftyH(ω)<+∞ and every sequence XnX_nXn​ in the set

{X: ∀ε>0, ∃Y∈conv⁡R{Z:Z∈A}, τ(X−Y)<ε}\left\{X:\ \forall\varepsilon>0,\ \exists Y\in\operatorname{conv}_{\mathbb R}\{Z:Z\in A\}, \ \tau(X-Y)<\varepsilon\right\}{X: ∀ε>0, ∃Y∈convR​{Z:Z∈A}, τ(X−Y)<ε}

with D(Xn∥ω)→0D(X_n\|\omega)\to0D(Xn​∥ω)→0 satisfies H(Xn)→H(ω)H(X_n)\to H(\omega)H(Xn​)→H(ω), or X↦D(X∥ω)X\mapsto D(X\|\omega)X↦D(X∥ω) is finite everywhere on AAA and continuous on AAA. Independently, if 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 the [0,∞][0,\infty][0,∞]-valued function HHH is continuous on AAA. The first premise gives a separate strict inequality for each state, with no common bound below 111 assumed.

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