Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5: atomic measures dense within rank-constrained barycenter fibers

Open
QAlgorithms.Papers.Independent.Support50.P34.lemma5_atomicFiberDense

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

prove2quantum

For a separable complex Hilbert space H\mathcal HH, a state ρ\rhoρ, and an integer k≥1k\ge1k≥1, let Pρ(Sk(H))\mathcal P_\rho(S_k(\mathcal H))Pρ​(Sk​(H)) be the Borel probability measures supported on rank-at-most-kkk states with barycenter exactly ρ\rhoρ. Then

Pρa(Sk(H))‾=Pρ(Sk(H)),\overline{\mathcal P^a_\rho(S_k(\mathcal H))}=\mathcal P_\rho(S_k(\mathcal H)),Pρa​(Sk​(H))​=Pρ​(Sk​(H)),

where the closure is taken in that fiber with its relative weak topology, and Pa\mathcal P^aPa means countably atomic. Thus atomic approximation preserves the barycenter exactly.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal NNReal BigOperators

namespace QAlgorithms.Papers.Independent.Support50.P34

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
   operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)

open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)

open QAlgorithms.Papers.Independent.Frontier18.P01 (binaryEntropy)

attribute [local instance] Classical.propDecidable Classical.decEq

section Operators

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable {I : Type*}

section Statements

variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]

include hsep hI

/-- Lemma 5, arXiv:0904.1963v3, PDF p.9: density inside each exact barycenter fiber. -/
theorem lemma5_atomicFiberDense (b : HilbertBasis I ℂ H) (k : ℕ) (hk : 0 < k)
    (rho : QuantumState b) :
    Dense {mu : {mu : ProbabilityMeasure (rankStates b k) //
      mu ∈ stateFiber b (rankStates b k) rho} | AtomicProbability mu.val} := by sorry

end Statements

end Operators

end QAlgorithms.Papers.Independent.Support50.P34

end
Source
Continuity of the von Neumann entropy, arXiv:0904.1963v3, PDF p. 9, Lemma 5: atomic measures dense within rank-constrained barycenter fibers
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let HHH be a complex Hilbert space with Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​. Call a bounded complex-linear operator trace class when it has a representation Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, and let ν(T)\nu(T)ν(T) be the infimum of these sums. Let Sb\mathcal S_bSb​ consist of the self-adjoint trace-class operators with nonnegative quadratic forms and basis trace ∑i⟨bi,Tbi⟩=1\sum_i\langle b_i,Tb_i\rangle=1∑i​⟨bi​,Tbi​⟩=1, with the initial topology of all functions T↦ν(T−S)T\mapsto\nu(T-S)T↦ν(T−S) for trace-class SSS. For a natural number k>0k>0k>0, let Sb,k⊆Sb\mathcal S_{b,k}\subseteq\mathcal S_bSb,k​⊆Sb​ consist of states whose operator ranges lie in the span of some kkk vectors. Fix ρ∈Sb\rho\in\mathcal S_bρ∈Sb​, and let Fρ\mathcal F_\rhoFρ​ be the probability measures μ\muμ on Sb,k\mathcal S_{b,k}Sb,k​ such that, for every x,y∈Hx,y\in Hx,y∈H, ⟨x,σy⟩\langle x,\sigma y\rangle⟨x,σy⟩ is integrable in σ\sigmaσ and

⟨x,ρy⟩=∫⟨x,σy⟩ dμ(σ).\langle x,\rho y\rangle=\int\langle x,\sigma y\rangle\,d\mu(\sigma).⟨x,ρy⟩=∫⟨x,σy⟩dμ(σ).

Then the measures in Fρ\mathcal F_\rhoFρ​ that give measure zero to the complement of some countable set are dense in Fρ\mathcal F_\rhoFρ​. The latter carries the subspace topology inherited from the weak topology on probability measures. Thus every nonempty relatively open subset of this fixed-barycenter space contains a measure concentrated on a countable set; the density statement itself does not assert that the space is nonempty.

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