Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 11

Open
QAlgorithms.Papers.Independent.Gap48.P18.retained_mass_factor_cannot_be_removed

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

prove2quantum

There is a nonempty set AAA of states on a separable infinite-dimensional Hilbert space, of finite capacity, and an orthogonal projection PPP with positive uniform retained mass such that

Cˉ(ΘP(A))>Cˉ(A).\bar C(\Theta_P(A))>\bar C(A).Cˉ(ΘP​(A))>Cˉ(A).

Thus the coefficient η(A,P)\eta(A,P)η(A,P) in Lemma 12 cannot be replaced by one. Remark 12 supplies a concrete family witnessing this phenomenon.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
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

/-- Remark 11, arXiv:quant-ph/0510073v2, PDF pp.73.
 -/
theorem retained_mass_factor_cannot_be_removed :
    ∃ (A : Set (State ℕ)) (P : BoundedOrthogonalProjection ℕ), A.Nonempty ∧
      setChiCapacity A < ⊤ ∧ 0 < projectionSuccessInfimum P A ∧
      setChiCapacity A < setChiCapacity (projectionImage P A) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 73, Remark 11
Read-back

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

There exist a nonempty set AAA of states indexed by N\mathbb NN and a bounded complex linear operator P:ℓ2(N;C)→ℓ2(N;C)P:\ell^2(\mathbb N;\mathbb C)\to\ell^2(\mathbb N;\mathbb C)P:ℓ2(N;C)→ℓ2(N;C) satisfying P2=PP^2=PP2=P and P∗=PP^*=PP∗=P, with the following properties. Here a state is a complex matrix XXX admitting an expansion Xij=∑m=0∞um(i)vm(j)‾X_{ij}=\sum_{m=0}^{\infty}u_m(i)\overline{v_m(j)}Xij​=∑m=0∞​um​(i)vm​(j)​ with um,vm∈ℓ2(N;C)u_m,v_m\in\ell^2(\mathbb N;\mathbb C)um​,vm​∈ℓ2(N;C) and ∑m∥um∥∥vm∥<∞\sum_m\|u_m\|\|v_m\|<\infty∑m​∥um​∥∥vm​∥<∞, whose finite quadratic forms ∑i,j∈szi‾Xijzj\sum_{i,j\in s}\overline{z_i}X_{ij}z_j∑i,j∈s​zi​​Xij​zj​ are real and nonnegative for every finite s⊆Ns\subseteq\mathbb Ns⊆N and every z:N→Cz:\mathbb N\to\mathbb Cz:N→C, and whose real diagonal entries form a summable family with sum 111. Define τ(Z)\tau(Z)τ(Z) as the infimum of ∑m∥um∥∥vm∥\sum_m\|u_m\|\|v_m\|∑m​∥um​∥∥vm​∥ over all such summable expansions of ZZZ, interpreted in [0,∞][0,\infty][0,∞], with value +∞+\infty+∞ if no expansion exists. The state topology is generated by the sets {Y:τ(Y−X)<ϵ}\{Y:\tau(Y-X)<\epsilon\}{Y:τ(Y−X)<ϵ} for states XXX and real ϵ>0\epsilon>0ϵ>0, and states carry its Borel measurable structure. For arbitrary coefficient matrices X,YX,YX,Y, define D(X,Y)D(X,Y)D(X,Y) to be the supremum over all finite s⊆Ns\subseteq\mathbb Ns⊆N, including s=∅s=\varnothings=∅, of

{[Re⁡tr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+,ker⁡Ys⊆ker⁡Xs,+∞,otherwise,\begin{cases} \left[\operatorname{Re}\operatorname{tr} \bigl(X_s\log X_s-X_s\log Y_s+Y_s-X_s\bigr)\right]_+, &\ker Y_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}, \end{cases}{[Retr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​,+∞,​kerYs​⊆kerXs​,otherwise,​

where Xs,YsX_s,Y_sXs​,Ys​ are the corresponding coordinate compressions, [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), and the matrix logarithms use continuous functional calculus with the real logarithm taking value 000 at 000. For a Borel probability measure μ\muμ on states, let (Xˉμ)ij=∫Xij dμ(X)(\bar X_\mu)_{ij}=\int X_{ij}\,d\mu(X)(Xˉμ​)ij​=∫Xij​dμ(X) and χ(μ)=∫−D(X,Xˉμ) dμ(X)\chi(\mu)=\int^-D(X,\bar X_\mu)\,d\mu(X)χ(μ)=∫−D(X,Xˉμ​)dμ(X); the first integrals are total complex integrals, with value 000 for nonintegrable functions, and the latter is the nonnegative extended integral. For any set BBB of states, define C(B)C(B)C(B) as the supremum of χ(μ)\chi(\mu)χ(μ) over all such probability measures whose topological support is finite and contained in BBB, with empty supremum 000. Writing eie_iei​ for the coordinate unit vectors, put

QP(X)ab=∑i∈N∑j∈N(Pei)aXij(Pej)b‾,pP(X)=∑a∈NRe⁡QP(X)aa,AP={Y a state:∃X∈A, pP(X)>0, Y=pP(X)−1QP(X)},Q_P(X)_{ab}=\sum_{i\in\mathbb N}\sum_{j\in\mathbb N} (Pe_i)_aX_{ij}\overline{(Pe_j)_b}, \qquad p_P(X)=\sum_{a\in\mathbb N}\operatorname{Re}Q_P(X)_{aa}, \qquad A_P=\{Y\text{ a state}:\exists X\in A,\ p_P(X)>0,\ Y=p_P(X)^{-1}Q_P(X)\},QP​(X)ab​=i∈N∑​j∈N∑​(Pei​)a​Xij​(Pej​)b​​,pP​(X)=a∈N∑​ReQP​(X)aa​,AP​={Y a state:∃X∈A, pP​(X)>0, Y=pP​(X)−1QP​(X)},

using total infinite sums, which take value 000 for nonsummable families. The asserted properties of the existentially chosen A,PA,PA,P are precisely

C(A)<+∞,0<inf⁡X∈A[pP(X)]+,C(A)<C(AP).C(A)<+\infty,\qquad 0<\inf_{X\in A}[p_P(X)]_+,\qquad C(A)<C(A_P).C(A)<+∞,0<X∈Ainf​[pP​(X)]+​,C(A)<C(AP​).

All three inequalities involving capacities or the infimum are in [0,∞][0,\infty][0,∞]; in particular, the last strict inequality does not itself assert that C(AP)C(A_P)C(AP​) is finite.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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