Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 11

Open
QAlgorithms.Papers.Independent.Gap48.P18.optimal_measure_capacity_bounded_by_average_entropy

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

prove2quantum

If a nonempty closed set AAA has finite capacity and admits an optimal measure, then

Cˉ(A)≤H(Ω(A)).\bar C(A)\le H(\Omega(A)).Cˉ(A)≤H(Ω(A)).

The right side may be infinite. This is a necessary condition for existence of an optimal law.

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 11, arXiv:quant-ph/0510073v2, PDF pp.40.
 -/
theorem optimal_measure_capacity_bounded_by_average_entropy {I : Type}
    [Countable I] [Nonempty I] (A : Set (State I)) (hA : A.Nonempty)
    (hclosed : IsClosed A) (hfinite : setChiCapacity A < ⊤)
    (hoptimal : ∃ mu, OptimalMeasure A mu) :
    setChiCapacity A ≤ stateEntropyNats (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. 40, Corollary 11
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. States are complex matrices RRR admitting expansions 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. Let T(X)T(X)T(X) be the infimum of these expansion costs in [0,∞][0,\infty][0,∞], with empty infimum ∞\infty∞, and use the state topology generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>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]_+, \qquad 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 the empty compression is included, d(B∥C)=[Re⁡tr⁡(Blog⁡cfcB−Blog⁡cfcC+C−B)]+d(B\|C)=[\operatorname{Re}\operatorname{tr}(B\log_{\mathrm{cfc}}B-B\log_{\mathrm{cfc}}C+C-B)]_+d(B∥C)=[Retr(Blogcfc​B−Blogcfc​C+C−B)]+​ if ker⁡C⊆ker⁡B\ker C\subseteq\ker BkerC⊆kerB, and d(B∥C)=∞d(B\|C)=\inftyd(B∥C)=∞ otherwise. Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞], and the continuous functional calculus uses the total real logarithm with log⁡0=0\log0=0log0=0. For a Borel probability measure μ\muμ, write (mμ)ij=∫Rij dμ(R)(m_\mu)_{ij}=\int R_{ij}\,d\mu(R)(mμ​)ij​=∫Rij​dμ(R) and χ(μ)=∫−D(R∥mμ) dμ(R)\chi(\mu)=\int^-D(R\|m_\mu)\,d\mu(R)χ(μ)=∫−D(R∥mμ​)dμ(R). Let AAA be a nonempty closed state set, and let C(A)<∞C(A)<\inftyC(A)<∞ be the supremum of χ(μ)\chi(\mu)χ(μ) over probability measures with finite topological support contained in AAA. Assume that there exists a Borel probability measure μ\muμ with μ\muμ-almost every state in AAA and χ(μ)=C(A)\chi(\mu)=C(A)χ(μ)=C(A); this attaining measure is not required to have finite support. Define OAO_AOA​ by choosing a state ω\omegaω satisfying D(R∥ω)≤C(A)D(R\|\omega)\le C(A)D(R∥ω)≤C(A) for every R∈AR\in AR∈A, if one exists, and otherwise choosing a member of AAA. Then C(A)≤S(OA)C(A)\le S(O_A)C(A)≤S(OA​), as an inequality in [0,∞][0,\infty][0,∞]; the conclusion allows S(OA)=∞S(O_A)=\inftyS(OA​)=∞.

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