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]

An algebraic structure is a set equipped with specified algebraic operations satisfying selected axioms. An operation's domain is part of the structure: a binary operation on $S$ takes two elements of $S$ and produces another element of $S$. Groups specify one such operation, rings specify addition and multiplication, and vector spaces specify vector addition and scalar multiplication by a separate field.

Different choices of operations can give the same underlying set different structures. The integers form a group under addition, since every integer has an additive inverse. They do not form a group under multiplication: for example, $2$ has no multiplicative inverse among the integers. Even the nonzero integers fail that inverse requirement. In contrast, nonzero rational numbers form a group under multiplication.

Finite multiplication tables make such distinctions visible. Arithmetic modulo $5$ gives a field; arithmetic modulo $6$ gives a commutative ring with zero divisors. In the former, multiplying by any nonzero element permutes all residue classes. In the latter, multiplying by $2$ reaches only $0,2,4$, and $2\cdot 3=0$ even though both factors are nonzero.

The goal is to extract reusable properties rather than memorize isolated tables. A homomorphism preserves the specified operations, and an isomorphism shows that two structures have identical operation patterns after relabeling.

An associator ring is a ring in which equality of the principal ideals generated by two elements forces them to be associate elements: $(a)=(b)$ implies $a=ub$ for a unit in a ring $u$. The reverse implication always holds, since $a=ub$ and $b=u^{-1}a$ give both ideal inclusions. The property separates equality of generated ideals from equality of generators up to an invertible factor.

Every integral domain is an associator ring. If $a\ne 0$ and $(a)=(b)$, write $a=rb$ and $b=sa$. Then $(1-rs)a=0$, so cancellation gives $rs=1$ and $a=rb$ with $r$ a unit. The zero case is immediate. The converse fails: $\mathbb{Z}/4\mathbb{Z}$ has generator classes $\{0\}$, $\{2\}$ and $\{1,3\}$ for its three ideals, and $1,3$ differ by a unit, although $2$ is a nonzero zero divisor.

Finite direct product of rings preserve this property. Equality of principal ideals is coordinatewise, and a tuple of units is a unit. Every quotient ring of a principal ideal domain is also an associator ring: first, modulo a prime power $p^k$, every nonzero class is a power $p^e$, $e<k$, times a unit, and distinct powers generate distinct ideals. Next factor a nonzero nonunit modulus into prime powers and apply the Chinese remainder theorem. The zero modulus gives the original integral domain, while a unit modulus gives the zero ring.

Suppose a ring has an underlying real normed vector space and its norm is multiplicative, without initially assuming real bilinearity of multiplication. For fixed $x$, distributivity makes $y\mapsto xy$ additive, while $\Vert xy-xz\Vert =\Vert x\Vert \Vert y-z\Vert$ makes it continuous. Additivity gives rational scalar compatibility, and continuity extends it to every real scalar. Apply the same argument in the other variable to obtain a bilinear map. The norm identity also excludes nonzero zero divisors.

The positive characteristic of a ring which is an integral domain is a prime number. The characteristic cannot be one because $1\ne 0$. If its least positive value were $n=ab$ with $1<a,b<n$, minimality would make $a1$ and $b1$ nonzero, while $(a1)(b1)=n1=0$ would give zero divisors.

The analogous result holds for a nonzero commutative nonunital ring without zero divisors, using the characteristic of a rng. If $n=ab$ were composite and minimal, choose $r$ with $ar\ne 0$. For every $s$, $(ar)(bs)=n(rs)=0$, so cancellation forces $bs=0$ for every $s$, contradicting minimality of $n$.

Commutative algebra studies commutative rings, ideals, modules, and the spectrum of a ring. Its basic question is which familiar rules of integer and polynomial arithmetic survive in a new setting. The distinction between units, zero divisors, and integral domains makes that question concrete.

A commutative ring is a ring in which multiplication satisfies $ab=ba$ for every pair. The integers and the polynomial ring $\mathbb{Z}[X]$ are examples. So is $\mathbb{Z}/n\mathbb{Z}$, the quotient ring whose elements are residue classes in modular arithmetic. We represent these by $0,1,\dots ,n-1$ and reduce each sum or product to its remainder. All following calculations modulo $6$ use this convention.

In $\mathbb{Z}/6\mathbb{Z}$, $2\cdot 3=0$, although neither factor is zero. Thus $2$ and $3$ are zero divisors: nonzero elements whose product with another nonzero element can vanish. Also $2\cdot 1=2\cdot 4=2$. Removing the common factor $2$ would falsely assert $1=4$. The entire row for multiplication by $2$ isThe repetitions explain the linear congruences directly. The equation $2x=2$ has exactly the two solutions $x=1,4$, whereas $2x=1$ has none. A common factor can erase information, and a nonzero coefficient does not guarantee that an equation has a solution.

