Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A uniform coordinate bound for the finite ppp-norm

Proved
HlawkaSchatten.DiagonalConstruction.lpNorm_le_card_root_mul

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

coordinate-normshlawka-schattenlp-normnorm-estimateuniform-bound

Let ι\iotaι be a finite index set, EEE a normed additive group, p>0p>0p>0 a real exponent, and M≥0M\ge0M≥0 a real number. For x=(xi)i∈ιx=(x_i)_{i\in\iota}x=(xi​)i∈ι​ with ∥xi∥≤M\|x_i\|\le M∥xi​∥≤M at every index iii, the coordinate ppp-norm

lpNormp(x)=(∑i∈ι∥xi∥p)1/p\mathrm{lpNorm}_p(x)=\Big(\sum_{i\in\iota}\|x_i\|^p\Big)^{1/p}lpNormp​(x)=(i∈ι∑​∥xi​∥p)1/p

satisfies

lpNormp(x)  ≤  ∣ι∣1/p M,\mathrm{lpNorm}_p(x) \;\le\; |\iota|^{1/p}\, M,lpNormp​(x)≤∣ι∣1/pM,

where ∣ι∣|\iota|∣ι∣ is the cardinality of ι\iotaι.

This turns a uniform bound on every individual coordinate into a bound on the whole vector's ppp-norm, with the cardinality factor ∣ι∣1/p|\iota|^{1/p}∣ι∣1/p that is exactly attained when every coordinate saturates the bound MMM. It belongs to the same foundational layer of coordinate-norm bounds as positive-definiteness and, once p≥1p\ge1p≥1, the triangle inequality for lpNormp\mathrm{lpNorm}_plpNormp​.

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

/-!
# Coordinate norms for the diagonal construction

The explicit finite power sum keeps coordinate arguments independent of
the exponent-indexed `PiLp` type. Its norm laws are inherited from `PiLp`.
-/


variable {ι E : Type*} [Fintype ι] [NormedAddCommGroup E]

open HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.lpNorm_le_card_root_mul {p M : ℝ} (hp : 0 < p) (hM : 0 ≤ M)
    (x : ι → E) (hx : ∀ i, ‖x i‖ ≤ M) :
    lpNorm p x ≤ (Fintype.card ι : ℝ) ^ (1 / p) * M := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/Basic.lean#L109-L122
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