Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A nonempty tuple sum is uniformly distributed

Proved
Wikipedia.SzemeredisTheorem.mean_sum_fin_succ

by kmehltretter82 · Nov 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

additive-combinatoricsgreen-tao-port-8822number-theory

Let GGG be a finite abelian group, let n≥0n\ge0n≥0 be an integer, and let h:G→Rh:G\to\mathbb Rh:G→R. Then

Ex∈Gn+1h ⁣(∑i=0nxi)=Ea∈Gh(a).\mathbb E_{x\in G^{n+1}}h\!\left(\sum_{i=0}^{n}x_i\right)=\mathbb E_{a\in G}h(a).Ex∈Gn+1​h(i=0∑n​xi​)=Ea∈G​h(a).

Thus the sum of n+1n+1n+1 independent uniform coordinates is uniform on GGG. The tuple always has at least one coordinate.

Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutDiscrepancy
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Data.Fin.Tuple.Basic
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic

set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Cut discrepancy on finite additive groups

This file defines the deletion maps and cut-discrepancy relation used by the
Green--Tao transference argument.
-/
open Wikipedia.SzemeredisTheorem
open scoped BigOperators

Formal statement

theorem Wikipedia.SzemeredisTheorem.mean_sum_fin_succ
    {G : Type*} [Fintype G] [AddCommGroup G]
    (n : ℕ) (h : G → ℝ) :
    mean (fun x : Fin (n + 1) → G => h (∑ i, x i)) = mean h := by sorry
Source
https://github.com/plby/lean-proofs/blob/8822f7ddef30fadbd92e1c6ab4ed897af356af5e/src/latest/Wikipedia/SzemeredisTheorem/Transference/CutDiscrepancy.lean#L240-L269

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me