Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2 — Λ=0\Lambda=0Λ=0: many vacuum solutions spherically symmetric at infinity

Proved
FlatlyFoliated.lemma2_many_vacua_zero_lambda

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

elliptic-pdegeneral-relativitymathematical-physics

For Λ=0\Lambda=0Λ=0 there is a sequence (ωn,ηn)n∈N(\omega_n,\eta_n)_{n\in\mathbb N}(ωn​,ηn​)n∈N​ of smooth vacuum solutions of the FFR equations (34)–(35) (with μ=0\mu=0μ=0, J=0J=0J=0) such that every ηn>0\eta_n>0ηn​>0, every (ωn,ηn)(\omega_n,\eta_n)(ωn​,ηn​) is spherically symmetric at infinity, and no two distinct members are related by an overall positive constant: for m≠nm\ne nm=n there is no c>0c>0c>0 with (ωm,ηm)=c (ωn,ηn)(\omega_m,\eta_m)=c\,(\omega_n,\eta_n)(ωm​,ηm​)=c(ωn​,ηn​).

So uniqueness of the vacuum, up to rescaling of ttt, fails when Λ=0\Lambda=0Λ=0.

Formalization Note "Many" is formalized as infinitely many pairwise inequivalent solutions.

Preamble
import Mathlib
import Definitions.Def_FlatlyFoliatedRelativity_basic

open scoped ContDiff
Formal statement
namespace FlatlyFoliated

/-- Lemma 2: for `Λ = 0` there are many (here: infinitely many, pairwise not related by a
positive rescaling) smooth vacuum solutions that are spherically symmetric at infinity. -/
theorem lemma2_many_vacua_zero_lambda :
    ∃ sol : ℕ → (R3 → R3) × (R3 → ℝ),
      (∀ n, ContDiff ℝ ∞ (sol n).1 ∧ ContDiff ℝ ∞ (sol n).2 ∧ (∀ x, 0 < (sol n).2 x) ∧
        FFREquations 0 0 0 (sol n).1 (sol n).2 ∧ SphSymmAtInfty (sol n).1 (sol n).2) ∧
      ∀ m n, m ≠ n → ¬ ∃ c : ℝ, 0 < c ∧ (sol m).1 = c • (sol n).1 ∧ (sol m).2 = c • (sol n).2 := by sorry

end FlatlyFoliated
Source
Bray, Hamm, Hirsch, Wheeler, Zhang, Flatly Foliated Relativity, arXiv:1911.00967v2, https://arxiv.org/abs/1911.00967, p. 20, Lemma 2 (eqs. (103)–(108))
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me