Alphabeta Math
Pipeline-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.

Em Minkowski Mathematical Prerequisites

1 · Prerequisites

2 · Summary

The finite-dimensional Minkowski algebra used by the covariant formulation of classical electromagnetism. The definition The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps fixes the affine four-space with its form η of signature (−1,1,1,1), the causal classification and the future cone C+, the standard orientation, Lorentz maps with the matrix criterion MTηM=η, the proper and orthochronous classes, frames, and the component laws of tensors under a frame change, with the fixed positive scalar c carried as extra structure. The lemma The explicit Lorentz boost preserves η, has determinant 1 and preserves the future cone verifies that the explicit boost Λβ preserves the form, has determinant 1, preserves the future cone and has inverse Λ−β, and records that the hypothesis 0≤β<1 is not removable. The lemma Proper time along a C1 future timelike curve: strictly increasing reparametrization with η(U,U)=−c2 constructs proper time along a C1 future timelike curve, proves that the reparametrizing function is strictly increasing with inverse derivative c/g, obtains the unit tangent with η(U,U)=−c2, and disposes of the null and straight-line cases. The lemma Antisymmetric contractions vanish and mU′=qΦ(U) preserves η(U,U) identifies the index-raised operator Φ of a skew bilinear form, proves η(u,Φ(u))=0, and shows that the conditional equation mU′=qΦ(U) preserves η(U,U), pointwise operators of a varying form included.

All items are mathematics: they carry domain: mathematics, depend only on mathematical suppliers, and assert no physical conclusion. The identification of the affine space with physical spacetime, of c with the vacuum speed of light, and of the conditional force equation with the Lorentz force are adopted physical premises belonging to the consuming physical items. The companion examples page tests the hypothesis boundaries of these statements.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

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.
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The explicit Lorentz boost preserves η, has determinant 1 and preserves the future cone

Statement

Let 0≤β<1 and put γ:=(1−β2)−1/2>0 (Rational powers ar of a positive base, Laws of rational exponents). Define Λβ:V→V by (Λβv)0=γ(v0−βv1), (Λβv)1=γ(v1−βv0), (Λβv)2=v2, (Λβv)3=v3. Then Λβ is linear (Linear map between vector spaces over the same field), Λβ is a proper orthochronous Lorentz map, and more precisely: (a) η(Λβv,Λβw)=η(v,w) for all v,w∈V; (b) det⁡Λβ=1; (c) Λβ(C+)=C+; (d) Λβ−1=Λ−β. In particular a future causal vector has future causal image and η(Λβv,Λβv)=η(v,v) for every v (Order on the reals, Squaring is monotone on the nonnegatives). The hypothesis 0≤β<1 is not removable: at β=1 the factor γ is undefined.

Facts & Assumptions

Given: A real β with 0≤β<1, the number γ:=(1−β2)−1/2, the map Λβ:V→V defined in the statement, and the Minkowski space (V,η) of The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps.

[L1]

On V=R4 the form η(v,w)=−v0w0+v1w1+v2w2+v3w3 is bilinear and symmetric with matrix diag⁡(−1,1,1,1); the future causal cone is C+={v:η(v,v)≤0, v0>0}; a Lorentz map is an invertible linear L:V→V with η(Lv,Lw)=η(v,w) for all v,w; the map L is proper when det⁡L=1 and orthochronous when L(C+)=C+ (The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps).

[L2]

For a>0 and rationals r,s the powers of Rational powers ar of a positive base satisfy ar>0, ar+s=aras and a−r=(ar)−1 (Laws of rational exponents). With a:=1−β2, which is positive by the hypothesis, this gives γ=a−1/2>0 and γ2=a−1/2a−1/2=a−1=1/a, so γ2(1−β2)=1.

[L3]

For a,b≥0 one has a≤b exactly when a2≤b2 (Squaring is monotone on the nonnegatives), and the order of R is total, with ∣x∣=x for x≥0 (Order on the reals); in particular 0≤β<1 gives β2<1 and 1−β>0.

[L4]

