Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Closed form for the shell-filling count: SN=2(N+23)S_N = 2\binom{N+2}{3}SN​=2(3N+2​)

Proved
MagicNumberShellModel.cumulativeCapacity_eq

by LG · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsmathematical-physicsnuclear-shell-model

Let Cn=2 ∣Ln∣C_n = 2\,|L_n|Cn​=2∣Ln​∣ be the capacity of the oscillator shell at level nnn and let

SN  =  ∑n<NCnS_N \;=\; \sum_{n<N} C_nSN​=n<N∑​Cn​

be the number of nucleons needed to fill every shell of level strictly below NNN. Then for every N≥0N \ge 0N≥0

SN  =  2(N+23)  =  N(N+1)(N+2)3.S_N \;=\; 2\binom{N+2}{3} \;=\; \frac{N(N+1)(N+2)}{3}.SN​=2(3N+2​)=3N(N+1)(N+2)​.

The identity turns the shell-closure numbers from a running sum into a closed-form cubic, which is what makes global statements about the predicted sequence — such as which integers never occur in it — accessible.

Formalization Note. The statement is written as 2(N+23)2\binom{N+2}{3}2(3N+2​) rather than N(N+1)(N+2)/3N(N+1)(N+2)/3N(N+1)(N+2)/3 so that no natural-number division occurs. The case N=0N=0N=0 is included: both sides are 000.

Preamble
import Definitions.Def_magic_number_shell_model
Formal statement
namespace MagicNumberShellModel

theorem cumulativeCapacity_eq (N : ℕ) :
    cumulativeCapacity N = 2 * (N + 2).choose 3 := by sorry

end MagicNumberShellModel
Source
Magic number (physics), Wikipedia, section "Derivation" (the 3D harmonic oscillator paragraph: weak 3-compositions counted by stars and bars, factor 2 for spin, cumulative sums 2, 8, 20, 40), and section lead (list of the seven magic numbers 2, 8, 20, 28, 50, 82, 126). https://en.wikipedia.org/wiki/Magic_number_(physics)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Oct 8, 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