Marginal constraints: convexity and compactness equivalences
OpenQAlgorithms.Papers.Independent.Gap48.P18.marginal_set_convexity_and_compactnessLet A and B be nonempty subsets of the normalized state spaces of nonzero separable complex Hilbert spaces H and K. Define A tensor B to be all joint states on H tensor K whose first marginal belongs to A and whose second marginal belongs to B. This joint constraint set is convex if and only if both A and B are convex, and it is compact in trace norm if and only if both A and B are compact in trace norm.
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 8, arXiv:quant-ph/0510073v2, PDF pp.61-62, cited there from [17].
Printed: the two equivalences for arbitrary marginal constraint sets.
Changed: make nonemptiness of both marginal sets explicit, as required by the
source's reverse implications. Why: an empty first set gives an empty compact
convex joint set for any second set, including nonconvex or noncompact ones.
This records the source's implicit nonempty-set convention and retains both
clauses. Singleton marginal sets give a nonvacuous instance. -/
theorem marginal_set_convexity_and_compactness {I J : Type}
[Countable I] [Countable J] [Nonempty I] [Nonempty J]
(A : Set (State I)) (B : Set (State J)) (hA : A.Nonempty) (hB : B.Nonempty) :
(CoefficientConvexStates (jointMarginalConstraintSet A B) ↔
CoefficientConvexStates A ∧ CoefficientConvexStates B) ∧
(IsCompact (jointMarginalConstraintSet A B) ↔ IsCompact A ∧ IsCompact 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 countable, nonempty types, finite or infinite, and let and be nonempty sets of states on and , respectively. Here, for any label type , a state is a complex matrix admitting an expansion , with and , such that every quadratic form , for every finite and every , has zero imaginary part and nonnegative real part, and the real diagonal entries form a summable family with sum . Define to be the infimum of over all expansions of of the preceding form, with value if no expansion exists, and give states the topology generated by all sets , for states and real . Let consist of all states on for which there exist and satisfying
These sums are the total infinite sums of the complex coefficient families, taking value zero when a family is not summable. Then both of the following equivalences hold:
Real convexity here means that for any two matrices in the relevant coefficient set and any real , including both endpoints, their matrix also belongs to that coefficient set; compactness uses the respective state topologies just defined.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.