In an ordered basis the j-th column of the matrix of a linear map T is the coordinate column of T(bj), and the coordinate column of v records the coefficients in v=∑jxjbj (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[L5]

The determinant of an operator on a finite-dimensional space is the determinant of its coordinate matrix in any ordered basis (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).

[L6]

If A=[T]B is row-reduced to an upper triangular matrix U using only row additions, then the determinant is unchanged by each addition and det⁡(U) is the product of the diagonal entries of U (In positive dimension the determinant of an operator is computed from a representing matrix by row reduction, tracking swaps and row scalings).

[L7]

An invertible linear map has a unique inverse linear map T−1 with T−1∘T=id⁡V and T∘T−1=id⁡V (Invertible linear maps, linear isomorphisms, and inverse linear maps).

[L8]

A map T:V→V is linear when T(av+bw)=aT(v)+bT(w) for all a,b∈R and v,w∈V (Linear map between vector spaces over the same field).

Proof

technique · direct
1.1givenL8algebra

Λβ is linear: in components (Λβu)0=γu0−γβu1, (Λβu)1=−γβu0+γu1, (Λβu)2=u2, (Λβu)3=u3, so each component of Λβu is a real linear combination of the components of u, and since addition and scalar multiplication in V are pointwise, Λβ(au+a′u′)=aΛβu+a′Λβu′ for all reals a,a′; this is linearity in the sense of [L8].

1.2givenL1L2algebra

(a) For all v,w∈V one has η(Λβv,Λβw)=η(v,w), and the same computation holds with −β in place of β: substituting the displayed components into the form of [L1] gives η(Λβv,Λβw)=γ2[−(v0−βv1)(w0−βw1)+(v1−βv0)(w1−βw0)]+v2w2+v3w3, the bracket expands to −(1−β2)v0w0+(1−β2)v1w1, and γ2(1−β2)=1 by [L2], so the whole expression equals −v0w0+v1w1+v2w2+v3w3=η(v,w); only β2 occurs, so the computation with −β is identical.

1.3givenL2L7algebra

(d) Λ−β∘Λβ=id⁡V=Λβ∘Λ−β: the map Λ−β is given by the same formulas with −β and is linear by the same component computation as the one displayed for Λβ, and using γ2(1−β2)=1 one computes (Λ−β(Λβv))0=γ((Λβv)0+β(Λβv)1)=γ(γ(v0−βv1)+βγ(v1−βv0))=γ2(1−β2)v0=v0 and likewise (Λ−β(Λβv))1=γ((Λβv)1+β(Λβv)0)=γ2(1−β2)v1=v1, while both maps fix the last two components; the composite Λβ∘Λ−β is the same computation with β and −β interchanged. Hence Λ−β is a two-sided inverse of Λβ, and by the uniqueness of the inverse in [L7], Λβ−1=Λ−β.

1.4givenL2

At β=1 the factor γ=(1−β2)−1/2 is undefined: there 1−β2=0, while a−1/2 is defined for a>0 and 0r only for rational r>0 [L2], so the hypothesis 0≤β<1 cannot be dropped.

1.5givenL4algebra

(b, matrix) The matrix M of Λβ in the basis (e0,e1,e2,e3) has first column the coordinate column (γ,−γβ,0,0), second column (−γβ,γ,0,0) and last two columns those of the identity matrix (the matrix is symmetric, so these are also its first two rows): by [L4] its columns are the coordinate columns of the images of the basis vectors, and the displayed component formulas give Λβe0=γe0−γβe1, Λβe1=−γβe0+γe1, Λβe2=e2, Λβe3=e3.

2.1step 1.5L2L5L6algebra

(b) det⁡Λβ=1: replacing the second row of the matrix of step 1.5 by (second row) +β(first row) gives the row (0,γ(1−β2),0,0), since its first entry is −γβ+βγ=0 and its second entry is γ−β2γ. The resulting matrix is upper triangular with diagonal entries γ, γ(1−β2), 1, 1. By [L5] and [L6], the row addition preserves the determinant and det⁡Λβ=γ2(1−β2)=1 by [L2].

2.2step 1.2L2L3algebra

(c, inclusion) Both Λβ(C+)⊆C+ and Λ−β(C+)⊆C+: if v∈C+ then v0>0 and (v1)2≤(v0)2, so ∣v1∣≤v0 by [L3], and since 0≤β<1 one has (Λβv)0=γ(v0−βv1)≥γ(v0−β∣v1∣)≥γ(1−β)v0>0 and (Λ−βv)0=γ(v0+βv1)≥γ(1−β)v0>0, while η(Λ±βv,Λ±βv)=η(v,v)≤0 by step 1.2; these are exactly the two defining conditions of C+.

3.1step 1.3step 2.2

(c) Λβ(C+)=C+: step 2.2 gives the inclusion Λβ(C+)⊆C+ and also Λ−β(C+)⊆C+, which by Λβ−1=Λ−β from step 1.3 says Λβ−1(C+)⊆C+; for u∈C+ the vector v:=Λβ−1u then lies in C+ and satisfies u=Λβv, so C+⊆Λβ(C+), and with the inclusion the two sets are equal.

3.2step 1.2step 2.2

In particular every future causal vector has future causal image, namely the inclusion from step 2.2, and η(Λβv,Λβv)=η(v,v) for every v is step 1.2 with w=v.

4.1step 1.1step 1.2step 1.3step 2.1step 3.1L1L7

Λβ is a proper orthochronous Lorentz map: it is linear by step 1.1, it satisfies η(Λβv,Λβw)=η(v,w) for all v,w by step 1.2, and it has the two-sided inverse Λ−β by step 1.3, so it is a Lorentz map in the sense of [L1]; det⁡Λβ=1 by step 2.1 makes it proper and Λβ(C+)=C+ by step 3.1 makes it orthochronous.

5.1step 1.1step 1.2step 1.3step 1.4step 1.5step 2.1step 2.2step 3.1step 3.2step 4.1∎

All claims of the statement are established — linearity in step 1.1, (a) in step 1.2, (d) in step 1.3, the excluded endpoint in step 1.4, (b) in steps 1.5 and 2.1, (c) in steps 2.2 and 3.1, the proper orthochronous Lorentz property in step 4.1 and the consequence for future causal vectors in step 3.2 — so the hypothesis is exactly as stated.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Proper time along a C1 future timelike curve: strictly increasing reparametrization with η(U,U)=−c2

Statement

Let J⊆R be a nonempty open interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and let z:J→R4 be of class C1 (Ck Euclidean maps and diffeomorphisms) with η(z′(s),z′(s))<0 and z0′(s)>0 for every s∈J; z′ is the derivative of the vector-valued curve (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral) and such a z is called a C1 future timelike curve. Put g(s):=−η(z′(s),z′(s))>0, fix s0∈J, and define τ(s):=c−1∫s0sg(u) du for s∈J. Then: (1) g is continuous on J and so is s↦g(s), where ⋅ is the nonnegative square root (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs); (2) τ is differentiable on J with τ′(s)=c−1g(s)>0, hence τ is strictly increasing on J, injective, and continuous (Every continuous function on an interval has a primitive; two primitives differ by a constant; and ∫abf=G(b)−G(a) for any primitive G, On an interval I, for f continuous on I and differentiable at every interior point: f′≥0 throughout gives f nondecreasing, f′>0 gives f increasing, f′≤0 and f′<0 give the two decreasing forms; conversely a nondecreasing f has f′≥0 and a nonincreasing f has f′≤0 wherever it is differentiable, and no strict converse is claimed); (3) the inverse τ−1:τ[J]→J is differentiable at every point τ(s) of the interval τ[J], with (τ−1)′(τ(s))=c/g(s) (Continuous inverse theorem: a continuous injective f on an interval I is a bijection onto the order-convex set f[I], and the inverse g:f[I]→I is continuous and strictly monotone in the same sense as f, Derivative of an inverse: if f is continuous and injective on a nondegenerate interval I and differentiable at c∈I with f′(c)≠0, then the inverse g is differentiable at f(c) with g′(f(c))=1/f′(c); and if f′(c)=0 then g is not differentiable at f(c)); (4) the reparametrized curve z∘τ−1:τ[J]→R4 is differentiable at every τ(s), with tangent U(τ(s)):=c z′(s)/g(s) satisfying η(U,U)=−c2 (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions); (5) if instead η(z′(s),z′(s))=0 for all s∈J, then g=0, τ≡0 on J and τ is not injective, so a null curve carries no proper-time parametrization (A function continuous on an interval I whose derivative vanishes at every interior point of I is constant on I; consequently two such functions with the same derivative differ by a constant); (6) if z(s)=p+sv with η(v,v)<0 and v0>0, then τ(s)=c−1−η(v,v) (s−s0) and U=c v/−η(v,v) is constant (A function differentiable at c is continuous at c, The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set). The identification of such straight lines with inertial motion is a physical premise and is not asserted here.

Facts & Assumptions

Given: A nonempty open interval J⊆R, a C1 future timelike curve z:J→R4 with η(z′(s),z′(s))<0 and z0′(s)>0 for all s∈J, the function g(s):=−η(z′(s),z′(s))>0, a point s0∈J, and the function τ(s):=c−1∫s0sg(u) du of the statement.

[L1]

On V=R4 the form η is symmetric and bilinear with matrix diag⁡(−1,1,1,1), and c is a fixed positive real (The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps).

[L2]

A nonempty open interval is order-convex, its defining inequalities are strict, so each of its points has a neighbourhood contained in it and it has at least two elements (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L3]

A map into Rq is of class Ck when all its components are of class Ck; for k=1 this means that every component has a continuous first derivative (Ck Euclidean maps and diffeomorphisms).

[L4]

For a curve f into Rm and a limit point c of its domain, f is differentiable at c exactly when every component is, and then f′(c)i=fi′(c); sums and scalar multiples of differentiable curves are differentiable with the expected derivatives (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).

[L5]

Every real a≥0 has a unique a≥0 with (a)2=a (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[L6]

For a,b≥0 one has a≤b exactly when a2≤b2 (Squaring is monotone on the nonnegatives).

[L7]

Sums, scalar multiples, products, absolute values and quotients (where defined) of functions continuous at a point are continuous there, and constant functions and x↦xn are continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function).

[L8]

If I is order-convex and f:I→R is continuous and injective, then f is strictly monotone, f[I] is order-convex, f:I→f[I] is a bijection, and the inverse is continuous (Continuous inverse theorem: a continuous injective f on an interval I is a bijection onto the order-convex set f[I], and the inverse g:f[I]→I is continuous and strictly monotone in the same sense as f).

[L10]

On an order-convex set I with at least two elements, a continuous f:I→R has, for every base point c0∈I, the primitive F(x)=∫c0xf; any two primitives differ by a constant; and for a<b in I one has ∫abf=G(b)−G(a) for every primitive G of f (Every continuous function on an interval has a primitive; two primitives differ by a constant; and ∫abf=G(b)−G(a) for any primitive G).

[L12]

Differentiability at a limit point of the domain implies continuity there (A function differentiable at c is continuous at c).

[L13]

For c a limit point of the domain, f′(c) is the limit of (f(x)−f(c))/(x−c) as x→c (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set).

[L14]

If I is order-convex with at least two elements, f:I→R is continuous and injective with inverse g:f[I]→I, c∈I and b:=f(c), then c and b are limit points, and if f is differentiable at c with f′(c)≠0 then g is differentiable at b with g′(b)=1/f′(c) (Derivative of an inverse: if f is continuous and injective on a nondegenerate interval I and differentiable at c∈I with f′(c)≠0, then the inverse g is differentiable at f(c) with g′(f(c))=1/f′(c); and if f′(c)=0 then g is not differentiable at f(c)).

[L15]

If g is differentiable at c, b:=g(c) is a limit point of the domain of f, and f is differentiable at b, then f∘g is differentiable at c with (f∘g)′(c)=f′(b)g′(c) (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)).

