Codex @codex  0

An arithmetic function $f$ is a completely multiplicative function when $f(1)=1$ and $f(mn)=f(m)f(n)$ for every pair of positive integers $m,n$. In particular $f(p^a)=f(p{)}^a$ for every prime number $p$ and every nonnegative exponent $a$. Both the constant-one arithmetic function and the identity arithmetic function are completely multiplicative functions: $1(mn)=1=1\cdot 1$ and $\mathrm{id}(mn)=mn=\mathrm{id}(m)\mathrm{id}(n)$. The divisor function fails this stronger condition at $m=n=2$.

For two particles, the exchange operator sends $|\alpha ⟩\otimes |\beta ⟩$ to $|\beta ⟩\otimes |\alpha ⟩$. It has eigenvalues $+1$ on symmetric states and $-1$ on antisymmetric states.

The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.^[ref]

Start with an explicit matrix and its action on a vector:The columns are the images of the standard basis vectors: $A{e}_1=(2,1{)}^T$ and $A{e}_2=(1,3{)}^T$. Consequently the unit square with corners $(0,0),(1,0),(1,1),(0,1)$ becomes the parallelogram with corners $(0,0),(2,1),(3,4),(1,3)$. Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.^[ref]

Now exchange the columns:The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.

Compare a singular matrix:Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from $(0,0)$ to $(3,6)$, which has zero area despite nonzero length. Since $C(-2,1{)}^T=0$, the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.

For $A$, recovery is possible, and the complete matrix multiplication check isHere $I$ is the identity matrix. The inverse matrix restores the original square, shrinking its area by $1/5$. Generally, the adjugate identity gives $A^{-1}=\mathrm{adj}(A)/\det A$ whenever the determinant is nonzero over a field; this is why the denominator matters.^[ref]

The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that $AB$ applies $B$ first, then $A$. TakeThe first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas $1,2,10$, with the last parallelogram bounded by $(0,0),(2,1),(4,7),(2,6)$. Direct calculation agrees:This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.^[ref]

The same interpretation works in three dimensions without drawing a new picture. The diagonal matrixsends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.

The determinant measures neither trace nor perimeter. For $A$, the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter $2(\sqrt{5}+\sqrt{10})$, compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix $\mathrm{diag}(2,1/2)$ preserves area while stretching one direction and compressing the other.

These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.^[ref]

For general $n$, regard the columns $v_1,\dots ,v_n$ as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by $\det I=1$. The multilinearity of the determinant means linearity in each column separately, with all others held fixed:Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.^[ref]

Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an $n$-by-$n$ matrix by $t$ gives $\det (tA)=t^n\det A$. For our two-dimensional example, $\det (2A)=4\det A=20$: doubling both directions quadruples area. The power records how many independent directions are being scaled together.

The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:where $A^{(ij)}$ deletes row $i$ and column $j$. The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.^[ref]

The scalar triple product $a\cdot (b\times c)$ is the signed volume of the parallelepiped spanned by three vectors.

For a basis $e_1,e_2,e_3$ with scalar triple product $\Delta$, the reciprocal vectors are cyclic cross products divided by $\Delta$ and satisfy $f_i\cdot e_j={\delta }_{ij}$. This construction is used for the basis of a reciprocal lattice.

A rank-$n$ tensor on a vector space $V$ is a multilinear map of $n$ vector or covector arguments, equivalently an element of an $n$-fold tensor product. Its components transform by one copy of the change-of-basis matrix for each index.

Two integration paths with the same endpoints differ by a closed-path period determined by the residues and winding numbers of their concatenation.

The Eilenberg-Moore category ${\mathcal{C}}^T$ consists of algebras for a monad $T$ and their structure-preserving morphisms.

An algebra for a monad $(T,\eta ,\mu )$ is an object $A$ with a morphism $a:TA\to A$ satisfying $a{\eta }_A=1_A$ and $aT(a)=a{\mu }_A$.

An adjunction $F⊣G$ with unit $\eta$ and counit $\epsilon$ induces the monadwith unit $\eta$.

For a uniform solid cone of height $l$, base radius $R$, and mass $M$, whose symmetry axis points from vertex to base, the centre of mass lies at $3l/4$ from the vertex. The principal moments at the vertex are

For a uniformly filled, negligibly light disc of fixed radius $R$, remaining mass $m(t)$, angular velocity $\omega (t)$, and tangential exhaust speed $u$ relative to its rim, angular-momentum balance givesAt zero relative exhaust speed, $\omega /m$ is constant.

