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.

A data-fixing isometric immersion of developments is injective, hence a development embedding; uniqueness of data-fixing embeddings

Statement

Retain the inherited Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)) of the Lorentzian-object and geodesic suppliers. 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(Σ) and Σ′:=j′(Σ). Let φ:M→M′ be a smooth map with φ∗(g′)=g, with gφ(p)′(dφpNp,Nφ(p)′)<0 for every p∈M, with φ∘j=j′ and φ∗ψ′=ψ (so φ is a future isometric immersion fixing the complete data and matching every matter field). Then:

(a) dφp:TpM→Tφ(p)M′ is an isomorphism for every p∈M;

(b) φ is injective, hence a diffeomorphism onto the open subset φ(M)⊆M′ and therefore a development embedding in the sense of Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (c);

(c) if M is connected and ψ1,ψ2:M→M′ are two such data-fixing isometric immersions, then ψ1=ψ2; in particular every data-fixing self-isometry of a connected development is the identity of M.

Facts & Assumptions

Given: Countable Choice, developments (M,g,N,j,ψ), (M′,g′,N′,j′,ψ′) of the same data and a data-fixing isometric immersion φ:M→M′ as in the statement.

[A1]

Countable Choice says that for every sequence (Xn)n∈N of nonempty sets there is a function f:N→⋃nXn with f(n)∈Xn for every n (The Axiom of Countable Choice (ACω)). It is inherited through the tangent-bundle smooth structure in Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model clause (c), Metric compatibility, torsion freedom and the metric-selected connection class, and the geodesic existence and uniqueness theorem The geodesic initial-value problem and the exponential map of the metric-selected connection ([L3] and its choice convention). No local discharge of these supplier assumptions is claimed. Only clause (b) of Convergent causal ends are extendible, maximal geodesics have no limit, and Cauchy sets are acausal and clauses (a)-(b) of Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps are used; their separately scoped Dependent Choice premises for the other clauses are not invoked.

[L1]

Cauchy data: Σ is a Cauchy set of M and Σ′ a Cauchy set of M′; φ∣Σ:Σ→Σ′ is the diffeomorphism j′∘j−1; every maximal geodesic of M with nonzero causal initial data is a causal curve that is inextendible in M, and it meets Σ in exactly one parameter value (Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (a), Spacelike hypersurfaces, acausal sets, Cauchy sets, domains of dependence and Cauchy horizons clause (c), Convergent causal ends are extendible, maximal geodesics have no limit, and Cauchy sets are acausal clause (b), Causal curves, chronological and causal reachability, and inextendibility clause (d)).

[L2]

Metric nondegeneracy and dimension: gp and gq′ are nondegenerate symmetric bilinear forms of signature (−,+,+,+) on four-dimensional tangent spaces; if v∈TpM satisfies dφpv=0 then gp(v,w)=gφ(p)′(0,dφpw)=0 for every w∈TpM, so v=0 by nondegeneracy (Lorentz forms of inertia (3,1,0) on a 4-dimensional real vector space, Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model clause (a)); consequently dφp is injective, and it is an isomorphism because both tangent spaces have dimension 4.

[L3]

Isometric immersions map geodesics to geodesics with velocity dφ(γ′). In source and target coordinates, step 1.1 of Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps gives ∂b∂cfα=Γdbc∂dfα−Γ′αβδ(f)∂bfβ∂cfδ. For a source coordinate geodesic x(t), substitution of x¨d=−Γdbcx˙bx˙c into the second derivative of f(x(t)) cancels the source terms and gives the target geodesic equation. Under [A1], The geodesic initial-value problem and the exponential map of the metric-selected connection clause (a) and proof step 3.1 supply the unique maximal target geodesic with prescribed value and velocity, and every geodesic with those data is its restriction. Timelike speed and time orientation remain constant along each geodesic by Covariant differentiation along curves: metric pairing, parallel transport and geodesic speed clause 3 and proof step 3.2.

[L4]

An isomorphism of tangent spaces gives a local diffeomorphism by The smooth inverse function theorem on manifolds.

[L5]

Future data-fixing development embeddings have identical initial differentials by Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps clause (b), and isometric immersions obey its connected-domain rigidity clause (a). The identity map satisfies Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (b).

Beyond the inherited Countable Choice of [A1], the argument makes only finite pointwise selections; it assumes neither Dependent Choice nor arbitrary-index Choice.

Proof

technique · direct
1.1L2L4algebra

