A vector bundle $E$ with a fibrewise quadratic form $Q$ defines a bundle whose fibre over $x$ is the Clifford algebra $\mathrm{Cl}(E_x,Q_x)$. When the polar form is a nondegenerate bilinear form, local orthonormal frames identify its fibres with a fixed Clifford algebra, and orthogonal transition maps induce the algebra transition maps. A Clifford module bundle is a bundle of modules over these algebras, rather than the algebra bundle itself. For a Riemannian manifold, use its cotangent bundle and the metric quadratic form, with the sign convention specified.

A spinor is an element of a representation space for a Spin group; algebraically, spinor spaces arise from irreducible representations of a Clifford algebra or its even part. The Spin group is a double cover of a rotation group, so its action can distinguish rotations that ordinary vectors cannot.

For rotations in three-dimensional Euclidean space, a spinor can be a column in ${\mathbb{C}}^2$, acted on by $\mathrm{SU}(2)$. A rotation through angle $\theta$ about a unit direction $n$ acts as $\exp (-i\theta n\cdot \sigma /2)$, where $\sigma$ are the Pauli matrices. At $\theta =2\pi$ this is $-I$, and at $4\pi$ it is $I$. The sign change explains the distinction between spinors and spatial vectors and underlies the representation of spin one-half. A spinor is not a literal square root of a vector; the relationship is through the Clifford algebra action.

After complexifying a nondegenerate metric in $D=2k$ dimensions, pair gamma matrices into $k$ fermionic creation and annihilation operators. Their binary occupation states span $2^k$ dimensions, and the gamma matrices generate all endomorphisms of this space. The Dirac module is therefore irreducible as a Clifford module. The even algebra preserves the chirality grading, splitting its Lorentz-spinor representation into two irreducible Weyl modules of dimension $2^{k-1}$. In $D=2k+1$, adjoining the old chirality matrix as the extra gamma gives an irreducible $2^k$-dimensional Spin group representation with no Weyl splitting. The two possible signs of that extra gamma distinguish Clifford modules but give equivalent Spin group modules.

The local entropy balance has nonnegative production, with heat supply ${\rho }_{0}r/\theta$ and thermodynamic entropy flux $q/\theta$ at positive temperature $\theta$. Its integral version holds on every material reference subvolume.

Requiring the Clausius-Duhem inequality for independent reversible mechanical and thermal variations constrains a constitutive equation. For $U(F,\eta ,\xi )$ it gives $P_{Ii}={\rho }_0{U}_{,F_{iI}}$ and $\theta =U_{,\eta }$. Combining the Lagrangian internal energy balance with the Lagrangian entropy inequality leaves $f_r{\dot{\xi }}_r-q_I{\theta }_{,I}/\theta \ge 0$. The independence assumptions are part of the constitutive argument.

For a nonnegative claim size $X$ of finite positive mean $\mu$, its equilibrium claim-size distribution has this probability density function and survival function ${\overline{F}}_I(x)={\mu }^{-1}{\int }_x^{\infty }{\overline{F}}_X(t)dt$. The tail integral formula for moments normalizes the probability density function. Its moment-generating function is $(M_X(r)-1)/(\mu r)$ wherever finite, so at an adjustment coefficient it equals one plus the safety loading.

Starting from capital $u$, ruin occurs exactly when the aggregate loss exceeds $u$. Positive relative safety loading and the strong law of large numbers make $S(t)-ct$ tend to minus infinity, so its supremum is finite almost surely. For exponential distribution claims of rate $\alpha$, $L$ has an atom $1-\lambda /(\alpha c)$ at zero, and, conditional on $L>0$, has exponential distribution of rate $\alpha -\lambda /c$. The ultimate ruin probability determines this mixture directly.

In a classical risk model, $T_j$ is the time of the $j$th claim. The displayed probability restricts ruin to the first $n$ claims and increases to the ultimate ruin probability. Conditioning on the first arrival and severity gives ${\psi }_{n+1}(u)=\mathbb{E}[{\overline{F}}_X(u+c{T}_1)+{\int }_0^{u+c{T}_1}{\psi }_n(u+c{T}_1-x)f_X(x)dx]$, with ${\psi }_0=0$. For exponential distribution claims of mean $\mu$ and relative safety loading $\rho$, put $d=1+\rho$ and $h=d+1$. Then ${\psi }_1(u)=e^{-u/\mu }/h$ and ${\psi }_2(u)=e^{-u/\mu }(h^{-1}+(u/\mu )h^{-2}+d{h}^{-3})$. The recursion follows because a surviving first claim leaves fresh independent future arrivals and claims. The formulas follow by integrating the rate-$\lambda$ first-arrival probability density function; the claim-arrival rate cancels with $c=d\lambda \mu$.

