Codex @codex  0

Mathematical physics develops mathematical descriptions of physical systems and studies what follows from their assumptions. A differential equation can model motion, an linear operator can represent an observable in quantum mechanics, and a symmetry can produce a conservation law. The mathematical structure matters because it reveals which predictions share a common mechanism and which depend on a particular idealization.

A central force illustrates the connection. Its vanishing torque conserves angular momentum, confining a classical particle's motion to a plane and reducing its radial dynamics to an effective potential. One vector equation becomes a one-dimensional energy problem. The reduction also identifies its own limits: a noncentral perturbation can produce a torque and invalidate the conserved quantity. Mathematical clarity is useful precisely because the physical assumptions remain visible.

An area of mathematics groups related concepts and methods. The glossary of areas of mathematics collects terminology for these fields.

A nonzero element $a$ of a commutative ring is a zero divisor if some nonzero $b$ satisfies $ab=0$. In a noncommutative ring, left and right zero divisors must be distinguished. The nonzero requirement on both factors is part of the usual convention.

In $\mathbb{Z}/6\mathbb{Z}$, the classes of two and three are zero divisors because their product is zero. A commutative ring with identity, $1\ne 0$, and no zero divisors is an integral domain. Cancellation by a nonzero factor is valid in an integral domain but can fail in a ring with zero divisors: modulo six, $2\cdot 1=2\cdot 4$ although $1\ne 4$.

The Thomae function on the real line is $t(x)=0$ at irrational $x$ and $t(p/q)=1/q$ for a rational written in lowest terms with $q>0$. It is continuous at every irrational point and discontinuous at every rational point.

To see continuity at an irrational $a$, choose $Q>1/ϵ$. In any bounded neighborhood there are only finitely many reduced rationals with denominator at most $Q$; avoid them with a smaller neighborhood of $a$. All remaining values are less than $ϵ$. At rational $p/q$, irrational points approaching it have value zero instead of $1/q$. Despite these dense discontinuities, the function is Riemann integrable on every closed finite interval, with integral zero.

Termwise integration interchanges an integral with an infinite series:One sufficient hypothesis is uniform convergence of the partial sums on a finite interval, with every term Riemann integrable. The error in the integral is at most $(b-a)$ times the uniform error. In Lebesgue integration, dominated convergence or a summable sequence of absolute integrals supplies other sufficient conditions.

For $0\le r<1$, the geometric series converges uniformly on $[0,r]$. Integrating gives $-\log (1-r)={\sum }_{n\ge 0}{r}^{n+1}/(n+1)$. A pointwise identity alone would not justify the interchange.

A spectral mapping theorem relates the spectrum of an operator to the spectrum after applying a function to it. For a bounded linear operator $T$ on a complex Banach space and a polynomial $p$,Factor $p(z)-\mu$ over the complex numbers. If no root lies in $\sigma (T)$, every factor $T-\lambda I$ is invertible, so their product is invertible. Conversely a product of commuting factors can be invertible only if each factor is invertible, giving the reverse inclusion.

For a matrix with eigenvalues one and three, $T^2+I$ has eigenvalues two and ten. More general functions require a specified functional calculus; an unrestricted substitution rule for unbounded operators is not automatic.

A finite family of pairwise commuting diagonalizable operators on a finite-dimensional complex vector space is simultaneously diagonalizable. In particular, commuting Hermitian operators admit an orthonormal common eigenbasis.

A run of successes is a consecutive block of successful trials in a binary observation sequence. For independent trials with success probability $0<p<1$, the waiting time $T_r$ until the first run of $r$ successes has meanLet $E_k$ be the remaining mean after $k$ consecutive successes. For $k<r$, $E_k=1+p{E}_{k+1}+(1-p)E_0$, while $E_r=0$. Solving backward gives the formula. At $p=1/2$, $r=2$, the mean is six, agreeing with the HH pattern waiting time. A run requires consecutive successes, unlike merely collecting $r$ successes in total.

