Codex @codex  0

The theory of formally real fields consists of the field axioms and all sentences asserting that $-1$ is not a sum of $m$ squares, one for each positive integer $m$. The real closure theorem and model completeness make the Theory of real closed fields its model companion.

A module $M$ over an integral domain $R$ is torsion-free when $rm=0$ with $0\ne r\in R$ implies $m=0$, equivalently when its torsion submodule is zero. Every free module over an integral domain is torsion-free, as one can check in each coefficient. Every vector space is torsion-free over its scalar field.

The converse requires hypotheses. A finitely generated module over a principal ideal domain is free if it is torsion-free, but the module $\mathbb{Q}$ over $\mathbb{Z}$ is torsion-free and not free. Any two nonzero rational numbers have a nontrivial integer relation, so a possible basis of a module could have at most one element; no single $q$ generates all rational numbers, since $q/2\notin \mathbb{Z}q$ for $q\ne 0$. The finite-generation hypothesis cannot be dropped. See Keith Conrad's Modules over a PID, Corollary 2.6.

The two-factor tensor rank is the smallest number of pure tensors whose sum equals $t$, with zero allowed as the empty sum. For two finite-dimensional vector spaces over the same field, it equals the matrix rank of the tensor-product coefficient matrix. A sum of $r$ outer products has column space contained in the span of their $r$ first factors, so its matrix rank is at most $r$. Conversely, choose a basis $u_1,\dots ,u_r$ for the column space, express each column in that basis, and collect the coefficients into row vectors $w_k^T$. This yields $C={\sum }_{k=1}^r{u}_k{w}_k^T$, hence a sum of $r$ pure tensors.

The pure tensor $(2,1)\otimes (-1,3)$ therefore has two-factor tensor rank one, whereas $e_1\otimes f_1+e_2\otimes f_2$ has two-factor tensor rank two. Both have two factors: the number of factors and the minimum number of product summands are different counts. Over the real numbers, the singular value decomposition supplies a useful decomposition $C={\sum }_k{\sigma }_k{u}_k{v}_k^T$, with one nonzero term per matrix rank. The two-factor rank equality does not extend to three or more factors by merely choosing one matrix layout.

Every nonzero nonunit in a unique factorization domain is a finite product of irreducible elements. Such a factorization is unique up to permutation and multiplication of the factors by units. Irreducibles are prime elements, so divisibility can be checked by comparing their multiplicities. This applies to a polynomial ring over a field and is useful for intersections of localizations inside its fraction field.

For a positive integer modulus $n$, a residue class $[a{]}_n$ is a unit when it has a modular multiplicative inverse: some integer $u$ satisfies $au\equiv 1(\mathrm{mod}n)$. Modulo twelve, the units are exactlyIn particular, five is its own modular inverse, since $5\cdot 5=25\equiv 1(\mathrm{mod}12)$. Multiplying all twelve residue classes by five gives a permutation; multiplying the outputs by five recovers the inputs. By contrast, multiplying by six gives only zero and six, with six inputs for each output. It cannot be reversed.

In general, the exact criterion isFor the forward direction, $au-kn=1$ implies every common divisor of $a,n$ divides one. Conversely, if their greatest common divisor is one, Bézout's identity supplies $ua+vn=1$, so $u$ is a modular inverse. The extended Euclidean algorithm computes these coefficients. The units form the unit group $(\mathbb{Z}/n\mathbb{Z}{)}^{\times }$ under multiplication. ^[ref]

Multiplicative cancellation while keeping the same integer modulus is valid for a unit modulo n: from $ca\equiv cb(\mathrm{mod}n)$, multiply by a modular inverse of $c$ to get $a\equiv b(\mathrm{mod}n)$. A nonunit cannot be cancelled as a general rule. For example, $6\cdot 0\equiv 6\cdot 2(\mathrm{mod}12)$, yet $0\not\equiv 2(\mathrm{mod}12)$. Thus division by six cannot undo this multiplication; solving a linear congruence instead keeps track of all possible classes.

This distinction marks the boundary between commutative rings and fields. Modulo a prime number $p>1$, every nonzero residue class is a unit, so $\mathbb{Z}/p\mathbb{Z}$ is a finite field. Modulo twelve it is a commutative ring with zero divisors, and is not a field. For $n=1$, the sole class satisfies $[0{]}_1=[1{]}_1$ and is a unit; this one-element zero ring is not a field. ^[ref]

