Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

There are 2N+12N+12N+1 states with energy up to ENE_NEN​

Proved
ParticleInARing.energy_le_card

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

analysismathematical-physicsquantum-mechanics

Let ℏ,m,R\hbar, m, Rℏ,m,R be positive reals and let NNN be a natural number. Then exactly 2N+12N + 12N+1 integers nnn satisfy En≤ENE_n \le E_NEn​≤EN​:

#{n∈Z  :  n2ℏ22mR2≤N2ℏ22mR2}=2N+1.\#\left\{ n \in \mathbb{Z} \;:\; \frac{n^2\hbar^2}{2mR^2} \le \frac{N^2\hbar^2}{2mR^2} \right\} = 2N + 1 .#{n∈Z:2mR2n2ℏ2​≤2mR2N2ℏ2​}=2N+1.

This is the source's count of the states with energies up to the level indexed by nnn; together with the two spin orientations of an electron it gives the 2×(2N+1)=4N+22 \times (2N+1) = 4N + 22×(2N+1)=4N+2 electrons of Hückel's rule.

Preamble
import Mathlib
import Definitions.Def_ParticleInARing_model
Formal statement
namespace ParticleInARing

theorem energy_le_card (hbar m R : ℝ) (hhbar : 0 < hbar) (hm : 0 < m) (hR : 0 < R) (N : ℕ) :
    {n : ℤ | energy hbar m R n ≤ energy hbar m R N}.ncard = 2 * N + 1 := by sorry

end ParticleInARing
Source
Wikipedia, "Particle in a ring", https://en.wikipedia.org/wiki/Particle_in_a_ring (oldid 1318339663), sections "Wave function" and "Energy eigenvalues"
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Disclosure — this read-back is not independent. It was written by the same agent that drafted the Lean statements of this proposal, at the explicit instruction of the proposal owner, and not by a separate auditor working blind from the Lean code alone. It is therefore not independent testimony: the author already knew what each statement was intended to say, so it cannot be relied on to expose a mismatch between intent and formalization in the way a blind read-back can. Please read it as an author's rendering of the code, and audit the Lean statements directly.

Let ℏ\hbarℏ, mmm and RRR be real numbers with ℏ>0\hbar > 0ℏ>0, m>0m > 0m>0 and R>0R > 0R>0, and let NNN be a natural number (so N≥0N \ge 0N≥0). With

Ek=k2ℏ22mR2(k∈Z),E_k = \frac{k^{2}\hbar^{2}}{2 m R^{2}} \qquad (k \in \mathbb{Z}),Ek​=2mR2k2ℏ2​(k∈Z),

consider the set of integers

S  =  { n∈Z  :  En≤EN },S \;=\; \{\, n \in \mathbb{Z} \;:\; E_{n} \le E_{N} \,\},S={n∈Z:En​≤EN​},

where the comparison is the order on R\mathbb{R}R, the bound uses the image of the natural number NNN in Z\mathbb{Z}Z, and the inequality is non-strict. The claim is that the cardinality of SSS, taken as a natural number (the convention being that this cardinality is 000 for an infinite set), equals

2N+1.2N + 1 .2N+1.

The case N=0N = 0N=0 is included and asserts that exactly one integer nnn satisfies En≤0E_n \le 0En​≤0. The statement counts integer labels nnn, not eigenfunctions or dimensions of eigenspaces, and says nothing about which integers these are.

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