Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableprecheck 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.

Normal neighborhoods, convex normal sets, the position vector and the squared-displacement function

Definition

Let (M,g,N) be a time-oriented smooth Lorentzian four-manifold with metric-selected connection ∇ (Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model, Metric compatibility, torsion freedom and the metric-selected connection class), and let exp⁡q:Eq→M be the exponential maps of The geodesic initial-value problem and the exponential map of the metric-selected connection. For an open set U⊆M write TU⊆TM for the tangent vectors based at points of U.

(a) Normal neighborhood. An open neighborhood U of p∈M is a normal neighborhood of p when there is an open star-shaped subset W⊆Ep of TpM such that U=exp⁡p(W) and exp⁡p∣W:W→U is a diffeomorphism onto U (Point-normal and exponential coordinate charts of the metric-selected connection clause (b) supplies such pairs). The exponential coordinates at p on such a U are u:=ψ∘exp⁡p−1:U→R4 for a linear isomorphism ψ:TpM→R4.

(b) Convex normal and strictly convex normal sets. An open set C⊆M is convex normal when it is a normal neighborhood of each of its points; thus for every q∈C there is an open star-shaped Cq⊆Eq with exp⁡q(Cq)=C and exp⁡q∣Cq a diffeomorphism onto C. It is strictly convex normal when it is convex normal and every pair q,q′∈C‾ is joined by exactly one affinely parametrized geodesic segment γ:[0,1]→C‾ with γ(0)=q and γ(1)=q′, and, if q≠q′, its parameter interior γ((0,1)) lies in C. In the degenerate case q=q′, the required segment is the constant geodesic at q; no interior-containment condition is imposed on this degenerate segment when q∈∂C.

(c) Position vector. Fix a normal neighborhood U=exp⁡p(W) of p as in (a), with its chosen inverse (exp⁡p∣W)−1, and let q∈U. Put v:=(exp⁡p∣W)−1(q)∈TpM. Since W is star-shaped, tv∈W for 0≤t≤1, and x(t):=exp⁡p(tv) is the radial geodesic segment in U from p to q. The vector P(p,q):=γp,v′(1)=d(exp⁡p)v(v)∈TqM is the position vector of q with respect to p; here γp,v is the maximal geodesic of The geodesic initial-value problem and the exponential map of the metric-selected connection. The notation P(p,q) uses this chosen inverse branch; another normal neighborhood may select a different radial segment for the same endpoints. On a convex normal set C, use the inverse domains Cp of (b) and the joining segment in C; on a strictly convex normal set this segment is unique by (b). By the Gauss lemma of The Lorentzian Gauss lemma and the radial maximum of proper time gq(P(p,q),P(p,q))=gp(exp⁡p−1(q),exp⁡p−1(q)).

(d) Squared-displacement function. For a normal neighborhood U of p the squared-displacement function is Dp2:U→R,Dp2(q):=gp(exp⁡p−1(q),exp⁡p−1(q)). It is smooth on U because exp⁡p−1 is smooth and gp is bilinear; Dp2(p)=0, Dp2(q)<0 exactly when P(p,q) is timelike, Dp2(q)=0 exactly when P(p,q) is null or zero, and Dp2(q)>0 exactly when P(p,q) is spacelike. On a convex normal C we write D2:C×C→R, D2(p,q):=Dp2(q), whenever the position vector is defined using these inverse domains.

(e) Scope. These are definitions inside the smooth Lorentzian model; they assert no existence of convex normal sets (supplied separately by Existence of strictly convex normal neighborhoods: small coordinate balls are normal neighborhoods of each of their points ↗), no completeness and no physical reading. The position vector is an element of TqM, not a vector field and not a coordinate displacement; D2 is not a metric distance and takes negative values on timelike-separated pairs.

Remarks

Depends on

Dependency tree · 2 levels

Sources