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.

Pairing of an observer with future causal vectors

Statement

Let (M,g,N) be a time-oriented smooth Lorentzian four-manifold, let p∈M, and let n be an observer at p (Observers, rest spaces and the spatial projection at an event). For w∈TpM write h=hn and γ(w):=−gp(n,w).

  1. If w is nonzero future causal, then γ(w)>0.
  2. If w is future unit timelike, then γ(w)≥1, with γ(w)=1 if and only if w=n, and gp(h(w),h(w))=γ(w)2−1.
  3. If w is unit timelike, then w is future-directed if and only if gp(n,w)<0, and past-directed if and only if gp(n,w)>0; in particular gp(n,w)≠0 for such w.

Facts & Assumptions

Given: A time-oriented smooth Lorentzian four-manifold (M,g,N), a point p∈M, an observer n at p, and a vector w∈TpM.

[L1]

An observer at p is a vector n with gp(n,n)=−1 and gp(n,Np)<0; units mean gp(n,n)=−1, so a future unit timelike vector w is exactly a future-directed vector with gp(w,w)=−1 (Observers, rest spaces and the spatial projection at an event, Timelike, null, spacelike and causal vectors of a Lorentz vector space).

[L2]

The projection identity gp(h(v),h(v′))=gp(v,v′)+gp(v,n)gp(n,v′) holds for all v,v′, ker⁡h=Rn, and gp is positive definite on n⊥=im⁡h (The observer rest-space decomposition and the spatial projection).

[L3]

There are ordered gp-orthonormal bases of TpM (Every Lorentz form admits an ordered basis with matrix diag(-1,1,1,1)).

[L4]

In an orthonormal ordered basis the timelike set is T=T+∪T− with T+={v:v0>∣vvec∣} and T−={v:v0<−∣vvec∣} the two components, in some order in every orthonormal basis (The timelike set has exactly two convex components, described in orthonormal coordinates).

[L5]

In the time-oriented manifold, Cp+={v:gp(v,v)<0,gp(v,Np)<0} and Cp−={v:gp(v,v)<0,gp(v,Np)>0} are the two components of the timelike set; a nonzero causal vector is future-directed exactly when it lies in cl⁡(Cp+), and gp(v,Np)≠0 for every nonzero causal v (Classification of future and past causal vectors by a timelike field, Time orientation, future and past timelike/null/causal vectors, and the closed cones).

Proof

technique · direct
1.1L3L4L5givenalgebra

By [L3] choose an ordered orthonormal basis (f0,f1,f2,f3); replacing f0 by −f0 if necessary we may assume gp(f0,Np)<0, so f0 is future-directed and, by [L4] and [L5] as in the rest-space lemma, the future timelike component is Cp+=T+={v:v0>∣vvec∣} and the future causal vectors are the nonzero points of cl⁡(T+)={v:v0≥∣vvec∣}. Write n=n0f0+nvec and w=w0f0+wvec; then n0>∣nvec∣≥0, (n0)2−∣nvec∣2=1, and for nonzero future causal w we have w0≥∣wvec∣ with w0>0 (because w≠0 forces either ∣wvec∣>0 or w0>0≥∣wvec∣).

2.1step 1.1L6algebra

With the coordinates of step 1.1, gp(n,w)=−n0w0+nvec⋅wvec, so by [L6] γ(w)=n0w0−nvec⋅wvec≥n0w0−∣nvec∣∣wvec∣≥w0(n0−∣nvec∣). Since n0−∣nvec∣=(n0+∣nvec∣)−1>0 and w0>0, we get γ(w)>0; this proves claim 1.

3.1step 2.1L2givenalgebra

Let w be future unit timelike. By claim 1, γ(w)>0; by [L2], gp(h(w),h(w))=gp(w,w)+γ(w)2=−1+γ(w)2, and the left side is ≥0 because h(w)∈n⊥ and gp is positive definite there, so γ(w)2≥1 and hence γ(w)≥1. Equality holds exactly when h(w)=0, i.e. w∈ker⁡h=Rn by [L2]; a future unit timelike vector proportional to n must equal n. This proves claim 2.

3.2step 2.1L1L5algebra

Let w be unit timelike. It is timelike and nonzero, so by [L5] it is future-directed or past-directed according to membership in Cp+ or Cp−, and gp(w,Np)≠0. If w is future-directed, step 2.1 applied to w gives −gp(n,w)>0, i.e. gp(n,w)<0. If w is past-directed, then −w is future unit timelike, so step 2.1 gives −gp(n,−w)=gp(n,w)>0. Conversely, if gp(n,w)<0 and w were past-directed, the previous case would give gp(n,w)>0, a contradiction; and if gp(n,w)>0 and w were future-directed, the first case would give gp(n,w)<0, a contradiction. Hence w is future-directed exactly when gp(n,w)<0, and past-directed exactly when gp(n,w)>0; in particular gp(n,w)≠0. This proves claim 3.

4.1step 2.1step 3.1step 3.2∎

Claims 1, 2 and 3 are steps 2.1, 3.1 and 3.2 respectively.

Depends on

Dependency tree · 2 levels

Sources