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 and preserves the future cone
Statement
Let and put (Rational powers of a positive base, Laws of rational exponents). Define by , , , . Then is linear (Linear map between vector spaces over the same field), is a proper orthochronous Lorentz map, and more precisely: (a) for all ; (b) ; (c) ; (d) . In particular a future causal vector has future causal image and for every (Order on the reals, Squaring is monotone on the nonnegatives). The hypothesis is not removable: at the factor is undefined.
Facts & Assumptions
Given: A real with , the number , the map defined in the statement, and the Minkowski space of The Minkowski affine four-space: the form , causal cones, frames and Lorentz maps.
On the form is bilinear and symmetric with matrix ; the future causal cone is ; a Lorentz map is an invertible linear with for all ; the map is proper when and orthochronous when (The Minkowski affine four-space: the form , causal cones, frames and Lorentz maps).
For and rationals the powers of Rational powers of a positive base satisfy , and (Laws of rational exponents). With , which is positive by the hypothesis, this gives and , so .
For one has exactly when (Squaring is monotone on the nonnegatives), and the order of is total, with for (Order on the reals); in particular gives and .
In an ordered basis the -th column of the matrix of a linear map is the coordinate column of , and the coordinate column of records the coefficients in (Coordinate columns and matrices of linear maps relative to ordered bases).
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 on the zero space).
If is row-reduced to an upper triangular matrix using only row additions, then the determinant is unchanged by each addition and is the product of the diagonal entries of (In positive dimension the determinant of an operator is computed from a representing matrix by row reduction, tracking swaps and row scalings).
An invertible linear map has a unique inverse linear map with and (Invertible linear maps, linear isomorphisms, and inverse linear maps).
A map is linear when for all and (Linear map between vector spaces over the same field).
Proof
is linear: in components , , , , so each component of is a real linear combination of the components of , and since addition and scalar multiplication in are pointwise, for all reals ; this is linearity in the sense of [L8].
(a) For all one has , and the same computation holds with in place of : substituting the displayed components into the form of [L1] gives , the bracket expands to , and by [L2], so the whole expression equals ; only occurs, so the computation with is identical.
(d) : the map is given by the same formulas with and is linear by the same component computation as the one displayed for , and using one computes and likewise , 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], .
At the factor is undefined: there , while is defined for and only for rational [L2], so the hypothesis cannot be dropped.
(b, matrix) The matrix of in the basis has first column the coordinate column , second column 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 , , , .
(b) : replacing the second row of the matrix of step 1.5 by (second row) (first row) gives the row , since its first entry is and its second entry is . The resulting matrix is upper triangular with diagonal entries , , , . By [L5] and [L6], the row addition preserves the determinant and by [L2].
(c, inclusion) Both and : if then and , so by [L3], and since one has and , while by step 1.2; these are exactly the two defining conditions of .
(c) : step 2.2 gives the inclusion and also , which by from step 1.3 says ; for the vector then lies in and satisfies , so , and with the inclusion the two sets are equal.
In particular every future causal vector has future causal image, namely the inclusion from step 2.2, and for every is step 1.2 with .
is a proper orthochronous Lorentz map: it is linear by step 1.1, it satisfies for all 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]; by step 2.1 makes it proper and by step 3.1 makes it orthochronous.
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
The Minkowski affine four-space: the form , causal cones, frames and Lorentz maps
Linear map between vector spaces over the same field
Rational powers of a positive base
Laws of rational exponents
Squaring is monotone on the nonnegatives
Order on the reals
Coordinate columns and matrices of linear maps relative to ordered bases
The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and on the zero space
In positive dimension the determinant of an operator is computed from a representing matrix by row reduction, tracking swaps and row scalings
Invertible linear maps, linear isomorphisms, and inverse linear maps