Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The radial Mazur map is an isometry of Schatten norms on individual operators

Proved
HlawkaSchatten.norm_radialMazurHilbertMap

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

hlawka-schattenisometrymazur-mapschatten-norms

Let E,FE,FE,F be finite-dimensional complex inner-product spaces, let p>0p>0p>0, and let T:E→FT:E\to FT:E→F be a complex-linear map. Write

∥T∥p=(∑jσj(T)p)1/p\|T\|_p=\left(\sum_j\sigma_j(T)^p\right)^{1/p}∥T∥p​=(j∑​σj​(T)p)1/p

for the Schatten ppp-quantity (schattenPNorm), where σj(T)\sigma_j(T)σj​(T) are the singular values. This is a norm for p≥1p\ge1p≥1 and a quasi-norm for 0<p<10<p<10<p<1.

The radial Mazur map Ψp\Psi_pΨp​ is built as follows. At T=0T=0T=0, set Ψp(0)=0\Psi_p(0)=0Ψp​(0)=0. Otherwise, normalize TTT to the Schatten-ppp power sphere by setting U=∥T∥p−1TU=\|T\|_p^{-1}TU=∥T∥p−1​T, apply the rectangular Mazur map at exponent ppp to UUU, and rescale its image by ∥T∥p\|T\|_p∥T∥p​. Record that operator by its column coordinates in a fixed orthonormal basis of EEE, giving a vector Ψp(T)\Psi_p(T)Ψp​(T) in a finite-dimensional Hilbert space. The theorem states that this construction preserves the size of each operator:

∥Ψp(T)∥=∥T∥p,\|\Psi_p(T)\|=\|T\|_p,∥Ψp​(T)∥=∥T∥p​,

where the norm on the left is the Hilbert-space norm.

This pointwise identity supplies the radii used in later comparisons of Schatten deficits with Hilbert-space deficits. It asserts no preservation of distances between two different operators. The map is generally nonlinear: sums of images and images of sums must be distinguished when forming those deficits.

Preamble
import Definitions.Def_HlawkaSchatten_Final
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.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
-/

/-!
# Dimension-independent Hlawka constants for Schatten norms

This file removes the unit-sphere normalization from the variational
comparison and performs the final Hilbert-space Hlawka transfer.
-/


open scoped InnerProductSpace

variable {E F : Type*}
  [NormedAddCommGroup E] [InnerProductSpace ℂ E] [FiniteDimensional ℂ E]
  [NormedAddCommGroup F] [InnerProductSpace ℂ F] [FiniteDimensional ℂ F]

open HlawkaSchatten
Formal statement
theorem HlawkaSchatten.norm_radialMazurHilbertMap {p : ℝ} (hp : 0 < p)
    (T : E →ₗ[ℂ] F) :
    ‖radialMazurHilbertMap p T‖ = schattenPNorm p T := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/Final.lean#L75-L96
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Oct 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me