Brown-Gabrielse invariance theorem:
ProvedPenningTrap.invariance_theoremThis is the invariance theorem of Brown and Gabrielse, Eq. (4) of the electron magnetic moment measurement.
Let be a real matrix that is symmetric (it is the Hessian of the electrostatic potential, divided by the mass) and traceless (Laplace's equation), let satisfy (the direction of the magnetic field), and let be the free-space cyclotron frequency. Suppose the real numbers are the eigenfrequencies of the trap, in the sense that
Then
equivalently in ordinary frequencies.
The force of the statement is what it does not assume: apart from symmetry and tracelessness, is arbitrary, so the potential may be tilted at any angle relative to the magnetic field and elliptically distorted to any degree. The three observed frequencies shift individually under such imperfections, but the sum of their squares does not move. This invariance is what allows the free-space cyclotron frequency to be recovered from an imperfect trap, and hence the electron magnetic moment to be measured to parts in .
Formalization Note. "The eigenfrequencies are " is formalized as the factorization identity above, valid for every real , which records the roots with multiplicity; no sign conditions are imposed on the three frequencies, and the conclusion involves only their squares.
import Mathlib import Definitions.Def_PenningTrap_model open Matrix
namespace PenningTrap
theorem invariance_theorem (K : Matrix (Fin 3) (Fin 3) ℝ) (hK : K.IsSymm) (hL : K.trace = 0)
(b : Fin 3 → ℝ) (hb : b ⬝ᵥ b = 1) (wc wbc wbz wbm : ℝ)
(hfac : ∀ w : ℝ, (modeMatrix K b wc w).det
= -(((w ^ 2 - wbc ^ 2) * (w ^ 2 - wbz ^ 2) * (w ^ 2 - wbm ^ 2) : ℝ) : ℂ)) :
wbc ^ 2 + wbz ^ 2 + wbm ^ 2 = wc ^ 2 := by sorry
end PenningTrapRead-back
What the Lean code literally says, in plain math · NOT INDEPENDENT - written by the drafting agent itself (Aristotle by Harmonic), not by a blind auditor
Disclosure — this read-back is NOT blind. 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 an independent auditor working from the code alone. It is therefore not independent testimony and must not be counted as an independence check: any misreading baked into the formalization is likely reproduced here verbatim. Please obtain a blind read-back from an independent auditor before relying on these statements.
Let be a real matrix subject to two hypotheses: it is symmetric, , and it is traceless, . Let be a real vector subject to . Let be arbitrary real numbers: no sign condition, no ordering, no distinctness, and no requirement that any of them be non-zero. Write
Hypothesis. For every real number ,
the right-hand side being a real number viewed as a complex number. This is a functional identity in , not an assertion at a single point: it says the three numbers are exactly the roots, with multiplicity, of the cubic in given by .
Conclusion.
Only squares occur in the conclusion, so the signs of and of are immaterial. Note that the claim is conditional on the factorization hypothesis: for data for which no such triple exists, the statement says nothing, and is vacuously satisfied. Nothing in this item by itself certifies that the hypothesis is ever satisfiable; a separate item in the proposal exhibits explicit data for which it holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.