Alphabeta Math
Pipeline-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.

Cm Math Geometry

1 · Prerequisites

2 · Summary

The geometric and kinematic prerequisites of the non-relativistic classical mechanics collection, all of them mathematics.

The stability group fixes the dynamical vocabulary: Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system defines equilibria, Lyapunov and asymptotic stability, Invariant sets, orbital stability of an invariant set, and linear stability of an equilibrium defines invariant sets, the distance to a set, orbital stability and linear stability, Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories defines hyperbolic equilibria and fixed points, periodic orbits, limit cycles and homoclinic trajectories, and The stroboscopic (time-P) map of a P-periodic first-order system defines the time-P map of a P-periodic system with Iterates of the stroboscopic map, and equilibria as fixed points recording its iterates and the equilibrium fixed-point identity. The constrained-mechanics definitions are Constrained configurations, the mass matrix and the mass metric, with the nondegeneracy criterion The mass metric is symmetric, positive semidefinite, and positive definite exactly when the configuration differential is injective, keeping the intrinsic dimension of the configuration manifold distinct from the ambient particle dimension 3N, and the continuum vocabulary Material regions, densities and their mass and Traction fields and stress matrices representing them, which record the density-as-integrand convention, the traction sign convention and the fact that a representing stress matrix is an object whose existence is a theorem under stated hypotheses, not a definitional consequence.

The affine-time model is Affine time space with Euclidean simultaneous slices and adapted charts: a four-dimensional real vector space with a surjective time functional, an inner product on its kernel, and an affine space of events, together with adapted charts whose time coordinate is fixed by the functional. Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices proves that adapted coordinates exist and are unique and that each simultaneous slice is an affine space over the kernel with its slice distance; Transformation between adapted charts and its kinematic consequences derives the transformation t′=t+b, x′=Rx+vt+a between two adapted charts with R∈SO(3) under the orientation convention, and the velocity and acceleration transformation laws. Angular velocity of a moving frame and the rotating-frame acceleration identity computes the angular velocity Ω=RTR′, proves that RTx′′=y′′+2ω×y′+ω′×y+ω×(ω×y)+RTc′′ for x=Ry+c, and records norm preservation.

The rotation-group facts are 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, SO(3) is a compact three-dimensional embedded submanifold of M3(R), with tangent space the matrices RΩ for skew Ω and A labeling containing two independent vectors has trivial SO(3)-stabilizer: SO(3) is a subgroup of GL3(R) with R−1=RT, a compact three-dimensional embedded submanifold of M3(R) with tangent space {RΩ:ΩT=−Ω}, and a labeling containing two linearly independent vectors has trivial stabilizer. All items carry domain: mathematics; dependence is only on mathematical suppliers, and every external item dependency is a published canonical root mathematics item. The affine-space structure is stated inline in Affine time space with Euclidean simultaneous slices and adapted charts; the separate draft special-relativity definition is not a dependency. The companion page cm-math-geometry-examples verifies the transformation, rotating-frame, constraint, counterexample, primitive and stroboscopic computations in finite form.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system

Definition

Let n≥1, let U⊆Rn be open and let F:U→Rn be a map. Consider the autonomous first-order system

z′(t)=F(z(t)),

read as the first-order system of First-order systems, initial value problems, and solutions on intervals with D=R×U and right-hand side (t,z)↦F(z). A solution below means a solution of this system on an interval containing 0; a solution whose interval is [0,∞) or contains it is said to be defined for all t≥0.

A solution z~:J→U extends z:I→U when I⊆J and z~∣I=z; the extension is proper if I⊊J. A solution is maximal when it has no proper extension (Extensions, maximal solutions, maximal intervals, and global solutions). All stability predicates below quantify over maximal solutions whose intervals contain 0; their local restrictions remain solutions. This convention asserts neither existence nor uniqueness of maximal solutions for an arbitrary map F.

A point z∗∈U is an equilibrium (also fixed point or zero) of F when F(z∗)=0; then the constant function z(t)=z∗ is a solution on every interval containing 0.

Let z∗∈U be an equilibrium.

  1. z∗ is Lyapunov stable (or simply stable) when for every Euclidean ball Bε(z∗) with Bε(z∗)‾⊆U (Open ball, closed ball and sphere in a metric space) there is δ∈(0,ε] such that every maximal solution z with ∥z(0)−z∗∥2<δ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn) is defined for all t≥0 and satisfies

∥z(t)−z∗∥2<ε(t≥0).

  1. z∗ is asymptotically stable when it is Lyapunov stable and in addition there is δ0>0 such that every maximal solution z with ∥z(0)−z∗∥2<δ0 is defined for all t≥0 and satisfies ∥z(t)−z∗∥2→0 as t→∞.

An equilibrium which is not Lyapunov stable is unstable. An equilibrium is globally asymptotically stable when it is asymptotically stable and every maximal solution of the system is defined for all t≥0 and converges to it as t→∞.

Remarks

  • The two clauses are not equivalent. The equation z′=0 on R has every point Lyapunov stable and no point asymptotically stable. Conversely, convergence of nearby solutions to z∗ does not by itself imply stability, which is why clause 2 requires stability explicitly; a standard planar witness is recorded in Problem 6.16 of the cited source. No claim about any physical system is made by either clause.

  • The quantification in clause 1 is invariant under replacing Euclidean balls by arbitrary neighbourhoods of z∗: if the ball form holds then the neighbourhood form holds by choosing a ball inside the given neighbourhood, and conversely. Requiring Bε(z∗)‾⊆U costs no generality, because ε is only a test radius and U is open.

  • Whether the definition is non-vacuous for a given F depends on an existence theory for solutions. Under the continuity and local-Lipschitz hypotheses of Picard-Lindelof, every initial value problem has a unique maximal solution (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval), and clause 1 can be read as forbidding finite-time breakdown before any boundary of the ball is reached. No such hypothesis is built into this definition.

  • Linear stability and orbital stability are defined separately in Invariant sets, orbital stability of an invariant set, and linear stability of an equilibrium; hyperbolicity, limit cycles and homoclinic trajectories in Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories. The stability of a limit cycle is orbital stability of its image, not Lyapunov stability of any of its points.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Invariant sets, orbital stability of an invariant set, and linear stability of an equilibrium

Definition

Let n≥1, let U⊆Rn be open and let F:U→Rn be a map; retain the convention of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system that a solution means a solution of z′(t)=F(z(t)), read as a system of First-order systems, initial value problems, and solutions on intervals, and that it is defined for all t≥0 when its interval contains [0,∞). A maximal solution means one with no proper extension, as defined there; the invariance and stability predicates below quantify over maximal solutions through time 0, not their arbitrary local restrictions. No existence or uniqueness is asserted for an arbitrary F.

Invariant sets. A set S⊆U is forward invariant (for this system) when every maximal solution z with z(0)∈S is defined for all t≥0 and satisfies z(t)∈S for all t≥0.

Distance to a set. For a nonempty S⊆U define

dist⁡(z,S):=inf⁡{ ∥z−s∥2:s∈S }(z∈Rn),

the infimum of a nonempty set of nonnegative reals that is bounded below, computed for the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Define the Euclidean closure of S by

S‾:={z∈Rn:for every ε>0 there is s∈S with ∥z−s∥2<ε}.

The map z↦dist⁡(z,S) is nonnegative and vanishes exactly on S‾: by the defining property of the infimum, dist⁡(z,S)=0 exactly when every positive-radius Euclidean ball about z meets S. When S={z∗} is a singleton, dist⁡(z,S)=∥z−z∗∥2.

Orbital stability. Let S⊆U be nonempty and forward invariant. Then S is orbitally stable when for every ε>0 there is δ>0 such that every maximal solution z with dist⁡(z(0),S)<δ is defined for all t≥0 and satisfies

dist⁡(z(t),S)<ε(t≥0).

It is asymptotically orbitally stable when it is orbitally stable and there is δ0>0 such that every maximal solution with dist⁡(z(0),S)<δ0 is defined for all t≥0 and satisfies dist⁡(z(t),S)→0 as t→∞.

Linear stability. Let z∗∈U be an equilibrium of F and suppose F is totally differentiable at z∗ in the sense of The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, with total derivative DF(z∗):Rn→Rn; write L:=DF(z∗). The linearized system at z∗ is the autonomous linear system

y′(t)=L y(t).

The equilibrium z∗ is linearly stable when every maximal solution y of the linearized system (First-order systems, initial value problems, and solutions on intervals) is defined for all t≥0 and is bounded on [0,∞), that is, there is a real constant C≥0 with ∥y(t)∥2≤C for every t≥0. It is linearly asymptotically stable when every maximal solution of the linearized system is defined for all t≥0 and satisfies ∥y(t)∥2→0 as t→∞.