[L16]

If f is continuous on an order-convex I and differentiable with f′=0 at every interior point of I, then f is constant on I (A function continuous on an interval I whose derivative vanishes at every interior point of I is constant on I; consequently two such functions with the same derivative differ by a constant).

[L17]

For the oriented integral, ∫uuf=0 and ∫uvf=−∫vuf (The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf).

Proof

technique · direct
1.1givenL2algebra

J is order-convex with at least two elements, and every point of J is a limit point of J and lies in its interior: J is a nonempty open interval and so has one of the forms (a,b), (a,∞), (−∞,b), R with strict defining inequalities, so a sufficiently small neighbourhood of any s∈J is contained in J, whence a punctured neighbourhood of s meets J again, and J contains two distinct points.

2.1step 1.1L1L3L7algebra

g is continuous on J: by [L3] each component za of the C1 curve has a continuous derivative za′. By [L1], g(s)=−η(z′(s),z′(s))=(z0′(s))2−∑i=13(zi′(s))2=∑a=03ϵa(za′(s))2 with ϵ=(1,−1,−1,−1). This finite sum of squares and scalar multiples of continuous functions is continuous by [L7].

3.1step 2.1L5L6L7L8L9

s↦g(s) is continuous on J: on [0,∞) the map x↦x2 is continuous by [L7], strictly increasing by [L6], and its image is [0,∞) by [L5]; hence its inverse, which is ⋅ by the uniqueness in [L5], is continuous on [0,∞) by [L8], and composing with the continuous g gives a continuous function by [L9].

