Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: tensor-factor lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.tensor_factor_lower

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For arbitrary finite-dimensional density matrices τ,ω\tau,\omegaτ,ω and 0≤ε<10\le\varepsilon<10≤ε<1, let Δe\Delta_eΔe​ denote the logarithm of the joint retained-subset minimum ∣J∣max⁡j∈Jrj|J|\max_{j\in J}r_j∣J∣maxj∈J​rj​, with retained mass at least 1−e1-e1−e. Then

Δε(τ⊗ω)≥Δε(τ)+log⁡2(1−ε).\Delta_\varepsilon(\tau\otimes\omega)\ge\Delta_{\sqrt\varepsilon}(\tau)+\log_2(1-\sqrt\varepsilon).Δε​(τ⊗ω)≥Δε​​(τ)+log2​(1−ε​).

No purity or flatness assumption is imposed on the auxiliary density ω\omegaω. This bounds a tensor product's smooth spread using one factor.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P61

open scoped Matrix ComplexConjugate

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

open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)

open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

attribute [local instance] Classical.propDecidable

section SpectralResults

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- PDF p.4, Lemma 6: arbitrary auxiliary density, including epsilon=0. -/
theorem tensor_factor_lower (tau : Matrix I I ℂ) (omega : Matrix J J ℂ)
    (htau : IsDensityMatrix tau) (homega : IsDensityMatrix omega)
    (epsilon : ℝ) (hzero : 0 ≤ epsilon) (hone : epsilon < 1) :
    smoothSpread tau (Real.sqrt epsilon) + logTwo (1 - Real.sqrt epsilon) ≤
    smoothSpread (Matrix.kronecker tau omega) epsilon := by sorry

end SpectralResults

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 4, Lemma 6: tensor-factor lower bound
Read-back

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

For finite index types I,JI,JI,J with decidable equality, let τ\tauτ and ω\omegaω be positive semidefinite complex matrices on III and JJJ, respectively, each with trace 111, and let 0≤ϵ<10\le\epsilon<10≤ϵ<1. For a density matrix XXX with ascending eigenvalues λi(X)\lambda_i(X)λi​(X), define

Δη(X)=log⁡2min⁡s⊆{i:λi(X)>0}∑i∈sλi(X)≥1−η(∣s∣max⁡i∈sλi(X)).\Delta^\eta(X)= \log_2\min_{\substack{s\subseteq\{i:\lambda_i(X)>0\}\\ \sum_{i\in s}\lambda_i(X)\ge1-\eta}} \left(|s|\max_{i\in s}\lambda_i(X)\right).Δη(X)=log2​s⊆{i:λi​(X)>0}∑i∈s​λi​(X)≥1−η​min​(∣s∣i∈smax​λi​(X)).

Then

Δϵ(τ)+log⁡2(1−ϵ)≤Δϵ(τ⊗ω),\Delta^{\sqrt\epsilon}(\tau)+\log_2(1-\sqrt\epsilon) \le \Delta^\epsilon(\tau\otimes\omega),Δϵ​(τ)+log2​(1−ϵ​)≤Δϵ(τ⊗ω),

where (τ⊗ω)(i,j),(i′,j′)=τii′ωjj′(\tau\otimes\omega)_{(i,j),(i',j')}=\tau_{ii'}\omega_{jj'}(τ⊗ω)(i,j),(i′,j′)​=τii′​ωjj′​. Both retention families are nonempty and contain only nonempty subsets. The case ϵ=0\epsilon=0ϵ=0 is included, and the density hypotheses exclude empty index types.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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