A unit in a ring is an element $u$ with a multiplicative inverse, meaning $uv=vu=1$ for some $v$. In $\mathbb{Z}/6\mathbb{Z}$, the units are exactly $1$ and $5$, since $5^2=1$. The other nonzero elements, $2,3,4$, are zero divisors; for $4$, use $4\cdot 3=0$. In a nonzero commutative ring, a unit cannot be a zero divisor: multiplying $ub=0$ by its multiplicative inverse forces $b=0$. But a nonzero element need not be a unit or a zero divisor: the integer $2$ is neither in $\mathbb{Z}$.

By contrast, in $\mathbb{Z}/5\mathbb{Z}$, every row for a nonzero multiplier is a permutation of $0,1,2,3,4$. Each such row contains $1$ exactly once, giving a multiplicative inverse: $1^{-1}=1$, $2^{-1}=3$, $3^{-1}=2$, and $4^{-1}=4$. Hence this commutative ring is a field. For example, $2x=1$ now has the unique solution $x=3$. Reading the tables reveals which algebraic steps the arithmetic permits.

A finite-dimensional commutative real algebra with a Euclidean multiplicative norm has dimension at most two. Automatic real bilinearity from a multiplicative norm supplies bilinearity if it was not part of the initial description. On its unit sphere, squaring has derivative $v\mapsto 2xv$, injective because there are no zero divisors. The only equal squares are antipodal pairs, so the map induces an injective immersion ${\mathbb{RP}}^{n-1}\to S^{n-1}$. Compactness and the inverse function theorem make it a diffeomorphism when $n\ge 2$. For $n\ge 3$, the fundamental groups $\mathbb{Z}/2$ and zero contradict this. The real and complex number algebras attain dimensions one and two.

Two equations are equivalent on a specified domain of a function if they have the same solution set. Adding the same defined mathematical expression to both sides is reversible. Multiplying or dividing both sides by a mathematical expression is reversible only where that expression is nonzero and invertible in the arithmetic being used. In a field, every nonzero scalar is invertible; a general ring needs an additional check.

For example, $x^2=1$ and $(x-1)(x+1)=0$ are equivalent equations over the real numbers, by the distributive property. Concluding $x=1$ or $x=-1$ additionally uses the absence of zero divisors. The modular example in algebra shows why that extra inference can fail in a ring with zero divisors.

A field is a commutative ring with $0\ne 1$ in which every nonzero element has a multiplicative inverse. Examples include the rational numbers, real numbers, and complex numbers. The integers are a ring but not a field: dividing $1$ by $2$ leaves them. For a prime number $p$, the prime field ${\mathbb{F}}_p=\mathbb{Z}/p\mathbb{Z}$ is a finite example, because every nonzero residue is coprime to $p$ and hence has a modular inverse.

In ${\mathbb{F}}_5$, the nonzero inverse pairs are $1^{-1}=1$, $2^{-1}=3$, $3^{-1}=2$, and $4^{-1}=4$. Thus $2x=3$ has solution $x=3\cdot 3=4$ in this field; the real number solution would be $3/2$. Dividing by a nonzero coefficient is valid in both settings, but it means division according to the chosen field's operations.

A field has no zero divisors: if $ab=0$ and $a\ne 0$, multiplying by $a^{-1}$ gives $b=0$. This short argument supports polynomial factorization arguments and pivot division in Gaussian elimination. It does not hold in every commutative ring: modulo $6$, the nonzero residues $2$ and $3$ multiply to zero. The distinction is visible in the figure under algebraic structure.

Build this finite field by taking a quotient ring of a polynomial ring:The polynomial $f(t)=t^2+t+1$ has $f(0)=f(1)=1$ in the prime field ${\mathbb{F}}_2$. A polynomial of polynomial degree two is an irreducible polynomial exactly when it has no polynomial root in the coefficient field. Thus the quotient by an irreducible polynomial is a field construction applies. Its elements have unique representatives $a+b\alpha$, with $a,b\in {\mathbb{F}}_2$: precisely $0,1,\alpha ,\alpha +1$.

The defining relation is ${\alpha }^2+\alpha +1=0$. Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes ${\alpha }^2=\alpha +1$. Addition acts separately on the two coefficients:All coefficient calculations use modular arithmetic modulo two. For example, $(\alpha +1)+\alpha =1$ and $(\alpha +1)+(\alpha +1)=0$. Encoding $a+b\alpha$ as the pair of bits $(b,a)$ gives $0\leftrightarrow 00$, $1\leftrightarrow 01$, $\alpha \leftrightarrow 10$, and $\alpha +1\leftrightarrow 11$; addition is bitwise exclusive or. These are coordinates in the basis $1,\alpha$, so the label $10$ does not make $\alpha$ the element $1+1$.

