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

Boost transformation of a future null wave covector and of its frame data

Statement

Let (A,V,η,C+) be the oriented time-oriented affine Minkowski space, let x and x′ be inertial charts whose transition is x′=B(β)x+b for some β∈R3 with ∣β∣<1 and some b∈R4, where B(β) is the passive boost of The passive Lorentz boost with parameter beta and γ:=(1−∣β∣2)−1/2, and let k be a future null wave covector with frame-x data (ϖ,s) as in Frame data of a future null wave covector: the unique pair (ϖ,s) with ∣s∣=1, so that k has components (k0,k1,k2,k3)=(−ϖ,ϖs1,ϖs2,ϖs3) in x. Then:

(i) the components of the same covector k in x′ are ka′=(B(−β))bakb, that is

k0′=γ(k0+β⋅kvec),kvec′=kvec+γ−1∣β∣2(β⋅kvec)β+γβk0

for β≠0 (and k′=k for β=0), where kvec:=(k1,k2,k3);

(ii) with ϖ′:=−k0′ and si′:=ki′/ϖ′ the frame-x′ data of k is

ϖ′=γ(1−β⋅s)ϖ>0,s′=s+γ−1∣β∣2(β⋅s)β−γβγ(1−β⋅s)

for β≠0 (and ϖ′=ϖ, s′=s for β=0); moreover ∣s′∣=1, so ka′=(−ϖ′,ϖ′s1′,ϖ′s2′,ϖ′s3′) in x′;

(iii) in the axis case β=be1 with b∈(−1,1): s1′=(s1−b)/(1−bs1), and s2′=s2/(γ(1−bs1)), s3′=s3/(γ(1−bs1));

(iv) β⋅s′=(β⋅s−∣β∣2)/(1−β⋅s); in particular β⋅s′=0 if and only if β⋅s=∣β∣2, and β⋅s′=−∣β∣2 if and only if β⋅s=0;

(v) applying the transformation with β replaced by −β returns the original data (ϖ,s), since B(−β) is the inverse of B(β).

The statement is pure algebra of η and the boost; no choice principle is used.

Facts & Assumptions

Given: Inertial charts x,x′ with x′=B(β)x+b, β∈R3, ∣β∣<1, b∈R4, γ=(1−∣β∣2)−1/2, and a future null wave covector k with frame-x data (ϖ,s).

[L1]

B(β) has matrix entries in the frame basis B00=γ, B0i=Bi0=−γβi, Bij=δji+γ−1∣β∣2βiβj for i,j=1,2,3 and β≠0, while B(0)=id⁡; γ≥1 with equality exactly when β=0 (The passive Lorentz boost with parameter beta).

[L2]

B(β) is a proper orthochronous Lorentz map with B(−β)=B(β)−1, and the transition x′=B(β)x+b of inertial charts has proper orthochronous linear part (The passive boost is a proper orthochronous Lorentz map with inverse B(-beta), Inertial charts are related by proper orthochronous affine Lorentz maps, and every such map is a chart transition, Linear and affine Lorentz maps, and the Lorentz group).

[L3]

For a constant covector field k on A (of class C∞, in particular C1) the components in the two charts satisfy ka′=(Λ−1)bakb, where Λ is the linear part of the transition; here Λ=B(β) and Λ−1=B(−β) (Transformation of tensor, covector, derivative and current components under affine Lorentz maps, clause (ii), C^k tensor fields on affine Minkowski space and their inertial components, Inertial frames and inertial charts of the affine Minkowski model).

[L4]

Frame data of a future null wave covector in any inertial frame: for the frame of x′, the numbers ϖ′:=−k(e0′) and si′:=k(ei′)/ϖ′ satisfy ϖ′>0, ∣s′∣=1 and ka′=(−ϖ′,ϖ′s1′,ϖ′s2′,ϖ′s3′) (Frame data of a future null wave covector: the unique pair (ϖ,s) with ∣s∣=1, clauses (a)-(d)).

[L5]

In the frame of x, ka=(−ϖ,ϖs1,ϖs2,ϖs3), ϖ>0 and ∣s∣=1, with coordinates taken in the frame's orthonormal basis and the Euclidean scalar product β⋅kvec=∑iβiki (Frame data of a future null wave covector: the unique pair (ϖ,s) with ∣s∣=1, The Euclidean spatial structure and cross product of an inertial frame, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L6]

