Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fock projectors distinguish weak operator and trace-norm cone topologies

Open
QAlgorithms.Papers.Independent.Intakethird100.P88.remark4

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

On the full single-mode Fock space, let Pn=∣n⟩⟨n∣P_n=|n\rangle\langle n|Pn​=∣n⟩⟨n∣ be the normalized number-state projectors. The weak operator and trace-norm topologies on the positive trace-class cone differ. Specifically,

Pn→WOT0,(Pn)n≥0 is not trace-norm Cauchy and has no trace-norm limit.P_n\xrightarrow{\mathrm{WOT}}0, \qquad (P_n)_{n\ge0}\text{ is not trace-norm Cauchy and has no trace-norm limit}.Pn​WOT​0,(Pn​)n≥0​ is not trace-norm Cauchy and has no trace-norm limit.

Weak operator convergence means ⟨x,Pnx⟩→0\langle x,P_nx\rangle\to0⟨x,Pn​x⟩→0 for every Hilbert vector xxx. The limiting operator is zero and therefore lies outside the normalized state space. This gives the counterexample that distinguishes the two cone topologies.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P88
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P88

open Filter

open QAlgorithms.Papers.Independent.Dependency50.P13

open QAlgorithms.Papers.Independent.Dependency50.P39 (Fock fockKet fockDyad)

open QAlgorithms.Papers.Independent.Information100.P62 (logTwo)

attribute [local instance] Classical.propDecidable

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

/-- PDF p.4, Remark 4: the full single-mode Fock projectors tend to zero in
WOT, are not trace-norm Cauchy, and have no trace-norm limit. Consequently the
cone topologies differ. No normalized WOT limit within the state space is asserted. -/
theorem remark4 :
    weakOperatorPositiveTopology (H := Fock) ≠ normPositiveTopology (H := Fock) ∧
    (∀ n : ℕ, IsTraceClass (fockDyad n n) ∧ IsPositive (fockDyad n n) ∧
      (∑' k : ℕ, fockDyad n n (fockKet k) k) = 1) ∧
    (∀ x : Fock, Tendsto (fun n : ℕ => (inner ℂ x (fockDyad n n x)).re)
      atTop (nhds 0)) ∧
    (¬ ∀ epsilon : ℝ, 0 < epsilon → ∃ N : ℕ, ∀ i ≥ N, ∀ j ≥ N,
      traceNormValue (fockDyad i i - fockDyad j j) < epsilon) ∧
    (¬ ∃ T : TraceClass Fock, Tendsto
      (fun n : ℕ => traceNormValue (fockDyad n n - T.val)) atTop (nhds 0)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P88

end
Source
Asymptotic state transformations of continuous variable resources, arXiv:2010.00044v3, PDF p. 4, II A: Remark4
Read-back

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

Let F=ℓ2(N;C)\mathcal F=\ell^2(\mathbb N;\mathbb C)F=ℓ2(N;C), let ene_nen​ be its coordinate unit vectors, and put Pnx=⟨en,x⟩enP_nx=\langle e_n,x\rangle e_nPn​x=⟨en​,x⟩en​. Here trace class means admitting a representation Tx=∑r∈N⟨vr,x⟩urTx=\sum_{r\in\mathbb N}\langle v_r,x\rangle u_rTx=∑r∈N​⟨vr​,x⟩ur​ for every xxx, with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, and positivity means T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx. Let N(R)N(R)N(R) be the real conversion of the infimum in [0,∞][0,\infty][0,∞] of ∑rofReal⁡(∥ur∥∥vr∥)\sum_r\operatorname{ofReal}(\|u_r\|\|v_r\|)∑r​ofReal(∥ur​∥∥vr​∥) over these representations of RRR, converting +∞+\infty+∞ to 000. The topology on positive trace-class operators generated by T↦Re⁡⟨x,Tx⟩T\mapsto\operatorname{Re}\langle x,Tx\rangleT↦Re⟨x,Tx⟩, for all x∈Fx\in\mathcal Fx∈F, differs from the topology generated by T↦N(T−S)T\mapsto N(T-S)T↦N(T−S), for all trace-class SSS. Moreover, for every n∈Nn\in\mathbb Nn∈N, including 000, PnP_nPn​ is trace class and positive and ∑k∈N(Pnek)k=1\sum_{k\in\mathbb N}(P_ne_k)_k=1∑k∈N​(Pn​ek​)k​=1; for every x∈Fx\in\mathcal Fx∈F, Re⁡⟨x,Pnx⟩→0\operatorname{Re}\langle x,P_nx\rangle\to0Re⟨x,Pn​x⟩→0 as n→∞n\to\inftyn→∞; there exists a real ε>0\varepsilon>0ε>0 such that for every N0∈NN_0\in\mathbb NN0​∈N there are i,j≥N0i,j\ge N_0i,j≥N0​ with N(Pi−Pj)≥εN(P_i-P_j)\ge\varepsilonN(Pi​−Pj​)≥ε; and there is no trace-class operator TTT on F\mathcal FF for which N(Pn−T)→0N(P_n-T)\to0N(Pn​−T)→0.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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