(Reduction to injectivity at two points.) Let p,q∈M with φ(p)=φ(q)=:z. We show p=q. By [L2] the differential dφp is an isomorphism, so φ restricts to a diffeomorphism of some open neighbourhood V of p onto an open neighbourhood of z.

1.2A1L1L2L3choose

(Two geodesics through q and through p.) Choose a future-directed timelike vector u∈TqM. By [L1] and [L3] there is a maximal geodesic γ:Iγ→M of M with γ(0)=q, γ′(0)=u, which is a timelike curve, is inextendible in M, and meets Σ in exactly one parameter value τ0. Its image φ∘γ is a geodesic of M′ with (φ∘γ)(0)=z and velocity dφq(γ′(0)); since dφq is an isomorphism, define w:=(dφp)−1(dφq(γ′(0)))∈TpM, a timelike vector, and let σ:Iσ→M be the maximal geodesic of M with σ(0)=p, σ′(0)=w; it is timelike, inextendible in M, and meets Σ in exactly one parameter value τ1.

1.3A1L3algebra

(The two image geodesics are the same maximal geodesic of M′.) By [L3] both φ∘σ and φ∘γ are geodesics of M′; at parameter 0 both have value z and velocity dφp(w)=dφq(γ′(0)). Let ζ:Iζ→M′ be the maximal geodesic of M′ with ζ(0)=z, ζ′(0)=dφq(γ′(0)) ([L3]). By uniqueness of maximal geodesics, Iσ⊆Iζ, Iγ⊆Iζ, φ∘σ=ζ∣Iσ and φ∘γ=ζ∣Iγ.

2.1step 1.3L1L3algebra

(The initial-surface crossing parameters coincide.) By step 1.3 and [L1], φ(σ(τ1))=ζ(τ1)∈Σ′ and φ(γ(τ0))=ζ(τ0)∈Σ′, with τ1∈Iσ⊆Iζ and τ0∈Iγ⊆Iζ. The geodesic ζ has timelike velocity, hence is a causal curve, and by [L3] it is inextendible in M′; since Σ′ is a Cauchy set of M′ ([L1]), the parameter set ζ−1[Σ′] has exactly one element. Hence τ0=τ1 and ζ(τ0)=ζ(τ1).

3.1step 2.1L2L3algebra

(Equal points and velocities on Σ.) By step 2.1, φ(σ(τ0))=φ(γ(τ0)) with both arguments in Σ; since φ∣Σ=j′∘j−1 is injective ([L1]), σ(τ0)=γ(τ0)=:x. Differentiating φ∘σ=ζ=φ∘γ at τ0 gives dφx(σ′(τ0))=dφx(γ′(τ0)), and dφx is injective by [L2], so σ′(τ0)=γ′(τ0). Hence σ and γ are maximal geodesics with the same value and velocity at τ0; by uniqueness [L3] they agree on the intersection of their intervals, which contains 0, so p=σ(0)=γ(0)=q.

4.1step 1.1step 3.1L2L4algebra

(Clauses (a) and (b).) Clause (a) is [L2]. For clause (b): step 3.1 shows that φ is injective; by clause (a) and the inverse function theorem on manifolds, φ is a local diffeomorphism, hence an open map, so φ(M) is open in M′ and φ:M→φ(M) is a bijective local diffeomorphism, hence a diffeomorphism; it satisfies the remaining clauses of a development embedding by hypothesis.

5.1step 4.1L5algebra∎

(Clause (c).) Let ψ1,ψ2:M→M′ be data-fixing isometric immersions and let M be connected. By clause (b), already proved in step 4.1, both maps are development embeddings. The pair (M,ψ1) is a common subdevelopment of M and M′, so the embedding-only hypotheses of Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps clause (b) hold for U=M and both maps. At x=j(σ)∈Σ they have the same value j′(σ) and the same differential; hence by rigidity (clause (a) of that lemma) ψ1=ψ2 on M. Taking ψ2=idM:M→M (which is data-fixing by Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (b)) gives the self-isometry statement.

Remarks

Clause (b) shows that in the definition of an extension of a development one need not require the map to be an embedding: a data-fixing isometric immersion is automatically one. Clause (c) is the uniqueness used at the end of Existence and uniqueness of the smooth maximal globally hyperbolic development of constrained initial data in the selected matter sectors; its connectedness hypothesis is the one of Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps clause (a).

Depends on

Dependency tree · 2 levels

Sources