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

Unique boost-rotation factorization of proper orthochronous Lorentz maps

Statement

Let (o;e0,e1,e2,e3) be an inertial frame (Inertial frames and inertial charts of the affine Minkowski model), let S:=span⁡(e1,e2,e3) be its spatial three-space with Euclidean form δ (The Euclidean spatial structure and cross product of an inertial frame), and let L:V→V be a proper orthochronous Lorentz map (Linear and affine Lorentz maps, and the Lorentz group). Write u:=Le0, with coordinates (u0,uvec) in the frame, so that η(u,u)=−1 and u0>0. Then:

(i) ∣uvec∣<u0 and the parameter β:=uvec/u0∈R3 satisfies ∣β∣<1;

(ii) the linear map R^:=B(β)L satisfies R^e0=e0 and R^(S)=S, and its restriction R:S→S preserves δ and has determinant +1 (Spatial rotations of an inertial frame); hence R^ is the extension diag⁡(1,R) of the unique map R:=R^∣S; this extension is a spatial rotation of the frame and L=B(−β)R^ is a product of a passive boost and a spatial rotation;

(iii) conversely, for every β with ∣β∣<1 and every linear map R:S→S preserving δ with det⁡R=1, the extension R^(v0e0+w):=v0e0+Rw (w∈S), denoted diag⁡(1,R) in the frame basis, is a proper orthochronous Lorentz map and the product B(−β)R^ is a proper orthochronous Lorentz map;

(iv) the factorization L=B(−β)R^ of (ii) is unique: if B(−β1)R^1=B(−β2)R^2 with ∣βi∣<1 and spatial rotations R^i, then β1=β2 and R1=R2;

(v) L is a passive boost, that is L=B(β′) for some ∣β′∣<1, if and only if the rotation R in (ii) is the identity, and then β′=−β with β the parameter of (i).

Facts & Assumptions

Given: An inertial frame (o;e0,e1,e2,e3) with spatial three-space S, a proper orthochronous Lorentz map L, and u:=Le0 with coordinates (u0,uvec) in the frame.

[L1]

A linear Lorentz map is a linear L with η(Lv,Lw)=η(v,w) for all v,w∈V; it is proper when det⁡L=+1 and orthochronous when L(C+)=C+; O(V,η) and SO+(V,η) denote the corresponding sets (Linear and affine Lorentz maps, and the Lorentz group).

[L2]

A linear Lorentz map is a linear isomorphism, satisfies det⁡L=±1, and has Lorentz inverse; it preserves η(v,v) and the causal character of every nonzero vector; L(C+) is one of the two components C+,C−, and L(C+)=C+ holds exactly when L(C+)⊆C+; composition of linear Lorentz maps is a linear Lorentz map, and the proper orthochronous ones form a subgroup (Lorentz maps are isomorphisms of determinant ±1 that preserve causal character and permute the cones; the Lorentz sets are groups).

[L3]

For ∣β∣<1 the passive boost B(β) is defined by its coordinate action, and for β≠0 in the frame's ordered basis it has the matrix (γ−γβT−γβI3+γ−1∣β∣2ββT) with γ=(1−∣β∣2)−1/2; for β=0 one defines B(0)=id⁡V, whose matrix is I4 (The passive Lorentz boost with parameter beta).

[L4]

For every ∣β∣<1: B(β) is a proper orthochronous Lorentz map with B(β)−1=B(−β); B(β)e0=γ(e0−β1e1−β2e2−β3e3); the map β↦B(β) is injective; if u is a future timelike unit vector with u0>0 then B(uvec/u0)u=e0 (The passive boost is a proper orthochronous Lorentz map with inverse B(-beta)).

[L5]

A spatial rotation of the frame is a linear R:V→V with R(e0)=e0, R(S)⊆S, δ(Rw,Rz)=δ(w,z) for all w,z∈S, and det⁡(R∣S)=+1 (Spatial rotations of an inertial frame).

[L6]

In an inertial frame, η(ea,eb)=diag⁡(−1,1,1,1)ab and e0∈C+; the chart is the affine coordinate map of the frame (Inertial frames and inertial charts of the affine Minkowski model).

