Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6

Open
QAlgorithms.Papers.Independent.Gap48.P18.tail_layer_prescribed_relative_entropy

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

prove2quantum

Let σ=∑k≥1λk∣k⟩⟨k∣\sigma=\sum_{k\ge1}\lambda_k|k\rangle\langle k|σ=∑k≥1​λk​∣k⟩⟨k∣ have infinite entropy. Let Ln(σ)L_n(\sigma)Ln​(σ) contain the states with the same diagonal and no off-diagonal entries involving an index below nnn. For every finite c≥0c\ge0c≥0 and integer n≥1n\ge1n≥1,

∃m, ∃ρ∈Ln(σ):D(ρ∥σ)=c,\exists m,\ \exists\rho\in L_n(\sigma):\quad D(\rho\|\sigma)=c,∃m, ∃ρ∈Ln​(σ):D(ρ∥σ)=c,

with every off-diagonal entry involving an index above mmm also zero. Thus only a finite band of coherences is needed to realize each prescribed relative entropy.

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

/-- Lemma 6, arXiv:quant-ph/0510073v2, PDF pp.59.
Source basis index k=1 corresponds to Lean coordinate 0; all inequalities use i+1. Infinite entropy is a hypothesis. -/
theorem tail_layer_prescribed_relative_entropy (sigma : State ℕ)
    (hdiag : Diagonal sigma) (hinfinite : stateEntropyNats sigma = ⊤)
    (c : ℝ≥0) (n : ℕ) (hn : 1 ≤ n) :
    ∃ (m : ℕ) (rho : State ℕ), rho ∈ tailLayer sigma n ∧
      stateRelativeEntropyNats rho sigma = (c : ℝ≥0∞) ∧
      ∀ i j, i ≠ j → (m < i + 1 ∨ m < j + 1) → rho.coefficients i j = 0 := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 59, Lemma 6
Read-back

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

Let σ\sigmaσ be a state on N\mathbb NN. A state here is a complex matrix XXX with an expansion Xij=∑a∈Nua(i)va(j)‾X_{ij}=\sum_{a\in\mathbb N}u_a(i)\overline{v_a(j)}Xij​=∑a∈N​ua​(i)va​(j)​, where ua,va∈ℓ2(N;C)u_a,v_a\in\ell^2(\mathbb N;\mathbb C)ua​,va​∈ℓ2(N;C) and ∑a∥ua∥2∥va∥2<∞\sum_a\|u_a\|_2\|v_a\|_2<\infty∑a​∥ua​∥2​∥va​∥2​<∞, with every finite quadratic form real and nonnegative, and with summable real diagonal of sum 111. For a finite s⊆Ns\subseteq\mathbb Ns⊆N, write XsX_sXs​ for the principal compression and ts=ℜtr⁡Xst_s=\Re\operatorname{tr}X_sts​=ℜtrXs​, and define

H(X)=sup⁡s finite[tslog⁡ts−ℜtr⁡(Xslog⁡Xs)]+,D(X∥Y)=sup⁡s finite{[ℜtr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+,ker⁡Ys⊆ker⁡Xs,+∞,otherwise.H(X)=\sup_{s\text{ finite}}\bigl[t_s\log t_s-\Re\operatorname{tr}(X_s\log X_s)\bigr]_+, \qquad D(X\|Y)=\sup_{s\text{ finite}} \begin{cases} \bigl[\Re\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)\bigr]_+, &\ker Y_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}. \end{cases}H(X)=s finitesup​[ts​logts​−ℜtr(Xs​logXs​)]+​,D(X∥Y)=s finitesup​{[ℜtr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​,+∞,​kerYs​⊆kerXs​,otherwise.​

Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), the logarithm is natural with its total real convention log⁡0=0\log 0=0log0=0, and matrix logarithms use continuous functional calculus. Suppose that σij=0\sigma_{ij}=0σij​=0 whenever i≠ji\ne ji=j, and H(σ)=+∞H(\sigma)=+\inftyH(σ)=+∞. For every nonnegative real ccc and every natural number n≥1n\ge1n≥1, there exist a natural number mmm and a state ρ\rhoρ such that

ρii=σiifor every i,D(ρ∥σ)=c,\rho_{ii}=\sigma_{ii}\quad\text{for every }i,\qquad D(\rho\|\sigma)=c,ρii​=σii​for every i,D(ρ∥σ)=c,

and, for every distinct i,j∈Ni,j\in\mathbb Ni,j∈N,

(i+1<n or j+1<n) ⟹ ρij=0,(m<i+1 or m<j+1) ⟹ ρij=0.(i+1<n\ \text{or}\ j+1<n)\ \Longrightarrow\ \rho_{ij}=0, \qquad (m<i+1\ \text{or}\ m<j+1)\ \Longrightarrow\ \rho_{ij}=0.(i+1<n or j+1<n) ⟹ ρij​=0,(m<i+1 or m<j+1) ⟹ ρij​=0.

Thus the conditions concern off-diagonal entries only; the entire diagonal remains prescribed by σ\sigmaσ. The case c=0c=0c=0 is included, mmm has no stated positive lower bound, and for n=1n=1n=1 the first off-diagonal vanishing condition is vacuous.

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