Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 14

Proved
QAlgorithms.Papers.Independent.Support50.P21.smoothMax_domination

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

prove2quantum

All systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.

Let ρ,σ\rho,\sigmaρ,σ be density operators, Δ≥0\Delta\ge0Δ≥0, and λ∈R\lambda\in\mathbb Rλ∈R with ρ≤2λσ+Δ\rho\le2^\lambda\sigma+\Deltaρ≤2λσ+Δ. For every ε≥8Tr⁡Δ\varepsilon\ge\sqrt{8\operatorname{Tr}\Delta}ε≥8TrΔ​,

Dmax⁡ε(ρ∥σ)≤λ.D_{\max}^{\varepsilon}(\rho\Vert\sigma)\le\lambda.Dmaxε​(ρ∥σ)≤λ.

Smoothing uses Bε(ρ)={ρˉ≥0:∥ρˉ−ρ∥1≤ε, Tr⁡ρˉ≤Tr⁡ρ}B^\varepsilon(\rho)=\{\bar\rho\ge0:\lVert\bar\rho-\rho\rVert_1\le\varepsilon,\ \operatorname{Tr}\bar\rho\le\operatorname{Tr}\rho\}Bε(ρ)={ρˉ​≥0:∥ρˉ​−ρ∥1​≤ε, Trρˉ​≤Trρ}. Approximants may be subnormalized and ε\varepsilonε may exceed one. This converts approximate domination to a smooth max-divergence bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P21

open QAlgorithms QAlgorithms.Entanglement Filter

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.

open QAlgorithms.Papers.Independent.Claimed50.P33
  (FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)

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

open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

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

section Statements

variable [Nonempty I] [Nonempty J]

/-- Lemma 14, PDF p.7; construction pp.10–11: subnormalized approximants,
full trace norm, exponent lambda, and eps allowed to exceed one. -/
theorem smoothMax_domination (rho sigma Delta : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (hDelta : Delta.PosSemidef) (lambda eps : ℝ)
    (hdom : Le rho ((((2 : ℝ) ^ lambda) : ℂ) • sigma + Delta))
    (heps : Real.sqrt (8 * tr Delta) ≤ eps) :
    traceSmoothMax eps rho sigma ≤ (lambda : EReal) := by sorry

end Statements

end QAlgorithms.Papers.Independent.Support50.P21

end
Source
Min- and Max- Relative Entropies and a New Entanglement Monotone, arXiv:0803.2770v3, PDF p. 7, Lemma 14
Read-back

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

Let III be a finite index type with decidable equality, let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices on III with trace 111, let Δ\DeltaΔ be a positive semidefinite matrix on III, and let λ,ε∈R\lambda,\varepsilon\in\mathbb Rλ,ε∈R. Write tr⁡X=Re⁡Tr⁡X\operatorname{tr}X=\operatorname{Re}\operatorname{Tr}XtrX=ReTrX, and define

∥X∥1=Re⁡Tr⁡X†X,Bε(ρ)={r:r is positive semidefinite, ∥r−ρ∥1≤ε, tr⁡r≤tr⁡ρ},\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X},\qquad \mathcal B_\varepsilon(\rho)= \{r:r\text{ is positive semidefinite},\ \|r-\rho\|_1\le\varepsilon,\ \operatorname{tr}r\le\operatorname{tr}\rho\},∥X∥1​=ReTrX†X​,Bε​(ρ)={r:r is positive semidefinite, ∥r−ρ∥1​≤ε, trr≤trρ}, Dmax⁡(r∥σ)=inf⁡{ℓ∈R:2ℓσ−r is positive semidefinite},Smax⁡ε(ρ∥σ)=inf⁡r∈Bε(ρ)Dmax⁡(r∥σ),D_{\max}(r\Vert\sigma) =\inf\{\ell\in\mathbb R:2^\ell\sigma-r\text{ is positive semidefinite}\}, \qquad S_{\max}^{\varepsilon}(\rho\Vert\sigma) =\inf_{r\in\mathcal B_\varepsilon(\rho)}D_{\max}(r\Vert\sigma),Dmax​(r∥σ)=inf{ℓ∈R:2ℓσ−r is positive semidefinite},Smaxε​(ρ∥σ)=r∈Bε​(ρ)inf​Dmax​(r∥σ),

with both infima interpreted in the extended reals. If 2λσ+Δ−ρ2^\lambda\sigma+\Delta-\rho2λσ+Δ−ρ is positive semidefinite and 8tr⁡Δ≤ε\sqrt{8\operatorname{tr}\Delta}\le\varepsilon8trΔ​≤ε, then

Smax⁡ε(ρ∥σ)≤λ.S_{\max}^{\varepsilon}(\rho\Vert\sigma)\le\lambda.Smaxε​(ρ∥σ)≤λ.

There is no upper bound on ε\varepsilonε or sign restriction on λ\lambdaλ; matrices in the smoothing ball need not have trace 111 and may be zero.

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