Logarithmic multioperator interpolation
OpenQAlgorithms.Papers.Independent.Intakethird100.P91.logarithmicInterpolationLet be integers and let act on the common space , with products in the displayed order. For , write for the unnormalized Schatten norm. On a positive eigenvalue , acts by , and it acts by zero on the kernel. No commutation between different factors or trace normalization is assumed.
Assume every is positive semidefinite, and let be finite real numbers. Define for . Then
Here , scalar logarithms are natural with , and the integral is the signed extended Lebesgue integral. Its positive part is finite, while its negative part may be infinite. This bound gives explicit interpolation without optimizing over unitaries, and covers zero factors.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P91
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Intakethird100.P91
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Dependency50.P21
(extendedLog upperLogIntegral betaDensity betaZero interpolationExponent)
open QAlgorithms.Papers.Independent.Bridge50.P29
(positiveComplexPower orderedProduct)
/-- Theorem 2, Eq.(18), arXiv:1610.01262v1, PDF pp.3--4.
The outer powers p and q remain INSIDE their natural logarithms.
Zero eigenvalues have support-zero powers; extendedLog(0)=-infinity.
The signed extended integral retains an infinite negative part, with its
positive part finite by boundedness of these finite matrix products and
the beta probability density. There is no unitary optimization here. -/
theorem logarithmicInterpolation
(d L : ℕ) (hd : 0 < d) (hL : 0 < L)
(C : Fin L → Matrix (Fin d) (Fin d) ℂ)
(hC : ∀ i, (C i).PosSemidef)
(p q : ℝ) (hq : 1 ≤ q) (hqp : q < p) :
extendedLog ((schattenNorm (ENNReal.ofReal p)
(orderedProduct (fun i => positiveComplexPower (C i) (1 / (p : ℂ))))) ^ p) ≤
upperLogIntegral (fun t =>
(betaDensity (q / p) t : EReal) *
extendedLog ((schattenNorm (ENNReal.ofReal q)
(orderedProduct (fun i => positiveComplexPower (C i)
((1 + (t : ℂ) * Complex.I) / (q : ℂ))))) ^ q)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P91
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers , every family of positive semidefinite complex matrices, and all real satisfying , the following inequality holds in the extended real numbers:
Products are in increasing index order; for a positive semidefinite , replaces every positive eigenvalue by and every zero eigenvalue by . For ,
Here when , and when ; for an extended-real-valued function , is defined as the nonnegative Lebesgue integral of its positive part minus the nonnegative Lebesgue integral of its negative part, with both integrals cast to the extended reals and subtraction performed there. No separate integrability or finiteness hypothesis is imposed on this expression. The hypotheses ensure , but permit singular or zero matrices , so the extended logarithms need not be finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.