Block-diagonal Schatten embedding and contractive pinching
ProvedQAlgorithms.Papers.Independent.Support21.P15.schatten_blockDiagonalLet and let be integers. Write for the complex matrices with Schatten quasi-norm . The complex-linear map is injective and satisfies
For , deleting the off-diagonal blocks defines a complex-linear projection onto the range of this same inclusion, with for every matrix . Thus this range is 1-complemented in .
This identifies finite p-sums of Schatten blocks with concrete block-diagonal matrix subspaces. Formalization Note The target matrix rows and columns are indexed by ; the Schatten formula is reused from the pinned accepted library.
import Definitions.Def_QAlgorithms_Papers_Independent_Support21_P15
noncomputable section
open scoped BigOperators
open Filter
namespace QAlgorithms.Papers.Independent.Support21.P15
/-- Unnumbered block-diagonal observation, arXiv:math/0307169v1, PDF p.14:
ell_p^n(S_p^m) embeds isometrically into S_p^(nm), with a contractive projection
onto that same range when p≥1. The Schatten size is the accepted all-matrix
trace-of-power formula, not the ambient entrywise matrix norm. -/
theorem schatten_blockDiagonal (p : ℝ) (hp : 0 < p)
(n m : ℕ) (hn : 1 ≤ n) (hm : 1 ≤ m) :
Function.Injective (schattenBlockInclusion n m) ∧
(∀ x : Fin n → Matrix (Fin m) (Fin m) ℂ,
QAlgorithms.Papers.Independent.Information100.P50.schattenNorm (ENNReal.ofReal p)
(schattenBlockInclusion n m x) =
finiteLpSize p
(QAlgorithms.Papers.Independent.Information100.P50.schattenNorm (ENNReal.ofReal p)) x) ∧
(1 ≤ p →
(schattenBlockProjection n m).comp (schattenBlockProjection n m) =
schattenBlockProjection n m ∧
LinearMap.range (schattenBlockProjection n m) =
LinearMap.range (schattenBlockInclusion n m) ∧
∀ x : Matrix (Fin n × Fin m) (Fin n × Fin m) ℂ,
QAlgorithms.Papers.Independent.Information100.P50.schattenNorm (ENNReal.ofReal p)
(schattenBlockProjection n m x) ≤
QAlgorithms.Papers.Independent.Information100.P50.schattenNorm (ENNReal.ofReal p) x) := by sorry
end QAlgorithms.Papers.Independent.Support21.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real and integers , define, for each finite square complex matrix ,
where is the conjugate transpose and the matrix power is defined by continuous functional calculus using the real function . Let send a family of matrices to the matrix with entry at and zero between distinct blocks, and let retain precisely those same-block entries of any matrix indexed by . The theorem asserts that is injective and
for every such family . In addition, if , then , the ranges of and coincide, and for every matrix of the indicated size. For , this last conjunction is only asserted conditionally on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.