Theorem 4
OpenQAlgorithms.Papers.Independent.Gap48.P18.strong_projection_capacity_and_average_approximationLet be a nonempty state set and let orthogonal projections converge strongly to the identity. No finite-rank, nesting, or monotonicity assumption is imposed. If , normalization is eventually valid uniformly on , image capacities are eventually finite, and
Conversely, if some strongly exhaustive projection sequence has all normalization maps defined on and uniformly bounded image capacities, then . Arbitrary initial terms outside the positive-trace domain do not affect the first limits.
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
/-- Theorem 4, arXiv:quant-ph/0510073v2, PDF pp.73.
Early empty images are totalized only for writing the average sequence. Eventual positive uniform mass, nonempty images, and finite image capacities are conclusions. -/
theorem strong_projection_capacity_and_average_approximation {I : Type}
[Countable I] [Nonempty I] (A : Set (State I)) (hA : A.Nonempty)
(P : ℕ → BoundedOrthogonalProjection I)
(hstrong : ∀ v : QAlgorithms.RealRegisters.Hilbert I,
Tendsto (fun n => (P n).operator v) atTop (𝓝 v)) :
(setChiCapacity A < ⊤ →
(∀ᶠ n in atTop, 0 < projectionSuccessInfimum (P n) A) ∧
(∀ᶠ n in atTop, (projectionImage (P n) A).Nonempty ∧
setChiCapacity (projectionImage (P n) A) < ⊤) ∧
Tendsto (fun n => setChiCapacity (projectionImage (P n) A)) atTop (𝓝 (setChiCapacity A)) ∧
Tendsto (fun n => projectedAverage (P n) A hA) atTop (𝓝 (optimalAverage A hA))) ∧
((∀ n, ∀ rho ∈ A, 0 < projectionMass (P n) rho) →
(⨆ n, setChiCapacity (projectionImage (P n) A)) < ⊤ → setChiCapacity A < ⊤) := 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 any countable, nonempty type, and let . A state on is a complex matrix admitting an expansion , where and , such that every finite quadratic form , for every finite and every , is real and nonnegative, and such that is summable and equals . Write for these states, identifying each state with its coefficient matrix. For any matrix , define
where the infimum is if there is no such expansion. Equip with the topology generated by all sets , with and real , and with its Borel measurable structure. To define the capacity used below, for finite complex matrices on the same index set put
where matrix logarithms use continuous functional calculus and the real logarithm has value at ; the supremum includes the empty compression. For a Borel probability measure on , let and , using the nonnegative extended integral; the coefficient integrals are the total complex integrals, which take value when the corresponding function is not integrable. For any , set
This is a supremum in , with empty supremum , and the support is taken in the state topology just specified. Let be nonempty, with a given witness of nonemptiness. For each , let be a bounded complex linear operator satisfying and , and suppose for every . Writing for the coordinate unit vectors, define
These sums use the total infinite-sum convention, giving to a nonsummable family. For a nonempty set , let be a fixed classical choice of a state satisfying for every , if any such state exists, and otherwise a state chosen from the given witness that is nonempty. Let when is nonempty, and otherwise. The assertion is the conjunction of the following implication and converse implication: if , then for all sufficiently large ; also, for all sufficiently large , is nonempty and ; and
The capacity convergence uses the topology of , and the state convergence uses the state topology specified above. Conversely, if for every and every , and , then . Here includes : the first implication gives eventual conclusions, whereas the positivity premise of the converse includes every index.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.