Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An ignorable (cyclic) coordinate has conserved conjugate momentum

Proved
ClassicalDynamics.ignorable_coordinate_momentum_conserved

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

classical-mechanicsconservation-lawsmathematical-physics

Tong, eq. (2.49). Suppose a smooth Lagrangian LLL on Rn\mathbb{R}^nRn satisfies ∂L/∂qj=0\partial L/\partial q_j = 0∂L/∂qj​=0 identically for some coordinate qjq_jqj​; such a coordinate is called ignorable or cyclic. Then along any smooth solution of Lagrange's equations the conjugate momentum

pj=∂L∂q˙jp_j = \frac{\partial L}{\partial \dot q_j}pj​=∂q˙​j​∂L​

is a constant of the motion, since Lagrange's equation for that coordinate reads p˙j=∂L/∂qj=0\dot p_j = \partial L/\partial q_j = 0p˙​j​=∂L/∂qj​=0.

Preamble
import Definitions.Def_ClassicalDynamics_core
Formal statement
namespace ClassicalDynamics

/-- Tong, eq. (2.49): the momentum conjugate to an ignorable (cyclic) coordinate
is a constant of the motion. -/
theorem ignorable_coordinate_momentum_conserved {n : ℕ} (L : Lagrangian n)
    (hL : IsSmoothLagrangian L) (j : Fin n)
    (hcyc : ∀ (t : ℝ) (x v : Fin n → ℝ), dLdq L j t x v = 0)
    (q : ℝ → Fin n → ℝ) (hq : ContDiff ℝ (⊤ : ℕ∞) q) (hmot : IsMotion L q) :
    IsConstantInTime (momentum L j q) := by sorry
end ClassicalDynamics
Source
D. Tong, Classical Dynamics, University of Cambridge Part II Mathematical Tripos, Michaelmas 2004/2005, https://www.damtp.cam.ac.uk/user/tong/dynamics.html, Section 2 (pp. 10-25), p. 23, eqs. (2.49)-(2.50)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — the drafting agent itself; see the notice above

Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements in this proposal, not by an independent blind auditor. Its author knew what the code was intended to say, so it cannot serve the usual purpose of catching a mismatch between intent and code. Treat it as an aid to reading the Lean, and obtain an independent blind read-back before relying on it during the audit.

Fix a natural number nnn, a Lagrangian L(t,q,v)L(t, q, v)L(t,q,v) on nnn-tuples of reals, a distinguished index j∈{0,…,n−1}j \in \{0, \dots, n-1\}j∈{0,…,n−1}, and a path q:R→Rnq : \mathbb{R} \to \mathbb{R}^nq:R→Rn. The hypotheses are:

  1. LLL is C∞C^\inftyC∞ jointly in (t,q,v)(t, q, v)(t,q,v);
  2. for every real ttt and all nnn-tuples x,vx, vx,v,
∂L∂qj(t,x,v)=0,\frac{\partial L}{\partial q_j}(t, x, v) = 0,∂qj​∂L​(t,x,v)=0,

where this is the derivative of y↦L(t,x[j↦y],v)y \mapsto L(t, x[j \mapsto y], v)y↦L(t,x[j↦y],v) at y=xjy = x_jy=xj​, i.e. the jjj-th coordinate is varied and everything else is frozen; 3. the path qqq is C∞C^\inftyC∞; 4. the path satisfies Lagrange's equations at every time and in every coordinate — for each index iii and each real ttt, s↦∂L∂q˙i(s,q(s),q˙(s))s \mapsto \frac{\partial L}{\partial \dot q_i}(s, q(s), \dot q(s))s↦∂q˙​i​∂L​(s,q(s),q˙​(s)) is differentiable at ttt with derivative ∂L∂qi(t,q(t),q˙(t))\frac{\partial L}{\partial q_i}(t, q(t), \dot q(t))∂qi​∂L​(t,q(t),q˙​(t)).

Note that hypothesis 2 is imposed only for the single index jjj, while hypothesis 4 is imposed for all indices.

The conclusion is that the function of time

pj(t)=∂L∂q˙j(t,q(t),q˙(t))p_j(t) = \frac{\partial L}{\partial \dot q_j}\big(t, q(t), \dot q(t)\big)pj​(t)=∂q˙​j​∂L​(t,q(t),q˙​(t))

— the derivative of y↦L(t,q(t),q˙(t)[j↦y])y \mapsto L(t, q(t), \dot q(t)[j \mapsto y])y↦L(t,q(t),q˙​(t)[j↦y]) at y=q˙j(t)y = \dot q_j(t)y=q˙​j​(t), where q˙\dot qq˙​ is the coordinatewise time derivative of the path — satisfies pj(t1)=pj(t2)p_j(t_1) = p_j(t_2)pj​(t1​)=pj​(t2​) for every pair of reals t1,t2t_1, t_2t1​,t2​: the same value at all times on the whole line.

The existence of the index jjj presupposes n≥1n \ge 1n≥1, so the statement is not instantiable at n=0n = 0n=0.

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

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