Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The singular-value power sum of a diagonal operator

Proved
HlawkaSchatten.DiagonalConstruction.singularValuePowerSum_diagonal

by savarin · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

diagonal-operatorhlawka-schattenschatten-normsingular-values

For a finite index set ι\iotaι with decidable equality and d:ι→Cd:\iota\to\mathbb Cd:ι→C, let diagonalOperator(d)\mathrm{diagonalOperator}(d)diagonalOperator(d) be the C\mathbb CC-linear operator on the complex Euclidean space Cι\mathbb C^\iotaCι whose matrix, in the standard orthonormal basis, is diagonal with entries ddd. For a linear operator TTT between finite-dimensional complex inner-product spaces and a real exponent ppp, let

singularValuePowerSump(T)  :=  ∑kσk(T)p\mathrm{singularValuePowerSum}_p(T) \;:=\; \sum_k \sigma_k(T)^psingularValuePowerSump​(T):=k∑​σk​(T)p

be the sum of the ppp-th powers of the (finitely many nonzero) singular values σk(T)\sigma_k(T)σk​(T) of TTT.

For every p>0p>0p>0 and every d:ι→Cd:\iota\to\mathbb Cd:ι→C, this theorem shows

singularValuePowerSump(diagonalOperator(d))  =  ∑i∈ι∣di∣p.\mathrm{singularValuePowerSum}_p\bigl(\mathrm{diagonalOperator}(d)\bigr) \;=\; \sum_{i\in\iota} |d_i|^p.singularValuePowerSump​(diagonalOperator(d))=i∈ι∑​∣di​∣p.

This identifies the singular values of a diagonal operator with the moduli of its diagonal entries, at the level of ppp-th power sums. It is the step connecting a coordinate-vector proof of a Hlawka-type bound to the singular-value definition of the Schatten quantity used elsewhere.

Formalization Note. diagonalOperator(d)\mathrm{diagonalOperator}(d)diagonalOperator(d) denotes the linear map on Mathlib's EuclideanSpace ℂ ι, obtained from the diagonal matrix with entries ddd; the hypothesis p>0p>0p>0 is only what is needed for the power σk(T)p\sigma_k(T)^pσk​(T)p and the exponent p/2p/2p/2 used internally in the proof to be well-behaved, not for singularValuePowerSump\mathrm{singularValuePowerSum}_psingularValuePowerSump​ itself to be a norm-like quantity.

Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_DiagonalNorm
import Definitions.Def_HlawkaSchatten_SchattenNorm
import Mathlib.Analysis.Calculus.LHopital
import Mathlib.Analysis.Convex.Deriv
import Mathlib.Analysis.Convex.SpecificFunctions.Basic
import Mathlib.Analysis.InnerProductSpace.Adjoint
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.InnerProductSpace.Dual
import Mathlib.Analysis.InnerProductSpace.NormPow
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.InnerProductSpace.ProdL2
import Mathlib.Analysis.InnerProductSpace.SingularValues
import Mathlib.Analysis.InnerProductSpace.Trace
import Mathlib.Analysis.Normed.Lp.PiLp
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
import Mathlib.Data.Sign.Basic
import Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
import Mathlib.Topology.Compactification.OnePoint.Basic
import Mathlib.Topology.Instances.Sign

/-
Copyright (c) 2026 Ezzeri Esa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ezzeri Esa
-/

/-!
# Diagonal operators and coordinate power sums

This connects the coordinate proof to the singular-value Schatten norm
used in the publication boundary. The Gram operator has the coordinate
basis as an eigenbasis, with eigenvalues equal to squared entry norms.
-/


open scoped InnerProductSpace

variable {ι : Type*} [Fintype ι] [DecidableEq ι]

open HlawkaSchatten
open HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.singularValuePowerSum_diagonal {p : ℝ} (hp : 0 < p) (d : ι → ℂ) :
    singularValuePowerSum p (diagonalOperator d) = ∑ i, ‖d i‖ ^ p := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/DiagonalNorm.lean#L60-L74
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by marwahaha · Sep 30, 2026

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