Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Existence and uniqueness of the maximal common development of two developments

Statement

Assume Countable Choice and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let (M,g,N,j,ψ) and (M′,g′,N′,j′,ψ′) be developments of the same data in the sense of Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (a), with Σ:=j(Σ). Then there exist U∗⊆M and ψ∗:U∗→M′ such that:

(a) (U∗,ψ∗) is a common subdevelopment of M and M′ in the sense of Common subdevelopments, maximal common developments and corresponding boundary points clause (a);

(b) for every common subdevelopment (U,φ) of M and M′ one has U⊆U∗ and ψ∗∣U=φ; in particular (U∗,ψ∗) is a maximal common development in the sense of clause (b) of that definition, and it contains j(Σ);

(c) uniqueness: if (U†,ψ†) also satisfies (a) and (b), then U†=U∗ and ψ†=ψ∗.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, two developments (M,g,N,j,ψ), (M′,g′,N′,j′,ψ′) of the same data, with Σ=j(Σ) Cauchy in both.

[L1]

Common subdevelopments form a set: a common subdevelopment is a pair (U,φ) with U⊆M and φ:U→M′; since U is an element of the power set of M and the graph of φ is an element of the power set of M×M′, the collection of all common subdevelopments is a set by separation (The power set P(x)={ z:z⊆x }, The Axiom Schema of Separation: for each formula φ, ∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ)))).

[L2]

Restriction and gluing of development data: each Uα is open, is a development of the same data with the restricted fields, and ψα is a development embedding, hence in particular an isometric immersion fixing the data and the time orientation (Common subdevelopments, maximal common developments and corresponding boundary points clause (a), Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clauses (b)-(c)).

[L3]

Agreement on overlaps is Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps clause (c). Nonemptiness follows from the local complete-data uniqueness theorem for the selected fixed model: the admissible fixed coupled-model theorem Local geometric development for a fixed covariant Einstein-matter model with complete constrained data (including its vacuum instance), Local Einstein-scalar evolution: smooth constrained data admit a local development, unique up to a data-fixing isometry, Local evolution for a strict barotropic perfect fluid: smooth constrained data admit a development, unique up to a data-fixing isometry or a specified independent reduction, including the tilted nonnegative dust theorem Local Einstein-dust evolution: smooth constrained data with prescribed velocity admit a smooth local development, unique up to a data-fixing isometry. With their Countable Choice and Dependent Choice assumptions, two developments agree near the entire initial surface by a future data-fixing isometry matching all matter fields. Apply the intrinsic Cauchy-neighborhood construction Local Cauchy neighborhoods in a conically bounded product chart to a smaller common isometry collar, and transport that neighborhood by the isometry. Its source and image have the entire initial surface Cauchy, so this restriction is a common subdevelopment.

[L4]

Portion inextendibility and Cauchy property: if a causal curve is inextendible in U∗, then for every component J of its preimage under one of the sets Uα the restriction is inextendible in Uα (A maximal connected portion of an inextendible causal curve inside an open subset is inextendible there); and every causal curve inextendible in Uα meets Σ in exactly one parameter value (Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (a)5).

[L5]

Two crossings in the ambient development: if a causal curve in M met Σ in two distinct parameter values, then by the segment-extension clause the compact segment between them lies on an inextendible causal curve of M meeting Σ twice, contradicting that Σ is a Cauchy set of M (Convergent causal ends are extendible, maximal geodesics have no limit, and Cauchy sets are acausal clause (c), Spacelike hypersurfaces, acausal sets, Cauchy sets, domains of dependence and Cauchy horizons clause (c), Causal curves, chronological and causal reachability, and inextendibility).

[L6]

Local differential geometry on U∗: a map whose restriction to an open cover of its domain is a smooth isometric immersion is a smooth isometric immersion, and the field equations of Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (a)4 are local, so they hold on U∗; injectivity of a data-fixing isometric immersion of developments follows from A data-fixing isometric immersion of developments is injective, hence a development embedding; uniqueness of data-fixing embeddings clause (b).

Proof

technique · direct
1.1L1L3construct

(The union and the patched map.) Let {(Uα,ψα)}α∈A be the set of all common subdevelopments, which exists by [L1] and is nonempty by [L3]. Put U∗:=⋃α∈AUα, an open subset of M containing j(Σ); define ψ∗:U∗→M′ by ψ∗(p):=ψα(p) for p∈Uα. This is well defined by [L3]: if p∈Uα∩Uβ, then ψα(p)=ψβ(p).

2.1step 1.1L2L4L5L6algebra

(U∗ is a development with Cauchy surface Σ.) Let γ:I→U∗ be a future causal curve inextendible in U∗, choose t0∈I with γ(t0)∈Uα0, and let J be the connected component of γ−1[Uα0] containing t0. By [L4] the restriction γ∣J is inextendible in Uα0 and therefore meets Σ in exactly one parameter value of J⊆I; hence γ meets Σ at least once. If it met Σ at two distinct parameter values, then by [L5] applied in M this would contradict that Σ is a Cauchy set of M; hence γ meets Σ in exactly one parameter value, and the same holds for past causal curves by the time reverse. Thus (U∗,g∣U∗,N∣U∗,j,ψ∣U∗) is a development of the same data: it is a time-oriented smooth Lorentzian four-manifold with j(Σ) a spacelike embedded hypersurface (as U∗ is open in M), the field equations hold by [L6], the induced data are those of j and ψ, and Σ is Cauchy by the above.

3.1step 2.1L2L6algebra

(ψ∗ is a data-fixing development embedding.) By [L2] each ψα is an isometric immersion fixing the data and the time orientation; these are local properties, so ψ∗ is a smooth isometric immersion with ψ∗∘j=j′ and gψ∗(p)′(dψp∗Np,Nψ∗(p)′)<0 for every p∈U∗, matching every matter field by [L2]. Hence ψ∗ is a data-fixing isometric immersion of the development U∗ into M′; by [L6] it is injective and therefore a data-fixing development embedding. So (U∗,ψ∗) is a common subdevelopment, which is clause (a).

4.1step 1.1step 3.1algebra

(Universality.) Every (Uα,ψα) satisfies Uα⊆U∗ by definition of the union, and ψ∗∣Uα=ψα by definition of ψ∗; in particular the pair (U∗,ψ∗) satisfies the universal property of clause (b), and j(Σ)⊆U∗ by step 1.1.

5.1step 4.1algebra∎

(Uniqueness.) Let (U†,ψ†) also satisfy (a) and (b). Since (U†,ψ†) is itself one of the common subdevelopments, (b) applied to (U†,ψ†) gives U†⊆U∗; conversely (b) for (U∗,ψ∗) applied to (U†,ψ†) gives U∗⊆U†. Hence U†=U∗, and then for every p∈U∗ the two maps agree because p lies in some common subdevelopment (Uα,ψα) and both ψ† and ψ∗ restrict to ψα there. This is clause (c).

Remarks

The construction is Sbierski's; the only structural ingredients are the agreement of the maps on overlaps (Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps clause (c)), the fact that a maximal connected portion of an inextendible curve inside one member remains inextendible there (A maximal connected portion of an inextendible causal curve inside an open subset is inextendible there), and the acyclicity of "two crossings of a Cauchy set" (Convergent causal ends are extendible, maximal geodesics have no limit, and Cauchy sets are acausal clause (c)). No Zorn's lemma and no selection of representatives of isometry classes is used.

Depends on

Dependency tree · 2 levels

Sources