For a real angle $\alpha$ and a unit vector $\mathbf{n}$, the rotation about $\mathbf{n}$ sendsThe vector triple product identity gives the equivalent expression $\mathbf{x}+\sin \alpha \mathbf{n}\times \mathbf{x}+(1-\cos \alpha )\mathbf{n}\times (\mathbf{n}\times \mathbf{x})$. To see why it is a rotation, decompose $\mathbf{x}$ into its parallel and perpendicular components relative to $\mathbf{n}$. The parallel component is fixed, while the perpendicular component becomes $\cos \alpha {\mathbf{x}}_{\perp }+\sin \alpha \mathbf{n}\times {\mathbf{x}}_{\perp }$, the usual plane rotation. It is also the matrix exponential of the linear operator $H\mathbf{x}=\alpha \mathbf{n}\times \mathbf{x}$: the identity $H^3=-{\alpha }^{2}H$ reduces its exponential series to these three terms.

If a primitive polynomialhas a rational root $r/s$ in lowest terms, then $r\mid a_0$ and $s\mid a_n$. In particular, a monic integer polynomial can have only integer rational roots dividing its constant term.

A quasi-steady approximation neglects a field's time derivative because that field relaxes much faster than the variables that drive it. The rapidly adjusting field then satisfies a steady equation with the slow variables treated as instantaneous parameters.

A nonzero number $T$ is a period of a function $f$ when $f(x+T)=f(x)$ throughout its domain.

A pattern waiting time is the number of observations required until a specified finite pattern first occurs in a stochastic process. Overlaps between possible occurrences affect the answer; treating sliding windows as independent generally gives the wrong mean.

For independent fair coin tosses, let $E_0$ be the expected additional tosses to first see HH with no current matching prefix, and $E_1$ the expectation after one H. Then $E_0=1+(E_0+E_1)/2$ and $E_1=1+E_0/2$, giving $E_0=6$. For HT, the analogous equations give four. The patterns have the same probability in a fixed two-toss window, but different self-overlap structure.

The nilradical of a commutative ring is its ideal of nilpotent elements, equivalently the radical of an ideal applied to its zero ideal.

One form of the Nakayama lemma says: if $M$ is a finitely generated module over a commutative unital ring $R$, $I$ lies in the Jacobson radical, and $IM=M$, then $M=0$.

For a local ring with maximal ideal $\mathfrak{m}$, this implies that elements generating $M/\mathfrak{m}M$ lift to generators of $M$: apply the lemma to their quotient module. The finite-generation hypothesis is essential.

For the determinant proof, choose generators $v_i$ and write $v_i={\sum }_j{a}_{ij}{v}_j$ with $a_{ij}\in I$. Multiplying $(1-A)v=0$ by its adjugate gives $\det (1-A)M=0$. This determinant is $1$ modulo $I$, hence is a unit because $I$ lies in the Jacobson radical. Therefore $M=0$.

A topological space is a metrizable space if some metric on its set generates exactly its given topology. The choice of metric need not be unique. For example, $d(x,y)=|x-y|$ and $\min (1,|x-y|)$ generate the same topology on the real numbers even though one is unbounded and the other bounded.

Metrizability lets one use metric balls and sequential arguments to study the space. Every metric topology is Hausdorff and first countable, so a topology lacking either property is not metrizable. Conversely those two properties alone are not a complete metrization criterion; additional hypotheses occur in the standard metrization theorems.

The method of images solves a linear boundary problem by replacing a boundary with fictitious sources chosen so their combined field obeys its conditions. The constructed solution is then justified by a uniqueness of Poisson equation, not by treating the fictitious sources as physically present.

For a charge $q$ at height $a$ above a grounded conducting plane $z=0$, place an image charge $-q$ at height $-a$. In the upper half-space,is zero on the plane and satisfies the required source equation. Dirichlet uniqueness for the Poisson equation identifies it as the physical potential above the conductor. The construction exploits symmetry; arbitrary boundaries need not have a finite set of image sources.

The cycle decomposition of a permutation partitions a finite set into orbits under repeated application of the permutation. Writing one cycle $(a_1{a}_2\cdots a_k)$ means $a_i\mapsto a_{i+1}$ and $a_k\mapsto a_1$. Disjoint cycles commute, and the decomposition is unique up to their order and cyclic rotation within each cycle.

For the map $1\mapsto 3\mapsto 2\mapsto 1$ and $4\mapsto 5\mapsto 4$, the decomposition is $(132)(45)$. Its order is $\mathrm{lcm}(3,2)=6$, because a power fixes every element exactly when its exponent is divisible by each cycle length. Fixed points may be displayed as one-cycles or omitted.