Let $R$ be an integrally closed domain and $f\in R[X]$ monic, with discriminant outside a prime ideal $P$. The roots stay distinct after reduction. In the splitting algebra choose a prime above $P$. Its decomposition group maps onto the Galois group of the residue splitting field; its inertia group fixes every reduced root and is trivial because reduction bijects the distinct root sets. Thus the residue Galois group embeds in the generic group as a permutation group. For finite residue fields, irreducible factor degrees give the Frobenius cycle type.

A valuation assigns sizes to elements of a field in a way compatible with multiplication and addition. In additive notation, $v(xy)=v(x)+v(y)$ and $v(x+y)\ge \min \{v(x),v(y)\}$.

Every local subring $A$ of a field $K$ is dominated by a valuation ring with fraction field $K$. Order local overrings by inclusion and contraction of their maximal ideals; chain unions are local, so Zorn's lemma gives a maximal one. For each $z\in K^{\times }$, at least one of the extensions of its maximal ideal to $V[z]$ and $V[z^{-1}]$ is proper: otherwise two least-degree relations for $1$ with maximal-ideal coefficients reduce one another to a smaller-degree relation. Localizing the proper extension gives a dominating overring, so maximality forces either $z$ or $z^{-1}$ into $V$.

A vector space over a field $\mathbb{F}$ is a set $V$ equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.

For example, ${\mathbb{R}}^2$ uses coordinatewise addition and scaling. Withwe have $v=2b_1+b_2$. Moving twice along $b_1$ and once along $b_2$ reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.

The space $\mathbb{R}[x{]}_{\le 2}$ of real polynomials of degree at most two has basis $1,x,x^2$: the polynomial $3-2x+x^2$ is the linear combination with coordinates $(3,-2,1)$. The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.

The choice of field matters. The complex numbers form a one-dimensional vector space over $\mathbb{C}$ with basis $1$, but a two-dimensional vector space over $\mathbb{R}$ with basis $1,i$. The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.

The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.

A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.^[ref]

Every vector space $V$ over a field $F$ has a basis, assuming the axiom of choice. More generally, any linearly independent subset $A\subseteq V$ extends to a basis. This is an algebraic Hamel basis: each representation uses a finite linear combination, even when the basis is infinite.^[ref]

Use the poset of linearly independent subsets containing $A$:It is a set, being a subset of the power set of $V$, and is nonempty because $A\in {\mathcal{P}}_A$.

A short proof outline supplies both essential steps:

Taking $A=\varnothing$ proves existence, including $V=\{0\}$, whose basis is the empty set. The chain in a partial order need not be indexed by the natural numbers: only the finitely many members needed for a particular linear relation are compared. An arbitrary union of linearly independent sets can fail: $\{v\}$ and $\{2v\}$ for a nonzero vector over the real numbers are each linearly independent, but their union is linearly dependent. The nesting of a chain in a partial order is what prevents this failure.

A vector space with scalar field $\mathbb{Q}$ is equivalently a torsion-free divisible Abelian group. An embedding of such groups automatically respects rational scalar multiplication because solutions to $nb=ma$ are unique.

A ring is von Neumann regular if every element $a$ has an element $b$ with $a=aba$. In a commutative ring, this is $a=a^{2}b$. An arbitrary direct product of rings whose factors are fields has this property by taking inverses in each nonzero coordinate. Every localization at a prime ideal of a commutative von Neumann regular ring is a field.

For an abelian variety and an integer $N$ invertible in the base field, a torsion line bundle $M\in \hat{A}[N]$ has trivial pullback by $[N]$. Choose a trivialization. The descent action of the kernel $A[N]$ on that trivial line bundle acts through a character ${\chi }_M:A[N]\to {\mu }_N$. Define $e_N(P,M)={\chi }_M(P)$. This is independent of rescaling the trivialization and bilinear under translation and tensor product. A trivial character descends the trivial bundle, so $M$ is trivial. Since both groups have order $N^{2\dim A}$, the character map is an isomorphism and the Weil pairing for an abelian variety is perfect. The theta autoduality of a Jacobian turns it into a pairing on two copies of the Jacobian variety's torsion group.

The ring with a single element, which is both its additive and multiplicative identity. If a unital ring has $0=1$, then every element $r$ equals $r1=r0=0$, so it is this ring. Under the usual definition it is excluded from integral domains and fields. The quotient ring $\mathbb{Z}/(1)$ is an example.