Lemma 11
ProvedQAlgorithms.Papers.Independent.Gap48.P18.projection_image_convexity_and_ensemble_liftingLet be an orthogonal projection and let lie in the positive-mass domain of . If is convex then is convex. For every finite probability ensemble in that image, there is an ensemble in with
The lifting assertion does not require convexity. Normalization is used only at positive trace.
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 11, arXiv:quant-ph/0510073v2, PDF pp.72.
-/
theorem projection_image_convexity_and_ensemble_lifting {I : Type}
[Countable I] [Nonempty I] (P : BoundedOrthogonalProjection I) (A : Set (State I))
(hdomain : ∀ rho ∈ A, 0 < projectionMass P rho) :
(CoefficientConvexStates A → CoefficientConvexStates (projectionImage P A)) ∧
∀ (m : ℕ) (pi : Fin m → ℝ≥0) (rho : Fin m → State I), InSimplex pi →
(∀ i, rho i ∈ projectionImage P A) →
∃ (w : Fin m → ℝ≥0) (sigma : Fin m → State I), InSimplex w ∧
(∀ i, sigma i ∈ A) ∧ ∀ i,
(rho i).coefficients = compressedCoefficients P (sigma i) ∧
(w i : ℝ) * projectionMass P (sigma i) =
(pi i : ℝ) * ∑ j, (w j : ℝ) * projectionMass P (sigma j) := 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. A state on is a complex matrix with a representation , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Let be a bounded complex-linear operator on satisfying and , and let be any set of states. With the coordinate vector at , define
where the inverse is the real inverse, embedded into , and is at . Define
Assume for every . Then, if the coefficient matrices of form a convex set over , the coefficient matrices of also form a convex set over . In addition, for every natural number , every collection of nonnegative real weights with , and every collection of states , there exist nonnegative real weights and states such that
This lifting assertion does not require the convexity premise from the first assertion. Zero weights are allowed, and a preimage is required even when . The case is quantified over, but its weight-sum hypothesis is impossible; itself is not assumed nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.