Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Logarithmic multioperator interpolation

Open
QAlgorithms.Papers.Independent.Intakethird100.P91.logarithmicInterpolation

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d,L≥1d,L\ge1d,L≥1 be integers and let C1,…,CLC_1,\ldots,C_LC1​,…,CL​ act on the common space Cd\mathbb C^dCd, with products in the displayed order. For 1≤r<∞1\le r<\infty1≤r<∞, write ∥X∥r=(Tr⁡(X∗X)r/2)1/r\|X\|_r=(\operatorname{Tr}(X^*X)^{r/2})^{1/r}∥X∥r​=(Tr(X∗X)r/2)1/r for the unnormalized Schatten norm. On a positive eigenvalue λ\lambdaλ, CzC^zCz acts by exp⁡(zlog⁡λ)\exp(z\log\lambda)exp(zlogλ), and it acts by zero on the kernel. No commutation between different factors or trace normalization is assumed.

Assume every CiC_iCi​ is positive semidefinite, and let 1≤q<p1\le q<p1≤q<p be finite real numbers. Define βθ(t)=sin⁡(πθ)/(2θ[cosh⁡(πt)+cos⁡(πθ)])\beta_\theta(t)=\sin(\pi\theta)/(2\theta[\cosh(\pi t)+\cos(\pi\theta)])βθ​(t)=sin(πθ)/(2θ[cosh(πt)+cos(πθ)]) for 0<θ<10<\theta<10<θ<1. Then

log⁡(∥C11/p⋯CL1/p∥pp)≤∫Rβq/p(t)log⁡(∥C1(1+it)/q⋯CL(1+it)/q∥qq) dt.\log\left(\left\|C_1^{1/p}\cdots C_L^{1/p}\right\|_p^p\right) \le\int_{\mathbb R}\beta_{q/p}(t) \log\left(\left\|C_1^{(1+it)/q}\cdots C_L^{(1+it)/q}\right\|_q^q\right)\,dt.log(​C11/p​⋯CL1/p​​pp​)≤∫R​βq/p​(t)log(​C1(1+it)/q​⋯CL(1+it)/q​​qq​)dt.

Here i=−1i=\sqrt{-1}i=−1​, scalar logarithms are natural with log⁡0=−∞\log0=-\inftylog0=−∞, 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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P91
Formal statement
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
Source
Monotonicity of ppp-norms of multiple operators via unitary swivels, arXiv:1610.01262v1, PDF p. 3, Theorem 2, Eq.(18), proof p.4
Read-back

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

For every pair of positive natural numbers d,Ld,Ld,L, every family C=(Ci)i=0L−1C=(C_i)_{i=0}^{L-1}C=(Ci​)i=0L−1​ of positive semidefinite complex d×dd\times dd×d matrices, and all real p,qp,qp,q satisfying 1≤q<p1\le q<p1≤q<p, the following inequality holds in the extended real numbers:

ℓ([Sp(∏i=0L−1Ci1/p)]p)≤U(t↦bq/p(t) ℓ([Sq(∏i=0L−1Ci(1+it)/q)]q)).\ell\left(\left[S_p\left(\prod_{i=0}^{L-1}C_i^{1/p}\right)\right]^p\right) \le \mathcal U\left( t\mapsto b_{q/p}(t)\, \ell\left(\left[S_q\left(\prod_{i=0}^{L-1}C_i^{(1+it)/q}\right)\right]^q\right) \right).ℓ([Sp​(i=0∏L−1​Ci1/p​)]p)≤U(t↦bq/p​(t)ℓ([Sq​(i=0∏L−1​Ci(1+it)/q​)]q)).

Products are in increasing index order; for a positive semidefinite AAA, AzA^zAz replaces every positive eigenvalue λ\lambdaλ by exp⁡(zlog⁡λ)\exp(z\log\lambda)exp(zlogλ) and every zero eigenvalue by 000. For s>0s>0s>0,

Ss(B)=(Re⁡Tr⁡[cfc⁡ ⁣(u↦us/2,B∗B)])1/s,ba(t)=sin⁡(πa)2a(cosh⁡(πt)+cos⁡(πa)).S_s(B)= \left(\operatorname{Re}\operatorname{Tr} \left[\operatorname{cfc}\!\left(u\mapsto u^{s/2},B^*B\right)\right]\right)^{1/s}, \qquad b_a(t)=\frac{\sin(\pi a)} {2a\bigl(\cosh(\pi t)+\cos(\pi a)\bigr)}.Ss​(B)=(ReTr[cfc(u↦us/2,B∗B)])1/s,ba​(t)=2a(cosh(πt)+cos(πa))sin(πa)​.

Here ℓ(x)=log⁡x\ell(x)=\log xℓ(x)=logx when x>0x>0x>0, and ℓ(x)=−∞\ell(x)=-\inftyℓ(x)=−∞ when x≤0x\le0x≤0; for an extended-real-valued function fff, U(f)\mathcal U(f)U(f) 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 0<q/p<10<q/p<10<q/p<1, but permit singular or zero matrices CiC_iCi​, so the extended logarithms need not be finite.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me