Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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 Galilean transformations form a group of bijections of the coordinate space

Statement

In the notation of The Galilean transformations of the coordinate space, with C=R×R3, G the set of Galilean transformations and θ=(b,a,v,R) the parameters of gθ:

  1. The parameter map θ↦gθ is injective: if g(b,a,v,R)=g(b′,a′,v′,R′) then b=b′, a=a′, v=v′ and R=R′.
  2. Each g(b,a,v,R) is a bijection of C, with inverse g(b,a,v,R)−1=g(−b, −RT(a−vb), −RTv, RT).
  3. Composition of Galilean transformations is Galilean, with g(b2,a2,v2,R2)∘g(b1,a1,v1,R1)=g(b1+b2, R2a1+v2b1+a2, R2v1+v2, R2R1), and g(0,0,0,I3) is the identity map of C.
  4. Consequently G is a subgroup of the group of all bijections of C under composition.

Facts & Assumptions

Given: The coordinate space C, the maps g(b,a,v,R)(t,x)=(t+b,Rx+vt+a) and the parameter set Θ (The Galilean transformations of the coordinate space).

[L1]

Definition of gθ and its parameters: g(b,a,v,R)(t,x)=(t+b,Rx+vt+a) for all (t,x)∈C, with b∈R, a,v∈R3 and R∈SO(3) (The Galilean transformations of the coordinate space).

[L2]

I3∈SO(3); for all R,S∈SO(3) the matrices RS and RT again lie in SO(3), and R is invertible with inverse RT, so that RRT=RTR=I3 (SO(3) is a subgroup of the general linear group, with R−1=RT, The orthogonal group O(3) and the rotation group SO(3)).

[L3]

Matrix algebra: the matrix product is associative and I3M=MI3=M for every 3×3 matrix M; the matrix-vector products displayed in the definition satisfy R(u+w)=Ru+Rw, R(λu)=λ(Ru), (λR)u=λ(Ru) and (RS)u=R(Su) for u,w∈R3 and λ∈R, when matrices act on column vectors by the product of Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes read componentwise; two vectors of R3 are equal exactly when their three components agree, and two 3×3 matrices are equal exactly when their nine entries agree (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

Proof

technique · direct
1.1L1L3algebra

[Injectivity] Assume g(b,a,v,R)=g(b′,a′,v′,R′). Evaluating at (0,0) and comparing first coordinates gives b=b′. Evaluating at (0,x) then gives Rx+a=R′x+a′ for every x∈R3; at x=0 this gives a=a′, and after subtracting, (R−R′)x=0 for every x, which for x=e1,e2,e3 compares the three columns of the matrix R−R′ and gives R=R′. Evaluating at (t,0) then gives vt+a=v′t+a′ for every real t; subtracting the known a=a′ and taking t=1 gives v=v′. Hence θ=θ′.

1.2L1L2L3algebra

[Composition] For every (t,x)∈C, applying first g(b1,a1,v1,R1) and then g(b2,a2,v2,R2) gives (t+b1+b2, R2(R1x+v1t+a1)+v2(t+b1)+a2). By the linearity and associativity identities of [L3] this equals (t+(b1+b2), (R2R1)x+(R2v1+v2)t+(R2a1+v2b1+a2)), which is gθ3(t,x) for θ3:=(b1+b2, R2a1+v2b1+a2, R2v1+v2, R2R1); and R2R1∈SO(3) by [L2], so θ3∈Θ and the composite is Galilean with the displayed parameters. Taking the second quadruple to be (0,0,0,I3) makes the composite equal gθ1 by [L2], and taking the first to be (0,0,0,I3) makes it equal gθ2; hence g(0,0,0,I3) is the identity map of C, and the composite lies in G.

1.3L1L2L3algebra

[Inverse] Let θ=(b,a,v,R) and η:=(−b, −RT(a−vb), −RTv, RT); by [L2] RT∈SO(3), so η∈Θ. For (t′,x′)∈C put t:=t′−b and x:=RT(x′−v(t′−b)−a). Then t+b=t′, and Rx+vt+a=R RT(x′−v(t′−b)−a)+v(t′−b)+a=x′ by RRT=I3 of [L2]; hence gθ(t,x)=(t′,x′) and gθ is surjective. Expanding x gives x=RTx′+(−RTv)t′+(−RT(a−vb))=gη(t′,x′), so gθ∘gη is the identity of C. If gθ(t1,x1)=gθ(t2,x2) then t1=t2 from the first coordinate, and R(x1−x2)=0 from the second, giving x1=x2 because R is invertible by [L2]; so gθ is injective, and with surjectivity it is a bijection.

2.1step 1.2L2L3algebra

[Two-sided inverse] By step 1.2 the composite gθ∘gη has parameters (−b+b, Raη+vbη+a, Rvη+v, RRT) with (bη,aη,vη,Rη)=η, so its components are 0, R(−RT(a−vb))+v(−b)+a=−(a−vb)−vb+a=0, R(−RTv)+v=−v+v=0 and RRT=I3; hence gθ∘gη=g(0,0,0,I3), the identity of C by step 1.2. This proves clause 2 with the displayed inverse.

3.1step 1.1step 1.2step 1.3step 2.1algebra∎

[Subgroup] By steps 1.2 and 2.1 the set G contains the identity of the bijection group of C and is closed under composition and inversion; by step 1.1 the parameter map is injective, and every gθ is a bijection by steps 1.3 and 2.1. Therefore G is a subgroup of the group of all bijections of C under composition, and clauses 1-4 hold.

Depends on

Dependency tree · 2 levels

Sources