Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 8

Open
QAlgorithms.Papers.Independent.Gap48.P18.nonregular_optimal_measure_examples

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

prove2quantum

On an infinite-dimensional separable Hilbert space there are nonregular sets of finite capacity without optimal measures, including a convergent sequence of states of finite capacity. There are also nonregular finite-capacity sets with optimal measures. In particular,

∃A: Cˉ(A)<∞,A nonregular,∃μ∗ optimal on A.\exists A:\ \bar C(A)<\infty,\quad A\text{ nonregular},\quad\exists\mu_*\text{ optimal on }A.∃A: Cˉ(A)<∞,A nonregular,∃μ∗​ optimal on A.

Regularity is therefore a sufficient condition in Theorem 3, but is not necessary.

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 8, arXiv:quant-ph/0510073v2, PDF pp.42.
 -/
theorem nonregular_optimal_measure_examples {I : Type} [Countable I] [Infinite I] :
    (∃ A : Set (State I), A.Nonempty ∧ setChiCapacity A < ⊤ ∧ ¬ ChiRegular A ∧
      ¬ ∃ mu, OptimalMeasure A mu) ∧
    (∃ (seq : ℕ → State I) (rho : State I),
      Tendsto seq atTop (𝓝 rho) ∧ rho ∈ Set.range seq ∧ setChiCapacity (Set.range seq) < ⊤ ∧
        ¬ ∃ mu, OptimalMeasure (Set.range seq) mu) ∧
    (∃ A : Set (State I), A.Nonempty ∧ setChiCapacity A < ⊤ ∧ ¬ ChiRegular A ∧
      ∃ mu, OptimalMeasure A mu) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

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

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

Let III be countable and infinite. States are complex matrices XXX admitting Xij=∑rar(i)br(j)‾X_{ij}=\sum_r a_r(i)\overline{b_r(j)}Xij​=∑r​ar​(i)br​(j)​, with ar,br∈ℓ2(I;C)a_r,b_r\in\ell^2(I;\mathbb C)ar​,br​∈ℓ2(I;C) and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, whose finite quadratic forms are real and nonnegative and whose real diagonals are summable with sum 111. Define T(X)T(X)T(X) as the infimum of these representation sums, with empty infimum +∞+\infty+∞, and use the state topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε, for state centers XXX and ε>0\varepsilon>0ε>0. Define H(X)H(X)H(X) as the supremum over all finite principal submatrices XsX_sXs​, including the empty one, of [rslog⁡rs−Re⁡tr⁡(Xslog⁡Xs)]+[r_s\log r_s-\operatorname{Re}\operatorname{tr}(X_s\log X_s)]_+[rs​logrs​−Retr(Xs​logXs​)]+​, where rs=Re⁡tr⁡Xsr_s=\operatorname{Re}\operatorname{tr}X_srs​=RetrXs​. Define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over finite sss of [Re⁡tr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+[\operatorname{Re}\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)]_+[Retr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​ if ker⁡Ys⊆ker⁡Xs\ker Y_s\subseteq\ker X_skerYs​⊆kerXs​, and +∞+\infty+∞ otherwise; [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) is extended nonnegative, and matrix logarithms use continuous functional calculus of the total natural logarithm with log⁡0=0\log0=0log0=0. For a Borel probability measure μ\muμ, write mμij=∫Xij dμ(X)m_\mu{}_{ij}=\int X_{ij}\,d\mu(X)mμ​ij​=∫Xij​dμ(X) and χ(μ)=∫−D(X∥mμ) dμ(X)\chi(\mu)=\int^-D(X\|m_\mu)\,d\mu(X)χ(μ)=∫−D(X∥mμ​)dμ(X). Let C(A)C(A)C(A) be the supremum of χ(μ)\chi(\mu)χ(μ) over probability measures with finite topological support contained in AAA; call a probability measure optimal for AAA when it assigns full measure to AAA and χ(μ)=C(A)\chi(\mu)=C(A)χ(μ)=C(A). Let K(A)K(A)K(A) consist of states approximable, for every ε>0\varepsilon>0ε>0 in TTT, by the real convex hull of the coefficient matrices of AAA. Call AAA regular when it is nonempty, C(A)<+∞C(A)<+\inftyC(A)<+∞, and there is a state ω\omegaω with D(X∥ω)≤C(A)D(X\|\omega)\le C(A)D(X∥ω)≤C(A) for all X∈AX\in AX∈A, satisfying either: H(ω)<+∞H(\omega)<+\inftyH(ω)<+∞ and every sequence Xn∈K(A)X_n\in K(A)Xn​∈K(A) with D(Xn∥ω)→0D(X_n\|\omega)\to0D(Xn​∥ω)→0 has H(Xn)→H(ω)H(X_n)\to H(\omega)H(Xn​)→H(ω); or D( ⋅ ∥ω)D(\,\cdot\,\|\omega)D(⋅∥ω) is finite everywhere on AAA and continuous on AAA. The declaration asserts all three of the following existence statements: there is a nonempty AAA with C(A)<+∞C(A)<+\inftyC(A)<+∞ that is not regular and has no optimal probability measure; there are states XnX_nXn​ and ρ\rhoρ with Xn→ρX_n\to\rhoXn​→ρ, with ρ=Xm\rho=X_mρ=Xm​ for at least one m∈Nm\in\mathbb Nm∈N, such that C({Xn:n∈N})<+∞C(\{X_n:n\in\mathbb N\})<+\inftyC({Xn​:n∈N})<+∞ and no optimal probability measure exists for this range; and there is a nonempty AAA with C(A)<+∞C(A)<+\inftyC(A)<+∞ that is not regular but does have an optimal probability measure. Each failure of regularity negates the entire existential condition just specified.

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