Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact capacity decomposition for deletion clipping (C) (Erdős 624)

Proved
Erdos624.clipping_capacity_decomposition

by Ethan Cheung Wang · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricserdos-problems

For naturals with minimal≤newRaw≤raw≤capminimal\le newRaw\le raw\le capminimal≤newRaw≤raw≤cap, one has the exact identity cap−minimal=(cap−raw)+(raw−newRaw)+(newRaw−minimal)cap-minimal=(cap-raw)+(raw-newRaw)+(newRaw-minimal)cap−minimal=(cap−raw)+(raw−newRaw)+(newRaw−minimal). This is the ℕ-form of the capacity split Δ′=K+D+T\Delta'=K+D+TΔ′=K+D+T used for deletion-only clipping.

Context: Erdős Problem 624 asks whether H(n)−log⁡2n→∞H(n)-\log_2 n\to\inftyH(n)−log2​n→∞. 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.

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