Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps

Definition

Let 4:={0,1,2,3} and let V:=R4 be the set of all functions 4→R, with the pointwise vector-space structure of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}; so V is the function space FX of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1} at F=R and X=4, and its elements are written v=(v0,v1,v2,v3) with va:=v(a) for a∈{0,1,2,3}, the components being indexed from 0 and written with an upper index; the index conventions used throughout this item are fixed below. Let A be the same set R4, whose elements are now called points, together with the map

V×A→A,(v,p)↦v+p,

given by pointwise addition of functions. Then the following three conditions hold.

  1. (v+v′)+p=v+(v′+p) for all v,v′∈V and all p∈A.
  2. 0+p=p for every p∈A.
  3. For all p,q∈A there is exactly one v∈V with v+p=q, namely v=q−p.

Conditions 1 and 2 are read at each of the four coordinates from the field axioms of R, and condition 3 holds because q−p satisfies (q−p)+p=q coordinatewise while any v with v+p=q agrees with q−p at every coordinate (Vector space over a field). A triple consisting of a set A, a vector space V and a map V×A→A satisfying 1–3 is called an affine space with translation space V; the three conditions are its definition, so by 1–3 the set A above is an affine space with translation space V.

For a∈{0,1,2,3} let ea∈V be given by ea(b):=1 for b=a and ea(b):=0 for b≠a. Then (e0,e1,e2,e3) is an ordered basis of V (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis): every v∈V equals v0e0+⋯+v3e3, because the two sides have the same value at each b∈{0,1,2,3}; and if c0e0+⋯+c3e3=0V then evaluating at b gives cb=0, so the list is linearly independent. We write v=v0e0+⋯+v3e3 and use the coordinate columns of Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases with respect to this ordered basis.

The Minkowski form. Define

η(v,w):=−v0w0+v1w1+v2w2+v3w3,v,w∈V.

This is the standard bilinear form ⟨x,y⟩=∑i<nxiyi of The standard bilinear form ⟨x,y⟩=∑i<nxiyi on Fn with the sign of the first coordinate reversed, together with the Euclidean inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn on the last three coordinates; directly from the formula, for fixed w the assignment v↦η(v,w) is a linear combination of the component functions v↦va, hence linear, and similarly in w, so η is a bilinear form, and η(v,w)=η(w,v) for all v,w, so it is symmetric (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms). Its matrix in the ordered basis (e0,e1,e2,e3) is

(η(ea,eb))a,b=diag⁡(−1,1,1,1),

