Vacuum initial data on : constraints and asymptotic flatness
Definitionwcc_initial_dataThis file builds the initial-data side of the vacuum Einstein initial-value problem in a single coordinate chart on .
A point is an element of ; the metric and the second fundamental form are fields of real matrices. From the partial derivatives (Fréchet derivatives in the coordinate directions, with Lean's junk value where a function is not differentiable) the file defines the Christoffel symbols, Riemann tensor, Ricci tensor and scalar curvature of , the covariant derivative , the trace and the squared norm .
The vacuum constraint equations are
written pointwise as HamiltonianConstraint and MomentumConstraint.
Asymptotic flatness is the weighted class: weightedSize3 k δ F is the extended nonnegative real , which is exactly when the decay fails. IsAFInitialData h k asserts that are smooth, is positive definite, is symmetric, the two constraints hold, and weightedSize3 3 1 (h−δ) and weightedSize3 3 2 k are finite — i.e. and with matching derivative decay.
These definitions are the reusable initial-data layer for the mission; every later statement imports them.
Formalization Note. Derivatives use fderiv/iteratedFDeriv with Lean's total-function junk values; smoothness hypotheses make them agree with the classical derivatives on the data. The weighted size lives in ENNReal so that an unbounded supremum is rather than a junk real number, and finiteness is the decay condition.
import Mathlib
open scoped Matrix
open Set
namespace WeakCosmicCensorship
abbrev Coords3 := Fin 3 → ℝ
abbrev Field3 := Coords3 → Matrix (Fin 3) (Fin 3) ℝ
noncomputable def dir3 (a : Fin 3) : Coords3 := Pi.single a 1
noncomputable def pd3 (a : Fin 3) (f : Coords3 → ℝ) (x : Coords3) : ℝ :=
fderiv ℝ f x (dir3 a)
def euclidean3 : Field3 := fun _ => 1
noncomputable def ginv3 (h : Field3) (x : Coords3) : Matrix (Fin 3) (Fin 3) ℝ := (h x)⁻¹
noncomputable def gip3 (h : Field3) (x : Coords3) (u v : Coords3) : ℝ :=
∑ a : Fin 3, ∑ b : Fin 3, h x a b * u a * v b
def IsRiemannian3 (h : Field3) : Prop :=
∀ x : Coords3, ∀ v : Coords3, v ≠ 0 → 0 < gip3 h x v v
noncomputable def christoffel3 (h : Field3) (a b c : Fin 3) (x : Coords3) : ℝ :=
(1 / 2 : ℝ) * ∑ d : Fin 3, ginv3 h x a d *
(pd3 b (fun y => h y d c) x + pd3 c (fun y => h y b d) x - pd3 d (fun y => h y b c) x)
noncomputable def riemann3 (h : Field3) (a b c d : Fin 3) (x : Coords3) : ℝ :=
pd3 c (christoffel3 h a d b) x - pd3 d (christoffel3 h a c b) x
+ (∑ e : Fin 3, christoffel3 h a c e x * christoffel3 h e d b x)
- (∑ e : Fin 3, christoffel3 h a d e x * christoffel3 h e c b x)
noncomputable def ricci3 (h : Field3) (b d : Fin 3) (x : Coords3) : ℝ :=
∑ a : Fin 3, riemann3 h a b a d x
noncomputable def scalarCurvature3 (h : Field3) (x : Coords3) : ℝ :=
∑ b : Fin 3, ∑ d : Fin 3, ginv3 h x b d * ricci3 h b d x
noncomputable def covDeriv3 (h k : Field3) (a b c : Fin 3) (x : Coords3) : ℝ :=
pd3 a (fun y => k y b c) x
- ∑ d : Fin 3, christoffel3 h d a b x * k x d c
- ∑ d : Fin 3, christoffel3 h d a c x * k x b d
noncomputable def tr3 (h k : Field3) (x : Coords3) : ℝ :=
∑ a : Fin 3, ∑ b : Fin 3, ginv3 h x a b * k x a b
noncomputable def kNormSq3 (h k : Field3) (x : Coords3) : ℝ :=
∑ a : Fin 3, ∑ b : Fin 3, ∑ c : Fin 3, ∑ d : Fin 3,
ginv3 h x a c * ginv3 h x b d * k x a b * k x c d
def HamiltonianConstraint (h k : Field3) : Prop :=
∀ x : Coords3, scalarCurvature3 h x + (tr3 h k x) ^ 2 - kNormSq3 h k x = 0
def MomentumConstraint (h k : Field3) : Prop :=
∀ x : Coords3, ∀ b : Fin 3,
(∑ a : Fin 3, ∑ c : Fin 3, ginv3 h x a c * covDeriv3 h k c a b x)
- pd3 b (fun y => tr3 h k y) x = 0
def IsSymmetric3 (k : Field3) : Prop :=
∀ x : Coords3, ∀ a b : Fin 3, k x a b = k x b a
noncomputable def weightedSize3 (k : ℕ) (δ : ℝ) (F : Field3) : ENNReal :=
∑ n : Fin (k + 1), ∑ a : Fin 3, ∑ b : Fin 3,
⨆ x : Coords3,
ENNReal.ofReal (Real.rpow (1 + ‖x‖) (δ + ((n : ℕ) : ℝ))) *
ENNReal.ofReal ‖iteratedFDeriv ℝ (n : ℕ) (fun y => F y a b) x‖
structure IsAFInitialData (h k : Field3) : Prop where
smooth_h : ∀ a b : Fin 3, ContDiff ℝ (⊤ : ℕ∞) (fun x => h x a b)
smooth_k : ∀ a b : Fin 3, ContDiff ℝ (⊤ : ℕ∞) (fun x => k x a b)
riemannian : IsRiemannian3 h
symmetric : IsSymmetric3 k
hamiltonian : HamiltonianConstraint h k
momentum : MomentumConstraint h k
decay_h : weightedSize3 3 1 (fun x => h x - euclidean3 x) < ⊤
decay_k : weightedSize3 3 2 k < ⊤
end WeakCosmicCensorship
Read-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.
Literal content of the file wcc_initial_data, namespace WeakCosmicCensorship.
It fixes Coords3 = Fin 3 → ℝ and Field3 = Coords3 → Matrix (Fin 3) (Fin 3) ℝ. pd3 a f x is the Fréchet derivative of f at x in the a-th coordinate direction (junk 0 if not differentiable). euclidean3 is the constant identity matrix; ginv3 h x is the matrix inverse of h x (zero matrix if singular); gip3 h x u v = Σ_{a,b} h x a b · u a · v b. IsRiemannian3 h means gip3 h x v v > 0 for every x and every nonzero v.
christoffel3, riemann3, ricci3, scalarCurvature3 are the usual coordinate formulas built from pd3 and ginv3. covDeriv3 h k a b c x = ∂ₐ k_{bc} − Γ^d_{ab} k_{dc} − Γ^d_{ac} k_{bd}. tr3 h k x = Σ ginv3 h x a b · k x a b; kNormSq3 h k x = Σ ginv3 h x a c · ginv3 h x b d · k x a b · k x c d.
HamiltonianConstraint h k : for all x, scalarCurvature3 h x + (tr3 h k x)² − kNormSq3 h k x = 0. MomentumConstraint h k : for all x and b, Σ_{a,c} ginv3 h x a c · covDeriv3 h k c a b x − pd3 b (tr3 h k) x = 0. IsSymmetric3 k : k x a b = k x b a.
weightedSize3 k δ F : ENNReal = Σ_{n : Fin (k+1)} Σ_{a,b} ⨆ x, ofReal((1+‖x‖)^(δ+n)) · ofReal ‖iteratedFDeriv ℝ n (F_{ab}) x‖.
IsAFInitialData h k is a structure asserting: every component of h and of k is ContDiff ℝ ⊤; IsRiemannian3 h; IsSymmetric3 k; HamiltonianConstraint h k; MomentumConstraint h k; weightedSize3 3 1 (h − euclidean3) < ⊤; weightedSize3 3 2 k < ⊤.