Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compact positive trace slices

Proved
QAlgorithms.Papers.Independent.Support50.P44.compact_positive_trace_slices

by Goku · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let EEE be a finite-dimensional complex Hilbert space and α≥0\alpha\ge0α≥0. Both sets

{X≥0:tr⁡X≤α},{X≥0:tr⁡X=α}\{X\ge0:\operatorname{tr}X\le\alpha\},\qquad \{X\ge0:\operatorname{tr}X=\alpha\}{X≥0:trX≤α},{X≥0:trX=α}

are compact in the finite-dimensional operator topology. Zero-dimensional spaces and α=0\alpha=0α=0 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 EEE with decidable equality and every real α≥0\alpha\ge0α≥0, both sets

{X∈CE×E:X is positive semidefinite, Re⁡tr⁡X≤α},{X∈CE×E:X is positive semidefinite, Re⁡tr⁡X=α}\{X\in\mathbb C^{E\times E}:X\text{ is positive semidefinite},\ \operatorname{Re}\operatorname{tr}X\le\alpha\}, \qquad \{X\in\mathbb C^{E\times E}:X\text{ is positive semidefinite},\ \operatorname{Re}\operatorname{tr}X=\alpha\}{X∈CE×E:X is positive semidefinite, RetrX≤α},{X∈CE×E:X is positive semidefinite, RetrX=α}

are compact in the usual topology on complex matrices. The assertion includes α=0\alpha=0α=0, when both sets consist of the zero matrix. It also includes empty EEE; then the first set is a singleton, while the second is a singleton for α=0\alpha=0α=0 and empty for α>0\alpha>0α>0.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me