For multiplication, expand using the distributive property and replace every ${\alpha }^2$ by $\alpha +1$:For example, $\alpha (\alpha +1)={\alpha }^2+\alpha =1$, while $(\alpha +1{)}^2={\alpha }^2+1=\alpha$. The following complete tables are computed from the coefficient rules. Colors identify results, rather than their numerical sizes. Every row of the addition table lists all four elements, and every nonzero row of the multiplication table does too: adding an element, or multiplying by a nonzero element, can be undone.

The nonzero multiplicative inverses are $1^{-1}=1$, ${\alpha }^{-1}=\alpha +1$, and $(\alpha +1{)}^{-1}=\alpha$. Consequently the equation $\alpha x=\alpha +1$ has the unique solution $x=(\alpha +1{)}^2=\alpha$. Repeated multiplication gives ${\alpha }^0=1$, ${\alpha }^1=\alpha$, ${\alpha }^2=\alpha +1$, and ${\alpha }^3=1$. They cycle through every element of the multiplicative group of a finite field.

Compare the ring $\mathbb{Z}/4\mathbb{Z}$, also with four elements. Its addition satisfies $1+1=2\ne 0$, and its multiplication satisfies $2^2=0$. Thus $2$ is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by $2$ collapses different inputs to the same output: both $0$ and $2$ give $0$, while both $1$ and $3$ give $2$. In the field with four elements, multiplying by $\alpha$ instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.

Foundations of mathematics asks what our objects mean, what we assume about them, and why an argument establishes its conclusion. Set theory gives a common language for collections and functions; mathematical logic makes the structure of statements and deductions precise. A mathematical definition fixes a meaning, an axiom supplies an assumption, and a mathematical proof explains what follows. Separating these roles makes results reusable: once the group axioms are enough for a conclusion, that conclusion applies to every group, regardless of how its members are represented.

The assumptions can change the answer to a familiar calculation. Over the real numbers, $x^2=x$ factors as $x(x-1)=0$, so $x$ is zero or one. The same reasoning holds in any integral domain, because a product can be zero only when a factor is zero. In the ring of integers modulo six, however, $3^2\equiv 3$ and $4^2\equiv 4(\mathrm{mod}6)$: there are four solutions, represented by $0,1,3,4$. The extra solutions are idempotents, and the failed step involves zero divisors. Writing the domain is part of explaining the answer.

This precision also reveals surprising possibilities. A two-dimensional grid of natural numbers is a countable set, while all infinite binary sequences form an uncountable set. The Cantor pairing function supplies a complete enumeration of the first; Cantor's diagonal argument defeats every proposed enumeration of the second. Both arguments are short, yet distinguish two sizes of infinity. The subject's appeal is this ability to turn a vague question into one whose assumptions, construction, and limits can all be inspected.

For a commutative ring $R$ with an identity element, use coordinatesThese matrices form a group under multiplication, withThese formulas require no division, so they remain valid over rings with zero divisors. The center of a group is $\{A(0,y,0):y\in R\}$: the commutator has only central coordinate $x{z}^{\prime }-x^{\prime }z$, and testing $x^{\prime }=0,z^{\prime }=1$ and $x^{\prime }=1,z^{\prime }=0$ forces $x=z=0$. For finite $R$, its group order is $|R{|}^3$. This includes real, integer and modular versions of the Heisenberg group; the ring $\mathbb{Z}/4\mathbb{Z}$ must not be confused with the finite field of four elements.

An integral domain is a nonzero commutative ring without zero divisors. Equivalently, a product of two nonzero elements is always nonzero. The zero ring is excluded, and $\mathbb{Z}/6\mathbb{Z}$ fails because $2\cdot 3=0$. Every field is an integral domain, but the integers show that the converse fails: $2$ has no multiplicative inverse in $\mathbb{Z}$. See MIT's Basic Properties of Rings, definitions 15.9–15.10 and example 15.11.

The practical benefit is multiplicative cancellation. In the integers, $2x=6$ has at most one solution and indeed $x=3$ works. Yet $2x=1$ has no integer solution. Thus multiplicative cancellation guarantees uniqueness when a solution exists; it does not guarantee division by every nonzero element. Passing to the fraction field $\mathbb{Q}$ supplies the missing solution $1/2$.

The polynomial ring $\mathbb{Z}[X]$ is also an integral domain. For example, the product of $2X+1$ and $3X-4$ has leading coefficient $6$ and cannot vanish. Generally the leading coefficient of a product is the product of the two leading coefficients; an integral domain prevents that coefficient from vanishing. This connects integer arithmetic to polynomial arithmetic through one reusable principle.

