Disjoint Copy-Block Square-Sum Bound
ProvedFunctionalInequalities.Analysis.Tensor.sum_sq_blocks_le_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This is a finite-dimensional Hilbert–Schmidt counting estimate, corresponding to the disjoint-copy-block estimate used after (112) in Bizeul–Klartag–Lehec, Proposition 7.1.
Let and be finite types, let , and let
Then the entries indexed by the disjoint blocks form a subfamily of all entries, and therefore
The statement is a technical injectivity-and-counting lemma for block decompositions.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis.Tensor. Shown in its original module context. Proof omitted.
theorem sum_sq_blocks_le
{d : ℕ} (hd : 0 < d) (A : (Fin d → Option (κ × ι)) → ℝ) :
∑ i : κ, ∑ j : Fin d → ι, A (fun k => some (i, j k)) ^ 2 ≤ ∑ J, A J ^ 2
Module navigation
Module: Analysis/Tensor/Coordinate.
Previous: norm_le_four_pow_mul_norm_symmetrize.
Source excerpt, lines 153–155 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Tensor_Coordinate
variable {ι κ : Type*}
variable [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
Formal statement
theorem FunctionalInequalities.Analysis.Tensor.sum_sq_blocks_le_readable
{d : ℕ} (hd : 0 < d) (A : (Fin d → Option (κ × ι)) → ℝ) :
∑ i : κ, ∑ j : Fin d → ι, A (fun k => some (i, j k)) ^ 2 ≤ ∑ J, A J ^ 2 := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Tensor/Coordinate.lean#L151-L177 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Tensor.Coordinate`, declaration `FunctionalInequalities.Analysis.Tensor.sum_sq_blocks_le`; the repository is private at upload time).