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.

Rigidity of isometric immersions of a connected Lorentzian manifold, and agreement of data-fixing embeddings on overlaps

Statement

Throughout, for a smooth map ψ:N→N′ between smooth Lorentzian four-manifolds write ψ∗(g′)=g when gp(v,w)=gψ(p)′(dψpv,dψpw) for all p∈N and v,w∈TpN; such a map is an isometric immersion (Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model, Cr and smooth maps between smooth manifolds). Let ∇,∇′ be the metric-selected connections (Metric compatibility, torsion freedom and the metric-selected connection class, Existence and uniqueness of the metric-selected connection of a nondegenerate metric, and its extension to tensor fields) and let geodesics and exponential maps be those of The geodesic initial-value problem and the exponential map of the metric-selected connection.

(a) Rigidity. Let N be connected and let ψ1,ψ2:N→N′ be isometric immersions with ψ1(p)=ψ2(p) and dψ1(p)=dψ2(p) for some p∈N. Then ψ1=ψ2, that is, ψ1(q)=ψ2(q) and dψ1(q)=dψ2(q) for every q∈N.

(b) Data-fixing embeddings have equal differentials on the initial surface. Let (M,g,N,j,ψ), (M′,g′,N′,j′,ψ′) and (U,g∣U,N∣U,j,ψ∣U) be as in Common subdevelopments, maximal common developments and corresponding boundary points clause (a), and let ψ1,ψ2:U→M′ be development embeddings in the sense of Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (c). Then dψ1=dψ2 at every point of Σ:=j(Σ)⊆U.

(c) Agreement on overlaps. 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) for the supplied causal-convexity and Cauchy-side arguments in this clause. Let (M,g,N,j,ψ) and (M′,g′,N′,j′,ψ′) be developments of the same data, and let (U1,ψ1) and (U2,ψ2) be common subdevelopments in the sense of Common subdevelopments, maximal common developments and corresponding boundary points clause (a). Then ψ1=ψ2 on U1∩U2.

Facts & Assumptions

Given: the maps and developments of the clause under consideration, with their metric-selected connections.

[L1]

Local metric matrices and their associated coefficients: in a source chart x and a target chart y, write gab and gαβ′ for the smooth nondegenerate metric matrices and gab and g′αβ for their inverses. Indices run from 0 to 3 and repeated indices are summed. Define the smooth coordinate arrays Γabc:=12gad(∂bgdc+∂cgbd−∂dgbc) and Γ′αβγ by the corresponding target formula. These are finite matrix constructions; no theorem about constructing a global tangent-bundle smooth structure, connection, geodesic or exponential map is applied in clauses (a) or (b). The connection/geodesic references in the Statement fix the usual terminology; the proof below instead obtains its needed local identity directly from ψ∗g′=g and differentiation (Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model, Cr and smooth maps between smooth manifolds).

[L4]

Development data and convexity: j(Σ) is a Cauchy set of M and of Ui; M=I−(Σ)⊔Σ⊔I+(Σ); a causal curve in M with endpoints in Ui stays in Ui; and p∈I+(Σ) means that a timelike curve in M from Σ to p exists (Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clause (a)5, Cauchy sets are closed, split the manifold into past, set and future, and are locally Lipschitz graphs clause (a), A development sharing the initial Cauchy surface with a larger development is causally convex in it clause (c), Causal curves, chronological and causal reachability, and inextendibility clause (c), The push-up rule: p << q and q <= r imply p << r, together with the timelike-piece criterion).

[L5]

Agreement on the surface: development embeddings satisfy ψ1∘j=j′=ψ2∘j and preserve the time orientation; since j(Σ) is spacelike with a unique future unit normal, ψ1 and ψ2 carry that normal to the future unit normal of j′(Σ), so their differentials agree on Tj(σ)M for every σ∈Σ (Smooth developments of constrained initial data, data-fixing isometries, development embeddings and maximality clauses (b)-(c), The future unit normal, induced metric and second fundamental form of a spacelike hypersurface, Spacelike hypersurfaces, acausal sets, Cauchy sets, domains of dependence and Cauchy horizons clause (a)).

Clauses (a) and (b) use only local metric matrices, differentiation and finite-dimensional estimates, with no choice principle; clause (c) retains the stated choice premises of its causal-convexity and Cauchy-side suppliers.

Proof

technique · direct
1.1L1algebraconstruct

(The coordinate identity for the first differential.) In the charts of [L1], write f=y∘ψ∘x−1 and Jαa=∂afα. The equation gab=gαβ′(f)JαaJβb makes J invertible: if Jv=0, then g(v,w)=0 for all w, so v=0. Put Hαbc=∂b∂cfα+Γ′αβγ(f)JβbJγc and Cabc=(J−1)aαHαbc. The target coefficient formula gives ∂βgγδ′=gαδ′Γ′αβγ+gγα′Γ′αβδ. Differentiating the metric identity therefore gives ∂bgcd=gadCabc+gcaCabd. Since Cabc=Cacb, adding this identity with indices (b,c,d) and (c,b,d) and subtracting the one with indices (d,b,c) yields 2gadCabc=∂bgcd+∂cgbd−∂dgbc. Thus Cabc=Γabc and ∂bJαc=ΓdbcJαd−Γ′αβγ(f)JβbJγc. This follows from finite algebra and the smooth metric identity, without an application of the choice-bearing connection or geodesic suppliers.

1.2givenalgebra