The classical-quantum state is block diagonal. If ${\lambda }_{xj}$ are the eigenvalues of ${\rho }_x$, its eigenvalues are $p_x{\lambda }_{xj}$. Inserting these into the definition of Von Neumann entropy gives the displayed sum of classical Shannon entropy and mean conditional quantum entropy. Its quantum mutual information is therefore the Holevo quantity $S({\sum }_x{p}_x{\rho }_x)-{\sum }_x{p}_{x}S({\rho }_x)$.

Normalized Haar measure makes this averaging a norm-one projection onto continuous class functions. Averaging a trace coefficient replaces its coefficient endomorphism by $\int \theta (h{)}^{-1}\alpha \theta (h)dh$. On an irreducible summand this average is $(\mathrm{tr}\alpha /\dim V)I$ by Schur lemma. It follows that averaging finite-dimensional matrix coefficients yields finite linear combinations of irreducible characters. Together with the Peter-Weyl theorem, this proves uniform density of those characters among continuous class functions.

The ray class field realizes the ray class group through the Artin reciprocity map and is the maximal abelian extension with bounded conductor.

For a finite Galois extension $L/K$ of number fields and a finite-dimensional complex group representation $\rho$ of its Galois group, the finite part of its Artin L-function is the Euler productHere $I_{\mathfrak{p}}$ is the inertia group, and a Frobenius automorphism lift acts on its invariant subspace. Different lifts induce the same operator there. At an unramified prime the invariant subspace is all of $V$; at a ramified prime this restriction removes the part on which inertia acts nontrivially.

The trivial representation gives the Dedekind zeta function of $K$. Direct sums of representations give products of Artin L-functions, because determinants multiply on direct sums. Taking the logarithm of each local factor produces traces of powers of Frobenius, connecting representation-theoretic characters with prime-counting sums. Archimedean factors are added separately when forming a completed L-function.

For a cyclic extension of number fields, an element of the base field is a global field norm exactly when it is a norm at every finite and infinite completion. The splitting criterion for a cyclic algebra encodes the norm obstruction as a Brauer group class. The Albert-Brauer-Hasse-Noether theorem makes a class that splits at every completion split globally, giving the result. Cyclicity is essential; arbitrary noncyclic extensions can have additional local-global norm obstructions.

Citrate denotes an ion derived from citric acid. The commonly specified form has electric charge equal to that of three electrons and chemical formula ${\mathrm{C}}_6{\mathrm{H}}_5{\mathrm{O}}_7^{3-}$; it results from removing three hydrogen ions from citric acid. Forms with additional hydrogen ions attached through protonation also occur. ^[ref]

In an inviscid barotropic fluid subject to conservative body force, the circulation of a material loop is constant. For constant density, parameterize that loop by $\mathbf{r}(s,t)$ with ${\mathbf{r}}_t=\mathbf{u}$. Differentiating $\Gamma =\int \mathbf{u}\cdot {\mathbf{r}}_{s}ds$ gives an integral of $(D\mathbf{u}/Dt)\cdot d\mathbf{r}$ plus $\int {\partial }_s(|\mathbf{u}{|}^2/2)ds$. The latter vanishes on a closed loop, and the Euler equations make the former the integral of a gradient, also zero. For a barotropic density, $\nabla p/\rho$ is still a gradient of specific enthalpy. Constant circulation is consistent with changing local vorticity when a vortex tube changes its cross-sectional area.

In a spherically symmetric gravitational potential $\Phi (r)$, a circular orbit has $r{\Omega }^2={\Phi }^{\prime }(r)$, specific orbital energy $\epsilon =\Phi +r^2{\Omega }^2/2$ and specific angular momentum $\mathbf{h}=r^2\Omega \mathbf{n}$, with $|\mathbf{n}|=1$. Differentiating gives ${\epsilon }^{\prime }=2r{\Omega }^2+r^2\Omega {\Omega }^{\prime }=\Omega (r^2\Omega {)}^{\prime }$. Changes in orbital orientation have $\mathbf{n}\cdot d\mathbf{n}=0$, so $\mathbf{\Omega }\cdot d\mathbf{h}=\Omega d(r^2\Omega )=d\epsilon$. For a particle of variable mass $M$ and total angular momentum $\mathbf{H}=M\mathbf{h}$, this implies $d(M\epsilon )=(\epsilon -\Omega h)dM+\mathbf{\Omega }\cdot d\mathbf{H}$. Moreover $d(\epsilon -\Omega h)/dr=-h{\Omega }^{\prime }$, which is positive when the orbital angular velocity decreases outward.

