Lemma 5.4: Multiplier sum logarithmic bound
ProvedQAlgorithms.Papers.Independent.Extend50.P32.multiplierLogBoundprove2quantum
Let and let be real numbers, with no probability normalization. The logarithm is natural. At the sum is empty.
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 and every nonincreasing sequence of strictly positive real numbers ,
where is the natural logarithm. No normalization of the sequence is assumed, and repeated entries are permitted. For , the sum is empty and the logarithm is .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.