Equivariance of Subset Sums
ProvedFunctionalInequalities.Analysis.Tensor.sum_powersetCard_image_eq_readableThis is an equivariance identity for subset sums.
Let be a type, let be a real inner-product space, let be a permutation representation by linear isometries, let be a permutation, and let assign a vector to each finite subset . Assume
for every finite subset . Then for every finite subset and natural number ,
The result permits subset sums over different blocks to be compared by applying a representing permutation.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis.Tensor. Shown in its original module context. Proof omitted.
theorem sum_powersetCard_image_eq (ρ : Equiv.Perm Ω →* (V ≃ₗᵢ[ℝ] V)) (g : Equiv.Perm Ω)
(T : Finset Ω → V) (hT : ∀ F, ρ g (T F) = T (F.image g)) (Q : Finset Ω) (k : ℕ) :
∑ F ∈ (Q.image g).powersetCard k, T F = ρ g (∑ F ∈ Q.powersetCard k, T F)
Module navigation
Module: Analysis/Tensor/Symmetrization.
Previous: sum_fixingOutside_eq_smul_sum · Next: norm_le_choose_mul_norm_blockAverage.
Source excerpt, lines 910–912 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Tensor_Symmetrization
variable {Ω : Type*} [Fintype Ω] [DecidableEq Ω]
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
omit [Fintype Ω]
theorem FunctionalInequalities.Analysis.Tensor.sum_powersetCard_image_eq_readable (ρ : Equiv.Perm Ω →* (V ≃ₗᵢ[ℝ] V)) (g : Equiv.Perm Ω)
(T : Finset Ω → V) (hT : ∀ F, ρ g (T F) = T (F.image g)) (Q : Finset Ω) (k : ℕ) :
∑ F ∈ (Q.image g).powersetCard k, T F = ρ g (∑ F ∈ Q.powersetCard k, T F) := by sorry