Exact capacity decomposition for deletion clipping (C) (Erdős 624)
ProvedErdos624.clipping_capacity_decompositioncombinatoricserdos-problems
For naturals with , one has the exact identity . This is the ℕ-form of the capacity split used for deletion-only 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 clipping_capacity_decomposition (cap raw newRaw minimal : ℕ)
(h1 : minimal ≤ newRaw) (h2 : newRaw ≤ raw) (h3 : raw ≤ cap) :
cap - minimal = (cap - raw) + (raw - newRaw) + (newRaw - minimal) := 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.