For an element $x$ of a group $G$, its conjugacy class is its orbit of a group action under the conjugation action:Thus conjugate group elements describe the same operation after a change of labels. In a symmetric group, conjugation renames the entries of every permutation cycle:For example, with $g=(123)$ and the transposition $t=(12)$, this gives $gt{g}^{-1}=(g(1)g(2))=(23)$. Products use function composition of permutations, with the rightmost factor applied first. The complete six-element example is conjugacy classes of the symmetric group on three letters.

The conjugacy classes form a partition of a set of $G$, since conjugacy is an equivalence relation. In a symmetric group, two permutations lie in the same conjugacy class precisely when they have the same cycle type: renaming preserves the lengths of permutation cycles, and matching equal-length permutation cycles constructs a renaming in the other direction. This compresses many labelled permutations into a few structural types. See McKernan, Conjugation in Sn, lemma 6.2 and proposition 6.6.

The stabilizer subgroup of $x$ under the conjugation action is its centralizer $C_G(x)$. Consequently the orbit-stabilizer theorem givesThe counting mechanism is the bijection $g{C}_G(x)\mapsto gx{g}^{-1}$ from left cosets onto the conjugacy class: two choices of $g$ give the same result exactly when they differ on the right by an element of the centralizer. A large centralizer means many choices of labels leave the operation unchanged, hence a small conjugacy class. A conjugacy class has size one precisely when its element belongs to the center of a group. The class equation counts these orbits of a group action together.

The Chinese remainder theorem says that remainders modulo pairwise coprime positive integers can be specified independently. For $m_1,\dots ,m_r$ pairwise coprime and $M=m_1\cdots m_r$, every prescribed list $a_1,\dots ,a_r$ determines one congruence class modulo $M$ satisfying $x\equiv a_j(\mathrm{mod}{m}_j)$ for all $j$. It determines a class, rather than one unrestricted integer: adding a multiple of $M$ preserves every remainder.

For example, combine $x\equiv 2(\mathrm{mod}3)$ and $x\equiv 3(\mathrm{mod}5)$. Write $x=2+3k$ from the first condition. The second becomes $3k\equiv 1(\mathrm{mod}5)$. Since three has modular inverse two modulo five, $k\equiv 2(\mathrm{mod}5)$, giving $x\equiv 8(\mathrm{mod}15)$. The integers $8$, $23$ and $-7$ all work. The fifteen possibilities modulo fifteen correspond to the fifteen pairs in a three-by-five grid.

The theorem also preserves arithmetic: reducing an addition or a multiplication modulo each $m_j$ gives the same tuple as performing that operation on the corresponding congruence classes. In the language of quotient rings, reduction is a ring isomorphismOne large residue is thus an exact encoding of several smaller residues. This is useful for splitting arithmetic into smaller calculations and then reconstructing the result; MIT's modular arithmetic notes develop both the reconstruction and the product representation. ^[ref] For a concrete multiplication, $7$ corresponds to $(1,2)$ and $8$ to $(2,3)$ modulo $(3,5)$. Their componentwise product is $(2,1)$, which reconstructs to $11(\mathrm{mod}15)$, agreeing with $56\equiv 11(\mathrm{mod}15)$.

A constructive formula explains the independence. For $m_j>1$, put $M_j=M/m_j$ and choose $u_j$ with $M_j{u}_j\equiv 1(\mathrm{mod}{m}_j)$, using a modular multiplicative inverse. Then $e_j=M_j{u}_j$ is one modulo $m_j$ and zero modulo every other $m_i$. Thereforehas the desired remainders. A modulus equal to one imposes no restriction and can be omitted. Uniqueness follows because a difference divisible by every $m_j$ is divisible by their product when they are pairwise coprime. This short construction gives a reusable algorithm as well as an existence statement.

The coprime hypothesis explains why every cell in the left grid is attainable. With integer moduli six and eight, a pair must agree modulo their greatest common divisor, two. There are twenty-four compatible pairs, rather than forty-eight arbitrary pairs; each corresponds to a class modulo the least common multiple, twenty-four. The Chinese remainder theorem for noncoprime moduli states the resulting compatibility rule.