Colour-loss averaging under pointwise domination (L) (Erdős 624)
ProvedErdos624.colour_loss_mean_boundcombinatoricserdos-problems
If for all in a finite type and , then . This is the averaging step in the colour-loss bound for clipping.
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 colour_loss_mean_bound {α : Type*} [Fintype α]
(ℓ d : α → ℝ) (E c : ℝ)
(hℓ : ∀ a, ℓ a ≤ d a)
(hd : ∑ a : α, d a ≤ (E + c) * Fintype.card α) :
∑ a : α, ℓ a ≤ (E + c) * Fintype.card α := 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.