Permutation Displacement From Adjacent Displacements
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.sqrt_normSq_sub_permField_le_of_adjacent_modularfunctional-inequalitieskls-conjecturekls-modularlog-concave
Let be a field with index positions and let . Suppose and every adjacent transposition of positions and with moves by at most in Hilbert–Schmidt norm:
Then every permutation that fixes all positions outside the first positions satisfies
The result is purely combinatorial and applies to arbitrary fields of classes; it does not use properties of the measure.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.sqrt_normSq_sub_permField_le_of_adjacent_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.sqrt_normSq_sub_permField_le_of_adjacent_modular {q : ℕ} (hq : q ≤ k) (u : Field ν k) {B : ℝ}
(hB0 : 0 ≤ B)
(hB : ∀ ℓ : Fin k, ℓ.val + 1 < q →
√(normSq (u - permField (Equiv.swap ℓ (finRotate k ℓ)) u)) ≤ B)
{σ : Equiv.Perm (Fin k)} (hσ : σ ∈ fixingOutside (slots k 0 q)) :
√(normSq (u - permField σ u)) ≤ (q : ℝ) ^ 2 * B := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Permutation.lean#L220-L270 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Permutation`, declaration `FunctionalInequalities.KLS.LogConcave.PoissonIterate.sqrt_normSq_sub_permField_le_of_adjacent`; the repository is private at upload time).