Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Subluminal speeds are closed under relativistic velocity addition

Proved
SpeedOfLight.velAdd_lt_light_speed

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

analysismathematical-physicsspecial-relativity

Let c>0c > 0c>0 and let u,vu, vu,v be speeds with ∣u∣<c|u| < c∣u∣<c and ∣v∣<c|v| < c∣v∣<c. Then their relativistic sum is again strictly subluminal:

∣u+v1+uv/c2∣<c.\left| \frac{u+v}{1 + uv/c^2} \right| < c .​1+uv/c2u+v​​<c.

Hence no finite chain of subluminal boosts ever attains the speed ccc; the open interval (−c,c)(-c, c)(−c,c) is closed under ⊕c\oplus_c⊕c​. The inequality is strict on both sides, and the conclusion is stated for the absolute value, so it covers velocities of either sign.

Preamble
import Mathlib
import Definitions.Def_SpeedOfLight_kinematics
open Filter Topology
Formal statement
namespace SpeedOfLight

theorem velAdd_lt_light_speed (c u v : ℝ) (hc : 0 < c) (hu : |u| < c) (hv : |v| < c) :
    |velAdd c u v| < c := by sorry

end SpeedOfLight
Source
Speed of light, Wikipedia (PDF supplied by the proposal owner), sections 'Invariance of c and the Lorentz factor' (Lorentz factor gamma = 1/sqrt(1 - v^2/c^2), diverging as v -> c), 'Synthesis of space and time' (Lorentz interval), and 'Mass and massless particles' (kinetic energy (gamma - 1) m c^2; c unattainable for positive rest mass). https://en.wikipedia.org/wiki/Speed_of_light
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the statement author; non-blind

Disclosure — this read-back is NOT blind and NOT independent. It was written by the same agent that drafted this Lean statement, at the explicit instruction of the proposal owner, with full sight of the source material and of the intended meaning. It is an author's restatement of the code, not independent testimony, and must not be mistaken for an independent audit.

Fix three real numbers ccc, uuu, vvv and assume 0<c0 < c0<c, ∣u∣<c|u| < c∣u∣<c and ∣v∣<c|v| < c∣v∣<c. The conclusion is the strict inequality

∣u+v1+uvc2∣  <  c,\left|\frac{u+v}{1 + \dfrac{uv}{c^{2}}}\right| \;<\; c,​1+c2uv​u+v​​<c,

with ordinary real division and the usual absolute value; the hypotheses are exactly −c<u<c-c < u < c−c<u<c and −c<v<c-c < v < c−c<v<c together with positivity of ccc. Under these hypotheses ∣uv∣<c2|uv| < c^{2}∣uv∣<c2, so the denominator is nonzero and no junk value from division by zero is involved. The bound is strict, so the boundary cases ∣u∣=c|u| = c∣u∣=c or ∣v∣=c|v| = c∣v∣=c are outside the statement, as are all c≤0c \le 0c≤0. The degenerate instance u=v=0u = v = 0u=v=0 is included and reads 0<c0 < c0<c.

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