Remark 5
OpenQAlgorithms.Papers.Independent.Gap48.P18.regularity_requirements_are_essentialA decreasing family of nonempty closed subsets of a regular finite-capacity set, all with the same capacity as that set, must have capacities converging to the capacity of its intersection. Thus a failure of this conclusion certifies nonregularity. Also there exists a nonempty closed finite-capacity set such that
These assertions show why the regularity requirements in Theorem 2G and 2I cannot simply be dropped.
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
/-- Remark 5, arXiv:quant-ph/0510073v2, PDF pp.31.
-/
theorem regularity_requirements_are_essential {I : Type} [Countable I] [Infinite I] :
(∀ (A : Set (State I)) (hA : A.Nonempty), setChiCapacity A < ⊤ → ChiRegular A →
∀ (B : ℕ → Set (State I)),
(∀ n, (B n).Nonempty ∧ IsClosed (B n) ∧ B n ⊆ A ∧ setChiCapacity (B n) = setChiCapacity A) →
(∀ n, B (n + 1) ⊆ B n) →
Tendsto (fun n => setChiCapacity (B n)) atTop (𝓝 (setChiCapacity (⋂ n, B n)))) ∧
(∃ A : Set (State I), A.Nonempty ∧ IsClosed A ∧ setChiCapacity A < ⊤ ∧
¬ ∃ B, MinimalClosedEqualCapacity A B) := 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 a countable infinite label set. States on are complex matrices admitting expansions with and , having real nonnegative finite quadratic forms and summable real diagonal of sum . Let be the infimum of these sums over all such expansions, with empty infimum , and equip states with the topology generated by , for states and , and with its Borel measurable structure. For finite principal compressions, define
Here , and logarithms use the total natural logarithm and its matrix continuous functional calculus. For a measure , set and ; let be the supremum of over Borel probability measures with finite topological support contained in , with empty supremum . Write for the set of states such that, for every real , some matrix in the real convex hull of the coefficient matrices of satisfies . The first assertion is that, for every nonempty set of states, every specified witness of its nonemptiness, and under the assumptions and the following regularity condition, every sequence of sets satisfying the conditions below has the indicated capacity limit. The regularity condition is that there exists a state with for every , and either and every sequence with satisfies , or the function is finite at every point of and continuous on . The required conditions on are, for every , that is nonempty and closed, , , and . The conclusion is
The second assertion is that there exists a nonempty closed set with for which there is no set satisfying all of: is closed, , , and every closed with equals . Neither nor is separately required to be nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.