Proposition 7
OpenQAlgorithms.Papers.Independent.Gap48.P18.finite_union_capacity_boundsLet be nonempty sets of density states, . Always,
If all component capacities are finite, the simplex objective attains a maximum and
If every capacity equals a finite , this gives . The maximum is attained, rather than merely a supremum.
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
/-- Proposition 7, arXiv:quant-ph/0510073v2, PDF pp.36.
Upper bound permits infinite component capacities; every occurrence of optimal averages is under finite-component assumptions. -/
theorem finite_union_capacity_bounds {I : Type} [Countable I] [Nonempty I]
(n : ℕ) (hn : 0 < n) (A : Fin n → Set (State I)) (hA : ∀ k, (A k).Nonempty) :
setChiCapacity (⋃ k, A k) ≤ (⨆ k, setChiCapacity (A k)) + ENNReal.ofReal (Real.log n) ∧
((∀ k, setChiCapacity (A k) < ⊤) →
(∃ w : Fin n → ℝ≥0, InSimplex w ∧
(∀ v : Fin n → ℝ≥0, InSimplex v → unionObjective A hA v ≤ unionObjective A hA w) ∧
unionObjective A hA w ≤ setChiCapacity (⋃ k, A k)) ∧
(∀ C : ℝ≥0, (∀ k, setChiCapacity (A k) = (C : ℝ≥0∞)) →
(C : ℝ≥0∞) + setChiCapacity (Set.range (fun k => optimalAverage (A k) (hA k))) ≤
setChiCapacity (⋃ k, A k) ∧
setChiCapacity (⋃ k, A k) ≤ (C : ℝ≥0∞) + ENNReal.ofReal (Real.log n))) := 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, nonempty label set, let be a positive natural number, and let be nonempty sets of states on , with a specified nonemptiness witness for each set. Here a state is a complex matrix admitting an expansion , where and , such that every finite quadratic form is real and nonnegative, and is summable and equals . Write for the infimum, over all such expansions of , of , regarded as an element of ; an empty infimum is . The state topology is generated by the sets for states and real , and measures on states use its Borel measurable structure. For matrices , define
where are the principal compressions to , matrix logarithms use continuous functional calculus, and . For a measure on states, put and , the latter being the nonnegative extended integral. Define as the supremum of over Borel probability measures whose topological support is finite and contained in ; this is a condition on the support itself, rather than just on the average, and an empty supremum is . For each nonempty , let be the state selected as follows: if some state satisfies for every , select such a state; otherwise select a member of using the given nonemptiness witness. For nonnegative real weights , set
The assertion is
Furthermore, if every is finite, there are nonnegative weights with such that for every nonnegative with , and . Under that same finiteness hypothesis, for every nonnegative real such that for all ,
All capacity expressions and their arithmetic lie in ; the logarithm is natural, zero weights are permitted, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.