§4.2: independence of the two regularity conditions
OpenQAlgorithms.Papers.Independent.Gap48.P18.regularity_alternatives_independentThe two defining regularity alternatives are independent in infinite dimension. There is a nonempty finite-capacity set for which entropy at is finite and converges along every H-convergent closed-hull sequence, while is not finite continuous on . There is also a nonempty finite-capacity set with the reverse behavior:
Here are exactly the two alternatives of Definition 2. Regularity uses their disjunction.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable and infinite. A state is a complex matrix admitting , with and , for which every finite quadratic form is real and nonnegative and the real diagonal is summable with sum . Let be the infimum of these expansion sums, with empty infimum , and give states the topology generated by for state centers and real . Define as the supremum over finite principal submatrices, including the empty one, of , where ; define as the supremum over those submatrices of when , and otherwise. Here is extended nonnegative, and matrix logarithms use continuous functional calculus of the total natural logarithm with . For a Borel probability measure , put and ; let be the supremum of over probability measures with finite topological support contained in . For a nonempty set , with a specified nonemptiness witness, define to be a classically chosen state satisfying for every if such a state exists, and otherwise the member chosen from that witness. Let consist of states approximable within -distance , for every , by matrices in the real convex hull of the coefficients of . Define condition to mean that and every sequence satisfying satisfies ; define to mean that for every and that , valued in , is continuous on . Then there exist a nonempty state set and a specified nonemptiness witness such that , holds, and fails; and there also exist a nonempty state set and a specified nonemptiness witness such that , holds, and fails. Each negation is of the whole stated condition, including its finiteness requirement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.