Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 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.

Depends on

Dependency tree · 2 levels

Sources