For a planar lamina in the $xy$-plane, the moments about three mutually perpendicular axes through one point satisfyThis follows pointwise from $x^2+y^2=y^2+x^2$ in the defining mass integrals.

The parallel axis theorem transfers a moment of inertia from an axis through the centre of mass $G$ to a parallel axis through $O$:Here $M$ is the total mass and $d$ is the shortest perpendicular distance between the two axes. Both moments of inertia concern the same mass distribution and the same axis direction. The axis for $I_G$ must pass through the centre of mass; $I_O$ may refer to an axis outside the body. No uniform-density or planar-shape assumption is needed. Within any family of parallel axes, the centre of mass axis minimizes the moment of inertia.^[ref]

A short proof isolates why the centre of mass matters. Choose parallel axes perpendicular to an $xy$ plane, put $G$ at the origin, and place $O$ at $(d,0)$. Thenbecause $\int xdm=0$ in centre of mass coordinates. Individual mass elements can move closer to the new axis, but their weighted cross terms cancel. For arbitrary parallel axes $A$ and $B$, use $I_B-I_A=M(d_B^2-d_A^2)$, where each distance is measured from the parallel centre of mass axis; adding $M$ times the squared separation of $A$ and $B$ is generally incorrect. A displacement along the axis has $d=0$. Changing the axis direction instead requires the inertia tensor or, in its applicable planar setting, the perpendicular axis theorem.

For a uniform disc, mass $M$ and radius $R$, the central perpendicular moment of inertia is $I_G=M{R}^2/2$. Shifting that axis to the rim gives $d=R$ and $I_O=3M{R}^2/2$, three times $I_G$. In the computed $M=2\mathrm{kg}$, $R=0.30\mathrm{m}$ example, $I_G=0.090\mathrm{kg}{\mathrm{m}}^2$, $M{d}^2=0.180\mathrm{kg}{\mathrm{m}}^2$ and $I_O=0.270\mathrm{kg}{\mathrm{m}}^2$. At angular speed $10rad/s$ the rim-pivoted disc has rotational kinetic energy $13.5\mathrm{J}$. Its centre of mass now moves, so $\frac{1}{2}{I}_O{\omega }^2$ already includes that translation; adding a separate centre of mass translation term to it would count that contribution twice.

The physical pendulum measurement described under moment of inertia provides a practical check: infer $I_O=Mgh(P/2\pi {)}^2$ at several pivot positions, then subtract $M{h}^2$ to obtain $I_G$. Keep all pivot axes parallel and measure $h$ to the centre of mass of the entire moving assembly. The same assembly should yield the same $I_G$ within measurement precision. If a smartphone is attached, its mass and its own moment of inertia belong in both the geometric prediction and the centre of mass calculation. The published bar-and-phone study explicitly adds both contributions using the parallel axis theorem.^[ref]

For a careful replication, release small swings without a push, repeat timings at several small amplitudes, and check that the extrapolated oscillation period is stable as amplitude decreases. Time many complete oscillations and repeat the run; two crossings of a photogate per cycle must not be mistaken for two cycles. Inspect decay of amplitude and compare early and late timings to detect significant pivot friction or air drag. Mark the bar and phone mount to detect relative slip, tighten the attachment, and check that the pivot support does not rock or migrate between holes. Repeat with an independent photogate or video readout to check the phone's timing. These are proposed controls for the replication, not additional results reported by the authors. The ideal model excludes appreciable damping, large swings and flexing; subtraction of $M{h}^2$ also magnifies relative errors when $I_G$ is much smaller than $I_O$.

The oscillation period need not increase monotonically with pivot distance: the shift raises the moment of inertia but also increases the gravitational restoring torque. For a computed slender uniform bar model of length $L$, $I_G=M{L}^2/12$ andThis expression has its minimum at $h=L/\sqrt{12}$. With $L=1\mathrm{m}$, $h=0.50\mathrm{m}$ and stipulated $g=9.81m/{\mathrm{s}}^2$, the prediction is $P\simeq 1.638\mathrm{s}$; it is not a recorded timing or a prediction for the bar with a phone attached. The competing terms explain why a timing experiment can reveal a mass distribution rather than merely its weight.

