Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Changing the reference frame I: boosting to the rest frame

Proved
NoHair.rest_frame_exists

by Lucas · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

black-holesgeneral-relativitylorentzian-geometrymathematical-physics

Let P∈R4P\in\mathbb R^4P∈R4 be a future-directed timelike 4-momentum: η(P,P)=PTηP<0\eta(P,P)=P^{\mathsf T}\eta P<0η(P,P)=PTηP<0 and P0>0P^0>0P0>0, with η=diag(−1,1,1,1)\eta=\mathrm{diag}(-1,1,1,1)η=diag(−1,1,1,1). Then there is a proper orthochronous Lorentz transformation Λ\LambdaΛ (ΛTηΛ=η\Lambda^{\mathsf T}\eta\Lambda=\etaΛTηΛ=η, det⁡Λ=1\det\Lambda=1detΛ=1, Λ00≥1\Lambda^0{}_0\ge1Λ00​≥1) with

ΛP=(−η(P,P),0,0,0).\Lambda P=\big(\sqrt{-\eta(P,P)},0,0,0\big).ΛP=(−η(P,P)​,0,0,0).

This is the step of the source's frame argument that sets the linear momentum to zero.

Preamble
import Mathlib
import Definitions.Def_NoHair_kerrNewman

open scoped ContDiff Manifold BigOperators
open Set Matrix
Formal statement
namespace NoHair

/-- **Milestone (changing the reference frame I): rest frame.** Every future-directed timelike
4-momentum `P` is carried by a proper orthochronous Lorentz transformation to
`(√(-η(P,P)), 0, 0, 0)`. -/
theorem rest_frame_exists (P : Fin 4 → ℝ) (hP : P ⬝ᵥ (minkowski *ᵥ P) < 0) (hP0 : 0 < P 0) :
    ∃ Λ : Matrix (Fin 4) (Fin 4) ℝ, Λᵀ * minkowski * Λ = minkowski ∧ Λ.det = 1 ∧
      1 ≤ Λ 0 0 ∧ Λ *ᵥ P = ![Real.sqrt (-(P ⬝ᵥ (minkowski *ᵥ P))), 0, 0, 0] := by
  sorry

end NoHair
Source
Wikipedia, "No-hair theorem" (revision oldid=1353599195), https://en.wikipedia.org/w/index.php?title=No-hair_theorem&oldid=1353599195
Read-back

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

Non-blind read-back. This read-back was written by the same agent that drafted the Lean statements (Aristotle, by Harmonic), with full knowledge of the source and of the intended meaning. It is not independent testimony and must not be treated as a blind audit; reviewers should compare it against the Lean code themselves or obtain an independent read-back.

Let P:{0,1,2,3}→RP:\{0,1,2,3\}\to\mathbb RP:{0,1,2,3}→R satisfy P⋅(ηP)<0P\cdot(\eta P)<0P⋅(ηP)<0 (i.e. −P02+P12+P22+P32<0-P_0^2+P_1^2+P_2^2+P_3^2<0−P02​+P12​+P22​+P32​<0) and P0>0P_0>0P0​>0, where η=diag(−1,1,1,1)\eta=\mathrm{diag}(-1,1,1,1)η=diag(−1,1,1,1). Then there is a real 4×44\times44×4 matrix Λ\LambdaΛ with ΛTηΛ=η\Lambda^{\mathsf T}\eta\Lambda=\etaΛTηΛ=η, det⁡Λ=1\det\Lambda=1detΛ=1, 1≤Λ001\le\Lambda_{00}1≤Λ00​, and ΛP=(−P⋅ηP,0,0,0)\Lambda P=\big(\sqrt{-P\cdot\eta P},0,0,0\big)ΛP=(−P⋅ηP​,0,0,0) (matrix–vector product).

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 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