4.1step 3.1L1L7

h(s):=c−1g(s) is continuous on J: it is the scalar multiple of the continuous function g by the constant c−1, which exists because c>0, and scalar multiples of continuous functions are continuous by [L7].

5.1step 1.1step 4.1L10L12

τ is a primitive of h on J, so τ is differentiable on J with τ′(s)=h(s)=c−1g(s) for every s∈J, and τ is continuous on J: J is order-convex with at least two elements by step 1.1 and h is continuous by step 4.1, so the primitive assertion of [L10] applies to h on J with base point s0, giving the derivative everywhere on J, and differentiability at the limit point s of J gives continuity at s by [L12].

6.1step 5.1L1L5algebra

τ′(s)=c−1g(s)>0 for every s∈J: by step 5.1, τ′(s)=c−1g(s); here g(s)>0 by hypothesis, so g(s)>0 because g(s) is the nonnegative square root of g(s) [L5], and c−1>0 because c>0 [L1]; the product of two positive reals is positive.

6.2step 1.1step 5.1L16L17algebra

Null case: if η(z′(s),z′(s))=0 for all s∈J, then g=0 by its definition and h=0; by step 5.1, τ is a primitive of the zero function on J, so τ′=0 at every point of J and τ is constant on J by [L16]; moreover τ(s0)=∫s0s0g(u) du=0 by [L17], so the constant is 0 and τ≡0 on J; a constant function on J is not injective because J has at least two elements, so a null curve carries no proper-time parametrization.