Remarks

  • Orbital stability of S is a statement about the set S, not about any chosen point of it: it controls the distance of a whole solution to S and does not assert that a solution starting near one point of S stays near that point. Lyapunov stability of an equilibrium is the special case S={z∗}; orbital stability of a limit cycle concerns its periodic image S (Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories) when that image is forward invariant in the sense of the Definition. Under the arbitrary-F hypotheses here, a periodic solution alone does not ensure that every maximal solution through its image remains there; forward invariance must be established separately.

  • Linear stability is a property of the linear system alone. It is not equivalent to Lyapunov stability of z∗ for the nonlinear system; linearization transfers stability only under additional spectral hypotheses, which this definition does not supply.

  • The constant C in the definition of linear stability is not required to be uniform over a family of systems, and no rate of decay is required; linear asymptotic stability is a strictly stronger property than linear stability. Both are defined here for the concrete Euclidean finite-dimensional case only.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories

Definition

Let n≥1, let U⊆Rn be open and let F:U→Rn be a map; a solution means a solution of z′(t)=F(z(t)) as in Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system.

For a real linear map A:Rn→Rn, define its complex-linear extension AC:Cn→Cn by AC(x+iy):=Ax+iAy for x,y∈Rn. In both spectral definitions below, an eigenvalue means an eigenvalue of AC over C (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism with field F=C); Re⁡λ and ∣λ∣ are the real part and modulus of Real and imaginary parts, complex conjugation, and modulus.