For a fixed spherical gravitating source, place a test particle at $(a,0)$ with initial velocity $(0,\sqrt{\mu /a})$, where $a$ is outside the source. Its exact circular orbit isDifferentiating twice gives $\ddot{\mathbf{r}}=-{\omega }^2\mathbf{r}=-\mu \mathbf{r}/a^3$, precisely the Newtonian gravitational field at each point of that circle. There is no outward physical force to cancel gravity in this inertial frame. Gravity supplies the inward centripetal acceleration that continually changes the velocity's direction.

Over a short interval, the displacement from the straight tangent path begins inward with magnitude $\frac{1}{2}(\mu /a^2)t^2$. The curvature of the orbit matters at the same order: the particle moves sideways while continually falling away from its instantaneous tangent. The full circular solution remains at radius $a$ rather than striking the source.

Its speed is $\sqrt{\mu /a}$, its oscillation period is $2\pi \sqrt{a^3/\mu }$, and its specific orbital energy is $-\mu /(2a)$. Removing gravity while keeping the initial velocity would give the straight path $(a,a\omega t)$, rather than a stationary particle. This contrast explains why orbital weightlessness is compatible with a substantial gravitational force: a freely coasting spacecraft and its contents fall together. ^[ref]

Consider the discrete linear system $Lx=b$ withThis is a finite periodic analogue of the Poisson equation, using the negative second finite difference with unit grid spacing. It is also a Graph Laplacian equation on a cycle graph; no continuum approximation is being claimed here.

Summing the four equations gives zero on the left, since each value occurs twice positively and twice negatively. A necessary condition is therefore ${\sum }_n{b}_n=0$. The Fourier diagonalization of a circulant matrix shows that this is also sufficient: the only zero eigenvalue of $L$ is the constant mode $k=0$, and ${\hat{b}}_0={\sum }_n{b}_n$.

For the displayed forcing, the discrete Fourier transform givesDivide only at the three nonzero eigenvalues, and choose ${\hat{x}}_0=0$ to impose zero arithmetic mean:Direct substitution gives $Lx=(1,0,-1,0{)}^T$. All other vectors satisfying the linear system are $x+a(1,1,1,1{)}^T$, because the kernel is the space of constant vectors. Thus balanced forcing determines the differences between values, while a reference level is an extra choice. This small model explains why a periodic Poisson equation needs both a compatibility condition and a normalization.

Use the negative-exponential forward discrete Fourier transform and the $1/N$-normalized inverse discrete Fourier transform:For the circulant matrix with first column $c$, the discrete Fourier mode $w_n^{(k)}=e^{2\pi ikn/N}$ is an eigenvector with eigenvalueIndeed, substitution into circular convolution givesThe columns of $F^{-1}$ are $w^{(k)}/N$, so the diagonalization of a matrix takes the formThe roots of unity give orthogonality of these eigenvectors; dividing each $w^{(k)}$ by $\sqrt{N}$ makes the basis orthonormal. Consequently, every complex circulant matrix is a normal matrix, including ones that are not Hermitian matrices.

The sign convention matters. For $c=(1,2,0,0{)}^T$, the circulant matrix isChanging the direction of the shift or the sign in the discrete Fourier transform changes which complex eigenvalue goes with which discrete Fourier mode. A real symmetric example alone would conceal that distinction.

For a linear system $Cx=b$, put $\hat{x}=Fx$ and $\hat{b}=Fb$. The equation becomes $N$ independent scalar equationsIf every ${\lambda }_k$ is nonzero, divide to find the unique vector $x$ and apply the inverse discrete Fourier transform. If some ${\lambda }_k=0$, a vector $x$ satisfying the linear system exists exactly when ${\hat{b}}_k=0$ at every such index; the corresponding ${\hat{x}}_k$ remain free. This is a concrete version of the Fredholm alternative in a finite-dimensional setting.

With an appropriate Fast Fourier transform, multiplication or a compatible solve takes $O(N\log N)$ arithmetic operations, instead of forming a dense matrix and applying general Gaussian elimination. The gain comes from the periodic structure; an arbitrary matrix does not have this shared basis of discrete Fourier modes.^[ref]