7.1step 1.1step 5.1step 6.1L11

τ is strictly increasing on J, hence injective: τ is continuous on J by step 5.1, J is order-convex and every point of J is interior to J by step 1.1, and τ′(s)>0 at every s∈J by step 6.1, so [L11] applies; a strictly increasing function is injective.

8.1step 1.1step 5.1step 7.1L8

τ[J] is an interval (order-convex), the map τ:J→τ[J] is a bijection with inverse τ−1:τ[J]→J, and τ−1 is continuous on τ[J]: this is [L8] applied to the continuous injective map τ on the order-convex set J, whose image is τ[J] by definition; the order-convexity of J and continuity of τ are steps 1.1 and 5.1, and injectivity is step 7.1.

9.1step 1.1step 5.1step 6.1step 7.1step 8.1L14algebra

τ−1 is differentiable at every point τ(s) of τ[J], with (τ−1)′(τ(s))=1/τ′(s)=c/g(s): the inverse τ−1:τ[J]→J is the one supplied by step 8.1 from [L8], and [L14] applies to τ with c there equal to s and b=τ(s); its hypotheses are the order-convexity of J with at least two elements (step 1.1), continuity (step 5.1) and injectivity (step 7.1), and τ′(s)≠0 by step 6.1, so the derivative is 1/τ′(s)=c/g(s) by step 5.1.

