Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dirac: a magnetic monopole forces charge quantization

Proved
ElementaryCharge.dirac_monopole_forces_quantization

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

mathematical-physicsquantization

Dirac's 1931 argument, in its algebraic form. Suppose a magnetic monopole of nonzero magnetic charge ggg exists, and that every electric charge qqq in a collection QQQ satisfies Dirac's quantization condition qg=nℏ/2qg = n\hbar/2qg=nℏ/2 for some integer nnn depending on qqq. Then every charge in QQQ is an integer multiple of the single fixed quantum ℏ/(2g)\hbar/(2g)ℏ/(2g): the charge spectrum is quantized. The physical derivation of the condition is outside the statement; what is asserted is that the condition forces quantization.

Preamble
import Mathlib
import Definitions.Def_elementary_charge_si_constants
Formal statement
namespace ElementaryCharge

theorem dirac_monopole_forces_quantization (Q : Set ℝ) (g hbar : ℝ) (hg : g ≠ 0)
    (hdirac : ∀ q ∈ Q, ∃ n : ℤ, q * g = n * (hbar / 2)) :
    ∀ q ∈ Q, ∃ n : ℤ, q = n * (hbar / (2 * g)) := by sorry

end ElementaryCharge
Source
"Elementary charge", Wikipedia, https://en.wikipedia.org/wiki/Elementary_charge (uploaded PDF revision). Sections: "As a unit"; "Quantization"; "Lack of fractional charges"; "In terms of the Avogadro constant and Faraday constant"; "From the Josephson and von Klitzing constants"; "CODATA method".
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — NON-BLIND: same agent that drafted the statements, not an independent auditor

⚠ NOT INDEPENDENT TESTIMONY — NON-BLIND READ-BACK. This text was written by the same agent that drafted this Lean statement, at the explicit instruction of the proposal owner. It is not the testimony of an independent auditor with fresh context: its author knew the source material, the informal statement and the drafting intent while writing it, which is exactly the knowledge a blind read-back is supposed to exclude. It therefore carries none of the evidential weight of a blind read-back and must not be counted as one. A blind, independent audit of this item is still outstanding.

The claim is: let QQQ be an arbitrary set of real numbers, and let ggg and ℏ\hbarℏ be arbitrary real numbers with g≠0g \neq 0g=0. Suppose that

for every q∈Q there exists an integer n with q⋅g=n⋅ℏ2.\text{for every } q \in Q \text{ there exists an integer } n \text{ with } q\cdot g = n\cdot\frac{\hbar}{2}.for every q∈Q there exists an integer n with q⋅g=n⋅2ℏ​.

Then

for every q∈Q there exists an integer m with q=m⋅ℏ2g.\text{for every } q \in Q \text{ there exists an integer } m \text{ with } q = m\cdot\frac{\hbar}{2g}.for every q∈Q there exists an integer m with q=m⋅2gℏ​.

The integers nnn and mmm are existentially quantified separately for each element qqq, so different elements may use different integers; the statement does not claim that a single integer works for all of QQQ, nor that the map q↦nq \mapsto nq↦n is injective, nor that every integer is realised.

Edge cases the quantifiers silently admit: QQQ may be empty, in which case both the hypothesis and the conclusion hold vacuously; ℏ\hbarℏ is unconstrained in sign and may be 000, in which case the hypothesis forces qg=0q g = 0qg=0, hence q=0q = 0q=0 for every q∈Qq \in Qq∈Q since g≠0g \neq 0g=0, and the conclusion holds with m=0m = 0m=0. Only g≠0g \neq 0g=0 is assumed, and it is needed for the division in the conclusion; no positivity is assumed anywhere, and nothing connects ℏ\hbarℏ or ggg to any fixed numerical value. Nothing in the statement asserts that such a ggg exists, or that any physical system satisfies the hypothesis: the content is the implication alone.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 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