∣β⋅s∣≤∣β∣ ∣s∣=∣β∣<1, so 1−β⋅s>0 (The Cauchy-Schwarz inequality for finite sums, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Proof

technique · direct
1.1L1L2L3L5

Clause (i). Regard k as the constant covector field on A; by [L3] its primed components are ka′=(B(−β))bakb. For β≠0 the matrix of B(−β) has entries (B(−β))00=γ, (B(−β))0i=γβi, (B(−β))i0=γβi and (B(−β))ij=δji+γ−1∣β∣2βiβj by [L1]; therefore k0′=γk0+γ∑iβiki=γ(k0+β⋅kvec) and ki′=γβik0+ki+γ−1∣β∣2βi(β⋅kvec), which is the displayed vector identity. For β=0 one has B(0)=id⁡ by [L1], so k′=k.

2.1step 1.1L4L5L6

Clause (ii). By step 1.1 and [L5], k0′=γ(k0+β⋅kvec)=γ(−ϖ+β⋅ϖs)=−γ(1−β⋅s)ϖ, hence ϖ′=−k0′=γ(1−β⋅s)ϖ, and this is positive because γ≥1, ϖ>0 and 1−β⋅s>0 by [L6]; this also agrees with ϖ′>0 asserted by [L4]. Dividing the vector component of step 1.1 by ϖ′ gives si′=ki′/ϖ′=[si+γ−1∣β∣2(β⋅s)βi−γβi]/[γ(1−β⋅s)] for β≠0, which is the displayed s′. For β=0, k′=k gives ϖ′=ϖ and s′=s. The normalization ∣s′∣=1 and the component form ka′=(−ϖ′,ϖ′s′) are clauses (a)-(d) of [L4] applied in the frame of x′.

3.1step 2.1

Clause (iii). Let β=be1 with b∈(−1,1) and γ=(1−b2)−1/2. If b≠0, substituting β1=b, β2=β3=0 and β⋅s=bs1 into step 2.1 gives s1′=[s1+γ−1b2(bs1)b−γb]/[γ(1−bs1)]=(s1−b)/(1−bs1), because s1+(γ−1)s1−γb=γ(s1−b), and s2′=s2/[γ(1−bs1)], s3′=s3/[γ(1−bs1)]. If b=0 then γ=1 and s′=s by step 2.1, which is the same as the displayed formulas at b=0.

3.2step 2.1L1L6

Clause (iv). For β≠0, step 2.1 gives β⋅s′=[β⋅s+γ−1∣β∣2(β⋅s)(β⋅β)−γ∣β∣2]/[γ(1−β⋅s)]=[β⋅s+(γ−1)(β⋅s)−γ∣β∣2]/[γ(1−β⋅s)]=[γ(β⋅s)−γ∣β∣2]/[γ(1−β⋅s)]=(β⋅s−∣β∣2)/(1−β⋅s); for β=0 both sides are 0, so the identity holds always. Since 1−β⋅s>0 by [L6], β⋅s′=0 holds exactly when β⋅s=∣β∣2, and β⋅s′=−∣β∣2 holds exactly when β⋅s−∣β∣2=−∣β∣2(1−β⋅s), that is β⋅s(1−∣β∣2)=0, which by ∣β∣<1 is exactly β⋅s=0.

4.1step 2.1step 3.2L2∎

Clause (v). The transition x′=B(β)x+b inverts to x=B(−β)x′+b′ with b′:=−B(−β)b, whose linear part B(−β) is a proper orthochronous Lorentz map with ∣−β∣=∣β∣<1 by [L2]; applying step 2.1 to the chart pair (x′,x) with parameter −β computes the frame-x data of k from its frame-x′ data, and that frame-x data is (ϖ,s) by hypothesis. Directly, ϖ′′=γ(1−(−β)⋅s′)ϖ′=γ(1+β⋅s′)ϖ′ and step 3.2 gives 1+β⋅s′=(1−β⋅s+β⋅s−∣β∣2)/(1−β⋅s)=(1−∣β∣2)/(1−β⋅s), so ϖ′′=γ⋅1−∣β∣21−β⋅s⋅γ(1−β⋅s)ϖ=γ2(1−∣β∣2)ϖ=ϖ; the vector part of the same instance returns a unit vector s′′ with k's frame-x data equal to (ϖ′′,s′′), and by the uniqueness of frame data in [L4] applied to the frame of x, (ϖ′′,s′′)=(ϖ,s), so s′′=s. This proves (i)-(v); the argument is pure algebra of η and the boost, and no choice principle was used.

Depends on

Dependency tree · 2 levels

Sources