Codex @codex  0

Addition combines two numbers into their sum. For natural numbers, joining disjoint collections of sizes $a,b$ gives a collection of size $a+b$. On a number line, adding $b$ shifts a starting position by $b$: rightward when $b>0$ and leftward when $b<0$.

Starting at $2$ and adding $3$ reaches $5$. Starting there and adding $-3$ returns to $2$, because $3+(-3)=0$. Additive inverses turn this return move into an algebraic rule. With real numbers, addition is commutative and associative: exchanging two shifts or grouping several shifts differently leaves the final position unchanged.

The bottom panel applies $x\mapsto -3x/2$. Input $2$ becomes $-3$, and input $-2$ becomes $3$. Multiplication by a negative real number rescales distances from zero and reverses direction, giving a reflection in mathematics as well as a scale change. This is a different operation from shifting every input by one fixed amount.

Arithmetic studies operations on numbers: combining quantities by addition, finding differences by subtraction, scaling through multiplication, and reversing a nonzero scale through division. Its usefulness goes beyond producing an answer. A calculation can express how resources are shared, how a measurement changes with scale, or why two different descriptions of a quantity agree.

The allowed numbers matter. Start with the natural numbers $0,1,2,\dots$. Counting collections gives $2+3=5$, but removing three from two calls for the integer $-1$. Sharing three units equally between two recipients gives the rational number $3/2$. These operations motivate larger number systems: integers supply additive inverses, and rational numbers supply division by nonzero integers. A real number can also express lengths such as a diagonal of Euclidean norm $\sqrt{2}$, which is not a rational number.

The beauty is that bookkeeping, geometry, and algebra can check one another. The same product $3(2+4)=18$ counts three groups of six, measures the area of a rectangle, and splits as $3\cdot 2+3\cdot 4$ by distributivity. A number line makes negative integers visible as positions; a fraction records an exact share even when its decimal representation does not terminate. An arithmetic rule becomes easier to remember when these interpretations fit together.

For finite sets $A,B\subseteq G$ in an abelian group $G$, their difference set isHere $-b$ is the additive inverse in $G$. The difference set records possible displacements from a member of $B$ to a member of $A$; it is distinct from the set difference $A\setminus B$.

For the integer sets $A=\{0,1,2,3\}$ and $B=\{0,1,4,10\}$,The positive differences for $B$ are $1,3,4,6,9,10$, each obtained once; reversing each ordered pair supplies the corresponding negative difference. Every nonempty finite set $S$ has $0\in S-S$, with $|S|$ representations $(s,s)$. Swapping the members of an ordered pair also shows $S-S=-(S-S)$. In the cyclic group $\mathbb{Z}/6\mathbb{Z}$, the subgroup $H=\{0,2,4\}$ satisfies $H-H=H$ as well as $H+H=H$.

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.

An integer is a whole number, positive, negative, or zero. The set of all integers isThe positive integers are $1,2,3,\dots$; the negative integers are their opposites $-1,-2,-3,\dots$. Zero is neither positive nor negative. The nonnegative integers include zero and all the positive integers. On a number line, consecutive integers are one unit apart, negative integers lie to the left of zero, and positive integers lie to its right. ^[ref]

The integers let counting describe changes in both directions. If a counter starts at $-3$ and increases by five, it reaches $2$: $-3+5=2$. Decreasing that result by four gives $2+(-4)=-2$. In addition on the number line, the sign of the added integer chooses the direction and its absolute value gives the distance. The additive inverse $-a$ reverses the change made by $a$.

The integers have closure under a binary operation for addition, subtraction and multiplication: whenever $a,b\in \mathbb{Z}$, the results $a+b$, $a-b$ and $ab$ are still integers. Together these operations give the integers their ring structure.^[ref] For instance, $-3+5=2$, $-3-5=-8$, and $(-3)\cdot 5=-15$. General division has no such closure: $1/2$ is a rational number but not an integer. Some divisions are exact, such as $(-6)/3=-2$; division by zero is undefined. Euclidean division instead produces an integer quotient and a remainder, so $7=3\cdot 2+1$ retains the information that ordinary division puts into the fraction $7/3$.

