Concavity of the weighted -norm in its weights
ProvedHlawkaSchatten.DiagonalConstruction.concaveOn_weightedNormLet be a finite index set, , and a fixed real vector. For a weight vector with every , define the weighted norm
Then, with fixed, the map is concave on the convex set of nonnegative weight vectors.
This concavity in the reweighting variable — rather than in — is the key convexity-analytic fact behind the three-coordinate reduction of the sharp diagonal construction. It lets a linear combination of such weighted norms, built from , , , and , be treated as a single concave objective on the space of nonnegative coordinate weights, so its minimizers can be analyzed by a sparse-minimizer argument rather than by direct case analysis on the ambient index set . Combining several such weighted norms this way — by summing them, or by a common nonnegative scalar multiple — again yields a concave function only because the combining coefficients are nonnegative; a negative coefficient would flip a concave summand to convex.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_WeightedCoordinates
import Mathlib.Analysis.Convex.SpecificFunctions.Pow
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.InnerProductSpace.Dual
import Mathlib.Analysis.Normed.Lp.PiLp
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
/-
Copyright (c) 2026 Ezzeri Esa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ezzeri Esa
-/
/-! # Concavity under common coordinate reweighting -/
variable {ι : Type*} [Fintype ι]
open HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalConstruction.concaveOn_weightedNorm {p : ℝ} (hp : 1 < p) (x : ι → ℝ) :
ConcaveOn ℝ {w : ι → ℝ | ∀ i, 0 ≤ w i} (weightedNorm p x) := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.