Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)
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.

Inertial frames and inertial charts of the affine Minkowski model

Definition

Let (A,V,η,C+) be an oriented time-oriented affine Minkowski space (Oriented time-oriented affine Minkowski space (the spacetime primitives)), with orientation fixed as a positive ray of the determinant line Λ4V (Determinant-line orientations of finite-dimensional real vector spaces) and with the corresponding class of positively oriented ordered bases of V (Orientation of a finite-dimensional real vector space); by Orientations and positive basis classes agree in positive dimension the positive ray selects exactly one such class for dim⁡V=4>0.

An inertial frame of the model is a tuple (o;e0,e1,e2,e3) consisting of an event o∈A and an ordered basis (e0,e1,e2,e3) of V that is

  1. η-orthonormal: η(ea,eb)=diag⁡(−1,1,1,1)ab for all a,b (Every Lorentz form admits an ordered basis with matrix diag(-1,1,1,1));
  2. future: e0∈C+, i.e. e0 is future timelike; and
  3. positively oriented: the ordered basis lies in the positive-basis class selected by the fixed orientation.

The event o is the origin of the frame and e0,e1,e2,e3 are its basis vectors.

Inertial charts. For an inertial frame (o;e0,e1,e2,e3), define

E:R4⟶V,E(u):=∑a=03uaea.

Then E is a linear isomorphism (Invertible linear maps, linear isomorphisms, and inverse linear maps): it is linear by construction, and it is bijective because (e0,e1,e2,e3) is an ordered basis, every v∈V having exactly one coordinate list u with v=∑auaea (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). The inertial chart of the frame is the map

x:A⟶R4,x(p):=E−1(p−o),

and its values xa(p) are the inertial coordinates of the event p in the frame. Since E and v↦p+v are bijections, x is a bijection A→R4; and x(p)=0 exactly when p−o=0V, that is, exactly when p=o.

Transition law. Let (o′;e0′,e1′,e2′,e3′) be another inertial frame with chart x′, and let M=(Mab) be the change-of-basis matrix defined by ea′=∑bMabeb, a 4×4 real matrix that is invertible because both families are ordered bases. Then E′(u)=∑auaea′=E(Mu) for all u∈R4, for the matrix-vector product Mu in the coordinates of the first frame, because ∑aua∑bMabeb=∑b(∑aMabua)eb; hence E′=E∘M and E′−1=M−1∘E−1, so for every event p,

x′(p)=M−1(x(p)−x(o′))=M−1x(p)−M−1x(o′).

In particular the transition between two inertial charts is an affine map of R4 with invertible linear part M−1 and constant part −M−1x(o′), and it is a bijection of R4 with inverse u↦Mu+x(o′), which is the transition in the reverse direction.

The inertial atlas. The inertial atlas of the model is the family of all inertial frames together with their inertial charts. Its charts are available at every event by Existence of future-oriented inertial frames at every event ↗, which supplies for every o∈A an inertial frame with origin o; and any two of its charts are related by the affine transition displayed above.

Depends on

Dependency tree · 2 levels

Sources