Virial as a sum over pairs (Newton's third law)
ProvedVirialTheorem.virial_sum_pairsLet be positions and () be the force of particle on particle , satisfying Newton's third law for all (in particular ). With ,
This rewrites the virial as a sum over unordered pairs.
import Mathlib import Definitions.Def_virial_theorem_defs open Filter Topology
namespace VirialTheorem
theorem virial_sum_pairs {N : ℕ} (Fp : Fin N → Fin N → Space) (x : Fin N → Space)
(hanti : ∀ j k, Fp j k = -Fp k j) :
∑ k, inner ℝ (∑ j, Fp j k) (x k) =
∑ k, ∑ j ∈ Finset.univ.filter (fun j => j < k), inner ℝ (Fp j k) (x k - x j) := by sorry
end VirialTheoremRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - drafting agent, non-blind
Non-blind read-back. This read-back is not independent testimony. It was written by the same agent that drafted the Lean statements, with full knowledge of the source article and of the intended meaning. Reviewers must not treat it as a blind audit; an independent read-back should still be obtained before relying on it.
Let , let be given for every ordered pair of indices , and let . Assume for all (which in particular forces ). Then
where refers to the natural order on indices. No other conditions; the statement is purely algebraic at a single configuration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.