[L7]

S=span⁡(e1,e2,e3)={w∈V:η(e0,w)=0}, δ=η∣S×S is positive definite with δ-orthonormal basis (e1,e2,e3), and V=S⊕span⁡(e0); hence for v=v0e0+w, z=z0e0+y with w,y∈S one has η(v,z)=−v0z0+δ(w,y) (The Euclidean spatial structure and cross product of an inertial frame).

[L8]

(S,δ) is a finite-dimensional real inner product space, and an endomorphism of it is a linear isometry exactly when it preserves δ; orthogonal operators have determinant ±1 (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces, Orthogonal and unitary operators form groups, and their determinants have modulus one).

[L9]

In every η-orthonormal ordered basis the timelike set is T+∪T− with T+={x:x0>∣xvec∣}, T−={x:x0<−∣xvec∣}, and these are exactly the two components of T; in particular η(x,x)=−(x0)2+∣xvec∣2 (The timelike set has exactly two convex components, described in orthonormal coordinates).

[L10]

C+ is one of the two components T+,T− and T=C+⊔C−; a vector of C+ is future timelike (Time orientation, future and past timelike/null/causal vectors, and the closed cones).

[L11]

For an operator on a finite-dimensional space, det⁡T is the determinant of its matrix in any ordered basis, independently of the basis, and det⁡(AB)=det⁡Adet⁡B with det⁡(id⁡)=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, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[L12]

For A=(aij)∈Mn(R) over a commutative ring, det⁡(A)=∑σ∈Snsgn⁡(σ)∏i<naσ(i),i, and sgn⁡(σ)=(−1)inv⁡(σ) where inv⁡(σ) counts the pairs i<j<n with σ(i)>σ(j) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations).

[L13]