(The agreement set of (a).) Let A:={q∈N:ψ1(q)=ψ2(q) and dψ1(q)=dψ2(q)}. Then p∈A by hypothesis, so A≠∅.

1.3def. smooth maps between smooth manifoldsdef. continuityalgebra

(A is closed.) Let q lie in the closure of A. Since N′ is Hausdorff, if ψ1(q)≠ψ2(q) there are disjoint neighborhoods of these values; their inverse images have an open intersection containing q and missing A, a contradiction. Thus ψ1(q)=ψ2(q)=r. Choose a source chart x:V→x(V)⊆R4 around q and a target chart y:W→y(W)⊆R4 around r, shrinking V so both ψi(V)⊆W. The coordinate maps fi=y∘ψi∘x−1 are smooth. On x(A∩V) their values and their 4 by 4 derivative matrices agree. Each entry of Df1−Df2 is continuous, so a nonzero entry at x(q) would have a neighborhood disjoint from x(A∩V), contradicting q∈A‾. Hence Df1(x(q))=Df2(x(q)). The invertible chart differentials identify these matrices with dψi,q:TqN→TrN′, giving dψ1,q=dψ2,q. Thus q∈A and A is closed.

1.4L5algebra

(Clause (b).) Differentiating ψi∘j=j′ makes the differentials equal on Tj(σ)Σ. The orthogonal complement of this positive definite three-plane in a Lorentzian four-space is a negative definite line, so it has exactly one future unit vector n; the target plane likewise has a unique future unit vector n′. The invertible linear isometries dψi carry the source plane to the target plane and preserve future cones, hence carry n to n′. Every tangent vector has a unique decomposition into a surface-tangent vector and a multiple of n; thus dψ1=dψ2 on Tj(σ)U. This is pointwise finite-dimensional linear algebra and uses no construction of a global normal field or connection.

1.5L4algebra

(Every component of U1∩U2 meets Σ.) Let x∈U1∩U2. By [L4] x lies in one of I−(Σ), Σ, I+(Σ); if x∈Σ its component already meets Σ; if x∈I+(Σ), choose a future timelike curve λ in M from a point of Σ to x ([L4]); by convexity of U1 and of U2 (A development sharing the initial Cauchy surface with a larger development is causally convex in it clauses (a) and (c), applied to the causal curve λ and to any subsegment with endpoints in Ui) λ⊆U1∩U2, so x lies in the same component of U1∩U2 as a point of Σ; the case x∈I−(Σ) is the time reverse.

2.1step 1.1step 1.2L1algebra

(A is open without geodesic existence.) Let q∈A. Choose charts x and y with x(q)=0 and y(ψi(q))=0, and shrink to a source coordinate ball B so both fi=y∘ψi∘x−1 are defined there. By continuity shrink B further so the pairs (fi(z),Dfi(z)) lie in a fixed compact convex ball Q about their common pair at 0, with the target-coordinate projection of Q contained in y's domain. For z∈B set ui(t)=(fi(tz),Dfi(tz)), 0≤t≤1. Step 1.1 gives f˙iα=zbJiαb and J˙iαc=zb(Γdbc(tz)Jiαd−Γ′αβγ(fi)JiβbJiγc), a common system u˙i=Fz(t,ui) with u1(0)=u2(0). The right side is smooth near [0,1]×Q, so its derivative in u has a finite bound L there; integration along the straight segment in the convex set Q gives ∣Fz(t,u)−Fz(t,v)∣≤L∣u−v∣. If equality holds at the start a of an interval [a,b] with L(b−a)<1, the ordinary fundamental theorem of calculus implies D≤L(b−a)D, where D=max⁡[a,b]∣u1−u2∣; hence D=0. A finite subdivision of [0,1] into such intervals proves u1=u2 throughout (if L=0 one interval suffices). In particular f1(z)=f2(z) and Df1(z)=Df2(z) for every z∈B. Thus x−1(B)⊆A, and A is open. Only uniqueness of these already supplied smooth coordinate curves was proved; no selections of solutions are needed.

3.1step 1.2step 2.1step 1.3discharge-construct

(Conclusion of (a).) N is connected and A is nonempty, open and closed by the preceding steps; hence A=N, which is the assertion of (a).

3.2step 2.1step 1.3step 1.4L5algebra

(The agreement set of (c).) Let A⊆U1∩U2 be the set of points at which ψ1=ψ2 and dψ1=dψ2; on j(Σ) the maps have equal values by [L5] and equal differentials by clause (b), so Σ⊆A. The set A is open in U1∩U2 by the argument of step 2.1 applied to coordinate balls contained in the open set U1∩U2, and closed by the argument of step 1.3.

4.1step 3.2step 1.5algebra∎

(Conclusion of (c).) Since A is open and closed in U1∩U2 and meets every component of U1∩U2 by step 1.5, A=U1∩U2; hence ψ1=ψ2 on U1∩U2, which is clause (c).

Remarks

Clause (a) is Sbierski's Lemma 3.1 and clause (c) his Corollary 3.2; the connectedness hypothesis of (a) is essential (on a disjoint union of three Minkowski copies, the identity and the isometry that fixes the first copy and exchanges the other two have equal value and differential at every point of the first copy but differ elsewhere). Clause (c) is what makes the patched map of Existence and uniqueness of the maximal common development of two developments well defined on overlaps.

Depends on

Dependency tree · 2 levels

Sources