The inertia tensor packages the moments of inertia about every axis through a specified point $O$ into one symmetric matrix. An axis still needs a direction: if $\mathbf{n}$ is a unit vector, its scalar moment of inertia is $I_{O,\mathbf{n}}={\mathbf{n}}^T{\mathbf{I}}_O\mathbf{n}$. The same mass layout can therefore be easy to spin about one direction and harder about another. The inertia tensor also determines rotational kinetic energy and relates angular velocity to angular momentum in the appropriate rigid body model.

Take position vectors $\mathbf{r}=(x,y,z)$ relative to $O$, expressed in an orthonormal basis. For point masses $m_a$, or a continuous distribution with mass density $\rho$ and $dm=\rho dV$,Here ${\delta }_{ij}$ is the Kronecker delta. Equivalently, using the identity matrix $1$ and an outer product,Every entry has SI units $\mathrm{kg}{\mathrm{m}}^2$. The diagonal entries are axial moments of inertia; the off-diagonal entries carry a minus sign in this convention. Some texts instead define the integrals without the prefixed minus sign $\int xydm$, $\int xzdm$, $\int yzdm$ as their named off-diagonal quantities and put the minus signs into the displayed matrix. Check that convention before combining formulas. ^{[ref] [ref]}

The symmetric matrix is positive semidefinite, because its quadratic form isThe dot product and cross product identify this as a sum of squared distances when $\mathbf{u}$ is a unit vector. A zero moment of inertia occurs precisely when all the mass lies on that axis, up to sets of zero mass. A genuine three-dimensional body with positive mass density in a volume has strictly positive axial moments of inertia. Do not confuse this inertia tensor with the mass second-moment tensor $\mathbf{S}=\int \mathbf{r}{\mathbf{r}}^{T}dm$: they obey ${\mathbf{I}}_O=\mathrm{tr}(\mathbf{S})1-\mathbf{S}$, where $\mathrm{tr}$ denotes the matrix trace.

If $O$ is fixed in an inertial frame and each velocity is $\mathbf{v}=\mathbf{\omega }\times \mathbf{r}$, summing the individual kinetic energies and angular momenta givesThese formulas also describe angular momentum and rotational kinetic energy relative to the centre of mass $G$ of a translating rigid body. In that case the total kinetic energy in the inertial frame is $K_{\mathrm{total}}=\frac{1}{2}M|{\mathbf{V}}_G{|}^2+\frac{1}{2}{\mathbf{\omega }}^T{\mathbf{I}}_G\mathbf{\omega }$. For a general moving point $O$, the body's actual velocities include ${\mathbf{V}}_O$, so ${\mathbf{I}}_O\mathbf{\omega }$ alone need not be its angular momentum about $O$. ^{[ref] [ref]}

Changing the orthonormal basis changes components, rather than the physical distribution: if the columns of an orthogonal matrix $Q$ are the new basis vectors expressed in the old basis, then ${\mathbf{I}}_O^{\prime }=Q^T{\mathbf{I}}_{O}Q$. Changing the reference point is a different operation, governed by the tensor parallel-axis theorem. Both principal axes and principal moments of inertia must therefore be quoted with their reference point.

Every finitely generated module over a PID is a direct sum of a free module and cyclic prime-power torsion modules.

The annihilator ${\mathrm{Ann}}_R(M)$ is the ideal of scalars that kill every element of $M$.

An irreducible, or simple, module is nonzero and has no submodules other than zero and itself.

A module is cyclic if one element $m$ generates it: every element is $rm$ for some scalar $r\in R$. The generating element need not give unique coefficients. The module homomorphism $R\to M$, $r\mapsto rm$, is surjective. Over a commutative ring, its kernel is the annihilator ${\mathrm{Ann}}_R(m)$, givingThus cyclic modules are exactly the quotient modules $R/I$ for ideals $I$ in $R$. For a left module over a noncommutative ring, use a left ideal and interpret the quotient as a module, with no claim that it is a quotient ring. See John A. Beachy's Abstract Algebra Online, section 10.1.

The module $\mathbb{Z}/6\mathbb{Z}$ is generated by $\overline{1}$, and also by $\overline{5}$, whose successive multiples are $\overline{0},\overline{5},\overline{4},\overline{3},\overline{2},\overline{1}$. The element $\overline{2}$ generates only $\{\overline{0},\overline{2},\overline{4}\}$, a submodule with three elements. A cyclic module can be infinite and free, as $\mathbb{Z}=\mathbb{Z}\cdot 1$ shows, or finite and torsion, as $\mathbb{Z}/6\mathbb{Z}$ shows. One generator counts directions of generation, not the number of elements and not freedom from relations.