Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A quantized charge spectrum is closed under composition

Proved
ElementaryCharge.charge_quantization_closure

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

mathematical-physicsquantization

If every charge in a collection SSS is an integer multiple of a quantum q0q_0q0​, then so is every charge obtainable from SSS by addition and negation — that is, the additive subgroup of R\mathbb{R}R generated by SSS is contained in q0Zq_0\mathbb{Z}q0​Z. This is the algebraic content of the source's observation that although quarks carry charges in multiples of e/3e/3e/3, every stable grouping of them carries an integer multiple of that same quantum.

Preamble
import Mathlib
import Definitions.Def_elementary_charge_si_constants
Formal statement
namespace ElementaryCharge

theorem charge_quantization_closure (S : Set ℝ) (q0 : ℝ)
    (hS : ∀ s ∈ S, ∃ n : ℤ, s = n * q0) :
    (AddSubgroup.closure S : Set ℝ) ⊆ (AddSubgroup.zmultiples q0 : Set ℝ) := 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 SSS be an arbitrary set of real numbers and q0q_0q0​ an arbitrary real number. Suppose that

for every s∈S there exists an integer n with s=n⋅q0.\text{for every } s \in S \text{ there exists an integer } n \text{ with } s = n\cdot q_0 .for every s∈S there exists an integer n with s=n⋅q0​.

Then, writing ⟨S⟩\langle S\rangle⟨S⟩ for the additive subgroup of R\mathbb{R}R generated by SSS — the smallest set containing SSS that is closed under addition and negation and contains 000 — the underlying set of ⟨S⟩\langle S\rangle⟨S⟩ satisfies

⟨S⟩⊆{ k⋅q0:k∈Z }.\langle S\rangle \subseteq \{\,k\cdot q_0 : k \in \mathbb{Z}\,\} .⟨S⟩⊆{k⋅q0​:k∈Z}.

The inclusion is asserted in one direction only: it is not claimed that the two sets are equal, and indeed they need not be (for example S={2q0}S = \{2q_0\}S={2q0​} generates only the even multiples). The integer witnessing membership is chosen per element.

Edge cases: SSS may be empty, in which case ⟨S⟩={0}\langle S\rangle = \{0\}⟨S⟩={0} and the inclusion holds; q0q_0q0​ may be 000, in which case the hypothesis says every element of SSS is 000 and the right-hand side is {0}\{0\}{0}. No positivity, nonzeroness, finiteness or discreteness is assumed of SSS or q0q_0q0​, and neither is tied to a fixed numerical value from this mission.

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