Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No-go: Galilean mechanics cannot host the full Maxwell system

Open
VaidyaFarina.no_go

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

electrodynamicsgalilean-covariancemathematical-physics

Main no-go theorem (the paper's conclusion). There is no field-independent transformation law for the charge and current sources that makes the full Maxwell system covariant under the Galilean boost forced by the Feynman–Dyson setup. Concretely, there do not exist maps R(ρ,j,v)R(\rho,j,v)R(ρ,j,v) and J(ρ,j,v)J(\rho,j,v)J(ρ,j,v) — functions of the source values and the boost velocity vvv alone, not of the fields — such that for every solution (E,H,ρ,j)(E,H,\rho,j)(E,H,ρ,j) of the full Maxwell system, the boosted fields E′=E+v×H, H′=HE'=E+v\times H,\ H'=HE′=E+v×H, H′=H together with the transformed sources ρ′=R(ρ,j,v), j′=J(ρ,j,v)\rho'=R(\rho,j,v),\ j'=J(\rho,j,v)ρ′=R(ρ,j,v), j′=J(ρ,j,v) (evaluated at the corresponding spacetime point) again satisfy the full Maxwell system. This is the precise sense in which "full Maxwell equations and Galilean mechanics are incompatible" (Vaidya–Farina, p. 266).

Preamble
import Mathlib
import Definitions.Def_vf_defs
Formal statement
namespace VaidyaFarina
theorem no_go :
  ¬ ∃ (R : ℝ → (Fin 3 → ℝ) → (Fin 3 → ℝ) → ℝ)
      (J : ℝ → (Fin 3 → ℝ) → (Fin 3 → ℝ) → (Fin 3 → ℝ)),
    ∀ (E H : ST → (Fin 3 → ℝ)) (rho : ST → ℝ) (j : ST → (Fin 3 → ℝ)) (v : Fin 3 → ℝ),
      FullMaxwell E H rho j →
      FullMaxwell (boostE v E H) (boostH v H)
        (fun p => R (rho (p.1 + p.2 • v, p.2)) (j (p.1 + p.2 • v, p.2)) v)
        (fun p => J (rho (p.1 + p.2 • v, p.2)) (j (p.1 + p.2 • v, p.2)) v) := by sorry
end VaidyaFarina
Source
A. Vaidya and C. Farina, Phys. Lett. A 153 (1991) 265-267, https://doi.org/10.1016/0375-9601(91)90940-A, p. 266, conclusion after eq. (19)

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