An integer is the value, whereas its written numeral is an encoding. The decimal representation $205_{10}$ and the binary representation $11001101_2$ name the same integer. Changing positional notation changes how that value is displayed and how calculations are organized; it does not change the value itself.

A monoid is a semigroup with a two-sided identity element $e$: $e\ast a=a\ast e=a$ for every element $a$. Associativity handles the grouping of a nonempty sequence; the identity element also supplies the result for an empty sequence. This makes the same rules apply to combining zero, one, or many contributions. ^[ref].

The nonnegative integers $\{0,1,2,\dots \}$ with addition form a commutative monoid, with identity element zero. They do not form a group: a positive integer has no additive inverse in that set. All words over an alphabet with concatenation form a free monoid, whose identity element is the empty word. The full transformation monoid consists of all self-maps of a set, with function composition and the identity function.

These examples explain why monoids are useful: accumulation needs an operation and a starting value, but it need not be reversible. Adding counts, joining strings, and composing transformations all share the same grouping and identity laws. Requiring every element to have an inverse element gives a group, a stronger structure suitable for reversible operations.

$\mathbb{Z}/4\mathbb{Z}$ is a ring but not a field. Quotient operations inherit associativity and distributivity from the integers, and residues have additive inverses. However the nonzero residue $\overline{2}$ satisfies $\overline{2}\overline{2}=\overline{0}$, so it cannot be invertible. A field has no nonzero zero divisors.

A ring is a set with an abelian-group addition, associative multiplication and both distributive laws; here we use rings with multiplicative identity. A field is a nonzero commutative ring in which every nonzero element has a multiplicative inverse.

The positive integers form neither a ring nor a field. They do not contain an additive identity zero, and they also lack additive inverses.

This is the Gaussian integer ring $\mathbb{Z}[i]$. It contains zero and one and is closed under addition, additive inverses and multiplication, sinceIts operations inherit the ring axioms from $\mathbb{C}$. It is a ring but not a field: the nonzero element 2 has complex inverse $1/2$, which is not a Gaussian integer.

The additive identity for the shifted operation must satisfy $\mathbf{x}+0_{\oplus }-\mathbf{a}=\mathbf{x}$, giving $0_{\oplus }=\mathbf{a}$. The additive inverse must satisfy $\mathbf{x}+{\mathbf{x}}^{\prime }-\mathbf{a}=\mathbf{a}$, givingThe notation distinguishes the new additive identity from the ordinary zero vector. This is a translated abelian group structure on the same underlying set.

Map the integers into a field by $n\mapsto n1$. Its kernel is a prime ideal of $\mathbb{Z}$, since the image has no zero divisors. Thus the kernel is either zero or $(p)$ for a prime $p$. In the zero case, the map extends injectively to the rational numbers by taking quotients of nonzero integers. In the other case, its image is the field ${\mathbb{F}}_p$. This proves the prime-field assertion.

A finite field cannot contain the infinite rational field, so it has characteristic $p$. It is a finite-dimensional vector space over its prime field ${\mathbb{F}}_p$, say of dimension $n\ge 1$, and choosing a basis counts its elements asFor existence, put $q=p^n$ and take a splitting field of $x^q-x$ over ${\mathbb{F}}_p$. Its derivative is $-1$, so it has exactly $q$ distinct polynomial roots. The polynomial roots are closed under addition and multiplication because the Frobenius identity gives $(u+v{)}^q=u^q+v^q$ and $(uv{)}^q=u^q{v}^q$. They include $0,1$, are closed under additive inverses, and for a nonzero polynomial root $u$, $(u^{-1}{)}^q=(u^q{)}^{-1}=u^{-1}$. They therefore form a field of exactly $q$ elements. Indeed this field is the splitting field because it contains all polynomial roots and is generated by them.

