Marked k-face nonempty-subset footprint (G-core) (Erdős 624)
ProvedErdos624.shadow_footprint_lowercombinatoricserdos-problems
If , then . This is the exact incidence count underlying the shadow footprint lower bound for marked faces.
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 shadow_footprint_lower {α : Type*} [DecidableEq α]
(P : Finset α) (k : ℕ) (B : Finset (Finset α))
(hB : B ⊆ P.powersetCard k) :
∑ Y ∈ B, (2 ^ #Y - 1) = #B * (2 ^ k - 1) := 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.