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.

The skew-matrix/cross-product correspondence [ω]×z=ω×z and its conjugation law R[ω]×RT=[Rω]×

Statement

Use the standard basis (e1,e2,e3) of R3 and coordinates ω=ω1e1+ω2e2+ω3e3 (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0, A finite list v:n→V is an ordered basis if and only if every x∈V equals ∑i<nλivi for exactly one λ:n→F; those scalars are the coordinates of x in that ordered basis). Define the map [⋅]×:R3→M3(R) by [ω]×:=(0−ω3ω2ω30−ω1−ω2ω10). Then:

  1. [ω]×z=ω×z for all ω,z∈R3, the cross product being that of The cross product in R3.
  2. [ω]×T=−[ω]× for every ω; the map ω↦[ω]× is linear and injective, and its image is exactly the set of skew-symmetric matrices of M3(R). Consequently every skew-symmetric Ω∈M3(R) equals [ω]× for exactly one ω, namely ω=(Ω32,Ω13,Ω21).
  3. For every R∈SO(3) (The orthogonal group O(3) and the rotation group SO(3)) and every ω∈R3, R[ω]×RT=[Rω]×.

Facts & Assumptions

Given: Vectors ω,z∈R3, a skew-symmetric matrix Ω∈M3(R) and a rotation R∈SO(3).

[L1]

The cross product has coordinates (u×v)1=u2v3−u3v2, (u×v)2=u3v1−u1v3, (u×v)3=u1v2−u2v1 in the standard basis, and satisfies ⟨u×v,w⟩=det⁡[u v w], where [u v w] is the matrix with these three vectors as columns; moreover u×v is orthogonal to u and to v The cross product in R3, The cross product is bilinear, alternating, and orthogonal to both factors.

[L2]

Use the owning page's one-based labels: uj:=u(j−1), Mij:=M(i−1,j−1), and ej is the standard unit vector at the actual index j−1, for i,j∈{1,2,3}. Relabelling the supplier's product formula gives (AB)ij=∑k=13AikBkj=∑r=02A(i−1,r)B(r,j−1). Sums are entrywise and (AT)ij=Aji; the transpose is involutive and reverses products The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, The transpose AT of a matrix, Transpose is linear and involutive, and (AB)T=BTAT, The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0.

[L4]

For R∈SO(3) one has RTR=I3, RRT=I3, det⁡R=1 and R invertible; for all x,y∈R3 therefore ⟨Rx,Ry⟩=⟨x,y⟩, since (Rx)T(Ry)=xTRTRy=xTy The orthogonal group O(3) and the rotation group SO(3), SO(3) is a subgroup of the general linear group, with R−1=RT, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

Proof

technique · direct
1.1givenL1L2algebra

Comparing coordinates, ([ω]×z)1=−ω3z2+ω2z3=ω2z3−ω3z2=(ω×z)1, and likewise ([ω]×z)2=ω3z1−ω1z3=(ω×z)2 and ([ω]×z)3=ω1z2−ω2z1=(ω×z)3, all by [L1] and [L2]; this is clause 1.

1.2givenL2algebra

The displayed matrix is manifestly antisymmetric: ([ω]×T)ij=([ω]×)ji=−([ω]×)ij for every i,j by [L2]. Hence [ω]×T=−[ω]×. Entries are linear functions of ω, so ω↦[ω]× is linear. If [ω]×=0, then the (1,3) entry gives ω2=0, the (2,3) entry gives ω1=0 and the (1,2) entry gives ω3=0, so ω=0: the map is injective.

1.3givenL1L2L3L4L5algebra

Let u,v,w∈R3. By [L4], ⟨R(u×v),Rw⟩=⟨u×v,w⟩=det⁡[u v w] by [L1]; by [L2] and [L3], det⁡[u v w]=det⁡(R)det⁡[u v w]=det⁡(R[u v w])=det⁡[Ru Rv Rw]=⟨Ru×Rv,Rw⟩ by [L1] again. Since R is invertible, Rw ranges over all of R3 as w does, so [L5] gives R(u×v)=Ru×Rv.

2.1step 1.2givenL2algebra

Let Ω be skew-symmetric and put ω:=(Ω32,Ω13,Ω21). Comparing entries with the definition of [ω]× and using Ωij=−Ωji and Ωii=0: [ω]× has (1,2) entry −ω3=−Ω21=Ω12, (1,3) entry ω2=Ω13, (2,3) entry −ω1=−Ω32=Ω23, and the lower-triangular entries follow by skew-symmetry of both matrices; so Ω=[ω]×. Together with step 1.2 this shows that the image of ω↦[ω]× is the set of skew-symmetric matrices, with the stated unique preimage; this proves clause 2.

3.1step 1.11.3givenL2L4L6algebra∎

For every z∈R3, R[ω]×RTz=R(ω×(RTz)) by step 1.1, =(Rω)×(RRTz) by step 1.3, =(Rω)×z by [L4], =[Rω]×z by step 1.1. Hence R[ω]×RT=[Rω]× by [L6]; this is clause 3.

Depends on

Dependency tree · 2 levels

Sources