Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Splitting a finite tuple average into head and tail

Proved
Wikipedia.SzemeredisTheorem.mean_fin_cons

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

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

Let GGG be a finite set, let n≥0n\ge0n≥0 be an integer, and let F:Gn+1→RF:G^{n+1}\to\mathbb RF:Gn+1→R. Its normalized mean decomposes as

Ex∈Gn+1F(x)=Ea∈GEy∈GnF(a,y).\mathbb E_{x\in G^{n+1}}F(x)=\mathbb E_{a\in G}\mathbb E_{y\in G^n}F(a,y).Ex∈Gn+1​F(x)=Ea∈G​Ey∈Gn​F(a,y).

On the right, (a,y)(a,y)(a,y) is the tuple obtained by prepending aaa to the nnn-tuple yyy. The identity uses the source's normalized finite-mean convention and does not assume GGG is nonempty.

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 Mathlib.Algebra.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic

set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Products of independent finite means

The product of normalized averages over independent finite variables is the
normalized average over their product space.  This is the finite-probability
Fubini identity used when expanding products of generalized convolutions.
-/
open Wikipedia.SzemeredisTheorem
open scoped BigOperators

Formal statement

theorem Wikipedia.SzemeredisTheorem.mean_fin_cons
    {G : Type*} [Fintype G] {n : ℕ}
    (F : (Fin (n + 1) → G) → ℝ) :
    mean F =
      mean₂ (fun a : G => fun y : Fin n → G => F (Fin.cons a y)) := by sorry
Source
https://github.com/plby/lean-proofs/blob/8822f7ddef30fadbd92e1c6ab4ed897af356af5e/src/latest/Wikipedia/SzemeredisTheorem/Finite/ProductMean.lean#L25-L45

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