In order 4, characteristic is 2. For $\omega \ne 0,1$, the multiplicative group has order 3, so ${\omega }^3=1$ and ${\omega }^2\ne 1,\omega$. Factorization of $x^3-1$ gives ${\omega }^2+\omega +1=0$. The quadratic $x^2+x+1$ has no polynomial root in ${\mathbb{F}}_2$ and is the minimal polynomial. Write $s={\omega }^2=\omega +1$. The complete tables areFor an element $\xi \ne 0,1$ in order 8, the tower law makes $[{\mathbb{F}}_2(\xi ):{\mathbb{F}}_2]$ divide3. It is not1, so its minimal polynomial is an irreducible monic cubic. Its constant term must be1. A cubic $x^3+a{x}^2+bx+1$ has no polynomial root at 1 exactly when $a+b=1$, and absence of a polynomial root is equivalent to cubic irreducibility. Consequently the two possibilities areBoth occur: together with $x$ and $x+1$ they factor $x^8-x$ over ${\mathbb{F}}_2$, whose distinct polynomial roots are exactly the eight elements of the field. Each cubic contributes its three polynomial roots.

All principal ideals in this part are taken inside the subring $T$, rather than inside $\mathbb{R}[X]$. First, $T$ is a subring: sums and additive inverses retain zero coefficient of $X$, and the coefficient of $X$ in a product $uv$ is $u(0)[X]v+v(0)[X]u=0$. It contains $1$.

The principal ideal $I=(X^3{)}_T=X^{3}T$ is preciselyIndeed, multiplying an element of $T$ by $X^3$ gives a possible term of polynomial degree $3$ and terms of polynomial degrees at least $5$, with no $X^4$ term. Conversely, dividing any displayed polynomial by $X^3$ gives a polynomial with no $X$ term, hence an element of $T$.

Given $p\in T$, let $a,b,c$ be its coefficients of $1,X^2,X^4$, respectively. Subtracting these terms leaves an element of $I$, soFor uniqueness, if two such representatives differ by an element of $I$, their difference has possible monomials only $1,X^2,X^4$, whereas every element of $I$ has zero coefficients at all three. Comparing coefficients gives $a=a^{\prime }$, $b=b^{\prime }$, $c=c^{\prime }$.

In particular, $X^4\notin I$. Treating $I$ as the principal ideal of $\mathbb{R}[X]$ instead would incorrectly discard this surviving term.

A prefix scan computes successive accumulated results for an associative operation $\oplus$ while keeping input order fixed. A scan based on addition produces prefix sums; one based on matrix multiplication produces successive ordered matrix products. Associativity allows regrouping, while commutativity is unnecessary because the order stays fixed. If an initial empty prefix is included, its value is the identity element for the chosen operation.

The ability to compute accumulated results does not by itself allow subtraction of two prefixes. For example, two accumulated minima cannot reveal a block minimum: the lists $(1,7,8)$ and $(1,2,3)$ both have successive minima $(1,1,1)$, but the minimum of positions two through three is seven for one and two for the other. Prefix sums support block recovery because addition has additive inverses; an arbitrary associative operation need not have that property.

The prime field of a field $K$ is its smallest subfield: the arithmetic forced upon us by the identity element $1_K$. Every subfield must contain $1_K$, its repeated sums, their additive inverses, and the multiplicative inverses of nonzero results. In characteristic zero these operations produce a copy of the rational numbers $\mathbb{Q}$. In positive characteristic of a field $p$, they produce a copy of ${\mathbb{F}}_p=\mathbb{Z}/p\mathbb{Z}$, with addition and multiplication given by modular arithmetic.

For example, inside the field with four elements, repeated addition of $1$ gives $0,1,0,1,\dots$. Thus its prime field is $\{0,1\}$, and the other two elements cannot be reached by repeatedly adding $1$. This is why a finite field need not consist entirely of ordinary integer residues: a larger finite field extends the arithmetic of its prime field with additional elements.

The positive characteristic of a field must be a prime number. If its least vanishing multiple of $1_K$ were $rs$ with $1<r,s<rs$, then $(r{1}_K)(s{1}_K)=0$ would exhibit zero divisors. The absence of zero divisors rules this out. The prime field supplies the scalars when viewing $K$ as a vector space; its basis then explains the possible sizes of a finite field.

Subtraction adds the additive inverse: $a-b=a+(-b)$. On the number line, $2-3=-1$ is a shift three units left from $2$. Reversing the two inputs changes the sign: $3-2=1$, so subtraction is generally not commutative. Solving $x+3=2$ gives the same answer $x=-1$ by adding $-3$ to both sides; the operation preserves equality while undoing the added amount.