Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9

Proved
QAlgorithms.Papers.Independent.Support50.P21.maxRelative_mixture_bound

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 KKK be a nonempty finite set, pi≥0p_i\ge0pi​≥0 with ∑ipi=1\sum_i p_i=1∑i​pi​=1, and let ρi,σi\rho_i,\sigma_iρi​,σi​ be density operators. Using the same weights in both mixtures,

Dmax⁡ ⁣(∑ipiρi∥∑ipiσi)≤max⁡i∈KDmax⁡(ρi∥σi).D_{\max}\!\left(\sum_i p_i\rho_i\middle\Vert\sum_i p_i\sigma_i\right)\le\max_{i\in K}D_{\max}(\rho_i\Vert\sigma_i).Dmax​(i∑​pi​ρi​​i∑​pi​σi​)≤i∈Kmax​Dmax​(ρi​∥σi​).

The maximum may be +∞+\infty+∞. This is the source's maximum bound, including zero-weight components.

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 9, PDF p.5, (25): common weights and finite maximum, not an average. -/
theorem maxRelative_mixture_bound {K : Type} [Fintype K] [Nonempty K]
    (p : K → ℝ) (hp : ∀ i, 0 ≤ p i) (hsum : ∑ i, p i = 1)
    (rho sigma : K → Mat I) (hrho : ∀ i, IsDensityMatrix (rho i))
    (hsigma : ∀ i, IsDensityMatrix (sigma i)) :
    maxRelative (∑ i, (p i : ℂ) • rho i) (∑ i, (p i : ℂ) • sigma i) ≤
      ⨆ i, maxRelative (rho i) (sigma i) := 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. 5, Lemma 9
Read-back

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

For any finite index type III with decidable equality and any finite nonempty type KKK, let pi≥0p_i\ge0pi​≥0 with ∑i∈Kpi=1\sum_{i\in K}p_i=1∑i∈K​pi​=1, and let ρi,σi\rho_i,\sigma_iρi​,σi​ be positive semidefinite complex matrices on III, each with complex trace one, for every i∈Ki\in Ki∈K. Define

Dmax⁡(X∥Y)=inf⁡{ℓ∈R:2ℓY−X is positive semidefinite},D_{\max}(X\|Y) =\inf\{\ell\in\mathbb R:2^\ell Y-X\text{ is positive semidefinite}\},Dmax​(X∥Y)=inf{ℓ∈R:2ℓY−X is positive semidefinite},

where the infimum is taken in the extended real numbers and is +∞+\infty+∞ when the feasible set is empty. Then

Dmax⁡ ⁣(∑i∈Kpiρi ∥ ∑i∈Kpiσi)≤sup⁡i∈KDmax⁡(ρi∥σi).D_{\max}\!\left(\sum_{i\in K}p_i\rho_i\,\middle\|\,\sum_{i\in K}p_i\sigma_i\right) \le\sup_{i\in K}D_{\max}(\rho_i\|\sigma_i).Dmax​(i∈K∑​pi​ρi​​i∈K∑​pi​σi​)≤i∈Ksup​Dmax​(ρi​∥σi​).

No support inclusions are assumed, so the supremum may be +∞+\infty+∞. Zero weights are permitted, and the supremum includes every index, including those with zero weight.

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