Distance From Partial Symmetrization
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_sub_symField_le_modularfunctional-inequalitieskls-conjecturekls-modularlog-concave
This formalizes BKL Lemma 3.3, Equation (44), p. 12.
Let be a field with indices and let . Let be the average over permutations of the first positions, and let swap positions and . Then
The squared norm is the field quantity normSq, and the sum is over the finite set of admissible adjacent positions.
This is the combinatorial symmetrization estimate used in the approximate symmetry of Poisson iterates.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_sub_symField_le_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_PoissonIterate_Permutation
noncomputable section
open MeasureTheory Finset
open FunctionalInequalities.Analysis.Tensor
open scoped Classical
section
namespace FunctionalInequalities
end FunctionalInequalities
open FunctionalInequalities
section
namespace FunctionalInequalities.KLS
end FunctionalInequalities.KLS
open FunctionalInequalities FunctionalInequalities.KLS
section
namespace FunctionalInequalities.KLS.LogConcave
end FunctionalInequalities.KLS.LogConcave
open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave
section
namespace FunctionalInequalities.KLS.LogConcave.PoissonIterate
end FunctionalInequalities.KLS.LogConcave.PoissonIterate
open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave FunctionalInequalities.KLS.LogConcave.PoissonIterate
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MeasurableSpace V]
{ν : ProbabilityMeasure V} {k : ℕ}
Formal statement
theorem FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_sub_symField_le_modular {q : ℕ} (hq : q ≤ k) (u : Field ν k) :
normSq (u - symField q u) ≤
(q : ℝ) ^ 4 * ∑ ℓ ∈ univ.filter (fun ℓ : Fin k => ℓ.val + 1 < q),
normSq (u - permField (Equiv.swap ℓ (finRotate k ℓ)) u) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Permutation.lean#L311-L338 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Permutation`, declaration `FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_sub_symField_le`; the repository is private at upload time).