Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Commuting unitary swivels make the powered Schatten objective nonincreasing

Open
QAlgorithms.Papers.Independent.Intakethird100.P91.swivelMonotonicity

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. Let VC\mathcal V_CVC​ be the set of all tuples of full-space unitaries (V1,…,VL)(V_1,\ldots,V_L)(V1​,…,VL​) satisfying ViCi=CiViV_iC_i=C_iV_iVi​Ci​=Ci​Vi​ for every iii. For every pair of finite real exponents 1≤q≤p1\le q\le p1≤q≤p, both displayed maxima are attained and

max⁡V∈VC∥C11/pV1⋯CL1/pVL∥pp≤max⁡W∈VC∥C11/qW1⋯CL1/qWL∥qq.\max_{V\in\mathcal V_C}\left\|C_1^{1/p}V_1\cdots C_L^{1/p}V_L\right\|_p^p \le \max_{W\in\mathcal V_C}\left\|C_1^{1/q}W_1\cdots C_L^{1/q}W_L\right\|_q^q.V∈VC​max​​C11/p​V1​⋯CL1/p​VL​​pp​≤W∈VC​max​​C11/q​W1​⋯CL1/q​WL​​qq​.

This is the monotonicity of the optimized powered norm, including singular and zero factors.

Formalization Note The theorem asserts greatest elements of the two explicitly constructed sets of objective values and compares them. Greatest-element membership records attainment; there is no default real supremum.

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 1, Eq.(5), arXiv:1610.01262v1, PDF p.3 (abstract p.1).
For every finite real 1 <= q <= p, both maxima are attained and the
p-objective is at most the q-objective. IsGreatest includes attainment,
so this states literal maxima, rather than an unattained supremum bound.
The dimension and sequence are nonzero; matrices may be singular or zero
and need not have trace one. Positive powers use the support-zero convention. -/
theorem swivelMonotonicity
    (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) :
    ∃ mp mq : ℝ,
      IsGreatest (swivelValues C p) mp ∧
      IsGreatest (swivelValues C q) mq ∧ mp ≤ mq := 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 1, Eq.(5); abstract p.1
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 numbers p,qp,qp,q satisfying 1≤q≤p1\le q\le p1≤q≤p, there exist real numbers mp,mqm_p,m_qmp​,mq​ such that mpm_pmp​ is an attained greatest value of

[Sp(∏i=0L−1Ci1/pVi)]p\left[S_p\left(\prod_{i=0}^{L-1}C_i^{1/p}V_i\right)\right]^p[Sp​(i=0∏L−1​Ci1/p​Vi​)]p

over all families of unitary matrices ViV_iVi​ satisfying CiVi=ViCiC_iV_i=V_iC_iCi​Vi​=Vi​Ci​, mqm_qmq​ is an attained greatest value of the analogous expression with ppp replaced by qqq, and mp≤mqm_p\le m_qmp​≤mq​. “Attained greatest value” means both that the number belongs to the indicated set of values and that every value in that set is at most that number. Products are in increasing index order. For s>0s>0s>0,

Ss(B)=(Re⁡Tr⁡[cfc⁡ ⁣(t↦ts/2,B∗B)])1/s,S_s(B)= \left(\operatorname{Re}\operatorname{Tr} \left[\operatorname{cfc}\!\left(t\mapsto t^{s/2},B^*B\right)\right]\right)^{1/s},Ss​(B)=(ReTr[cfc(t↦ts/2,B∗B)])1/s,

and Ci1/sC_i^{1/s}Ci1/s​ is obtained spectrally by replacing each positive eigenvalue λ\lambdaλ with exp⁡((log⁡λ)/s)\exp((\log\lambda)/s)exp((logλ)/s) and each zero eigenvalue with 000. Singular and zero CiC_iCi​ are allowed, and the case p=qp=qp=q is included; d=0d=0d=0 and L=0L=0L=0 are excluded by the hypotheses.

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