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.

The passive boost is a proper orthochronous Lorentz map with inverse B(-beta)

Statement

Let B(β) be the passive boost of The passive Lorentz boost with parameter beta in an inertial frame (o;e0,e1,e2,e3). For every β∈R3 with ∣β∣<1 the following hold.

(i) B(β) is a proper orthochronous Lorentz map: η(B(β)v,B(β)w)=η(v,w) for all v,w∈V, det⁡B(β)=+1, and B(β)(C+)=C+.

(ii) B(0) is the identity, and for every β the image of the frame vector e0 is B(β)e0=γ (e0−β1e1−β2e2−β3e3), so the map β↦B(β) is injective and B(β) fixes 0V; moreover every vector y with coordinates (0,yvec) and β⋅yvec=0 satisfies B(β)y=y.

(iii) B(−β)B(β)=B(β)B(−β)=id⁡V; in particular B(β) is invertible with B(β)−1=B(−β), and B(β) and B(−β) are inverse bijections of V.

(iv) If u is a future timelike unit vector with coordinates (u0,uvec), so that η(u,u)=−1, u0>0 and ∣uvec∣<u0, then the boost with parameter β:=uvec/u0 satisfies B(β)u=e0.

(v) If a vector x has x0>∣xvec∣, then the first coordinate of B(β)x is γ (x0−β⋅xvec)>0; if x0<−∣xvec∣ then that first coordinate is negative. In particular B(β) maps the future open cone {x:x0>∣xvec∣} into itself.

Facts & Assumptions

Given: An inertial frame (o;e0,e1,e2,e3) of the model and a vector β∈R3 with ∣β∣<1, with b:=∣β∣ when β≠0.

[L1]

The passive boost is defined by x′0=γ(x0−β⋅xvec) and xvec′=xvec+γ−1∣β∣2(β⋅xvec)β−γβx0 for β≠0, and B(0)=id⁡V; here γ=(1−∣β∣2)−1/2≥1 (The passive Lorentz boost with parameter beta).

[L2]

For a spatial column a∈R3, whose function domain is {0,1,2}, use the one-based labels ai:=a(i−1) for i∈{1,2,3}. In these labels the Euclidean inner product is x⋅y=∑i=13xiyi and the norm is ∣x∣=x⋅x (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L4]

Rational powers of positive reals satisfy (ar)s=ars, a−r=1/ar and a1/2>0 for a>0 (Laws of rational exponents); the power γ is the rational power (1−∣β∣2)−1/2 of the positive base 1−∣β∣2 (Rational powers ar of a positive base).

[L5]

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

[L6]

T=C+⊔C−, where C+ is the chosen component of the time orientation (Time orientation, future and past timelike/null/causal vectors, and the closed cones).

[L7]

An inertial frame has η(ea,eb)=diag⁡(−1,1,1,1)ab and e0∈C+, and E(u):=∑auaea is a linear isomorphism R4→V whose inverse gives the coordinates (Inertial frames and inertial charts of the affine Minkowski model).

[L8]

For a linear Lorentz map L one has L(C+)=C+ if and only if L(C+)⊆C+, and such an L permutes the two components; every Lorentz map satisfies det⁡L=±1 (Lorentz maps are isomorphisms of determinant ±1 that preserve causal character and permute the cones; the Lorentz sets are groups).

[L9]

The determinant of an operator is the determinant of its matrix in any ordered basis, independently of the 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).

[L10]

The determinant of a square matrix is the Leibniz sum ∑σsgn⁡(σ)∏iai,σ(i) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[L11]

η is a symmetric bilinear form, so η(∑aξaea,∑bζbeb)=∑a,bξaζbη(ea,eb) (Lorentz forms of inertia (3,1,0) on a 4-dimensional real vector space).

Proof

technique · direct
1.1L1L2L7L11algebra

Assume β≠0 and put b:=∣β∣. Define J:R3→S:=span⁡(e1,e2,e3) by J(a):=∑i=13aiei; [L7] makes J a linear isomorphism onto S, and [L7, L11] give η(J(a),J(d))=a⋅d and η(e0,J(a))=0. Set n:=β/b∈R3 and e:=J(n)∈S, so n⋅n=η(e,e)=1. For x=x0e0+J(xvec) set s:=n⋅xvec, yvec:=xvec−sn and y:=J(yvec); then x=x0e0+se+y and n⋅yvec=η(e,y)=0. Put Y:={J(a):n⋅a=0}⊆S. This decomposition is unique, since its time coordinate is x0, its e coefficient is s, and its transverse coordinate is yvec, so V=span⁡(e0,e)⊕Y. Substitution into [L1] gives (B(β)x)0=γ(x0−bs) and (B(β)x)vec=(γs−γbx0)n+yvec. Thus in this decomposition the boost sends (x0,s,y) to (γ(x0−bs),γ(s−bx0),y), preserves span⁡(e0,e) and fixes Y pointwise; also η is positive definite on Y because η(J(a),J(a))=∣a∣2.

1.2L1L2algebra

Reading [L1] at the coordinate list (1,0,0,0) of e0 gives (B(β)e0)0=γ and (B(β)e0)vec=−γβ, that is B(β)e0=γ(e0−β1e1−β2e2−β3e3) (for β=0, γ=1 and both sides are e0). The first coordinate γ>0 and the spatial coordinates −γβi of B(β)e0 determine γ and then each βi, so β↦B(β)e0 is injective and hence so is β↦B(β); also B(β) fixes 0V because it is linear. If y has coordinates (0,yvec) with β⋅yvec=0, then [L1] gives (B(β)y)0=γ(0−0)=0 and (B(β)y)vec=yvec+γ−1b2⋅0⋅β−0=yvec, so B(β)y=y (for β=0 because B(0) is the identity).

