Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Equivariance of Subset Sums

Proved
FunctionalInequalities.Analysis.Tensor.sum_powersetCard_image_eq_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is an equivariance identity for subset sums.

Let Ω\OmegaΩ be a type, let VVV be a real inner-product space, let ρ\rhoρ be a permutation representation by linear isometries, let ggg be a permutation, and let TTT assign a vector T(F)T(F)T(F) to each finite subset FFF. Assume

ρ(g)T(F)=T(g(F))\rho(g)T(F)=T(g(F))ρ(g)T(F)=T(g(F))

for every finite subset FFF. Then for every finite subset QQQ and natural number kkk,

∑F⊆g(Q)∣F∣=kT(F)=ρ(g)(∑F⊆Q∣F∣=kT(F)).\sum_{\substack{F\subseteq g(Q)\\|F|=k}}T(F) =\rho(g)\left(\sum_{\substack{F\subseteq Q\\|F|=k}}T(F)\right).F⊆g(Q)∣F∣=k​∑​T(F)=ρ(g)​F⊆Q∣F∣=k​∑​T(F)​.

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.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Tensor_Symmetrization

variable {Ω : Type*} [Fintype Ω] [DecidableEq Ω]
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
omit [Fintype Ω]
Formal statement

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
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Tensor/Symmetrization.lean#L907-L928 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Tensor.Symmetrization`, declaration `FunctionalInequalities.Analysis.Tensor.sum_powersetCard_image_eq`; the repository is private at upload time).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me