Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The oscillator count misses 282828 and predicts the non-magic 404040

Proved
MagicNumberShellModel.misses_28_and_predicts_40

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

combinatoricsmathematical-physicsnuclear-shell-model

Let M={2,8,20,28,50,82,126}M = \{2, 8, 20, 28, 50, 82, 126\}M={2,8,20,28,50,82,126} be the seven most widely recognized magic numbers and let SNS_NSN​ be the harmonic-oscillator shell-filling count. Then both failures of the oscillator model recorded by the source hold:

  1. 28∈M28 \in M28∈M, yet SN≠28S_N \neq 28SN​=28 for every N≥0N \ge 0N≥0: the magic number 282828 is never a shell closure of the pure oscillator.
  2. S4=40S_4 = 40S4​=40, yet 40∉M40 \notin M40∈/M: the model predicts a closure at 404040 nucleons, which is not a magic number.

These are the two discrepancies that spin–orbit coupling was introduced to repair. The first claim quantifies over all NNN, so it is not a finite check: it needs the closed form for SNS_NSN​ together with its monotonicity in NNN.

Preamble
import Definitions.Def_magic_number_shell_model
Formal statement
namespace MagicNumberShellModel

theorem misses_28_and_predicts_40 :
    (28 ∈ magicNumbers ∧ ∀ N : ℕ, cumulativeCapacity N ≠ 28) ∧
      cumulativeCapacity 4 = 40 ∧ 40 ∉ magicNumbers := 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