Entrywise Formula for Partial Symmetrization
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.symmetrize_apply_comp_cast_modularfunctional-inequalitieskls-conjecturekls-modularlog-concave
Let with , let be an -index coordinate tensor over an -element coordinate space, and let . Then the entry of the symmetrization over the first positions is the average over permutations of those positions, while the last positions remain fixed:
The equality includes the necessary cast from the equality and is an entrywise coordinate identity. It is used to expand symmetrized Taylor fields.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.symmetrize_apply_comp_cast_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_Taylor noncomputable section open MeasureTheory open FunctionalInequalities.Analysis.Semigroup FunctionalInequalities.Analysis.BakryEmery open FunctionalInequalities.Analysis.Tensor open scoped RealInnerProductSpace ContDiff 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 section Slots
Formal statement
theorem FunctionalInequalities.KLS.LogConcave.PoissonIterate.symmetrize_apply_comp_cast_modular {n N q r : ℕ} (h : N = q + r) (A : Coord n N)
(J : Fin (q + r) → Fin n) :
symmetrize n N q A (J ∘ Fin.cast h) =
(q.factorial : ℝ)⁻¹ * ∑ τ : Equiv.Perm (Fin q),
A (Fin.append (J ∘ Fin.castAdd r ∘ τ) (J ∘ Fin.natAdd q) ∘ Fin.cast h) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Taylor.lean#L199-L216 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Taylor`, declaration `FunctionalInequalities.KLS.LogConcave.PoissonIterate.symmetrize_apply_comp_cast`; the repository is private at upload time).