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.

The observer rest-space decomposition and the spatial projection

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). Write h:=hn, n⊥={v∈TpM:gp(v,n)=0} (eta-orthogonality and orthogonal complements in a Lorentz vector space) and Rn={λn:λ∈R}. Then:

  1. h:TpM→TpM is linear, h(n)=0, h(v)=v for every v∈n⊥ and h∘h=h; its kernel is ker⁡h=Rn, its image is im⁡h=n⊥, and TpM=Rn⊕n⊥ is an orthogonal direct sum: every v∈TpM has the unique decomposition

    v=−gp(v,n) n+h(v),

    in which −gp(v,n)n∈Rn and h(v)∈n⊥.

  2. For all v,w∈TpM the projection identity

    gp(h(v),h(w))=gp(v,w)+gp(v,n)gp(n,w)

    holds; in particular gp(h(v),h(v))=gp(v,v)+gp(v,n)2.

  3. dim⁡n⊥=3 and the restriction of gp to n⊥ is positive definite.

Facts & Assumptions

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

[L1]

An observer at p is a vector n∈TpM with gp(n,n)=−1 and gp(n,Np)<0, and the spatial projection of an observer is hn(v)=v+gp(n,v)n (Observers, rest spaces and the spatial projection at an event).

[L2]

There are ordered gp-orthonormal bases of TpM, i.e. ordered bases (f0,f1,f2,f3) with gp(fa,fb)=diag⁡(−1,1,1,1)ab (Every Lorentz form admits an ordered basis with matrix diag(-1,1,1,1)).

[L3]

In an η-orthonormal ordered basis of a Lorentz vector space, the coordinate expression is η(v,v)=−(v0)2+∣vvec∣2 with v=v0e0+v1e1+v2e2+v3e3, the timelike set is T=T+∪T− with T+={v:v0>∣vvec∣} and T−={v:v0<−∣vvec∣} the two connected components, and these descriptions coincide with the two components in some order in every orthonormal basis (The timelike set has exactly two convex components, described in orthonormal coordinates).

[L4]

In the time-oriented manifold, Cp+={v∈TpM:gp(v,v)<0 and gp(v,Np)<0} and Cp−={v∈TpM:gp(v,v)<0 and gp(v,Np)>0}; 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).

[L5]

A vector is timelike when gp(v,v)<0, null when v≠0 and gp(v,v)=0, spacelike when gp(v,v)>0, and causal when it is timelike or null (Timelike, null, spacelike and causal vectors of a Lorentz vector space).

[L7]

The Euclidean inner product of x,y∈R3 is ⟨x,y⟩=∑i=13xiyi with norm ∥x∥2, and ∣⟨x,y⟩∣≤∥x∥2∥y∥2 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

technique · direct
1.1L1algebra

The map h is linear because v↦gp(n,v) is linear and n is fixed. Moreover h(n)=n+gp(n,n)n=n−n=0, and if v∈n⊥ then gp(n,v)=0 and h(v)=v; hence for every v one has gp(h(v),n)=gp(v,n)+gp(v,n)gp(n,n)=gp(v,n)−gp(v,n)=0, so h(v)∈n⊥, and then h(h(v))=h(v)+gp(h(v),n)n=h(v), that is, h∘h=h.

1.2L2L3L4L5L6given

By [L2] choose an ordered gp-orthonormal basis (f0,f1,f2,f3). The vector f0 is timelike, and [L4] gives gp(f0,Np)≠0; replacing f0 by −f0 if necessary, which preserves orthonormality, we may assume gp(f0,Np)<0, so that f0∈Cp+ and f0 is future-directed. By [L3] the two components of the timelike set are T+={v:v0>∣vvec∣} and T−={v:v0<−∣vvec∣} in this basis, in some order; since f0 has coordinates (1,0,0,0)∈T+ and lies in Cp+, the identification is Cp+=T+. Writing n=n0f0+n1f1+n2f2+n3f3 by [L6] and using that n is future unit timelike, we get n0>∣nvec∣≥0 and (n0)2−∣nvec∣2=1.

2.1step 1.1L1algebra

From h(v)=0 we get v=−gp(v,n)n∈Rn, and conversely h(n)=0, so ker⁡h=Rn; since h fixes every vector of n⊥ pointwise and its image lies in n⊥, its image is exactly im⁡h=n⊥.

2.2step 1.1L1algebra

Using bilinearity and symmetry of gp, gp(h(v),h(w))=gp(v+gp(n,v)n, w+gp(n,w)n)=gp(v,w)+gp(n,w)gp(v,n)+gp(v,n)gp(n,w)+gp(v,n)gp(n,w)gp(n,n), and the last term is −gp(v,n)gp(n,w) because gp(n,n)=−1; hence gp(h(v),h(w))=gp(v,w)+gp(v,n)gp(n,w). Taking w=v gives the stated special case.

2.3step 1.2L7algebra

Let v∈n⊥, with coordinates v=v0f0+vvec as in step 1.2. Since 0=gp(v,n)=−v0n0+vvec⋅nvec and n0≥1>0 by step 1.2, we have v0=(vvec⋅nvec)/n0, and by [L7] ∣vvec⋅nvec∣≤∣vvec∣ ∣nvec∣; therefore gp(v,v)=−(v0)2+∣vvec∣2≥∣vvec∣2(1−∣nvec∣2/(n0)2)=∣vvec∣2((n0)2−∣nvec∣2)/(n0)2=∣vvec∣2/(n0)2≥0. Equality forces ∣vvec∣=0 and then v0=0, that is, v=0. Hence gp is positive definite on n⊥.

3.1step 2.1L1algebra

The displayed formula v=−gp(v,n)n+h(v) is a rearrangement of the definition of h, and the two summands lie in Rn and n⊥. If v=λn+w with λ∈R and w∈n⊥, then applying gp(⋅,n) gives gp(v,n)=−λ, so λ=−gp(v,n) and w=v+gp(v,n)n=h(v); hence the decomposition is unique and TpM=Rn⊕n⊥. It is orthogonal because gp(λn,w)=λgp(n,w)=0 for w∈n⊥, and Rn∩n⊥={0} since gp(λn,n)=−λ vanishes only for λ=0.

3.2step 1.1step 2.1step 1.2L6algebra

The vectors h(f1),h(f2),h(f3) lie in n⊥ by step 1.1 and are linearly independent: if ∑icih(fi)=0, then h(∑icifi)=0, so ∑icifi∈Rn by step 2.1. This vector has zero first coordinate in the basis of step 1.2, while a vector λn has first coordinate λn0 with n0>0. Hence λ=0 and all ci=0 by [L6]. The four vectors n,h(f1),h(f2),h(f3) are linearly independent: pairing a linear relation with n first makes the coefficient of n zero, and the just-proved independence makes the others zero. Since TpM has dimension 4, they form a basis. For v∈n⊥, expand in this basis and pair with n again; the coefficient of n is zero. Thus the three projected spatial vectors span n⊥ and form its basis, giving dimension 3. Together with step 2.3 this proves claim 3 without assuming the generic basis vector f0 equals n or h(f0)=0.

4.1step 1.1step 2.1step 3.1step 2.2step 2.3step 3.2∎

Claims 1 and 2 are steps 1.1, 2.1, 3.1 and 2.2, and claim 3 is steps 2.3 and 3.2.

Depends on

Dependency tree · 2 levels

Sources