Choquet-Bruhat–Geroch: unique maximal development
OpenWeakCosmicCensorship.choquet_bruhat_gerochEvery asymptotically flat vacuum initial data set has a maximal future development, and it is unique up to isometry: there exists a development into which every other development embeds by a smooth isometry preserving the initial surface (). This is the global existence-and-uniqueness theorem of the Einstein initial-value problem, obtained by gluing the local Choquet-Bruhat solutions via the domain-of-dependence property.
It supplies the object the conjecture talks about — "the maximal future development" — and is the first milestone of the attack path.
Formalization Note. Uniqueness is stated as: any two maximal developments are isometric via an embedding preserving the initial surface. The maximal future development of the source is represented by the maximal globally hyperbolic development.
import Mathlib import Definitions.Def_scc_coordinate_framework import Definitions.Def_wcc_initial_data import Definitions.Def_wcc_spacetime import Definitions.Def_wcc_complete_null_infinity open Set StrongCosmicCensorship
namespace WeakCosmicCensorship
theorem choquet_bruhat_geroch (h k : Field3) (hd : IsAFInitialData h k) :
∃ D : Development h k, IsMaximalDevelopment h k D ∧
∀ D' : Development h k, IsMaximalDevelopment h k D' →
∃ F : Coords → Coords,
MapsTo F D'.U D.U ∧ InjOn F D'.U ∧ ContDiffOn ℝ (⊤ : ℕ∞) F D'.U ∧
(∀ x ∈ D'.U, ∀ v w : Coords,
gip D'.g x v w = gip D.g (F x) ((jac F x).mulVec v) ((jac F x).mulVec w)) ∧
(∀ x : Coords3, F (D'.ι x) = D.ι x) := by sorry
end WeakCosmicCensorshipRead-back
What the Lean code literally says, in plain math · claude (drafting agent — NON-INDEPENDENT blind pass; not a separate auditor)
NON-INDEPENDENT READ-BACK. Written by the same agent that drafted the Lean, as a literal rendering of the code only. It is NOT the independent sub-agent testimony required by the skill; an independent auditor (references/mission_auditor.md) should re-read the code before submission.
The theorem choquet_bruhat_geroch takes h k : Field3 with hd : IsAFInitialData h k and concludes: there exists D : Development h k with IsMaximalDevelopment h k D, and for every D' : Development h k that is also maximal there exists F : Coords → Coords with MapsTo F D'.U D.U, InjOn F D'.U, ContDiffOn ℝ ⊤ F D'.U, the isometry identity gip D'.g x v w = gip D.g (F x) (jac F x · v) (jac F x · w) for x∈D'.U, and F (D'.ι x) = D.ι x for all x.