Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4: Multiplier sum logarithmic bound

Proved
QAlgorithms.Papers.Independent.Extend50.P32.multiplierLogBound

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

prove2quantum

Let d≥1d\ge1d≥1 and let α1≥⋯≥αd>0\alpha_1\ge\cdots\ge\alpha_d>0α1​≥⋯≥αd​>0 be real numbers, with no probability normalization. The logarithm is natural. At d=1d=1d=1 the sum is empty.

∑i=1d−1αi−αi+1αi≤min⁡{d,ln⁡α1αd}.\sum_{i=1}^{d-1}\frac{\alpha_i-\alpha_{i+1}}{\alpha_i}\le\min\left\{d,\ln\frac{\alpha_1}{\alpha_d}\right\}.i=1∑d−1​αi​αi​−αi+1​​≤min{d,lnαd​α1​​}.

This isolates the source comparison or construction with all of its domain and occurrence conventions retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P32
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators ENNReal Matrix ComplexOrder Topology

namespace QAlgorithms.Papers.Independent.Extend50.P32

open QAlgorithms.Papers.Independent.Support50.P38 (wordMass tv)

-- For the density matrices below, the characteristic-polynomial identity
-- preserves all eigenvalues with multiplicity and is equivalent to unitary
-- diagonalization with these real eigenvalues. No accuracy is assumed.

open QAlgorithms.Papers.Independent.Gap20.P17 (HasSpectrum)

/-- Lemma 5.4, PDF p.24: the printed upper bound is d, not d-1;
at d=1 the sum and log(1) are both zero. -/
theorem multiplierLogBound {d : ℕ} (hd : 0 < d) (alpha : Fin d → ℝ)
    (hSorted : Antitone alpha) (hPositive : ∀ i, 0 < alpha i) :
    (∑ j : Fin (d - 1), adjacentProbabilityMultiplier alpha j) ≤
      min (d : ℝ) (Real.log (alpha ⟨0, hd⟩ / alpha ⟨d - 1, by omega⟩)) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P32

end
Source
Efficient quantum tomography II, arXiv:1612.00034v1, PDF p. 24, Lemma 5.4
Read-back

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

For every positive integer ddd and every nonincreasing sequence of strictly positive real numbers α0,…,αd−1\alpha_0,\ldots,\alpha_{d-1}α0​,…,αd−1​,

∑j=0d−2αj−αj+1αj≤min⁡ ⁣{d,log⁡α0αd−1},\sum_{j=0}^{d-2}\frac{\alpha_j-\alpha_{j+1}}{\alpha_j} \le \min\!\left\{d,\log\frac{\alpha_0}{\alpha_{d-1}}\right\},j=0∑d−2​αj​αj​−αj+1​​≤min{d,logαd−1​α0​​},

where log⁡\loglog is the natural logarithm. No normalization of the sequence is assumed, and repeated entries are permitted. For d=1d=1d=1, the sum is empty and the logarithm is log⁡1=0\log1=0log1=0.

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

    Confirmed by the moderator at approval.

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