Historically, this connection grew far beyond elementary examples. Keith Conrad identifies the ring of integers of a number field and a ring of polynomial functions on a smooth plane curve as early important examples of Dedekind domains. This shared structure connects number theory with algebraic geometry; see Conrad's Ideal Factorization, section 6.

In a Noetherian ring, an ideal $Q$ is $\mathfrak{m}$-primary for a maximal ideal $\mathfrak{m}$ if and only if ${\mathfrak{m}}^n\subseteq Q\subseteq \mathfrak{m}$ for some $n\ge 1$. For necessity, choose generators $x_1,\dots ,x_d$ of $\mathfrak{m}$ and exponents $e_i\ge 1$ with $x_i^{e_i}\in Q$. Every product of $1+{\sum }_i(e_i-1)$ generators lies in $Q$. If $\mathfrak{m}=0$, take $n=1$. Conversely the inclusions imply $\sqrt{Q}=\mathfrak{m}$, so $R/Q$ is a local ring with maximal ideal $\mathfrak{m}/Q$. Every element outside this maximal ideal is a unit, while every element inside is nilpotent. Therefore every zero divisor is nilpotent, which is the primary ideal condition. The reverse implication works for any commutative ring.

For integers $a$ and $n>1$, a modular multiplicative inverse is a congruence class $b$ satisfying $ab\equiv 1(\mathrm{mod}n)$. It exists exactly when $\gcd (a,n)=1$. Necessity follows because every common divisor of $a,n$ would divide $ab-kn=1$. Conversely, Bézout's identity gives $ua+vn=1$ for coprime integers, making $u$ an inverse. This is the basic bridge from greatest common divisor calculations to reversible modular arithmetic.

For example, $5\cdot 7-2\cdot 17=1$, so $5^{-1}\equiv 7(\mathrm{mod}17)$. The modular congruence $5x\equiv 3(\mathrm{mod}17)$ therefore has the unique solution class $x\equiv 21\equiv 4(\mathrm{mod}17)$. Multiplication by $5$ sends all seventeen residue classes to different classes; multiplying by $7$ reverses it. The inverse criterion and its algorithmic construction are presented in Ankur Moitra, MIT 18.200, 2024, modular inverses and Euclid's algorithm.

By contrast, $5$ has no modular inverse modulo $15$. Its products have only residues $0,5,10$. Consequently $5x\equiv 3(\mathrm{mod}15)$ has no solution, while $5x\equiv 10(\mathrm{mod}15)$ has five solution classes, $x\equiv 2,5,8,11,14$. Dividing by a noninvertible residue would discard this distinction. In a prime field ${\mathbb{F}}_p$, every nonzero residue is invertible; a general integer modulus instead gives a quotient ring that can have zero divisors.

If $f(T)$ is monic of degree $k$ over a commutative ring, every polynomial has a unique expression $g=qf+r$ with $\mathrm{deg}r<k$. Cancel the highest remaining term successively; the leading coefficient one needs no inversion. Uniqueness follows because multiplication by a monic polynomial raises the degree of every nonzero polynomial by $k$, even when the ring has zero divisors. The same argument applies to an even central variable and central coefficients in a graded commutative algebra.

In an integral domain, $ab=ac$ with $a\ne 0$ gives $a(b-c)=0$ by the distributive property. Since there are no zero divisors, $b-c=0$. Conversely, in a nonzero commutative ring, this cancellation property rules out zero divisors by comparing $ab=0$ with $a0=0$.

For a field $K$, the nonzero elements form an abelian group under multiplication, called its multiplicative group. Products of nonzero elements are nonzero because a field has no nonzero zero divisors; multiplication is associative and commutative, the identity is $1$, and every nonzero element has an inverse. Thus every finite subgroup of $K^{\times }$ is a finite abelian group. The finite subgroup of a field multiplicative group is cyclic theorem uses the root bound for a polynomial to prove a stronger restriction on such subgroups.

For a finite field with $q$ elements, exactly $q+1$ functions from the field to itself preserve multiplication, without requiring additivity or preservation of the identity. They are the constant-zero map, the constant-one map, and the $q-1$ power maps $x\mapsto x^k$ for $1\le k\le q-1$.

To prove completeness, $f(1{)}^2=f(1)$ forces $f(1)\in \{0,1\}$ because a field has no zero divisors. The zero choice forces the constant-zero map. For $f(1)=1$, nonzero elements must map to nonzero elements, and the restriction is a group homomorphism of the cyclic multiplicative group of a finite field. Its generator has $q-1$ possible images, giving the $q-1$ power maps on nonzero elements. Setting $f(0)=0$ extends each. The only further possibility is $f(0)=1$, which forces every value to be one. For $q=5$, this gives six maps. These are generally not field homomorphisms, because preservation of addition was never required.