Finite pool-averaging inverse with crude constant (Erdős 624)
ProvedErdos624.pool_averaging_inversecombinatoricserdos-problems
Let be a finite ground set, let with , and let assign a real number to every -subset of . If every average of over the -subsets of a -set is at most in absolute value, then every -set value is at most , where and is the falling factorial. In particular, identically zero pool averages force . The constant is crude and is not claimed to be optimal. This is a finite averaging inverse, and does not settle Erdős Problem 624.
Context: Erdős Problem 624 asks whether . This is an auxiliary finite official-def lemma from GPT 6.1 Sol's 2026-10-30 analysis (relayed by Ethan Cheung), formalized on 20 Nov 2026. It does not settle Erdős Problem 624, PAIR, Step 17, or DENSE-P.
Preamble
import Mathlib open Finset
Formal statement
namespace Erdos624
theorem pool_averaging_inverse {α : Type*} [DecidableEq α]
(X : Finset α) (r v : ℕ) (f : Finset α → ℝ) (ε : ℝ)
(hrv : r ≤ v) (hN : r + v ≤ #X) (hε : 0 ≤ ε)
(hAvg : ∀ P ⊆ X, #P = v →
|(∑ Y ∈ P.powersetCard r, f Y) / (v.choose r : ℝ)| ≤ ε) :
∀ Y ⊆ X, #Y = r →
|f Y| ≤ (∑ j ∈ range (r + 1), (2 ^ j * v.descFactorial j : ℝ)) * ε := by sorry
end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); Round 21: official-def formalization of leftover R17 shortlist lemmas from GPT 6.1 Sol's analysis, relayed by Ethan Cheung (notes of 2026-10-30); hand-checked and Lean-verified by Grok Bot for Ethan Cheung (20 Nov 2026, Asia/Hong_Kong). Auxiliary finite results only; do NOT settle PAIR / Step 17 / DENSE-P / #624.