1.3L1L3L5L6L7algebra

Let x satisfy x0>∣xvec∣. If β≠0, then β⋅xvec≤∣β⋅xvec∣≤b∣xvec∣<bx0 by [L3], so x0−β⋅xvec>0 and the first coordinate of B(β)x is γ(x0−β⋅xvec)>0; if β=0, that first coordinate is x0>0. Symmetrically, x0<−∣xvec∣ gives β⋅xvec≥−b∣xvec∣>bx0 and first coordinate <0. Moreover the frame is inertial, so e0∈C+ and [L5] with [L6] identify the components in the frame's coordinates as C+={x:x0>∣xvec∣} and C−={x:x0<−∣xvec∣}.

1.4L1L2L4L5algebra

If uvec=0, future unit normalization gives u0=1, so u=e0, β=0 and B(0)u=e0 by [L1]. Otherwise let u be future timelike with η(u,u)=−1 and u0>0. By [L5] one has η(u,u)=−(u0)2+∣uvec∣2, so ∣uvec∣2=(u0)2−1 and ∣uvec∣<u0; thus β:=uvec/u0 satisfies ∣β∣<1. Moreover 1−∣β∣2=((u0)2−∣uvec∣2)/(u0)2=1/(u0)2, so by [L4] γ=(1−∣β∣2)−1/2=((u0)2)1/2=u0. Substituting x=u in [L1], and using β⋅uvec=∣uvec∣2/u0 and ∣β∣2=∣uvec∣2/(u0)2, the first coordinate is γ(u0−β⋅uvec)=γ((u0)2−∣uvec∣2)/u0=γ/u0=1, and the spatial part is uvec+γ−1∣β∣2(β⋅uvec)β−γuvec=uvec+(γ−1)uvec−γuvec=0. Hence B(β)u=e0.

2.1step 1.1L4L7L9L10L11algebra

For vectors x=(x0,s,y) and w=(w0,r,z) in the coordinates of step 1.1, bilinearity [L11] and the orthonormality of the frame [L7], together with η(e0,e)=0, η(e0,y)=η(e,z)=0 and η(y,z)=yvec⋅zvec, give η(x,w)=−x0w0+sr+yvec⋅zvec. Substituting the action of step 1.1, η(Bx,Bw)=−γ2(x0−bs)(w0−br)+γ2(s−bx0)(r−bw0)+yvec⋅zvec=γ2(1−b2)(−x0w0+sr)+yvec⋅zvec=−x0w0+sr+yvec⋅zvec=η(x,w), because γ2(1−b2)=1 by [L4] and 0<b<1. So B(β) is a linear Lorentz map. For an ordered basis of Y extended to the ordered basis (e0,e,y1,y2) of V, the matrix of B(β) is block diagonal with the 2×2 block (γ−γb−γbγ) on span⁡(e0,e) and the 2×2 identity on Y; in the Leibniz formula [L10] every product is zero unless the permutation preserves the two blocks, and a block-preserving permutation has sign the product of the signs of its two restrictions, so det⁡B(β)=(γ2−γ2b2)⋅1=γ2(1−b2)=1. By [L9] this is det⁡B(β).

2.2step 1.1L4algebra

For the parameter −β the unit spatial vector is −e=J(−n) and the adapted coefficient is −s, so step 1.1 applied to −β gives B(−β)(x0,s,y)=(γ(x0+bs),γ(s+bx0),y). Composing, B(−β)(B(β)(x0,s,y))=(γ2(x0−bs)+bγ2(s−bx0), γ2(s−bx0)+bγ2(x0−bs), y)=(γ2(1−b2)x0, γ2(1−b2)s, y)=(x0,s,y) by γ2(1−b2)=1, and the same computation with the roles of β and −β exchanged gives B(β)(B(−β)(x0,s,y))=(x0,s,y). Hence B(−β)B(β)=B(β)B(−β)=id⁡V, so B(β)−1=B(−β) and both maps are inverse bijections of V.

3.1step 1.3step 2.1L8algebra

By step 2.1 the map B(β) is a linear Lorentz map; by step 1.3 it carries C+ into the set of vectors whose first coordinate is positive, and by the metric preservation of step 2.1 the image of a timelike vector is timelike, so B(β)(C+)⊆C+ under the coordinate description of step 1.3. The containment equivalence in [L8] applied to the Lorentz map B(β) then gives B(β)(C+)=C+. Together with metric preservation and det⁡B(β)=1 from step 2.1, the boost B(β) is a proper orthochronous Lorentz map.

4.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1L1L10∎

For β=0: B(0) is the identity by [L1]; the identity preserves η, fixes C+, and its matrix in any ordered basis is the identity matrix, whose determinant is 1 by the Leibniz formula [L10], so (i) holds; (ii) holds because B(0)e0=e0=γ(e0−0) with γ(0)=1 and B(0) fixes every vector, while injectivity over the whole parameter range follows from the entries recorded in step 1.2; (iii) holds because B(0)−1=B(0)=B(−0); (iv) holds because a future timelike unit vector with uvec=0 has u=e0, so B(0)u=e0; and (v) reduces to x0>0 respectively x0<0. For β≠0: (i) is steps 2.1 and 3.1, (ii) is step 1.2, (iii) is step 2.2, (iv) is step 1.4, and (v) is step 1.3. Thus every clause holds for every ∣β∣<1.

Depends on

Dependency tree · 2 levels

Sources