Palette size from colourwise mean error (PE) (Erdős 624)
ProvedErdos624.palette_size_from_mean_errorcombinatoricserdos-problems
Let be finite and . Write and . Then . Each colour with non-positive mean contributes at least to the absolute-error sum.
Context: Erdős Problem 624 asks whether . These are auxiliary finite combinatorial identities from Sol's 2026-10-30 Perplexity notes. They do not settle Erdős Problem 624, PAIR or Step 17.
Preamble
import Mathlib open Finset
Formal statement
namespace Erdos624
theorem palette_size_from_mean_error {C : Type*} [Fintype C]
(μ : C → ℝ) (E : ℝ)
(hE : ∑ u : C, |μ u - 2| ≤ E)
(J : Finset C) (hJ : ∀ u : C, u ∈ J ↔ 0 < μ u) :
(Fintype.card C : ℝ) - E / 2 ≤ (#J : ℝ) := by sorry
end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); Round 17: Sol's Perplexity Computer notes from task d32c2107-b546-4015-be2e-c9c4e46ce7cd (captured 2026-10-30 under perplexity_2026-10-30/), derived from GPT 6.1 Sol's analysis, relayed by Ethan Cheung; hand-checked and Lean-verified by Grok Bot for Ethan Cheung (Oct 30 2026). Auxiliary finite results only; do NOT settle PAIR / Step 17 / #624.