Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 future timelike vector pairs negatively with every nonzero future causal vector

Statement

Let (A,V,η,C+) be the oriented time-oriented affine Minkowski space, let n,v∈V, and recall that a nonzero v with η(v,v)≤0 is causal (Timelike, null, spacelike and causal vectors of a Lorentz vector space, Time orientation, future and past timelike/null/causal vectors, and the closed cones). Then:

(a) if n is future timelike and v is nonzero future causal, then η(n,v)<0;

(b) if n is future timelike and v is nonzero past causal, then η(n,v)>0;

(c) consequently, for a nonzero null vector v and any future timelike n, v is future null if and only if η(n,v)<0, and v is past null if and only if η(n,v)>0; the sign of η(n,v) does not depend on the choice of the future timelike n;

(d) if nhat:=n/−η(n,n) is the normalization of a future timelike n, then nhat is future unit timelike, η(nhat,nhat)=−1, and η(n,v)=−η(n,n) η(nhat,v) for every v, so the sign statements hold for nhat as well.

The statement is pure affine Minkowski geometry, and no choice principle is used.

Facts & Assumptions

Given: An oriented time-oriented affine Minkowski space (A,V,η,C+) and vectors n,v∈V.

[L1]

A vector is timelike when η(v,v)<0, null when v≠0 and η(v,v)=0, spacelike when η(v,v)>0, and causal when it is timelike or null; the zero vector has no causal character and every nonzero vector has exactly one character (Timelike, null, spacelike and causal vectors of a Lorentz vector space).

[L2]

C+ is one of the two connected components of the timelike set, and future timelike means membership in C+, future null means nonzero null membership in cl⁡(C+), and future causal means future timelike or future null; the closed cones cl⁡(C+) and cl⁡(C−) are convex cones meeting only at 0, and every causal vector is future or past but not both (Time orientation, future and past timelike/null/causal vectors, and the closed cones).

[L3]

In an η-orthonormal basis (e0,e1,e2,e3) with e0 timelike, writing x=x0e0+xvec with xvec:=∑i=13xiei∈span⁡(e1,e2,e3) and ∣xvec∣:=(x1)2+(x2)2+(x3)2 and η00:=η(e0,e0)=−1, the timelike set splits into T+={x:x0>∣xvec∣} and T−={x:x0<−∣xvec∣}, these are exactly its two connected components, cl⁡(T+)={x:x0≥∣xvec∣} and cl⁡(T−)={x:x0≤−∣xvec∣} (The timelike set has exactly two convex components, described in orthonormal coordinates).

[L4]

For every event o∈A there is an inertial frame (o;e0,e1,e2,e3), so its ordered basis is η-orthonormal with e0∈C+ (Existence of future-oriented inertial frames at every event, Inertial frames and inertial charts of the affine Minkowski model).

[L5]

For an inertial frame, with S=span⁡(e1,e2,e3) and δ:S×S→R, δ(w,z):=η(w,z), the positive-definite spatial form, the spatial vectors xvec=∑i=13xiei and yvec=∑i=13yiei belong to S and satisfy δ(xvec,yvec)=∑i=13xiyi and ∣xvec∣=δ(xvec,xvec); bilinearity and η(ea,eb)=diag⁡(−1,1,1,1) give η(x,y)=−x0y0+δ(xvec,yvec) (The Euclidean spatial structure and cross product of an inertial frame).

[L6]

For real lists, ∣∑k<nakbk∣≤∑k<nak2∑k<nbk2 (The Cauchy-Schwarz inequality for finite sums), which in the coordinates of [L5] reads ∣δ(xvec,yvec)∣≤∣xvec∣ ∣yvec∣.

Proof

technique · direct
1.1L2L3L4L5L6

Frame and coordinates. Fix an inertial frame (o;e0,e1,e2,e3) [L4] and write every x∈V as x=x0e0+xvec, where xvec:=∑i=13xiei∈S; then η(x,y)=−x0y0+δ(xvec,yvec) with ∣δ(xvec,yvec)∣≤∣xvec∣ ∣yvec∣ by [L5, L6]. Because e0∈C+ and e0∈T+, the component T+ of [L3] is C+, so C+={x:x0>∣xvec∣} and cl⁡(C+)=cl⁡(T+)={x:x0≥∣xvec∣} [L2, L3].

2.1step 1.1

Clause (a). Let n be future timelike and v≠0 future causal. By [L2] and step 1.1 the future causal vectors are C+∪(cl⁡(C+)∖{0}), so in the frame of step 1.1, n0>∣nvec∣ and v0≥∣vvec∣≥0; v≠0 rules out v0=0, so v0>0. Then η(n,v)=−n0v0+δ(nvec,vvec)≤−n0v0+∣nvec∣ ∣vvec∣≤−n0v0+∣nvec∣ v0=−(n0−∣nvec∣)v0<0, because ∣vvec∣≤v0, ∣nvec∣≥0, n0−∣nvec∣>0 and v0>0.

3.1step 2.1L2L3

Clause (b). If n is future timelike and v is nonzero past causal, then −v is nonzero future causal: v∈C− or v is past null, and negating does not change η(v,v), while cl⁡(C−)=−cl⁡(C+) and T−=−T+ show −v lies in C+ (timelike case) or is nonzero null in cl⁡(C+) (null case) [L2, L3]. By step 2.1, η(n,−v)<0, and bilinearity gives η(n,−v)=−η(n,v), so η(n,v)>0.

4.1step 2.1step 3.1L1L2

Clause (c). Let v be nonzero null and n future timelike. If v is future null then v is nonzero future causal and step 2.1 gives η(n,v)<0; if v is past null then step 3.1 gives η(n,v)>0. Since a causal vector is future or past but not both [L2] and a nonzero null vector is causal, exactly one of these two cases occurs, so conversely η(n,v)<0 forces v future null and η(n,v)>0 forces v past null; the sign is therefore determined by v alone and is independent of the future timelike n used.

5.1step 1.1step 2.1step 3.1step 4.1L1∎

Clause (d). For future timelike n, −η(n,n)>0 by [L1], so λ:=−η(n,n) is a positive real number and nhat:=n/λ is defined. By step 1.1, n0>∣nvec∣≥0; multiplying by λ−1>0 gives nhat0>∣nhat,vec∣, so nhat∈T+=C+ is future timelike; bilinearity gives η(nhat,nhat)=λ−2η(n,n)=−1 and η(n,v)=η(λnhat,v)=λ η(nhat,v) for every v. Hence η(nhat,v) has the same sign as η(n,v) for every v, and the sign statements of steps 2.1, 3.1 and 4.1 hold with n replaced by nhat; this proves (a)-(d). The argument used only the affine Minkowski geometry of the cited items, and no choice principle was used.

Depends on

Dependency tree · 2 levels

Sources