10.1step 1.1step 9.1L3L4L15algebra

For each a∈{0,1,2,3} the composite za∘τ−1:τ[J]→R is differentiable at τ(s) with derivative za′(s)⋅c/g(s): za is differentiable at the limit point s of J by [L3] and step 1.1, τ−1 is differentiable at τ(s) by step 9.1, and τ(s) is a limit point of τ[J] by [L14] as used in step 9.1, so the chain rule [L15] applies and gives the displayed derivative by [L4].

11.1step 10.1L4algebra

The reparametrized curve z∘τ−1:τ[J]→R4 is differentiable at every τ(s), with tangent U(τ(s))=c z′(s)/g(s): by [L4] applied to the components of step 10.1, the curve is differentiable exactly when its components are and its derivative has those components, so U(τ(s)) is the vector with components za′(s)c/g(s), which is c z′(s)/g(s).

12.1step 11.1L1algebra

η(U(τ(s)),U(τ(s)))=−c2: by step 11.1, U(τ(s))=c z′(s)/g(s), and bilinearity and symmetry of η [L1] give η(U,U)=(c2/g(s)) η(z′(s),z′(s))=−(c2/g(s)) g(s)=−c2, since g(s)=−η(z′(s),z′(s))>0.

12.2step 5.1step 11.1L1L10L13L17algebra

Straight-line case: assume z(s)=p+sv with η(v,v)<0 and v0>0, so z′ is the constant v and g is the constant k:=−η(v,v)>0, and h is the constant c−1k by step 5.1; the function G(s):=c−1k(s−s0) is a primitive of h on J, its difference quotient at any c∈J being the constant c−1k by [L13], so for s>s0 the evaluation formula of [L10] gives τ(s)=G(s)−G(s0)=G(s), for s=s0 one has τ(s0)=∫s0s0h=0=G(s0) by [L17], and for s<s0 antisymmetry [L17] gives τ(s)=−∫ss0h=−(G(s0)−G(s))=G(s); hence τ(s)=c−1−η(v,v)(s−s0), and the tangent of step 11.1 is the constant U(τ(s))=c v/k=c v/−η(v,v).

13.1step 2.1step 3.1step 5.1step 6.1step 6.2step 7.1step 8.1step 9.1step 10.1step 11.1step 12.1step 12.2∎

All six claims are established: claim (1) by steps 2.1 and 3.1; claim (2) by steps 5.1 (differentiability and derivative), 6.1 (strict positivity), 7.1 (strict increase and injectivity) and 5.1 (continuity); claim (3) by steps 8.1 and 9.1; claim (4) by steps 10.1, 11.1 and 12.1; claim (5) by step 6.2; and claim (6) by step 12.2; the identification of straight lines with inertial motion is not asserted.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Antisymmetric contractions vanish and mU′=qΦ(U) preserves η(U,U)

Statement

Let (V,η) be the four-dimensional real Minkowski vector space of The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps, with the fixed form of signature (−1,1,1,1). Let F:V×V→R be a skew-symmetric bilinear form, F(u,v)=−F(v,u) for all u,v∈V (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms). Since η is nondegenerate, for each u∈V there is exactly one Φ(u)∈V with η(Φ(u),w)=F(w,u) for all w∈V (Bilinear forms on V correspond linearly and bijectively to linear maps V→V∗, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space), and Φ:V→V is linear (Linear map between vector spaces over the same field); with Fαβ:=F(eα,eβ) in the fixed ordered basis (e0,e1,e2,e3) of The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps and (ημα) the inverse matrix of (ηαβ), one has Φ(u)μ=∑α,βημαFαβuβ, the index-raised form of F. Then η(u,Φ(u))=0 for every u∈V; in components uμFμνuν=0, where uμ:=∑αημαuα and Fμν:=∑αημαFαν. Consequently, if J⊆R is a nonempty open interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length), U:J→V is differentiable (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral), and m U′(s)=q Φ(U(s)) on J for some real m≠0 and q, then s↦η(U(s),U(s)) is constant on J (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, A function differentiable at c is continuous at c, A function continuous on an interval I whose derivative vanishes at every interior point of I is constant on I; consequently two such functions with the same derivative differ by a constant). The same norm-conservation conclusion holds for a family of skew forms Fs and their pointwise operators Φs defined by η(Φs(u),w)=Fs(w,u), when mU′(s)=qΦs(U(s)): no derivative of Fs is required. In particular one may evaluate a varying field Fx along a differentiable trajectory x(s). This is a conditional statement about the given equation; it does not assert that this equation governs any particle.

