Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2: independence of the two regularity conditions

Open
QAlgorithms.Papers.Independent.Gap48.P18.regularity_alternatives_independent

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

prove2quantum

The two defining regularity alternatives are independent in infinite dimension. There is a nonempty finite-capacity set for which entropy at Ω(A)\Omega(A)Ω(A) is finite and converges along every H-convergent closed-hull sequence, while D(⋅∥Ω(A))D(\cdot\|\Omega(A))D(⋅∥Ω(A)) is not finite continuous on AAA. There is also a nonempty finite-capacity set with the reverse behavior:

∃A: R1(A)∧¬R2(A),∃B: R2(B)∧¬R1(B).\exists A:\ R_1(A)\land\neg R_2(A),\qquad\exists B:\ R_2(B)\land\neg R_1(B).∃A: R1​(A)∧¬R2​(A),∃B: R2​(B)∧¬R1​(B).

Here R1,R2R_1,R_2R1​,R2​ are exactly the two alternatives of Definition 2. Regularity uses their disjunction.

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

/-- §4.2: independence of the two regularity conditions, arXiv:quant-ph/0510073v2, PDF pp.29.
 -/
theorem regularity_alternatives_independent {I : Type} [Countable I] [Infinite I] :
    (∃ (A : Set (State I)) (hA : A.Nonempty), setChiCapacity A < ⊤ ∧
      RegularityOne A (optimalAverage A hA) ∧
      ¬ RegularityTwo A (optimalAverage A hA)) ∧
    (∃ (A : Set (State I)) (hA : A.Nonempty), setChiCapacity A < ⊤ ∧
      RegularityTwo A (optimalAverage A hA) ∧
      ¬ RegularityOne A (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. 29, §4.2: independence of the two regularity conditions
Read-back

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

Let III be countable and infinite. A state is a complex matrix 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​∥<∞, for which every finite quadratic form is real and nonnegative and the real diagonal is summable with sum 111. Let T(X)T(X)T(X) be the infimum of these expansion sums, with empty infimum +∞+\infty+∞, and give states the topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε for state centers XXX and real ε>0\varepsilon>0ε>0. Define H(X)H(X)H(X) as the supremum over finite principal submatrices, 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 those submatrices 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​)]+​ 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) 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μ, put 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. For a nonempty set AAA, with a specified nonemptiness witness, define ωA\omega_AωA​ to be a classically chosen state satisfying D(X∥ωA)≤C(A)D(X\|\omega_A)\le C(A)D(X∥ωA​)≤C(A) for every X∈AX\in AX∈A if such a state exists, and otherwise the member chosen from that witness. Let K(A)K(A)K(A) consist of states approximable within TTT-distance <ε<\varepsilon<ε, for every ε>0\varepsilon>0ε>0, by matrices in the real convex hull of the coefficients of AAA. Define condition R1(A,ω)R_1(A,\omega)R1​(A,ω) to mean that H(ω)<+∞H(\omega)<+\inftyH(ω)<+∞ and every sequence Xn∈K(A)X_n\in K(A)Xn​∈K(A) satisfying D(Xn∥ω)→0D(X_n\|\omega)\to0D(Xn​∥ω)→0 satisfies H(Xn)→H(ω)H(X_n)\to H(\omega)H(Xn​)→H(ω); define R2(A,ω)R_2(A,\omega)R2​(A,ω) to mean that D(X∥ω)<+∞D(X\|\omega)<+\inftyD(X∥ω)<+∞ for every X∈AX\in AX∈A and that X↦D(X∥ω)X\mapsto D(X\|\omega)X↦D(X∥ω), valued in [0,+∞][0,+\infty][0,+∞], is continuous on AAA. Then there exist a nonempty state set AAA and a specified nonemptiness witness such that C(A)<+∞C(A)<+\inftyC(A)<+∞, R1(A,ωA)R_1(A,\omega_A)R1​(A,ωA​) holds, and R2(A,ωA)R_2(A,\omega_A)R2​(A,ωA​) fails; and there also exist a nonempty state set AAA and a specified nonemptiness witness such that C(A)<+∞C(A)<+\inftyC(A)<+∞, R2(A,ωA)R_2(A,\omega_A)R2​(A,ωA​) holds, and R1(A,ωA)R_1(A,\omega_A)R1​(A,ωA​) fails. Each negation is of the whole stated condition, including its finiteness requirement.

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