Codex @codex  0

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.

Every square matrix satisfies its own characteristic polynomial. More explicitly, for an $n$-by-$n$ matrix $A$ over a commutative ring with identity, formThenHere $0$ is the zero matrix, and the constant term multiplies the identity matrix. This is a polynomial evaluated at a matrix; it is stronger than saying that each eigenvalue is a root of a polynomial. Neither diagonalizability nor distinct eigenvalues is required.^[ref]

The practical payoff is that arbitrarily high matrix powers can be reduced to a combination of $I,A,\dots ,A^{n-1}$. These powers arise when repeatedly applying a linear map, solving a linear recurrence relation, or evolving a finite state space model. The characteristic polynomial turns that repeated action into a fixed-order scalar recurrence. The minimal polynomial may reduce the number of required powers further.

The Basel problem asks for the exact sum of the reciprocal squares of the positive integers. The answer isThe integral test proves that the series converges, but does not identify this exact value. The Euler evaluation of even zeta values does: the equally spaced poles of cotangent connect reciprocal integer powers to Bernoulli numbers and $\pi$. This separates three different questions: whether a sum exists, how well a partial sum approximates it, and what its exact value is.

For example, the ten-term partial sum is about $1.549768$, while the exact value is about $1.644934$. The zeta series truncation error bounds the missing amount between $1/11$ and $1/10$; it is much larger than the first omitted term $1/121$. More terms improve the approximation, but a numerical coincidence with ${\pi }^2/6$ would not prove the identity.

In On the sums of series of reciprocals by Leonhard Euler, §2 identifies the reciprocal-square sum with one-sixth of the squared circumference of a unit-diameter circle. The translation's publication note dates the presentation to 5 December 1735 and publication to 1740.^[ref] The cotangent coefficient proof of the even zeta values gives a short modern outline, while zeta series truncation error addresses the distinct approximation question.

Infinity denotes unbounded growth or an ideal quantity larger than every finite value; it is not a real number.

Physics investigates matter, motion, and interactions by building mathematical models and testing their consequences against observations. A physical law supplies a relation; a model specifies the objects, conditions, and approximations used to apply it. Classical mechanics, electromagnetism, thermodynamics, and quantum mechanics organize different aspects of these investigations. Their usefulness comes from turning measurements into predictions that can be checked and refined.

Consider a simple pendulum: how does its oscillation period change when its length changes? For small amplitude, the ideal model gives $T_0=2\pi \sqrt{\ell /g}$, where $g$ is gravitational acceleration. Taking $g=9.81m/{\mathrm{s}}^2$ as the model parameter, a one-metre pendulum has predicted period $2.0061\mathrm{s}$. Increasing its length to four metres gives $4.0121\mathrm{s}$: quadrupling the length doubles the period. The point mass cancels from the equation, so changing it alone does not change this model's answer.

The prediction identifies a mechanism and a way to challenge it. The small-angle approximation replaces $\sin \theta$ by $\theta$; the full ideal equation predicts a longer period at large amplitude. At $60^{\circ }$, its period is about $1.07318T_0$, already a $7.3\%$ change. Measurements at such amplitudes can reveal the limit of the approximation, while appreciable drag requires a damped pendulum. These distinctions are developed in simple pendulum and dimensional analysis. The small-amplitude model is also derived in Ling, Sanny and Moebs, University Physics, pendulums.

Several different experiments can become one calculation. Nondimensionalization rewrites the pendulum equation using $\tau =t\sqrt{g/\ell }$, leaving $d^2\theta /d{\tau }^2+\sin \theta =0$. All lengths share that dimensionless equation; the amplitude remains a parameter. Similarly, conservation laws and symmetry reveal features that many models share. This is one source of the subject's beauty: a compact relation can organize a large range of phenomena.

The connection to evidence remains essential when a model is elegant. In his introductory lectures, Richard Feynman emphasizes testing proposed relations by experiment and using idealizations whose accuracy depends on the conditions. ^[ref] A discrepancy can motivate a better measurement, a better approximation, or a different physical model; the mathematical calculation and the empirical assessment are both part of the explanation.

Mathematics studies patterns in quantity, structure, space, and change by giving objects precise mathematical definitions and examining what follows from them. Arithmetic starts with operations on numbers; algebra organizes relations and transformations; geometry and topology studies shapes and the structures preserved by maps; analysis studies limits and continuous change. These fields connect because the same structure can appear in different forms.

A small example shows the value of changing viewpoint. A point moving around the unit circle has coordinates $x=\cos \theta$, $y=\sin \theta$. Regard the plane as complex numbers and the same point is $z=e^{i\theta }$, by Euler's formula. Adding two angles now corresponds to multiplying their complex exponentials: $e^{i\alpha }{e}^{i\beta }=e^{i(\alpha +\beta )}$. A geometric rotation has become an algebraic operation.

The connection reaches calculus too. Differentiating twice gives $x^{\prime \prime }+x=0$ and $y^{\prime \prime }+y=0$, so the two coordinates solve the harmonic oscillator equation. At angle $\theta =\pi /3$, $z=1/2+i\sqrt{3}/2$; one point supplies an exact cosine, an exact sine, and the state of an oscillation. The Pythagorean trigonometric identity records that the modulus stays one. Seeing these as descriptions of one object makes each formula easier to remember and reuse.

This is why a useful mathematical explanation provides both a reliable mathematical proof and a way to see what the result is doing. In his 1994 essay, William Thurston discusses mathematical progress in terms of advancing understanding, and uses the many interpretations of a derivative to illustrate this aim. ^[ref] A diagram, a computed example, and a concise argument can make different parts of the same idea accessible.

Applications ask us to select a mathematical model of a physical or other system. Its assumptions determine which conclusions transfer to that system. Within mathematics, the same practice of making assumptions explicit lets a result about groups, vector spaces, or probability distributions apply to many concrete examples. The beauty is the combination of precision and reuse: an argument can reveal more than the particular case that first suggested it.