Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The exact capacity under a spike budget is the lower binomial sum.

Proved
NeuralCoding.SparseEnergyTradeoff.card_budgetCodebook

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

The exact capacity under a spike budget is the lower binomial sum.

theorem NeuralCoding.SparseEnergyTradeoff.card_budgetCodebook(N k : ℕ) :
    (budgetCodebook N k).card = ∑ j ∈ Finset.range (k + 1), N.choose j := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/SparseEnergyTradeoff.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Novelty/SparseEnergyTradeoff.lean
import Mathlib
import Definitions.Def_Novelty_NeuralCoding
import Definitions.Def_Novelty_SparseEnergyTradeoff

/-!
# Sparse neural coding: exact capacity and an energy–information bound

A binary pattern on `N` neurons has energy equal to its Hamming weight.  This
file studies the codebook consisting of all patterns using at most `k` spikes.
Its size is exactly the Hamming-ball volume

`∑ j ∈ range (k+1), N.choose j`.

For exactly `k` spikes, the number of concepts is `N.choose k`.  The central
energy theorem proves that this capacity is at most `N^k`; consequently its
information content per spike is at most `log₂ N`.  Thus fixed sparsity gives
polynomial raw capacity while information per unit energy grows only
logarithmically with population size.  The result also applies directly to a
one-percent budget by substituting `k = N / 100`.
-/

open NeuralCoding.SparseEnergyTradeoff

open Finset
open NeuralCoding
Formal statement
theorem NeuralCoding.SparseEnergyTradeoff.card_budgetCodebook(N k : ℕ) :
    (budgetCodebook N k).card = ∑ j ∈ Finset.range (k + 1), N.choose j := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Novelty/SparseEnergyTradeoff.lean#L33

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