Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3

Open
QAlgorithms.Papers.Independent.Gap48.P18.regular_extreme_closure_optimal_measure

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

prove2quantum

Let AAA be nonempty, closed, and convex with finite capacity. If the closure of its extreme points is regular in the sense of Definition 2, then there exists a law μ∗\mu_*μ∗​ such that

χ(μ∗)=Cˉ(A),μ∗(Ext(A)‾)=1.\chi(\mu_*)=\bar C(A),\qquad\mu_*\big(\overline{\mathrm{Ext}(A)}\big)=1.χ(μ∗​)=Cˉ(A),μ∗​(Ext(A)​)=1.

Regularity supplies a sufficient condition for an optimal measure supported on the closure of the extreme boundary.

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

/-- Theorem 3, arXiv:quant-ph/0510073v2, PDF pp.40.
PDF overlines verified by rendering p.40; support is on closure of Ext(A). -/
theorem regular_extreme_closure_optimal_measure {I : Type} [Countable I] [Nonempty I]
    (A : Set (State I)) (hA : A.Nonempty) (hclosed : IsClosed A)
    (hconvex : CoefficientConvexStates A) (hfinite : setChiCapacity A < ⊤)
    (hregular : ChiRegular (extremeClosure A)) :
    ∃ mu : GeneralizedEnsemble I, OptimalMeasure A mu ∧
      MeasureConcentratedOn (mu : Measure (State I)) (extremeClosure A) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 40, Theorem 3
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 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​∥<∞, whose finite quadratic forms are real and nonnegative and whose summable real diagonal has 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 equip states with the topology generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>0. Define S(X)S(X)S(X) as the supremum over finite principal compressions XsX_sXs​, including the empty one, of [Re⁡tr⁡(Xs)log⁡(Re⁡tr⁡(Xs))−Re⁡tr⁡(Xslog⁡cfcXs)]+[\operatorname{Re}\operatorname{tr}(X_s)\log(\operatorname{Re}\operatorname{tr}(X_s))-\operatorname{Re}\operatorname{tr}(X_s\log_{\mathrm{cfc}}X_s)]_+[Retr(Xs​)log(Retr(Xs​))−Retr(Xs​logcfc​Xs​)]+​. Define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over the same finite coordinate sets of [Re⁡tr⁡(Xslog⁡cfcXs−Xslog⁡cfcYs+Ys−Xs)]+[\operatorname{Re}\operatorname{tr}(X_s\log_{\mathrm{cfc}}X_s-X_s\log_{\mathrm{cfc}}Y_s+Y_s-X_s)]_+[Retr(Xs​logcfc​Xs​−Xs​logcfc​Ys​+Ys​−Xs​)]+​ when ker⁡Ys⊆ker⁡Xs\ker Y_s\subseteq\ker X_skerYs​⊆kerXs​, and ∞\infty∞ otherwise. Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞], and the functional calculus uses the total real logarithm with log⁡0=0\log0=0log0=0. For a Borel probability measure μ\muμ, set (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 C(B)C(B)C(B) be the supremum of χ(μ)\chi(\mu)χ(μ) over probability measures with finite topological support contained in a state set BBB, and let H(B)H(B)H(B) consist of states approximable to every positive TTT-error by matrices in the real convex hull of BBB's coefficient matrices. Suppose AAA is nonempty and closed, its coefficient matrices form a real convex set, and C(A)<∞C(A)<\inftyC(A)<∞. Let EEE be the closure, in the state topology, of the states whose coefficient matrices are extreme points of the coefficient image of AAA. Assume EEE is nonempty, C(E)<∞C(E)<\inftyC(E)<∞, and there exists a state ω\omegaω such that D(R∥ω)≤C(E)D(R\|\omega)\le C(E)D(R∥ω)≤C(E) for every R∈ER\in ER∈E, and at least one of the following holds: S(ω)<∞S(\omega)<\inftyS(ω)<∞ and every sequence (Rn)(R_n)(Rn​) in H(E)H(E)H(E) with D(Rn∥ω)→0D(R_n\|\omega)\to0D(Rn​∥ω)→0 satisfies S(Rn)→S(ω)S(R_n)\to S(\omega)S(Rn​)→S(ω); or R↦D(R∥ω)R\mapsto D(R\|\omega)R↦D(R∥ω) is finite at every state in EEE and continuous on EEE. Then there exists a Borel probability measure μ\muμ on states such that μ\muμ-almost every state belongs to AAA, χ(μ)=C(A)\chi(\mu)=C(A)χ(μ)=C(A), and μ\muμ-almost every state belongs to EEE.

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