Lemma 4
OpenQAlgorithms.Papers.Independent.Gap48.P18.continuous_approximation_capacityLet be a nonempty directed preordered index set. Suppose continuous state maps tend pointwise to the identity on a nonempty set . Then
If these capacities converge to the finite value and the image capacities are eventually finite, their optimal averages converge in trace norm to . The maps need not be affine or channels.
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
/-- Lemma 4, arXiv:quant-ph/0510073v2, PDF pp.37.
-/
theorem continuous_approximation_capacity {I L : Type} [Countable I] [Nonempty I]
[Preorder L] [Nonempty L] (hdirected : (∀ x y : L, ∃ z : L, x ≤ z ∧ y ≤ z))
(A : Set (State I)) (hA : A.Nonempty) (Psi : L → State I → State I)
(hcontinuous : ∀ l, Continuous (Psi l))
(hpointwise : ∀ rho ∈ A, Tendsto (fun l => Psi l rho) atTop (𝓝 rho)) :
setChiCapacity A ≤ Filter.liminf (fun l => setChiCapacity (Psi l '' A)) atTop ∧
(setChiCapacity A < ⊤ →
(∀ᶠ l in atTop, setChiCapacity (Psi l '' A) < ⊤) →
Tendsto (fun l => setChiCapacity (Psi l '' A)) atTop (𝓝 (setChiCapacity A)) →
Tendsto (fun l => optimalAverage (Psi l '' A) (hA.image (Psi l))) atTop
(𝓝 (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 an at most countable, nonempty index set. States are complex matrices admitting expansions , with and summable products , having real nonnegative finite quadratic forms and a summable real diagonal of sum . Let be the infimum of these expansion costs in , with empty infimum , and use the state topology generated by , . Define as the supremum over finite principal compressions , including the empty one, of when , and otherwise; in , and the functional calculus uses the total real logarithm with . For any state set , let be the supremum, over Borel probability measures whose topological support is finite and contained in , of , where . For nonempty , define by choosing a state satisfying for every , if one exists, and otherwise choosing a member of . Let be a nonempty preordered set such that every pair has an upper bound with and . Let be a nonempty state set, and let be a continuous map from states to states for every . Suppose along the filter of eventual upper tails of , for every . Then
Moreover, if , if eventually, and if , then in the state topology. Each image is nonempty, so its chosen state is defined. The maps are only required to be continuous state maps.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.