A perfect elimination ordering of a finite simple graph $G=(V,E)$ is a permutation $(v_1,\dots ,v_n)$ of its vertices such that each set of later graph neighboursis a clique. Thus $v_i$ is a simplicial vertex in the remaining induced subgraph $G[\{v_i,\dots ,v_n\}]$. Empty and one-vertex sets satisfy the clique condition automatically. The order here is the order of deletion: $v_1$ goes first.

The characterization is powerful: a finite simple graph is a chordal graph if and only if it has a perfect elimination ordering. For one proof outline, the earliest vertex of an induced cycle of length at least four would have two later graph neighbours on that graph cycle that are not adjacent, contradicting the clique condition. Conversely, every nonempty chordal graph has a simplicial vertex, and every induced subgraph of a chordal graph is a chordal graph; repeatedly deleting such a vertex supplies the ordering.^[ref]

In the square-plus-diagonal chordal graph above, $(b,d,a,c)$ is a perfect elimination ordering, with later graph neighbourhoods $\{a,c\}$, $\{a,c\}$, $\{c\}$, and $\varnothing$. Starting instead with $a$ fails: its graph neighbours $b,c,d$ do not form a clique, because $bd$ is absent. Thus even a chordal graph can have a poor elimination ordering.

For a larger example, join three triangles along shared edges, usingThe exact graph neighbourhoods are $N(a)=\{b,c\}$, $N(b)=\{a,c,d\}$, $N(c)=\{a,b,d,e\}$, $N(d)=\{b,c,e\}$, and $N(e)=\{c,d\}$. The ordering $(a,b,c,d,e)$ has later graph neighbourhoods $\{b,c\}$, $\{c,d\}$, $\{d,e\}$, $\{e\}$, and $\varnothing$, all cliques; this certifies that the graph is a chordal graph without enumerating its graph cycles. Its maximal cliques $\{a,b,c\}$, $\{b,c,d\}$, $\{c,d,e\}$ form a junction tree in that order, with intersections $\{b,c\}$ and $\{c,d\}$.

To find an ordering, maximum cardinality search starts with all scores zero, repeatedly selects an unselected vertex of largest score, and increases each unselected graph neighbour's score by one. Reverse the selection order to obtain a candidate perfect elimination ordering. For the three-triangle graph, one valid selection sequence is $(e,d,c,b,a)$, with scores at selection $0,1,2,2,2$; reversing it gives the displayed deletion order. On a chordal graph every tie choice works. On an arbitrary graph, test the resulting later graph neighbourhoods for the clique condition to recognize chordal graphs. Suitable adjacency lists, score buckets and a linear-time verification method give $O(|V|+|E|)$ recognition.^[ref]

The deletion rule also explains sparse Gaussian elimination. For a symmetric positive-definite matrix whose matrix graph is $G$, eliminating pivot $v$ applies the Schur complement updateOnly pairs of remaining graph neighbours of $v$ can acquire new off-diagonal entries. A perfect elimination ordering already has all those edges, so Cholesky decomposition creates no symbolic fill-in. Positive definiteness ensures nonzero pivots in exact arithmetic. Special numerical cancellation can suppress predicted entries, and floating-point rounding affects their values.^[ref] In the three-triangle graph, deleting $c$ first instead connects every pair in $\{a,b,d,e\}$ and adds exactly $ad,ae,be$. The graph was already a chordal graph; the extra fill-in comes from the ordering.

One further reward is optimal graph coloring. Process a perfect elimination ordering backwards and give each vertex the smallest positive color absent from its already colored graph neighbours. Those graph neighbours form a clique, so this greedy algorithm uses at most the clique number $\omega (G)$ colors; any clique of that size requires at least that many. In the three-triangle graph, coloring $(e,d,c,b,a)$ gives colors $(1,2,3,1,2)$, so both the chromatic number and the clique number are three. Every maximal clique also occurs among $\{v_i\}\cup N_i^{+}$: take its earliest vertex and use maximality. The same ordering therefore supports graph coloring, maximal clique extraction and sparse computation.

Historically, Donald J. Rose, Robert E. Tarjan and George S. Lueker's 1976 paper connected graph elimination to symmetric sparse matrices and gave a search-based $O(|V|+|E|)$ algorithm for finding a perfect elimination ordering when one exists. Its abstract distinguishes a minimal elimination ordering from a minimum one: removing avoidable fill-in does not by itself minimize the total number of added edges.^[ref]