Hyperbolic equilibrium. Let z∗∈U be an equilibrium of F and suppose F is totally differentiable at z∗ (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder) with total derivative DF(z∗). Then z∗ is hyperbolic when no eigenvalue of the real matrix of DF(z∗) has real part 0 (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

Hyperbolic fixed point of a map. Let V⊆Rn be open, let φ:V→V be a map and let p∈V satisfy φ(p)=p. Suppose φ is totally differentiable at p. Then p is a hyperbolic fixed point of φ when no eigenvalue of Dφ(p) has modulus 1.

Periodic solutions and periodic orbits. A solution z:R→U is T-periodic for T>0 when z(t+T)=z(t) for every t∈R, and periodic when it is T-periodic for some T>0. It is nonconstant when z(t1)≠z(t2) for some t1,t2. The image of a periodic solution is {z(t):t∈R}; a subset of U is a periodic orbit when it is the image of a nonconstant periodic solution. A number T>0 is a least period of z when T is a period of z and no T′∈(0,T) is a period of z.

Limit cycle. A periodic orbit S⊆U is a limit cycle when it is isolated: there is an open set W⊆U with S⊆W such that the image of every nonconstant periodic solution lying in W equals S; equivalently, no other periodic orbit of the system is contained in W. Stability or attraction of S is a separate property and is not part of the definition.

Homoclinic and heteroclinic trajectories. A solution z defined on all of R is homoclinic to the equilibrium z∗ when z(t)→z∗ as t→+∞ and as t→−∞ and z is not the constant solution z≡z∗. It is heteroclinic from z∗ to z∗∗ when z∗≠z∗∗ are equilibria and z(t)→z∗∗ as t→+∞ and z(t)→z∗ as t→−∞.

Remarks

  • Hyperbolicity is a spectral condition on the derivative at a single point. It does not by itself assert Lyapunov stability, instability, the existence of local stable or unstable manifolds, or any statement about the nonlinear system; each of those is a theorem about the system under stated hypotheses, not a definitional consequence.

  • The qualifier "isolated" in the definition of a limit cycle is taken with respect to the periodic orbits of the same system on an open neighbourhood of the cycle's image. A given periodic orbit may be isolated in this sense while being orbitally unstable; conversely an orbitally stable periodic orbit in a system with a continuum of periodic orbits filling an annulus is not a limit cycle.

  • Stability and attraction of an invariant set are defined in Invariant sets, orbital stability of an invariant set, and linear stability of an equilibrium; for a periodic orbit they are separate from the isolation condition used here, and neither is implied by it.

  • For an equilibrium z∗, adopt the all-solutions convention when uniqueness is not assumed. For a∈U, let M(a) be the set of maximal solutions through z(0)=a, with maximality as in Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system. Define W+(z∗) to consist of those a for which M(a)≠∅ and every z:J→U in M(a) has [0,∞)⊆J and z(t)→z∗ as t→+∞. Define W−(z∗) by the same nonemptiness requirement, (−∞,0]⊆J for every such solution, and convergence as t→−∞. With a unique maximal solution these reduce to the usual stable and unstable sets; without uniqueness they explicitly require convergence of all trajectories and differ from an existential convention. Calling either set a differentiable manifold requires a stable-manifold theorem with its own hypotheses; no such conclusion is drawn here.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The stroboscopic (time-P) map of a P-periodic first-order system

Definition

Let n≥1, let U⊆Rn be open, let P>0, and let F:R×U→Rn be a map that is continuous and locally Lipschitz in the state variable, in the sense of the hypotheses of Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, and that is P-periodic:

F(t+P,z)=F(t,z)(t∈R, z∈U).

Consider the first-order system x′(t)=F(t,x(t)) of First-order systems, initial value problems, and solutions on intervals on the open domain R×U. For z∈U let

xz:Jz⟶U

be the unique maximal solution of the initial value problem x′(t)=F(t,x(t)), x(0)=z; here Jz is the open maximal interval of existence containing 0, and by Every Picard–Lindelöf initial value problem has one maximal solution on an open interval every solution of this initial value problem is a restriction of xz (Extensions, maximal solutions, maximal intervals, and global solutions, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

The domain of the stroboscopic map is

DP:={ z∈U:[0,P]⊆Jz },

the set of initial states whose solution exists over one full period. The stroboscopic map (or time-P map) of the system is the function

θP:DP⟶U,θP(z):=xz(P).

This is a well-defined function: for z∈DP the interval Jz contains P, so xz(P) is a point of U, and by the uniqueness clause of the maximal-solution theorem the value xz(P) does not depend on any choice, since xz is the only maximal solution through (0,z).

Remarks

  • The definition depends on the chosen initial time 0. Replacing the initial time by t0 and defining θPt0(z):=xt0,z(t0+P) on the corresponding domain gives the same family of maps up to the time-translation flow of the P-periodic system; only the initial time 0 is used on this page.

  • The domain DP is the set where the solution exists up to time P; it need not be invariant under θP or equal all of U. Openness of this domain is not proved here. Formal iterates θPk are defined only on the subset of points for which each successive value remains in DP; the precise statement is Iterates of the stroboscopic map, and equilibria as fixed points.

  • If F does not depend on t (the autonomous case), then θP is the time-P map of the autonomous system and every equilibrium z∗ of the autonomous right-hand side satisfies θP(z∗)=z∗. A fixed point z∈DP yields a P-periodic solution: repeat xz∣[0,P] on every interval [kP,(k+1)P], k∈Z. Values at each joining point equal z, and the one-sided derivatives agree because F(P,z)=F(0,z). Periodicity of F makes each segment solve the same equation; hence the repeated curve is a solution on R, and uniqueness identifies it with xz. Conversely a P-periodic solution through z gives θP(z)=z. Constant solutions are included, so a fixed point alone does not imply a nonconstant periodic orbit.

  • The map θP can be studied as a discrete-time map. Applying the hyperbolic-fixed-point definition of Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories requires a differentiable self-map of an open neighbourhood of the fixed point; such a restriction is not supplied here. No relation to a continuous-time stability criterion is asserted here.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Iterates of the stroboscopic map, and equilibria as fixed points

Statement

Retain all notation and hypotheses of The stroboscopic (time-P) map of a P-periodic first-order system: U⊆Rn is open, P>0, and F:R×U→Rn is continuous, locally Lipschitz in the state variable, and P-periodic.

  1. If z∈DP and θP(z)∈DP, then [0,2P]⊆Jz and

θP(θP(z))=xz(2P).

  1. If z∗∈U satisfies F(t,z∗)=0 for every t∈R, then z∗∈DP and θP(z∗)=z∗.

Facts & Assumptions

Given: The hypotheses of The stroboscopic (time-P) map of a P-periodic first-order system: an open U⊆Rn, a number P>0, and a continuous map F:R×U→Rn, locally Lipschitz in the state variable and P-periodic; for clause 1 a point z∈DP with θP(z)∈DP; for clause 2 a point z∗∈U with F(t,z∗)=0 for every t.

[F1]

Each initial value problem x′=F(t,x), x(t0)=x0 satisfies the Picard-Lindelof hypotheses, so it has a unique maximal solution whose domain is an open interval containing t0, and every other solution through the same data is a restriction of it (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, Extensions, maximal solutions, maximal intervals, and global solutions).

[F2]

The stroboscopic map satisfies θP(w)=xw(P) for w∈DP, and DP={w∈U:[0,P]⊆Jw} (The stroboscopic (time-P) map of a P-periodic first-order system).

[F3]

If two locally unique solutions of the same continuous equation are defined on adjacent intervals, agree at the common endpoint, and solve the equation there, their piecewise union is a solution on the union interval (Locally unique ODE solutions agree on overlaps and glue across a common endpoint).

[F4]

The right-hand side is P-periodic, so F(t+P,x)=F(t,x) for all (t,x) (The stroboscopic (time-P) map of a P-periodic first-order system).

Proof

technique · direct
1.1F2givenconstruct

Put w:=θP(z)=xz(P), a point of DP by hypothesis, and let xw:Jw→U be the maximal solution of x′=F(t,x), x(0)=w; by [F2] the interval Jw contains [0,P]. Define y:[0,2P]→U by y(t):=xz(t) for t∈[0,P] and y(t):=xw(t−P) for t∈[P,2P].

2.1step 1.1F3F4algebra

The curve y is well defined and continuous: at the common point P both formulas give y(P)=xz(P)=w=xw(0). On [0,P] it solves the system by definition of xz. On [P,2P], writing s=t−P, one has y′(t)=xw′(s)=F(s,xw(s))=F(s+P,xw(s))=F(t,y(t)) by P-periodicity [F4]. At t=P the one-sided derivatives are y′(P−)=F(P,w) and y′(P+)=F(0,w), equal by [F4]; hence y′(P)=F(P,y(P)). The domain-relative endpoint derivatives of the ODE solution definition and the gluing fact [F3] therefore make y a solution on [0,2P].

3.1step 1.1step 2.1F1F2algebra

The curve y satisfies y(0)=xz(0)=z, so y is a solution of the initial value problem with data (0,z) on [0,2P]. By the uniqueness clause of [F1] every solution through (0,z) is a restriction of the maximal solution xz, so [0,2P]⊆Jz and y=xz∣[0,2P]. In particular xz(2P)=y(2P)=xw(P)=θP(w)=θP(θP(z)).

4.1F1F2given∎

For clause 2, the constant curve c(t):=z∗ is a solution of the system on R because c′(t)=0=F(t,c(t)); it satisfies c(0)=z∗, so by the uniqueness clause of [F1] it is a restriction of xz∗. Hence [0,P]⊆Jz∗, that is z∗∈DP, and θP(z∗)=xz∗(P)=c(P)=z∗.

Remarks

  • Clause 1 is the precise sense in which iterating a stroboscopic map follows the continuous solution across successive periods: each iterate requires the previous value to lie in DP again, and then the iterate equals the value of the same maximal solution at the corresponding multiple of P. The identity extends by induction to k-fold iterates as long as every intermediate value lies in DP.

  • No claim is made that DP is nonempty, open, or forward invariant, or that θP has periodic points. Clause 2 shows only that every equilibrium of the P-periodic vector field gives a fixed point of θP with domain membership.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Constrained configurations, the mass matrix and the mass metric

Definition

Let N≥1; the ambient dimension is 3N. Identify R3N with the N-fold product (R3)N and write a point as x=(x1,…,xN) with xi∈R3, explicitly xi(k):=x(3(i−1)+k) for 1≤i≤N and 0≤k<3; the Euclidean inner product on R3N is

⟨x,y⟩3N=∑i=1N⟨xi,yi⟩2,

with ⟨ ⋅ , ⋅ ⟩2 the inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

Let d≥0 and let Q be a smooth d-dimensional manifold (Smooth manifolds and their smooth charts) and let

X:Q⟶R3N

be a smooth map. The manifold Q is the configuration space and X is the configuration map; the pair (Q,X) is called a particle configuration when Q is an embedded submanifold of R3N and X is the inclusion (Embedded submanifolds and slice charts), and a parametrized configuration otherwise. For q∈Q the intrinsic differential is dXq:TqQ→TX(q)R3N as in The differential of a smooth map (Derivations at a point and the tangent space for the tangent space). For a∈R3N and the coordinate function πk(x):=x(k), define ιa:TaR3N→R3N by ιa(w)(k):=w([πk]) for 0≤k<3N. This is the standard linear isomorphism: in the identity chart the coordinate derivations form a basis by Coordinate derivations form a basis of the tangent space, and evaluation on coordinate germs sends that basis to the standard unit vectors. Throughout this item and its mass-metric formulas, the notation dXq(u) in Euclidean expressions abbreviates ιX(q)(dXq(u)). In particular its components are u([πk∘X]), so this convention retains the usual Jacobian and inclusion formulas.

Let m1,…,mN>0 be masses. The mass matrix is the linear map M:R3N→R3N acting on each block by M(x1,…,xN)=(m1x1,…,mNxN); its matrix in the standard basis is block diagonal with blocks miI3 (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

The mass metric of (Q,X,m1,…,mN) is the family of maps

Gq:TqQ×TqQ⟶R,Gq(u,v):=⟨dXq(u), M dXq(v)⟩3N,

for q∈Q and u,v∈TqQ. The kinetic energy of a tangent vector v∈TqQ is

Tq(v):=12 Gq(v,v).

Each Gq is a symmetric bilinear form on the real vector space TqQ in the sense of Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms; that the family depends smoothly on q means that in every smooth local chart of Q the coefficient functions q↦Gq(∂i,∂j) are smooth, and is stated in the smoothness remark below.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The mass metric is symmetric, positive semidefinite, and positive definite exactly when the configuration differential is injective

Statement

Let N≥1, let Q be a smooth manifold, let X:Q→R3N be smooth, let m1,…,mN>0 and let Gq be the mass metric of Constrained configurations, the mass matrix and the mass metric.

  1. For every q∈Q the map Gq is a symmetric bilinear form on TqQ.
  2. Gq(u,u)=∑i=1Nmi∥dXq(u)i∥22≥0 for every u∈TqQ, so Gq is positive semidefinite.
  3. Gq is positive definite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form) if and only if dXq is injective. In particular, if X is an immersion (Immersions, submersions, and constant-rank maps) then Gq is positive definite for every q.
  4. If b1,…,bn is an ordered basis of TqQ and A is the matrix whose j-th column is the coordinate vector of dXq(bj) in the standard basis of R3N, then the matrix of the bilinear form Gq in this basis is ATMA, with M the mass matrix.

Facts & Assumptions

Given: The data (Q,X,m1,…,mN) of Constrained configurations, the mass matrix and the mass metric, a point q∈Q, and an ordered basis b1,…,bn of TqQ for clause 4.

[L1]

The mass metric is Gq(u,v)=⟨dXq(u),MdXq(v)⟩3N, the differential is linear, and M(x1,…,xN)=(m1x1,…,mNxN) with mi>0 (Constrained configurations, the mass matrix and the mass metric).

[L2]

The Euclidean inner product satisfies ⟨x,x⟩=∥x∥22≥0, with equality only for x=0, and is bilinear (Real and complex inner product spaces, with the inner product linear in the first argument, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L3]

Positive definiteness of a symmetric bilinear form means B(u,u)>0 for every u≠0 (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

Proof

technique · direct
1.1L1L2algebra

Bilinearity of Gq follows from linearity of dXq and of M together with bilinearity of the inner product [L1, L2]: for reals α,β and u,u′,v∈TqQ, Gq(αu+βu′,v)=αGq(u,v)+βGq(u′,v) and similarly in the second argument. Symmetry follows from symmetry of M: since M acts by x↦(m1x1,…,mNxN), ⟨a,Mb⟩3N=∑imi⟨ai,bi⟩2=⟨Ma,b⟩3N, so Gq(u,v)=Gq(v,u). This proves clause 1.

1.2L1L2algebra

For u∈TqQ write dXq(u)=(w1,…,wN) with wi∈R3; then [L1] and [L2] give Gq(u,u)=⟨dXq(u),MdXq(u)⟩3N=∑i=1Nmi⟨wi,wi⟩2=∑i=1Nmi∥wi∥22≥0. This proves clause 2.

2.1step 1.2L3algebra

Suppose dXq is injective and u≠0; then dXq(u)≠0, so some wi≠0, so ∥wi∥22>0 by [L2], and since mi>0 the sum in step 1.2 is strictly positive. Hence Gq(u,u)>0 for every u≠0. Conversely, if dXq is not injective, choose u≠0 with dXq(u)=0; then every wi=0, the sum in step 1.2 vanishes, and Gq is not positive definite by [L3]. This proves clause 3 for the injectivity criterion; if X is an immersion, dXq is injective at every q by definition, so Gq is positive definite.

3.1step 1.1L1L2algebra∎

In the basis b1,…,bn the matrix of Gq has entries Gq(bj,bk)=⟨dXq(bj),MdXq(bk)⟩3N. If A is the matrix whose j-th column is the coordinate vector of dXq(bj), then M(dXq(bk)) has coordinate vector MAek, and the inner product of coordinate vectors is the Euclidean product, so Gq(bj,bk)=(ATMA)jk. This proves clause 4.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Material regions, densities and their mass

Definition

A material region is a nonempty, bounded, open subset B⊆R3. This region predicate is choice-free and does not assume a density or measure.

For the following Lebesgue density and mass construction, assume ACω (The Axiom of Countable Choice (ACω)): Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume supplies the measure λ3 on its Lebesgue sigma-algebra (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Measures on sigma-algebras). Since B is open, it is Lebesgue measurable by the Borel-measurability theorem (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable). Put LB:={E∩B:E∈L(R3)} and λB(C):=λ3(C) for C∈LB. The trace family LB is a sigma-algebra on B (Sigma-algebras); countable additivity of λB follows by applying that of λ3 to disjoint trace-measurable sets, so (B,LB,λB) is a measure space (Measures on sigma-algebras). In the displays below, ∫Bρ dλ3 means the Lebesgue integral of ρ on this measure space (Integrable real and complex functions, and their integrals). A density on B is a measurable function

ρ:B⟶[0,∞)

measurable as a map from (B,LB) to (R,B(R)) (Measurable spaces and measurable sets, A measurable function between measurable spaces, The Borel sigma-algebra of a topological space) and integrable on (B,LB,λB); the mass of the pair (B,ρ) is

mass⁡(B,ρ):=∫Bρ dλ3 ∈[0,∞).

For this scalar function, bounded means that some M<∞ satisfies 0≤ρ(X)≤M for every X∈B. Continuous means that for every X∈B and every ε>0 there is δ>0 such that Y∈B and ∥X−Y∥2<δ imply ∣ρ(X)−ρ(Y)∣<ε. For k≥1, of class Ck on B means that every iterated coordinate partial derivative of order at most k exists on B and is continuous there; no extension to ∂B is required unless a consuming statement says so. A measured material region is a triple (B,ρ,m) with m=mass⁡(B,ρ) recorded.

Remarks

  • Only measurability and integrability on the restricted Lebesgue measure space (B,LB,λB), together with the displayed nonnegative codomain, are part of the density definition. A density is not required to be positive, bounded, continuous, or supported away from ∂B, and the definition asserts no conservation law: the mass is a number attached to (B,ρ).

  • Boundary regularity is a declared hypothesis, not part of the word "region": when a statement needs it, it says that the boundary ∂B is a C1 embedded surface (or a smooth/rectifiable hypersurface) and states the surface-measure conventions used. The local transport and balance items of this collection state their own boundary hypotheses; none is inherited from this definition.

  • The unit of ρ is mass per unit volume only after a unit system is fixed. The mathematical object here is a function and a number; no physical identification of the number m with a measured mass is made, and no empirical claim is attached.

  • The statement "ρ is mass per volume" is the interpretation convention m=∫Bρ dλ3 recorded above; it is a definition of the interpretation, not a physical law. In particular, if ρ is a summable function with a discontinuity across a surface, the integral above is still the Lebesgue integral and no interfacial mass is implied unless it is separately declared.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Traction fields and stress matrices representing them

Definition

Let Ω⊆R3 be a spatial set and let I⊆R be a time interval. No openness of Ω or regularity of a traction map is assumed by this definition; consumers impose any needed additional hypotheses. Let S2:={n∈R3:∥n∥2=1} be the unit sphere of Euclidean spheres and closed balls as subspaces of Rn.

A traction field is a map

t:S2⟶R3,

read with the following convention: t(n) is the force per unit area exerted by the material on the side towards which n points upon the material on the other side, at the point of a surface whose unit normal is n. The dependence of t on position and time is suppressed in this notation; a traction field on a set Ω×I is a map t:Ω×I×S2→R3, and all statements below apply to each fixed (y,s).

For v∈R3 use one-based component labels vi:=v(i−1), and for σ∈M3(R) use σij:=σ(i−1,j−1), where 1≤i,j≤3; ei is the vector with value 1 at i−1 and 0 at the other two indices. Define the matrix-vector action σv∈R3 by (σv)(k):=∑j<3σ(k,j)v(j) for 0≤k<3, equivalently (σv)i=∑j=13σijvj. It is the rectangular product of Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes after identifying v with the column matrix Cv(j,0):=v(j) and the result with its sole column.

A matrix σ∈M3(R) (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations) represents the traction field t when

t(n)=σnfor every n∈S2,

the product being the matrix-vector action defined above. A matrix representing a traction field is called a stress matrix for it.

The reversed normal convention is the identity t(−n)=−t(n); it is a property some traction fields have and is not part of the definition. A traction field is normal when t(n) is a real multiple of n for every n, and purely tangential when ⟨t(n),n⟩2=0 for every n (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Remarks

  • Continuity and dependence on the normal alone do not imply existence of a representing matrix: the continuous map t(n)=(n13,0,0) has t(e1)=e1 and t(e2)=t(e3)=0, forcing any representing matrix to be diag⁡(1,0,0), but this matrix disagrees with t at n=(1/2,1/2,0). Conditional Cauchy tetrahedron arguments also require balance and limiting hypotheses, stated by their consuming items. If a representing matrix exists, it is unique because its columns are t(e1),t(e2),t(e3).

  • Stress positivity is not asserted: for λ>0, the matrix −λI3 represents the normal-dependent map t(n)=−λn under the sign convention above. This is a mathematical example and imposes no constitutive or force-balance law.

  • This definition does not identify a traction with an acceleration or assert any momentum balance; those are separate model data and results with their own hypotheses.

  • The notation t(n) suppresses the point of application. A traction field depending only on (y,s) cannot distinguish two surfaces through the same point with the same normal, which is exactly the restriction Cauchy's hypothesis imposes; the failure of that hypothesis for general contact interactions is not a defect of this definition.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Affine time space with Euclidean simultaneous slices and adapted charts

Definition

Let V be a real vector space of dimension 4 (Vector space over a field) and let τ:V→R be a surjective linear map (Linear map between vector spaces over the same field). Put

K:=ker⁡τ={v∈V:τ(v)=0},

the kernel of τ (Kernel and image of a linear map). The kernel is a linear subspace (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial), so the quotient vector space V/K is defined (The quotient vector space V/W and its canonical projection). The first isomorphism theorem gives the linear isomorphism V/K→im⁡τ=R, v+K↦τ(v) (First isomorphism theorem for vector spaces: V/ker⁡T is isomorphic to im⁡T). Since R has the one-element standard basis, dim⁡R=1 (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 with F=R and n=1); rank-nullity for the surjective map τ therefore gives dim⁡K=4−1=3 (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

Let g be an inner product on K in the sense of Real and complex inner product spaces, with the inner product linear in the first argument: a symmetric positive definite R-bilinear form g:K×K→R.

Let A be a nonempty set equipped with an action of the additive group of V, written (p,v)↦p+v, that is free and transitive: explicitly, (p+v)+w=p+(v+w) and p+0=p for all p∈A and v,w∈V, and for all p,q∈A there is exactly one v∈V with p+v=q; write q−p for that unique vector. The identities p+(q−p)=q, (q−p)+(r−q)=r−p and q−p=−(p−q) follow from the axioms together with uniqueness of the displacement. Such a set is an affine space modelled on V, and its elements are events. (This formulation restates the affine-space structure used here so that the item is self-contained; the general theory of affine spaces is supplied by the special-relativity collection for its own consumers.)

Fix an orientation of K in the sense of Orientation of a finite-dimensional real vector space; this is a chosen orientation class, not a chosen spatial basis.

An adapted chart for the data (V,τ,g,A) is a triple (o,u,(e1,e2,e3)) consisting of

  1. an origin o∈A;
  2. a vector u∈V with τ(u)=1;
  3. an ordered basis (e1,e2,e3) of K that is g-orthonormal and positively oriented with respect to the fixed orientation of K (Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases, Orientation of a finite-dimensional real vector space).

An adapted chart exists for every such set of data and fixed orientation, by clause 3 of Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices ↗.

For spatial coordinate vectors x∈R3, this item uses the one-based labels xi:=x(i−1) for 1≤i≤3; thus (x1,x2,x3) lists the values at 0,1,2 of the function-space vector of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. The labels e1,e2,e3 name the corresponding ordered spatial basis; they do not change the underlying index set of R3.

The adapted coordinates of a point p∈A in this chart are the pair (t,x)∈R×R3 determined by

p=o+tu+∑i=13xiei,

when such a pair exists (existence and uniqueness are Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices ↗, so that the notation is defined for every p). The number t is the time coordinate and x=(x1,x2,x3) the spatial coordinate vector of p in the chart. When K is identified with R3 through the coordinates in (e1,e2,e3), the assignment p↦(t,x) is a bijection A→R×R3.

Simultaneous slices. For t∈R set

At:={p∈A:τ(p−o)=t}.

The family {At}t∈R is the family of simultaneous slices of the chart. Each At is an affine space modelled on K; the derivation is immediate from the affine identities and linearity of τ and is recorded in Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices ↗. The slice distance of two points p,q in a common slice At is

dg(p,q):=g(p−q, p−q),

the square root taken in R; this is defined because p−q∈K for points of a common slice. In adapted coordinates dg(p,q)=∥x(p)−x(q)∥2, with ∥⋅∥2 the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

Remarks

  • The data (V,τ,g,A) contain no inner product on V and no identification of V with R4: g is defined only on K. Consequently a general displacement v∈V with τ(v)≠0 has no g-norm defined in this structure, and "the length of a temporal displacement" is not a quantity of the model. Only displacements inside a common slice carry a length, and those are exactly the elements of K.

  • The time coordinate of an adapted chart is fixed by τ and the origin alone: if p=o+tu+k with k∈K, then τ(p−o)=t, so t is independent of u and of the spatial basis. The remaining freedom in the chart (choice of o, u, oriented orthonormal basis of K) is what produces the transformation law of Transformation between adapted charts and its kinematic consequences. The phrase "ten parameters" for the passage between two such charts refers to the dimensions of the transformation data (b,a,v,R) and is not asserted here as a Lie-group dimension count.

  • This is a mathematical model. No postulate that physical space and time are described by such data, that adapted charts are inertial frames, or that g is measured by any apparatus is part of this definition; physical interpretations and their empirical qualifications are supplied by the physical items that consume it, with their own hypotheses.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices

Statement

Let (V,τ,g,A) and an adapted chart (o,u,(e1,e2,e3)) be as in Affine time space with Euclidean simultaneous slices and adapted charts.

  1. Every p∈A has exactly one pair (t,x)∈R×R3 with

p=o+tu+∑i=13xiei,

so the adapted-coordinate map ι:A→R×R3 of that definition is well defined, and it is a bijection.

  1. For every t∈R the simultaneous slice At={p:τ(p−o)=t} is an affine space modelled on K=ker⁡τ, and for p,q∈At one has p−q∈K with p−q=∑i(xi(p)−xi(q))ei and

dg(p,q)=∥x(p)−x(q)∥2.

  1. For every set of data (V,τ,g,A) and fixed orientation of K satisfying Affine time space with Euclidean simultaneous slices and adapted charts, at least one adapted chart exists. No origin, time vector or spatial basis is distinguished by this existence assertion.

Facts & Assumptions

Given: The data of Affine time space with Euclidean simultaneous slices and adapted charts: a real four-dimensional vector space V, a surjective linear map τ:V→R, K=ker⁡τ of dimension 3, an inner product g on K, a nonempty affine space A modelled on V, and a fixed orientation of K. For clauses 1 and 2, also a given adapted chart (o,u,(e1,e2,e3)); for clause 1 any p∈A, and for clause 2 any t∈R and p,q∈At. Clause 3 assumes only the raw data and orientation.

[L1]

A carries the free transitive V-action recorded in Affine time space with Euclidean simultaneous slices and adapted charts: every pair p,q has a unique displacement q−p with p+(q−p)=q, and displacements satisfy (q−p)+(r−q)=r−p and q−p=−(p−q), the latter two being consequences of the action axioms and uniqueness of displacements (Affine time space with Euclidean simultaneous slices and adapted charts).

[L2]

τ is linear and surjective, K=ker⁡τ, and the chart vector u satisfies τ(u)=1 (Affine time space with Euclidean simultaneous slices and adapted charts, Kernel and image of a linear map, Linear map between vector spaces over the same field).

[L3]

For the given chart in clauses 1 and 2, (e1,e2,e3) is an ordered g-orthonormal basis of K: every k∈K has a unique expansion k=∑ixiei, and g(ei,ej)=δij (Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases, Affine time space with Euclidean simultaneous slices and adapted charts).

[L4]

Every finite-dimensional real inner-product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis). Here K has dimension 3 and g is an inner product, as in Affine time space with Euclidean simultaneous slices and adapted charts.

[L5]

An orientation is an equivalence class of ordered bases under positive-determinant changes of basis. In positive dimension there are exactly two classes, and interchanging two entries of an ordered basis gives a change of basis with determinant −1 (Orientation of a finite-dimensional real vector space).

Proof

technique · direct
1.1L2algebra

For every v∈V the vector v−τ(v)u lies in K, because τ(v−τ(v)u)=τ(v)−τ(v)τ(u)=τ(v)−τ(v)=0 by linearity [L2]. Hence v=τ(v)u+k with k:=v−τ(v)u∈K, so V=Ru+K.

2.1step 1.1L2algebra

Suppose v=tu+k=t′u+k′ with t,t′∈R and k,k′∈K. Applying τ gives t=t′ since τ(u)=1 and τ(k)=τ(k′)=0; then k=v−tu=k′. Hence every v has exactly one decomposition v=tu+k, and t=τ(v).

2.2step 1.1L1L2algebra

Fix t∈R. The event o+tu lies in At, because τ((o+tu)−o)=tτ(u)=t, so At is nonempty. For k∈K and p∈At one has τ((p+k)−o)=τ(p−o)+τ(k)=t, so p+k∈At; the action of K on At so defined is associative, and it is free and transitive because displacements in At are displacements in A and lie in K: if p,q∈At then τ(q−p)=τ(q−o)−τ(p−o)=0, so q−p∈K and p+(q−p)=q with the displacement unique in V and hence in K [L1, L2]. Thus At is an affine space modelled on K.

3.1step 1.1step 2.1L1L3

Let p∈A and put v:=p−o, the unique displacement vector of [L1]. By steps 1.1 and 2.1 there are unique t∈R and k∈K with v=tu+k; by [L3] there is a unique x∈R3 with k=∑ixiei. Hence (t,x) is the unique pair with p=o+tu+∑ixiei, and the map ι is well defined. The assignment (t,x)↦o+tu+∑ixiei is a left and right inverse of ι by the defining property of the action [L1]; hence ι is a bijection onto R×R3. This proves clause 1.

4.1step 3.1step 2.2L1L3algebra

For p,q∈At the coordinate expressions p−o=tpu+∑ixi(p)ei and q−o=tqu+∑ixi(q)ei have tp=tq=t by definition of At, so subtracting the two displays and using [L1] gives p−q=∑i(xi(p)−xi(q))ei. By [L3], g(p−q,p−q)=∑i(xi(p)−xi(q))2, so dg(p,q)=∥x(p)−x(q)∥2. This proves clause 2.

5.1L1L2L4L5choose∎

Choose o∈A, possible because A is nonempty, and choose u∈V with τ(u)=1, possible because τ is surjective. By [L4], choose an ordered g-orthonormal basis (f1,f2,f3) of K. If it belongs to the fixed orientation class, put (e1,e2,e3)=(f1,f2,f3); otherwise put (e1,e2,e3)=(f2,f1,f3). The interchange preserves the basis property and all identities g(ei,ej)=δij, and its determinant is −1 by [L5], so it changes the orientation class. Since there are exactly two classes, the resulting basis is positively oriented. Thus (o,u,(e1,e2,e3)) is an adapted chart, proving clause 3. These are finitely many existential choices, not a selection from an arbitrary family.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Transformation between adapted charts and its kinematic consequences

Statement

Let (V,τ,g,A) be as in Affine time space with Euclidean simultaneous slices and adapted charts and let (o,u,(e1,e2,e3)) and (o′,u′,(e1′,e2′,e3′)) be two adapted charts, with coordinate functions (t,x) and (t′,x′) of Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices.

  1. There are b∈R, a,v∈R3 and a matrix R∈O(3) such that for every p∈A

t′(p)=t(p)+b,x′(p)=R x(p)+v t(p)+a.

If (e1,e2,e3) and (e1′,e2′,e3′) are both positively oriented for the fixed orientation of K, then R∈SO(3) (The orthogonal group O(3) and the rotation group SO(3)).

  1. Let I⊆R be a nondegenerate interval and let γ:I→A be a map whose first-chart time coordinate satisfies t(γ(s))=s for all s∈I. Write x(s):=x(γ(s)) and y(s):=x′(γ(s)). The regularity hypothesis below means that this coordinate function x:I→R3 is continuously differentiable (respectively, twice continuously differentiable); no additional smooth structure on A is assumed. If x is continuously differentiable then y is continuously differentiable with

y′(s)=R x′(s)+v(s∈I),

and if x is twice continuously differentiable then y′′(s)=R x′′(s) for all s∈I. Equivalently, in the differentiated variables of the two charts, dx′/dt′=R dx/dt+v and d2x′/dt′2=R d2x/dt2.

  1. Consequently x′′=0 on I if and only if y′′=0 on I: the two charts agree on which time-parametrized curves have zero coordinate acceleration.

Facts & Assumptions

Given: Two adapted charts (o,u,(e1,e2,e3)) and (o′,u′,(e1′,e2′,e3′)) of the data (V,τ,g,A), with coordinate functions (t,x) and (t′,x′); for clauses 2 and 3 a map γ:I→A with t(γ(s))=s, and its first-chart spatial coordinate x(s) of the stated regularity.

[L1]

Affine displacement identities: p+(q−p)=q, (q−p)+(r−q)=r−p, and displacements are additive over the action, as recorded in Affine time space with Euclidean simultaneous slices and adapted charts.

[L2]

τ is linear with τ(u)=τ(u′)=1 and K=ker⁡τ; hence τ(u−u′)=0, so u−u′∈K; moreover τ(o−o′)=t′(o)−t(o) is a constant (Affine time space with Euclidean simultaneous slices and adapted charts).

[L3]

Adapted coordinates are unique, and for each slice At the coordinate vector of p−o−tu∈K in the basis (e1,e2,e3) is x(p); likewise for the primed chart (Existence and uniqueness of adapted coordinates, and the affine structure of simultaneous slices).

[L4]

Both ordered bases are g-orthonormal and positively oriented; if M is the change-of-basis matrix defined by ej=∑kMkjek′, then MTM=I3, and det⁡M>0 because the two bases lie in the same orientation class. Determinant multiplicativity and invariance under transpose give (det⁡M)2=det⁡(MTM)=1; positivity and uniqueness of the positive square root give det⁡M=1. Hence M∈O(3), and M∈SO(3) under the orientation hypothesis of clause 1 (Orientation of a finite-dimensional real vector space, Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases, The orthogonal group O(3) and the rotation group SO(3), For every square matrix over a commutative ring, det⁡(AT)=det⁡(A), For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B), Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

Proof

technique · direct
1.1L1L2L3algebra

By the slice formula of [L3] applied at p and at o, t′(p)−t(p)=τ(p−o′)−τ(p−o)=τ(o−o′), which does not depend on p; put b:=τ(o−o′). This proves the first display of clause 1.

2.1step 1.1L1L2L3algebra

Let k:=p−o−tu=∑ixi(p)ei∈K and k′:=p−o′−t′u′=∑ixi′(p)ei′∈K. Subtracting the second expansion from the first and using [L1], k′=k+(o−o′)+(t−t′)u+t′(u−u′). Here (o−o′)+(t−t′)u∈K because its τ-value is b−b=0 by step 1.1 and [L2], and t′(u−u′)∈K by [L2]; hence the displayed equality is an identity in K.

3.1step 1.1step 2.1L1L3L4algebra

Let c∈R3 be the coordinate vector in the unprimed basis of the constant vector (o−o′)+(t−t′)u∈K, and let d∈R3 be the coordinate vector of u−u′∈K; by step 2.1 and [L3], the coordinate vector of k′ in the unprimed basis is x(p)+c+t′(p)d. Since the coordinate vector of k′ in the primed basis is x′(p) and changes of coordinates are given by [L4], x′(p)=M(x(p)+c+t′(p)d)=Mx(p)+(Md)t′(p)+Mc. Using t′=t+b from step 1.1 and setting R:=M, v:=Md, a:=Mc+bv, this reads x′(p)=Rx(p)+vt(p)+a, the second display of clause 1.

4.1step 3.1L4algebra

By [L4], MTM=I3, so R=M∈O(3); and if both bases are positively oriented then det⁡M>0, which with det⁡M=±1 gives det⁡M=1 and R∈SO(3). This completes clause 1.

4.2step 3.1L5algebra

For the map γ with t(γ(s))=s, clause 1 gives y(s)=x′(γ(s))=Rx(s)+vs+a. By [L5], this coordinate function is C1 with y′(s)=Rx′(s)+v, and if x is C2 it satisfies y′′(s)=Rx′′(s). Since t′(γ(s))=s+b, one has dt′/ds=1, giving the equivalent differentiated-coordinate formulas. This proves clause 2.

5.1step 4.2L4algebra∎

If x′′=0 on the interval then y′′=Rx′′=0 by step 4.2; conversely if y′′=0 then 0=RTy′′=RTRx′′=x′′ because RTR=I3 by [L4]. This proves clause 3.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Angular velocity of a moving frame and the rotating-frame acceleration identity

Statement

Use one-based labels zi:=z(i−1) and Aij:=A(i−1,j−1) for 1≤i,j≤3, so the displayed components correspond in order to the imported coordinates 0,1,2. Matrix-vector products mean (Az)(k):=∑j<3A(k,j)z(j), obtained from the rectangular product by representing z as the column Cz(j,0)=z(j) (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

Let I⊆R be a nondegenerate interval, let R:I→SO(3) and c:I→R3 be twice continuously differentiable in the sense that all entries of R and all components of c have continuous second derivatives, and put

Ω(t):=R(t)TR′(t)(t∈I).

  1. Ω(t) is skew-symmetric for every t∈I, that is Ω(t)T=−Ω(t).
  2. For every t∈I there is exactly one vector ω(t)∈R3 such that

Ω(t)z=ω(t)×z(z∈R3),

the cross product being that of The cross product in R3. Its components in the standard basis are ω(t)=(−Ω23(t),Ω13(t),−Ω12(t)). Since R is C2, Ω=RTR′ and hence ω are C1; thus ω′(t) in clause 3 is defined. 3. If y:I→R3 is twice continuously differentiable and

x(t):=R(t)y(t)+c(t)(t∈I),

then for every t∈I

R(t)Tx′′(t)=y′′(t)+2 ω(t)×y′(t)+ω′(t)×y(t)+ω(t)×(ω(t)×y(t))+R(t)Tc′′(t).

  1. For every t∈I and z∈R3, ∥R(t)z∥2=∥z∥2: the rotation part of the change of coordinates preserves Euclidean norms (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Facts & Assumptions

Given: A nondegenerate interval I, twice continuously differentiable maps R:I→SO(3) and c:I→R3, and a twice continuously differentiable y:I→R3; write Ω=RTR′ and x=Ry+c.

[L1]

R(t)TR(t)=I3 for every t by The orthogonal group O(3) and the rotation group SO(3). The matrix entries of R are twice continuously differentiable by the given hypothesis.

[L3]

The cross product is bilinear and alternating, and Ωz=ω×z for all z holds exactly for the matrix Ω with entries Ω12=−ω3, Ω13=ω2, Ω23=−ω1 and the opposite entries fixed by skew-symmetry (The cross product in R3, The cross product is bilinear, alternating, and orthogonal to both factors).

[L4]

The Euclidean norm satisfies ∥z∥22=⟨z,z⟩2=zTz, and ⟨z,z⟩2=0 only for z=0 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L5]

If R∈SO(3), then det⁡R=1, so R is invertible by the square-matrix determinant criterion. Since RTR=I3, its inverse is RT and RRT=I3 (The orthogonal group O(3) and the rotation group SO(3), A finite square real matrix is invertible if and only if its determinant is nonzero).

Proof

technique · direct
1.1L1L2algebra

Differentiate the identity RTR=I3 of [L1] componentwise using [L2]: 0=(RTR)′=R′TR+RTR′, so RTR′=−R′TR. Transposing this last identity with [L2] gives ΩT=(RTR′)T=R′T(RT)T=R′TR=−Ω. This proves clause 1.

1.2L1L2algebra

Differentiate x=Ry+c twice using [L2]: x′=R′y+Ry′+c′ and x′′=R′′y+2R′y′+Ry′′+c′′. Multiplying on the left by RT gives RTx′′=RTR′′y+2RTR′y′+y′′+RTc′′.

2.1step 1.1L3algebra

Write the entries of the skew matrix Ω(t) as Ωij; by step 1.1, Ωji=−Ωij and Ωii=0, so Ω is determined by the three entries Ω12,Ω13,Ω23. Define ω:=(ω1,ω2,ω3) by ω1:=−Ω23, ω2:=Ω13, ω3:=−Ω12, and substitute into the defining formula of [L3]: for every z, the i-th component of Ωz and of ω×z agree by the displayed finite computation of the cross product, so Ωz=ω×z.

2.2step 1.1step 1.2L1L2L5algebra

By definition of Ω and [L2], Ω′=(RTR′)′=R′TR′+RTR′′, hence RTR′′=Ω′−R′TR′=Ω′+Ω2. Indeed, R′=RΩ follows from RTR′=Ω after multiplying on the left by R and using RRT=I3 from [L5]; then R′TR′=(RΩ)T(RΩ)=ΩTRTRΩ=ΩTΩ=−Ω2 by clause 1. Also RTR′=Ω. Substituting into step 1.2, RTx′′=(Ω′+Ω2)y+2Ωy′+y′′+RTc′′.

3.1step 2.1givenL2L3algebra

If another vector η∈R3 satisfies Ωz=η×z for every z, then (ω−η)×z=0 for every z; taking z to be each standard basis vector in the formula of [L3] gives ω−η=0, proving uniqueness. Each entry of Ω=RTR′ is C1 by the given C2 regularity and the product rule [L2]; the three component formulas of step 2.1 therefore make ω a C1 curve. This completes clause 2.

4.1step 2.1step 2.2step 3.1L2L3algebra

Differentiating the three component formulas in step 2.1, justified by the C1 regularity proved in step 3.1, gives Ω′z=ω′×z for each fixed z. Thus Ω′y=ω′×y, Ω2y=Ω(ω×y)=ω×(ω×y) and Ωy′=ω×y′. Substituting these into step 2.2 gives the displayed identity of clause 3.

5.1L1L2L4algebra∎

For z∈R3, ∥Rz∥22=(Rz)T(Rz)=zTRTRz=zTz=∥z∥22 by [L1], [L2] and [L4]; taking square roots proves clause 4.

Remarks

  • The vector ω(t) is the angular velocity of the frame in the body-fixed convention Ω=RTR′. The vector attached to the other convention R′RT is the spatial angular velocity, and the two differ by a rotation by R; this item records only the convention used in clause 3, and its consumers must state which convention they use.

  • The identity of clause 3 is a coordinate identity for twice differentiable curves. It asserts nothing about forces: reading the terms 2ω×y′ and ω×(ω×y) as "Coriolis" and "centrifugal" accelerations is an interpretation made by the physical items, under their own mass and force hypotheses.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The orthogonal group O(3) and the rotation group SO(3)

Definition

Let M3(R) be the set of 3×3 matrices over R (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations), with identity I3 and product as in Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, transpose RT as in The transpose AT of a matrix, and determinant det⁡R as in For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix.

The orthogonal group and the special orthogonal group are the subsets

O(3):={R∈M3(R):RTR=I3},SO(3):={R∈M3(R):RTR=I3 and det⁡R=1}.

Equivalently SO(3)=O(3)∩{R:det⁡R=1}. Elements of SO(3) are called rotations. The identification of M3(R) with the function space R3×3 and hence with R9 is the one of The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations; when M3(R) is regarded as a metric or topological space, this is always the Euclidean metric of that identification.

Remarks

  • The set O(3) is a group under matrix multiplication. It contains I3, and if A,B∈O(3) then (AB)T(AB)=BTATAB=I3. For A∈O(3), determinant multiplicativity and det⁡(AT)=det⁡A give (det⁡A)2=det⁡(ATA)=1, so A is invertible; ATA=I3 then gives A−1=AT and AAT=I3, hence AT∈O(3). The stronger fact that SO(3) is a subgroup of GL3(R) is proved in SO(3) is a subgroup of the general linear group, with R−1=RT.

  • An element R∈O(3) preserves the Euclidean inner product of R3: ⟨Ru,Rv⟩2=uTRTRv=⟨u,v⟩2 for all u,v. Its three columns therefore form an orthonormal triple. Relative to the standard orientation determined by the standard basis, det⁡R=1 means orientation preserving and det⁡R=−1 means orientation reversing (Orientation of a finite-dimensional real vector space).

  • The set O(3) appears here as a subset of M3(R) with a specific defining equation; no claim is made in this item about its manifold structure, dimension or compactness. Those are supplied by SO(3) is a compact three-dimensional embedded submanifold of M3(R), with tangent space the matrices RΩ for skew Ω.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

SO(3) is a subgroup of the general linear group, with R−1=RT

Statement

In the notation of The orthogonal group O(3) and the rotation group SO(3):

  1. I3∈SO(3), and for all R,S∈SO(3) the matrices RS and RT again lie in SO(3); moreover det⁡R=1, R is invertible, and its inverse is RT, so also RRT=I3.
  2. Consequently SO(3) is a subgroup of the general linear group GL3(R) (Invertible matrices and the general linear group GL⁡n(F), GL⁡n(F) is a group under matrix multiplication, including the trivial group GL⁡0(F)).

Facts & Assumptions

Given: Matrices R,S∈SO(3), so that RTR=I3=STS and det⁡R=det⁡S=1 by The orthogonal group O(3) and the rotation group SO(3).

[L2]

Transposition is involutive and reverses products: (AB)T=BTAT and (AT)T=A (Transpose is linear and involutive, and (AB)T=BTAT).

[L4]

An n×n matrix is invertible exactly when it has a two-sided inverse, and the inverse is unique when it exists; GL3(R) is the set of invertible 3×3 real matrices, and it is a group under multiplication (Invertible matrices and the general linear group GL⁡n(F), GL⁡n(F) is a group under matrix multiplication, including the trivial group GL⁡0(F)). For a finite square real matrix, invertibility is equivalent to nonzero determinant (A finite square real matrix is invertible if and only if its determinant is nonzero).

Proof

technique · direct
1.1L1L3given

Since (I3)TI3=I3I3=I3 and det⁡I3=1 by [L1] and [L3], the identity matrix lies in SO(3).

1.2L1L2L3givenalgebra

For the product, (RS)T(RS)=STRTRS=ST(RTR)S=STI3S=STS=I3 by [L1], [L2] and the defining relations for R,S; and det⁡(RS)=det⁡Rdet⁡S=1 by [L3]. Hence RS∈SO(3).

2.1step 1.2L1L2L3L4algebra

For R∈SO(3) the relation RTR=I3 exhibits RT as a left inverse of R. Since det⁡R=1≠0, the matrix R is invertible by [L4]; multiplying the relation RTR=I3 on the right by the two-sided inverse R−1 and using [L1] gives RT=R−1; hence also RRT=RR−1=I3. Moreover RT∈SO(3): (RT)TRT=RRT=I3 by [L2], and det⁡RT=1 because det⁡RTdet⁡R=det⁡(RTR)=det⁡I3=1 by [L2], [L3] and det⁡R=1.

3.1step 1.1step 1.2step 2.1L4∎

By steps 1.1, 1.2 and 2.1 the set SO(3) contains I3 and is closed under multiplication and inversion; since it is a subset of GL3(R) by step 2.1 and GL3(R) is a group under multiplication by [L4], SO(3) is a subgroup of GL3(R). This proves clause 2.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

SO(3) is a compact three-dimensional embedded submanifold of M3(R), with tangent space the matrices RΩ for skew Ω

Statement

Identify M3(R) with R3×3 and hence with R9 as in The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, with the Euclidean metric of that identification (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

  1. SO(3) is an embedded submanifold of M3(R) of dimension 3, and it is both open and closed in the subset topology of O(3) inside M3(R).
  2. For every R∈SO(3) the tangent space is

TRSO(3)={ RΩ:Ω∈M3(R), ΩT=−Ω }.

  1. SO(3) is compact (Open cover, subcover, compact metric space, and compact subset of a metric space).

Facts & Assumptions

Given: The sets O(3) and SO(3) of The orthogonal group O(3) and the rotation group SO(3), with M3(R) identified with R9.

[F1]

Regular level sets: if F:Mm→Nn is smooth, q is a regular value and F−1(q) is nonempty, then F−1(q) is an embedded submanifold of codimension n; and for p∈F−1(q) one has TpF−1(q)=ker⁡dFp (A regular level set is an embedded submanifold, The tangent space of a regular level set is the kernel).

[F2]

Finite componentwise sums and products of Ck Euclidean maps are Ck, composites of Ck Euclidean maps are Ck, and a map is C∞ when it is Ck for every k (Ck Euclidean maps are closed under componentwise algebra and composition, Ck Euclidean maps and diffeomorphisms).

[F3]

If f is totally differentiable at a, then its directional derivative in the direction v exists and equals Df(a)v (A total derivative computes every directional derivative, and its matrix is the Jacobian).

[F4]

For a continuous map of metric spaces, preimages of open sets are open and preimages of closed sets are closed; singletons in a metric space are closed, because metric spaces are Hausdorff and a space is T1 exactly when its singletons are closed; and the determinant M3(R)→R is a polynomial in the matrix entries (Metric continuity characterisations, with countable choice for the sequential converse, Distinct points of a metric space have disjoint balls around them, A space is T1 if and only if every singleton is closed, if and only if every finite subset is closed, if and only if its topology contains the cofinite topology, For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries).

[F5]

An open subset of a smooth manifold carries the canonical restricted smooth structure of the same dimension; its charts are restrictions of the original charts (An open subset of a smooth manifold has a canonical restricted smooth structure).

[F9]

If all first partial derivatives of a Euclidean map exist near a point and are continuous there, then the map is totally differentiable there and its derivative matrix is its Jacobian (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).

[F10]

Embeddedness means that each point has an ambient smooth chart taking the subset to a coordinate slice (Embedded submanifolds and slice charts). Coordinate derivations form a basis of each tangent space (Coordinate derivations form a basis of the tangent space); the differential acts on germs by djR(v)([h])=v([h∘j]) (The differential of a smooth map).

Proof

technique · direct
1.1F2givenalgebra

Set Sym⁡3(R):={S∈M3(R):ST=S} and identify it with R6 by its six entries with i≤j. Define f:M3(R)→Sym⁡3(R) by f(A):=ATA. Its independent components are fij(A)=∑k<3akiakj for i≤j, finite sums of products of coordinate functions; each coordinate function is linear with constant first partials and zero higher partials, hence Ck for every k. By [F2], f is Ck for every k, hence smooth. The target has dimension 6 by the displayed coordinate identification.

2.1step 1.1F1F3F7F9algebra

For A,H∈M3(R) and real t, f(A+tH)=(AT+tHT)(A+tH)=ATA+t(ATH+HTA)+t2HTH, so the directional derivative in direction H is ATH+HTA. Since f is smooth, [F9] gives total differentiability and [F3] identifies Df(A)H=ATH+HTA. If A∈O(3) then ATA=I3 and the derivative is surjective onto Sym⁡3(R): for symmetric S take H:=AS/2, so that ATH+HTA=ATAS/2+STATA/2=S/2+S/2=S. The level is nonempty because I3∈O(3) by [F7]; hence I3 is a regular value and [F1] gives that O(3)=f−1(I3) is an embedded submanifold of M3(R) of dimension 9−6=3 with TAO(3)=ker⁡Df(A) for A∈O(3).

3.1step 2.1F7algebra

For A∈O(3) the kernel is {AK:KT=−K}: if K is skew then Df(A)(AK)=ATAK+(AK)TA=K+KT=0; conversely, if ATH+HTA=0, put K:=ATH, so that KT=HTA=−ATH=−K and H=AK because [F7] gives AAT=I3. Combining with step 2.1, TAO(3)={AK:KT=−K}.

4.1step 2.1step 3.1F4F5F7F8F10algebra

For A∈O(3), [F7] gives (det⁡A)2=1; hence det⁡A>0 if and only if det⁡A=1 by [F8]. Therefore SO(3)=O(3)∩det⁡−1((0,∞))=O(3)∩det⁡−1({1}). By [F4] the determinant is continuous, (0,∞) is open and {1} is closed, so both preimages are open respectively closed; hence SO(3) is open and closed in O(3). By [F5], SO(3) has the restricted smooth structure of dimension 3. Fix R∈SO(3) and a slice chart of O(3) at R from step 2.1 and [F10]. Restrict its ambient domain to its intersection with the open set det⁡−1((0,∞)). On this domain SO(3) and O(3) coincide, so the same chart is a slice chart for SO(3), proving embeddedness in M3(R). In the restricted manifold charts the inclusion j:SO(3)↪O(3) is the identity in three coordinates. The differential formula in [F10] sends each coordinate derivation to the corresponding coordinate derivation of O(3); the coordinate-basis theorem makes djR an isomorphism onto TRO(3). Composing with the ambient inclusion therefore gives exactly the same ambient tangent subspace as in step 3.1, namely {RΩ:ΩT=−Ω}. This proves clauses 1 and 2.

5.1step 4.1F4F6algebra∎

SO(3) is closed in M3(R) as the intersection of the closed sets O(3)=f−1({I3}) and det⁡−1({1}), using continuity of f and of the determinant and closedness of singletons from [F4]. It is bounded: if A∈SO(3) then the relation ATA=I3 says that the columns of A are unit vectors, so ∣aij∣≤1 for all i,j and the Frobenius norm obeys ∥A∥F2=∑i,jaij2≤9. By [F6] a closed and bounded subset of R9 is compact, so SO(3) is compact. This proves clause 3.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A labeling containing two independent vectors has trivial SO(3)-stabilizer

Statement

For S⊆R3, its pointwise SO(3) stabilizer is

Stab⁡SO(3)(S):={R∈SO(3):Rs=s for every s∈S}.

Let u,v∈R3 be linearly independent and let S⊆R3 be a nonempty set with u,v∈S. If R∈SO(3) satisfies Rs=s for every s∈S, then R=I3.

Equivalently, Stab⁡SO(3)(S)={I3}. The conclusion uses only the two indicated independent vectors; no assumption that 0∈S is made.

Facts & Assumptions

Given: Linearly independent u,v∈R3, a nonempty S⊆R3 containing u and v, and R∈SO(3) with Rs=s for every s∈S.

[L1]

For R∈SO(3) one has RTR=I3 and det⁡R=1 (The orthogonal group O(3) and the rotation group SO(3)).

[L2]

The cross product is bilinear and alternating and satisfies ⟨u×v,w⟩2=det⁡[u v w] for all u,v,w, where the bracket denotes the matrix whose columns are u,v,w; and u×v is orthogonal to u and to v (The cross product is bilinear, alternating, and orthogonal to both factors, The cross product in R3).

[L3]

Transpose reverses products, (Ra)T=aTRT, the determinant is multiplicative, and the matrix R[u v w]=[Ru Rv Rw] has the three image vectors as columns (Transpose is linear and involutive, and (AB)T=BTAT, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B), Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[L5]

The Euclidean inner product is positive definite: if ⟨x,z⟩2=0 for every z∈R3, then x=0 (Real and complex inner product spaces, with the inner product linear in the first argument, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L6]

For u,v∈R3, ∥u×v∥22=det⁡G(u,v) is positive exactly when u,v are linearly independent (The squared cross-product norm is the Gram determinant of two vectors).

[L8]

For R∈SO(3), det⁡R=1, so R is invertible by the square-matrix determinant criterion (The orthogonal group O(3) and the rotation group SO(3), A finite square real matrix is invertible if and only if its determinant is nonzero).

Proof

technique · direct
1.1L2L5L6L7givenalgebra

Put w:=u×v. It is nonzero by [L6]. If w∈span⁡{u,v}, then w is orthogonal to every vector in that span by [L2], hence to itself; positive definiteness [L5] would give w=0, a contradiction. Thus w∉span⁡{u,v}. If αu+βv+γw=0 and γ≠0, then w∈span⁡{u,v}; hence γ=0, and independence of u,v gives α=β=0. So u,v,w are linearly independent. By [L7] their three-element set spans R3, hence (u,v,w) is an ordered basis.

2.1step 1.1L1L2L3L5L8algebra

For all a,b∈R3, ⟨Ra,Rb⟩2=(Ra)T(Rb)=aTRTRb=aTb=⟨a,b⟩2, by [L1] and [L3]. Hence for every z∈R3, ⟨R(u×v),Rz⟩2=⟨u×v,z⟩2=det⁡[u v z] by [L2], while ⟨(Ru)×(Rv),Rz⟩2=det⁡[Ru Rv Rz]=det⁡ ⁣(R[u v z])=det⁡Rdet⁡[u v z]=det⁡[u v z] by [L2] and [L3]. Subtracting gives ⟨R(u×v)−(Ru)×(Rv),Rz⟩2=0 for every z. Since R is invertible by [L8], Rz ranges over all of R3, so [L5] gives R(u×v)=(Ru)×(Rv).

3.1step 2.1given

By the defining property of R, Ru=u and Rv=v; substituting into step 2.1 gives R(u×v)=u×v. Thus R fixes each vector of the basis (u,v,u×v) of step 1.1.

4.1step 1.1step 3.1L4givenalgebra∎

Let x∈R3; by [L4] write x=c1u+c2v+c3(u×v) with unique real coefficients. By linearity of R and step 3.1, Rx=c1Ru+c2Rv+c3R(u×v)=c1u+c2v+c3(u×v)=x. Since x was arbitrary, R=I3.

5 · Examples, experiments and counterexamples

None yet.

Sources