Facts & Assumptions

Given: The four-dimensional Minkowski vector space (V,η) of The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps with fixed ordered basis (e0,e1,e2,e3), a skew-symmetric bilinear form F:V×V→R, a nonempty open interval J⊆R, a differentiable curve U:J→V, and real numbers m≠0 and q.

[L1]

η is symmetric and bilinear with matrix ηαβ=η(eα,eβ)=diag⁡(−1,1,1,1) in the basis (e0,e1,e2,e3), that matrix is its own inverse, and η is nondegenerate (The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps).

[L2]

A bilinear form F is skew-symmetric when F(u,v)=−F(v,u) for all u,v, and over the real field this implies F(u,u)=0 for every u: setting v=u gives 2F(u,u)=0 and division by the nonzero real scalar 2 gives zero (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, The Minkowski affine four-space: the form η, causal cones, frames and Lorentz maps).

[L3]

A bilinear form B on a finite-dimensional space is nondegenerate exactly when its flat map B♭:V→V∗, B♭(u)(v)=B(u,v), is an isomorphism (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

[L4]

The assignment B↦B♭ is a linear bijection from bilinear forms on V to linear maps V→V∗ (Bilinear forms on V correspond linearly and bijectively to linear maps V→V∗).

[L5]

A map T:V→V is linear when T(av+bw)=aT(v)+bT(w) (Linear map between vector spaces over the same field).

[L6]

A curve U into R4 is differentiable exactly when all its components are, and then (U′)a=(Ua)′ (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).

[L8]

Differentiability at a limit point of the domain implies continuity there (A function differentiable at c is continuous at c).

[L10]

A nonempty open interval is order-convex, and every point of it is interior to it and is a limit point of it (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1givenL2algebra

For each u∈V the map w↦F(w,u) is linear: by bilinearity of F [L2] one has F(aw+a′w′,u)=aF(w,u)+a′F(w′,u) for all reals a,a′ and all w,w′∈V, so F(⋅,u)∈V∗.

1.2givenL1L3L4

The flat map η♭:V→V∗, η♭(x)(w):=η(x,w), is a bijection: η is nondegenerate on the four-dimensional space V, so by [L3] its flat map is an isomorphism; equivalently, no nonzero x satisfies η(x,w)=0 for all w.

2.1step 1.1step 1.2L3L4

For each u∈V there is exactly one Φ(u)∈V with η(Φ(u),w)=F(w,u) for all w∈V, namely Φ(u):=(η♭)−1(F(⋅,u)): the functional F(⋅,u) lies in V∗ by step 1.1 and η♭ is a bijection by step 1.2, so exactly one x∈V satisfies η♭(x)=F(⋅,u), that is η(x,w)=F(w,u) for all w.

3.1step 2.1L1L2L5

Φ:V→V is linear: for all u,u′∈V, all reals a,a′ and every w∈V, bilinearity of F and η [L1, L2] gives η(Φ(au+a′u′),w)=F(w,au+a′u′)=aF(w,u)+a′F(w,u′)=aη(Φ(u),w)+a′η(Φ(u′),w)=η(aΦ(u)+a′Φ(u′),w); since w is arbitrary, the uniqueness in step 2.1 gives Φ(au+a′u′)=aΦ(u)+a′Φ(u′), which is linearity in the sense of [L5].

3.2step 2.1L1algebra

Coordinate formula: writing Fαβ:=F(eα,eβ) and letting ηνα denote the entry of the inverse of the matrix (ηαβ)=diag⁡(−1,1,1,1), one has Φ(u)ν=ηναFαβuβ, the sum running over α,β∈{0,1,2,3}: substituting this candidate into the defining pairing gives ημνηναFαβuβ=δμαFαβuβ=Fμβuβ=F(eμ,u), because ημνηνα=δμα is the inverse-matrix identity and the matrix diag⁡(−1,1,1,1) is its own inverse [L1]; the candidate therefore satisfies the defining property in step 2.1, and uniqueness gives the formula, that is Φ(u)0=−F0βuβ and Φ(u)i=Fiβuβ for i=1,2,3.

3.3step 2.1L1L2algebra

η(u,Φ(u))=0 for every u∈V: symmetry of η [L1] and the defining equation of step 2.1 give η(u,Φ(u))=η(Φ(u),u)=F(u,u), which is 0 by the skew-symmetry of F [L2].

4.1step 3.2step 3.3L1L2algebra

Component form: uμFμνuν=0, where uμ:=ημαuα and Fμν:=ημαFαν; indeed uμFμνuν=uαηαμημβFβνuν=uβFβνuν=F(u,u)=0 by [L2], the middle equality using the inverse-matrix identity of step 3.2 and the last equally following from step 3.3 with the coordinate formula, since uβFβνuν=η(u,Φ(u)).

4.2step 3.3L1L6L7L8L9L10algebra

Norm conservation for a constant form: assume m U′(s)=q Φ(U(s)) on J with m≠0; then f(s):=η(U(s),U(s)) is constant on J. Indeed, by [L1] and [L6], f(s)=∑a=03ϵa(Ua(s))2 with ϵ=(−1,1,1,1) is differentiable on J with f′(s)=∑a2ϵaUa(s)(Ua)′(s)=2η(U(s),U′(s)), using the product rule and sum rule [L7]; the equation gives η(U(s),U′(s))=(q/m)η(U(s),Φ(U(s)))=0 by step 3.3, so f′=0 everywhere on J; f is continuous on J by [L8] and the interval J is order-convex with every point interior [L10], so [L9] gives that f is constant on J.

5.1step 4.2L2L6L7L9algebra

Varying-form clause: let Fs, s∈J, be skew-symmetric bilinear forms and let Φs be defined pointwise by η(Φs(u),w)=Fs(w,u), with mU′(s)=qΦs(U(s)) on J; then s↦η(U(s),U(s)) is again constant on J. Indeed the computation of step 4.2 applies verbatim — it differentiates only U, never Φs or Fs — giving f′(s)=2η(U(s),U′(s)), while at each fixed s one has η(U(s),Φs(U(s)))=Fs(U(s),U(s))=0 by the skew-symmetry of Fs [L2]; hence η(U,U′)=(q/m)η(U,Φs(U))=0 and f′=0 on J, so [L9] gives that f is constant as in step 4.2. In particular, for a varying field Fx and a differentiable trajectory x(s) one may take Fs:=Fx(s) and the corresponding pointwise operator Φs.

6.1step 2.1step 3.1step 3.2step 3.3step 4.1step 4.2step 5.1∎

Conclusion: for every u∈V there is exactly one Φ(u) with η(Φ(u),w)=F(w,u) for all w (step 2.1); Φ is linear (step 3.1) and has the index-raised coordinate formula Φ(u)μ=ημαFαβuβ (step 3.2); η(u,Φ(u))=0 (step 3.3), in components uμFμνuν=0 (step 4.1); and both mU′=qΦ(U) and its varying-form version mU′=qΦs(U) make s↦η(U(s),U(s)) constant on the nonempty open interval J (steps 4.2 and 5.1). The statement is conditional on the displayed equation and asserts nothing about particles.

5 · Examples, experiments and counterexamples

None yet.

Sources