and this matrix is its own inverse, the product of diag⁡(−1,1,1,1) with itself being the identity matrix (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes); in particular it is invertible, so η is nondegenerate (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

Index conventions. The components va of a vector are the numbers in its expansion v=v0e0+⋯+v3e3 in the ordered basis (e0,…,e3), and for a linear map T:V→V one writes (Tv)a for the components of Tv and Tab for the matrix entries, so that (Tv)a=∑bTabvb. Write ηab:=η(ea,eb), so that (ηab)=diag⁡(−1,1,1,1), and let (ηab) denote the inverse matrix of (ηab), that is, ∑bηabηbc=1 when a=c and ∑bηabηbc=0 when a≠c. The lowered components of v are va:=∑bηabvb, and the operation is inverted by va=∑bηabvb, because diag⁡(−1,1,1,1) is its own inverse; explicitly v0=−v0 and vi=vi for i=1,2,3. In these conventions η(v,w)=∑a,bηabvawb=∑avawa for all v,w∈V.

Causal classification. Let v∈V with v≠0. Then v is timelike when η(v,v)<0, null when η(v,v)=0, and spacelike when η(v,v)>0; it is causal when η(v,v)≤0. If the nonzero v is causal, then v0≠0: the inequality −(v0)2+(v1)2+(v2)2+(v3)2≤0 gives (v0)2≥(v1)2+(v2)2+(v3)2, and v0=0 would force (v1)2+(v2)2+(v3)2=0, hence v1=v2=v3=0 and v=0, contrary to the hypothesis. A nonzero causal v is therefore future-directed when v0>0 and past-directed when v0<0, and exactly one of these two alternatives holds for a nonzero real v0 (Order on the reals). The future causal cone is

C+:={v∈V:η(v,v)≤0, v0>0},

whose elements are exactly the future-directed causal vectors; the zero vector is not in C+, because it fails v0>0.

Orientation. The standard orientation of V is the orientation class of the ordered basis (e0,e1,e2,e3) (Orientation of a finite-dimensional real vector space).

Lorentz maps. A Lorentz map is a linear map L:V→V (Linear map between vector spaces over the same field) that is invertible (Invertible linear maps, linear isomorphisms, and inverse linear maps) and satisfies

η(Lv,Lw)=η(v,w)for all v,w∈V.

Writing M:=[L](e0,…,e3)∈M4(R) for the matrix of L in the ordered basis (e0,…,e3) (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases), MT for its transpose (The transpose AT of a matrix), and η also for the matrix diag⁡(−1,1,1,1), the condition is the matrix identity

MTηM=η.

Expanding Lv and Lw in the basis gives η(Lv,Lw)=∑c,d(MTηM)cdvcwd, whereas η(v,w)=∑c,dηcdvcwd, and the two sides agree for all v,w exactly when (MTηM)cd=ηcd for every c,d, since inserting the basis vectors v=ec, w=ed gives the converse (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes). Equivalently, the matrix of η in the basis (Le0,…,Le3) is again diag⁡(−1,1,1,1); this is the change-of-basis congruence of A basis change by P changes the matrix of a bilinear form from A to PTAP for the basis change from (e0,…,e3) to its image under the invertible map L. The invertibility requirement in the definition of a Lorentz map is in fact automatic: if L satisfies the displayed identity and Lv=0, then η(v,w)=η(Lv,Lw)=0 for every w, so v lies in the left radical of η, which is {0} because η is nondegenerate; thus L is injective, and an injective linear endomorphism of the four-dimensional space V is surjective by Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T together with If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V, so L is a bijection, and its inverse S:=L−1 is linear: for all x,y∈V and all reals a,b, linearity of L gives L(aS(x)+bS(y))=ax+by, and applying S gives S(ax+by)=aS(x)+bS(y); thus L is invertible (Invertible linear maps, linear isomorphisms, and inverse linear maps). The map L is proper when det⁡L=1 (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space) and orthochronous when L(C+)=C+.

Frames. A frame of A is a point o∈A together with an ordered basis (u0,u1,u2,u3) of V such that η(ua,ub)=diag⁡(−1,1,1,1)ab for all a,b and u0∈C+. The coordinates of p∈A in that frame are the unique (x0,x1,x2,x3)∈R4 with p=o+x0u0+x1u1+x2u2+x3u3; uniqueness holds because (u0,u1,u2,u3) is an ordered basis, and p−o is the unique element of V carrying o to p.

Tensors and components. For nonnegative integers p,q, a tensor of type (p,q) on V is a map (V∗)p×Vq→R that is linear in each argument separately, where V∗ is the algebraic dual of Linear functionals and the algebraic dual V∗=L(V,F). An empty product is a singleton, so a (0,0) tensor is a scalar. Covectors are the (0,1) case, a vector v defines the (1,0) tensor θ↦θ(v), and a two-form is a skew-symmetric (0,2) tensor. These objects are maps, with arrays recording their components in a chosen basis.

Fix a frame (o,(ua)) and define its linear coordinate map B:R4→V by Bξ:=∑aξaua. It is invertible because (ua) is a basis, and η(Bξ,Bζ)=η(ξ,ζ) by its defining pairings. For a Lorentz map L:V→V, put N:=[L](ua), identifying its matrix with the linear map B−1LB on R4. With origin fixed and new basis ua′:=L−1ua, the coordinates of the same point obey x′=Nx: indeed p−o=Bx=L−1Bx′ is equivalent to this identity. The basis is orthonormal since L−1 preserves η, and it is a frame when L is orthochronous, since then L−1u0∈C+.

For a fixed vector v, covector θ and two-form F, let v^:=B−1v, θ^a:=θ(ua) and F^ab:=F(ua,ub) be their old component columns and matrix; primes denote the corresponding components in (ua′). Then

v^′=Nv^,θ^′=(N−1)Tθ^,F^′=(N−1)TF^N−1.

The vector law follows from B′=L−1B=BN−1. Substituting ua′=∑bub(N−1)ba into θ(ua′) and F(ua′,ub′) gives the other two laws by linearity and bilinearity. Equivalently, the coordinate functional θ∘B′ is (θ∘B)∘N−1, the transpose operation of The transpose or algebraic adjoint T∗:W∗→V∗, T∗(g)=g∘T, of a linear map T:V→W, and the coordinate bilinear form obeys F(B′ξ,B′ζ)=F(BN−1ξ,BN−1ζ). The geometric objects themselves are unchanged. In the standard frame B=id⁡, N is the standard coordinate matrix of L; in a general frame it is B−1LB.

Finally, a fixed positive real c is separate extra structure: the coordinate x0 has the dimension of length, and the time coordinate is t:=x0/c. No physical claim is made here; in particular the identification of A with physical spacetime, of C+ with the future light cone, and of c with the speed of light in vacuum are later physical premises.

Remarks

  • Sign convention. The form has signature (−1,1,1,1): with the index conventions of the Definition, v0 is the time component and v1,v2,v3 are the spatial components of v; the lowered time component v0=−v0 carries the opposite sign, while vi=vi for i=1,2,3.
  • What is not asserted. The affine space, the form, the cone and the transformation laws are mathematical data and conventions; the physical readings of these objects, and any statement that some physical trajectory or force equation has this form, are separate premises that this item does not supply.

Depends on

Dependency tree · 2 levels

Sources