∣x∣ denotes the Euclidean norm on R3, and the coordinates of uvec in the δ-orthonormal basis (e1,e2,e3) carry the standard Euclidean inner product (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Proof

technique · direct
1.1L1L2L3L6L9L10L13algebra

Since L is orthochronous and e0∈C+ by [L6], the image u=Le0 lies in L(C+)=C+; by [L9] and [L10] the component C+ is the coordinate set {x:x0>∣xvec∣} because it contains e0 with coordinates (1,0,0,0). Hence u0>∣uvec∣≥0, so u0>0 and ∣uvec∣<u0. Moreover η(u,u)=η(e0,e0)=−1 by [L2] and [L6], while [L9] gives η(u,u)=−(u0)2+∣uvec∣2, so (u0)2−∣uvec∣2=1 and the parameter β:=uvec/u0 satisfies ∣β∣2=1−1/(u0)2<1; in particular β lies in the open unit ball of R3 and B(β) is defined by [L3].

1.2L4L5algebra

For uniqueness, suppose B(−β1)R^1=B(−β2)R^2 with ∣βi∣<1 and spatial rotations R^i, and apply both sides to e0. Since R^ie0=e0 by [L5] and B(−βi)e0=γi(e0+βi,1e1+βi,2e2+βi,3e3) by [L4], equality of the two images reads γ1(e0+β1)=γ2(e0+β2) in coordinates, the time component giving γ1=γ2>0 and then the three spatial components giving β1,k=β2,k for k=1,2,3; hence β1=β2. Composing the original equality on the left with the bijection B(β1)=B(β2) and using B(βi)B(−βi)=id⁡ from [L4] gives R^1=R^2, and therefore R1=R^1∣S=R^2∣S=R2.

2.1L2L4step 1.1algebra

Define R^:=B(β)L. It is a composition of linear Lorentz maps, hence a linear Lorentz map by [L2]; in particular it is invertible. By [L4] applied to the future timelike unit vector u with u0>0 from step 1.1, B(β)u=e0; therefore R^e0=B(β)Le0=B(β)u=e0.

3.1L2L7L8step 2.1algebra

For w∈S, applying the Lorentz identity of R^ and R^e0=e0 gives η(e0,R^w)=η(R^e0,R^w)=η(e0,w)=0, so R^w∈S by [L7] and R^(S)⊆S. Conversely, let y∈S and let w:=R^−1y; applying the same identity to the Lorentz map R^−1, whose value at e0 is again e0, gives η(e0,w)=η(R^−1e0,R^−1y)=η(e0,y)=0, so w∈S by [L7] and y=R^w∈R^(S); hence R^(S)=S. For w,z∈S, δ(R^w,R^z)=η(R^w,R^z)=η(w,z)=δ(w,z), so the restriction R^∣S is a δ-isometry of S; it is an automorphism of S because R^ is an automorphism of V preserving the splitting.

4.1L5L8L11L12step 2.1step 3.1algebra

Put A:=R^∣S and let M^ be the matrix of R^ in the ordered basis (e0,e1,e2,e3) of V and MA the matrix of A in the ordered basis (e1,e2,e3) of S. Because R^e0=e0 and R^(S)=S, the matrix M^ is the block matrix (100MA) and, reading the Leibniz sum of [L12] over σ∈S4, every term with σ(0)≠0 vanishes; for σ with σ(0)=0 the product equals ∏j<3(MA)σ(j+1)−1,j, the permutation τ(j):=σ(j+1)−1 of {0,1,2} has the same inversion number as σ (no inversion involves the index 0 with σ(0)=0), and so the same sign, whence det⁡M^=det⁡MA. By [L11], det⁡R^=det⁡M^=det⁡MA=det⁡A=det⁡(R^∣S). Now det⁡R^=det⁡B(β)det⁡L=1⋅1=1 by [L4], [L1] and [L11]. Hence det⁡(R^∣S)=+1, and by [L8] the restriction is an orthogonal operator; with step 3.1 and [L5] this shows that R:=R^∣S:S→S is a determinant-one δ-isometry and R^=diag⁡(1,R):V→V is a spatial rotation of the frame. Finally L=B(β)−1R^=B(−β)R^ by [L4].

5.1L2L4L5L7L12algebra

Conversely, let ∣β∣<1 and let R:S→S be a linear δ-isometry of determinant 1, with extension R^=diag⁡(1,R), so that R^e0=e0 and R^∣S=R. For v=v0e0+w and z=z0e0+y with w,y∈S, linearity gives R^v=v0e0+Rw and R^z=z0e0+Ry, so by [L7] and the δ-preservation of R in [L5], η(R^v,R^z)=−v0z0+δ(Rw,Ry)=−v0z0+δ(w,y)=η(v,z); hence R^ is a linear Lorentz map. Its matrix in (e0,e1,e2,e3) is block diagonal diag⁡(1,MR) with MR the matrix of R in (e1,e2,e3), and the same Leibniz argument as step 4.1 gives det⁡R^=det⁡R=1 by [L5]; thus R^ is proper. It is orthochronous because R^e0=e0∈C+ with e0 future timelike, so R^(C+)∩C+≠∅, and by [L2] the image R^(C+) is one of the two components C+,C−; it must therefore be C+. Finally B(−β) is a proper orthochronous Lorentz map by [L4], and the product of two proper orthochronous Lorentz maps is proper orthochronous by [L2].

5.2L4step 4.1

For the characterization of boosts, suppose first that L=B(β′) for some ∣β′∣<1. Then u=Le0=B(β′)e0=γ′(e0−β1′e1−β2′e2−β3′e3) by [L4], so u0=γ′ and β=uvec/u0=−β′; hence R^=B(β)L=B(−β′)B(β′)=id⁡ by [L4], and R=id⁡. Conversely, if R=id⁡, then R^=id⁡ and the factorization of step 4.1 gives L=B(−β), a passive boost with parameter −β.

6.1step 1.1step 2.1step 3.1step 4.1step 5.1step 1.2step 5.2∎

Clause (i) is step 1.1; clause (ii) is steps 2.1, 3.1, 4.1; clause (iii) is step 5.1; clause (iv) is step 1.2; and clause (v) is step 5.2. This proves every clause of the statement.

Depends on

Dependency tree · 2 levels

Sources