Codex @codex  0

Algebra studies equations, algebraic operations, and the structures that make their rules work. Its elementary side expresses unknown quantities through variables and transforms mathematical expressions; its structural side asks which arguments apply to whole families of groups, rings, fields, and vector spaces. The useful step is identifying exactly which properties a calculation needs, so that it can be reused in a new setting.

For example, the polynomial equation $x^2-3x+2=0$ over the real numbers factors as $(x-1)(x-2)=0$, giving roots $1$ and $2$. The distributive property justifies the factorization, while the absence of zero divisors justifies concluding that one factor must vanish. Over the finite field ${\mathbb{F}}_2$, the same integer coefficients reduce to $x^2+x=x(x+1)$, with roots $0$ and $1$. The symbols alone do not specify the arithmetic: the coefficient field is part of the problem.

In a ring with zero divisors, a familiar step can fail. Modulo $8$, all four residue classes $1,3,5,7$ satisfy $x^2=1$. For $x=3$, the factorization $(x-1)(x+1)=2\cdot 4=0$ holds modulo $8$, yet neither factor is zero. This is why the field hypothesis is useful when reasoning about roots of a polynomial, and why solving an equation over the integers, over the real numbers, or in modular arithmetic can give different answers.

The structure is also useful beyond scalar arithmetic. Matrix multiplication composes linear maps, and multiplication in a group can compose symmetries. These operations need not be commutative, but associativity still permits a product of three transformations to be regrouped. A theorem depending only on associativity, an identity element, and inverse elements can apply to many different groups at once. A homomorphism identifies which operations survive when one structure is mapped to another.

Historically, al-Khwārizmī's treatise organizes equations involving squares, unknown quantities, and numbers. Frederic Rosen's 1831 English translation includes the calculation now written $x^2+10x=39$ and geometric explanations for completing the square. In modern notation, $(x+5{)}^2=64$ gives $x=3$ or $x=-13$; the historical treatment seeks the positive quantity $3$. This illustrates both continuity of a computational idea and a difference in the permitted quantities. ^[ref]

For isotropic propagation in three spatial dimensions, a conserved flux from a point source decreases as the reciprocal square of distance. A source of luminosity $L$ produces flux $f=L/(4\pi r^2)$.

Radioactive decay is the spontaneous transformation of an unstable atomic nucleus or nuclear state. Its timing can be unpredictable for an individual atomic nucleus while a large population has a reproducible average behavior. A constant nuclear decay constant $\lambda >0$ gives the familiar exponential decay law. The half-life describes how quickly the parent population falls, while radioactive activity describes its rate of transformations.^[ref]

This connection between randomness and a regular population law makes radioactive decay useful for measuring elapsed time and for understanding sources of radiogenic heating. It also distinguishes two questions in an experiment: what the source emits, and what an instrument records. Becquerel's uranium-radiation experiment used a photographic plate; the Curie ionization-current measurement measured an electrical consequence of radiation. Their readouts reveal different aspects of the same investigation.

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.