Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 — Counting subsets with a forced prefix

Proved
PermanentStars.Counting.lemma_5_2

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-complexitydynamic-programmingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1permanent

Let N≥0N\ge0N≥0 and r≥1r\ge1r≥1 be integers, and let ccc be real with 1<c<21<c<21<c<2 and c(c−1)r−1≥1c(c-1)^{r-1}\ge1c(c−1)r−1≥1. For S⊆[N]S\subseteq[N]S⊆[N], let pref⁡(S)\operatorname{pref}(S)pref(S) be the largest initial-segment length contained in SSS. Then

#{S⊆[N]:∣S∣≤rpref⁡(S)}≤(N+1)cN.\#\{S\subseteq[N]:|S|\le r\operatorname{pref}(S)\}\le(N+1)c^N.#{S⊆[N]:∣S∣≤rpref(S)}≤(N+1)cN.

The empty subset and the full prefix are included. This bounds the covered-set choices of the small-star dynamic program.

Differences from the source:

  • encoding: cardinality bars around the subset family in (19) → Finset.card of all subsets satisfying the prefix condition; reason: finite subsets of Fin N represent exactly the source family; the PDF already displays cardinality bars, which the text extraction loses
  • encoding: initial segment [p] → indices i in Fin N with i.val<p; reason: this is the same ordered prefix after shifting indices by one
Preamble
import Definitions.Def_PermanentStars_Counting_Partitions
Formal statement
namespace PermanentStars.Counting

/-- Lemma 5.2, (19), p.10; braces are a cardinality, as in its counting proof. -/
theorem lemma_5_2 (N r : ℕ) (hr : 1 ≤ r) (c : ℝ)
    (hc : 1 < c) (hc2 : c < 2) (hprod : 1 ≤ c * (c - 1) ^ (r - 1)) :
    (prefixCount N r : ℝ) ≤ (N + 1 : ℝ) * c ^ N := by sorry

end PermanentStars.Counting
Source
Radu Curticapean, STOC 2027 submission #1331 (October 2026), Lemma 5.2, PDF/printed p.10
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

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