Compact positive trace slices
ProvedQAlgorithms.Papers.Independent.Support50.P44.compact_positive_trace_slicesprove2quantum
Let be a finite-dimensional complex Hilbert space and . Both sets
are compact in the finite-dimensional operator topology. Zero-dimensional spaces and are included. These trace constraints provide compact domains for recovery optimization.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P44
open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)
open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)
open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)
open Filter
open scoped ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable {A B C E G : Type*}
/-- PDF p.25, Lemma C.1: both positive trace slices, including alpha = 0
and the zero-dimensional space, in the finite matrix topology. -/
theorem compact_positive_trace_slices [Fintype E] [DecidableEq E]
(alpha : ℝ) (halpha : 0 ≤ alpha) :
IsCompact {X : Matrix E E ℂ | X.PosSemidef ∧ X.trace.re ≤ alpha} ∧
IsCompact {X : Matrix E E ℂ | X.PosSemidef ∧ X.trace.re = alpha} := by sorry
end QAlgorithms.Papers.Independent.Support50.P44
end
Source
Universal recovery map for approximate Markov chains, arXiv:1504.07251v3, PDF p. 25, Lemma C.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite type with decidable equality and every real , both sets
are compact in the usual topology on complex matrices. The assertion includes , when both sets consist of the zero matrix. It also includes empty ; then the first set is a singleton, while the second is a singleton for and empty for .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.