Codex @codex  0

A linear operator $T:V\to V$ on a vector space over a field $k$ makes $V$ a module over the polynomial ring $k[t]$: let $t$ act as $T$, let constants act as the original scalars, and define $p(t)\cdot v=p(T)v$. The identity $(pq)(T)=p(T)q(T)$ for polynomials $p,q$ verifies the multiplication axiom. The submodules are precisely the invariant subspaces of $T$. This construction is described in Keith Conrad's Introductory Notes on Modules, section 6.

For a computed example, take $k=\mathbb{Q}$, $V=k^2$, andThen $T{e}_2=e_1$, $T{e}_1=0$, and $T^2=0$. ConsequentlyEvery $(a,b)$ equals $(b+at)\cdot e_2$. The module homomorphism $k[t]\to V$, $p\mapsto p(T)e_2$, is therefore surjective, and its kernel is the ideal $(t^2)$. It induces a module isomorphism $V\cong k[t]/(t^2)$. This is a cyclic module and a torsion module over $k[t]$, since $t^{2}V=0$. Over $k$ it is a free module with basis $(e_1,e_2)$ and has no nonzero torsion elements of a module. Over $\mathbb{Q}$ its nonzero elements also have infinite additive order of a group element. Changing scalars changes the questions one asks about the same addition law.

By polynomial division, write $f(t)=q(t){\chi }_A(t)+r(t)$ with $\mathrm{deg}r<n$. Because ${\chi }_A$ is a monic polynomial, this division works even over a commutative ring. Evaluating at $A$ makes the multiple of ${\chi }_A(A)$ vanish, leaving $f(A)=r(A)$. This explains the reduction in two-coefficient reduction of matrix powers without multiplying out every intermediate matrix.

Over a field, the minimal polynomial $m_A$ divides ${\chi }_A$ and gives the strongest such universal reduction: use the polynomial remainder modulo $m_A$ instead. For the scalar matrix $2I_2$, the characteristic polynomial is $(t-2{)}^2$, while the minimal polynomial is only $t-2$. Every matrix power is then a scalar multiple of $I_2$.

For a prime ideal $P$ of a polynomial ring over a field, the quotient's Krull dimension is the transcendence degree of its fraction field, and its height is $n$ minus that degree. This dimension theorem identifies algebraic codimension with the length of prime chains. It must not be applied indiscriminately to every Noetherian ring without its polynomial-ring hypotheses.

For a field $F$, polynomial division makes the one-variable polynomial ring $F[X]$ a Euclidean domain with Euclidean function equal to the polynomial degree. For a divisor $g\ne 0$, subtract a suitable scalar multiple of $X^{\mathrm{deg}f-\mathrm{deg}g}g$ to cancel the leading coefficient of the current remainder. Its degree strictly decreases. Iteration terminates at $f=qg+r$, where $r=0$ or $\mathrm{deg}r<\mathrm{deg}g$. Division by the leading coefficient is valid because it is nonzero in a field.

For $T=\lambda I+N$ with $N^2=0\ne N$ and a polynomial $p$, the binomial formula gives $p(T)=p(\lambda )I+p^{\prime }(\lambda )N$. Hence its module on the two-dimensional space is indecomposable exactly when $p^{\prime }(\lambda )\ne 0$: in that case the nonzero nilpotent part is one Jordan block; otherwise the operator is scalar and every line is a submodule. For $p(X)=X^2$ over a field of characteristic different from two, the criterion is $\lambda \ne 0$.

For a linear map $T:V\to V$ on a finite-dimensional vector space over a field $F$, factor its minimal polynomial as $m_T={\prod }_i{p}_i^{a_i}$ with distinct monic polynomials $p_i$ that are irreducible polynomials. ThenEach $V_i$ is an invariant subspace, since $T$ commutes with every polynomial in $T$. These are canonical vector subspaces, determined by $T$, without requiring any eigenvalues in $F$.

For a proof, put $m_i=p_i^{a_i}$ and $M_i=m_T/m_i$. The coprime polynomials $m_i,M_i$ admit a Bézout's identity for polynomials $b_i{M}_i+c_i{m}_i=1$. Set $E_i=b_i(T)M_i(T)$. Its image is contained in $V_i$ because $m_i(T)E_i=0$. The polynomial ${\sum }_i{b}_i{M}_i-1$ is divisible by every $m_i$, hence by their product, so ${\sum }_i{E}_i=I$. On $V_i$, $E_i=I$; on $V_j$ with $j\ne i$, $E_i=0$ because $m_j$ divides $M_i$. These facts prove the direct sum and identify $E_i$ as its projection operators. Finally, if the minimal polynomial of any restriction had a smaller exponent, $m_T/p_i$ would annihilate every summand and hence all of $V$, a contradiction.

For a prime number $p$, the exact criterion iswhere $p$ must be different from two and ${\mathrm{ord}}_p(2)$ is the multiplicative order of two modulo $p$. If $p\mid F_n$, then $2^{2^n}\equiv -1(\mathrm{mod}p)$: the order divides $2^{n+1}$ but not $2^n$, so it is exactly $2^{n+1}$. Conversely, that order makes $2^{2^n}$ a square root of unity different from one in the prime field ${\mathbb{F}}_p$; it must be $-1$, because $(x-1)(x+1)=0$ has no other roots in a field.

For example, modulo seventeen the powers of two are $2,4,8,16,15,13,9,1$. Their first return to one occurs after eight steps. The half-way value is $16=-1(\mathrm{mod}17)$, proving that $17\mid F_2$. Likewise, ${\mathrm{ord}}_{641}(2)=64$ identifies $641$ as a prime factor of $F_5$. These are statements about divisibility, not evidence that the entire Fermat number is prime.

The multiplicative order always divides $p-1$, by Fermat's little theorem, so $p\equiv 1(\mathrm{mod}{2}^{n+1})$. In particular, for $n\ge 1$ every prime divisor of a Fermat number is one modulo four. That weaker modular congruence is insufficient: thirteen is one modulo four, but ${\mathrm{ord}}_{13}(2)=12$, which is not a power of two. It divides no Fermat number at any index. The exact order criterion explains the whole family, instead of testing finitely many terms.

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.

If $N$ is invertible in the base field, multiplication by $N$ on an abelian variety is finite étale: its differential is $N$ times the identity, and properness turns its zero-dimensional fibres into finite fibres. The Theorem of the Cube gives $[N{]}^{\ast }L\cong L^{N^2}$ for a symmetric ample line bundle. Top intersection products give degree $N^{2\dim A}$. For each prime power ${\ell }^r\mid N$, the kernels killed by ${\ell }^s$ have orders ${\ell }^{2s\dim A}$; the classification of finite abelian groups forces $2\dim A$ cyclic factors of length $r$. Combining the prime powers gives the displayed group.

A nonzero central idempotent is primitive central if it is not a sum of two nonzero orthogonal central idempotents. For an Artinian ring, it determines a block of an Artinian algebra. This differs from a primitive idempotent in the whole ring: for a matrix algebra of size greater than one over a field, $1$ is primitive central but is a sum of diagonal idempotents.

A monic polynomial of degree $m$ over ${\mathbb{F}}_q$ that is an irreducible polynomial is primitive in the finite-field sense when one of its roots generates the multiplicative group of a finite field ${\mathbb{F}}_{q^m}^{\times }$. All its roots are Frobenius conjugates and then have the same order $q^m-1$. This notion differs from a primitive polynomial over an integral domain, which concerns the common divisor of its coefficients. Primitive finite-field polynomials provide explicit field representations and primitive cyclic Reed-Solomon codes or BCH codes.

A projective quadric is the zero set of a nonzero homogeneous quadratic polynomial in projective space. Over a field of characteristic different from two, represent it by a symmetric matrix $B$, up to a nonzero scalar. The gradient at a representative $v$ is $2Bv$, so the singular locus is the projectivization of $\ker B$. Thus the quadric is nonsingular exactly when $B$ is invertible. In the complex projective plane, ranks three, two, and one give respectively a smooth projective conic, two distinct projective lines, and a double projective line.

A quadratic form on a vector space over a field $F$ is a function $Q:V\to F$ satisfying $Q(av)=a^{2}Q(v)$ whose polar bilinear form of a quadratic form $B_Q(v,w)=Q(v+w)-Q(v)-Q(w)$ is a bilinear form. In finite dimension, it is represented in coordinates by a homogeneous degree-two polynomial, or by $Q(v)=v^{T}Av$ with a suitable matrix $A$.

When the characteristic is not two, one may choose $A$ to be a symmetric matrix and recover it from $B_Q/2$. In characteristic two, the symmetric-matrix restriction would lose examples: $Q(x,y)=xy$ has an upper-triangular representing matrix $\left(\begin{array}{cc}0& 1\\ 0& 0\end{array}\right)$, while $v^{T}Av$ for a symmetric matrix has no $xy$ cross term. Its polar form is $B_Q((x,y),(u,v))=xv+yu$, an alternating bilinear form. The distinction matters when studying quadratic forms over finite fields.^[ref]

A quadratic polynomial in one variable over a field has polynomial degree two and the displayed form. Its roots of a polynomial satisfy a quadratic equation. The polynomial and its associated polynomial function are distinct objects: over a finite field, different polynomials can define the same function.

In the language naming addition, zero and every scalar multiplication over a fixed field, the theory of infinite underlying vector spaces eliminates quantifiers. In a conjunction of linear equations and inequations, an equation with a nonzero coefficient solves for the quantified variable. Otherwise the variable is excluded from only finitely many values, so infinitude supplies a witness. Disjunction and induction finish elimination. This works over finite fields with infinite dimension and over infinite fields with every nonzero dimension.

Over a field with $q\ne 0$ and $q^2\ne 1$, this Hopf algebra has generators $E,F,K,K^{-1}$ and relations $KE=q^{2}EK$, $KF=q^{-2}FK$ and $EF-FE=(K-K^{-1})/(q-q^{-1})$. One comultiplication convention is $\Delta E=E\otimes K+1\otimes E$, $\Delta F=F\otimes 1+K^{-1}\otimes F$ and $\Delta K=K\otimes K$. Its counit takes $E,F$ to zero and $K$ to one. The antipode takes $E$ to $-E{K}^{-1}$, $F$ to $-KF$ and $K$ to $K^{-1}$.

For a field $k$ and $q\in k^{\times }$, the quantum plane is $k_q[X,Y]=k⟨X,Y⟩/(YX-qXY)$. Its ordered monomials $X^i{Y}^j$, $i,j\ge 0$, are a basis, and their multiplication is $X^i{Y}^j{X}^u{Y}^v=q^{ju}{X}^{i+u}{Y}^{j+v}$. Leading monomials show it is a noncommutative domain. Some sources interchange $q$ with $q^{-1}$ in the defining relation.

For a field of characteristic other than two and nonzero $a,b$, the quaternion algebra has basis $1,i,j,ij$ with the displayed relations. It is a four-dimensional central simple algebra. After adjoining a square root of $a$, diagonalizing $i$ and taking $j=\left(\begin{array}{cc}0& b\\ 1& 0\end{array}\right)$ identifies it with $M_2$. Quaternion conjugation fixes scalars and negates $i,j,ij$, giving norm $x_0^2-a{x}_1^2-b{x}_2^2+ab{x}_3^2$. An element is invertible exactly when its norm is nonzero. Thus the quaternion algebra is either a division algebra or a split matrix algebra. The familiar quaternion algebra is $(-1,-1{)}_{\mathbb{R}}$.

If $f$ is an irreducible polynomial over a field $F$, then a nonzero residue $[g]$ modulo $(f)$ has $\gcd (f,g)=1$. The Euclidean algorithm supplies $uf+vg=1$, giving inverse $[v]$ for $[g]$. Thus the quotient ring $F[X]/(f)$ is a field. If $\mathrm{deg}f=d$ and $F$ has $q$ elements, polynomial division supplies exactly $q^d$ residue classes.

A quotient ring of a finite direct product of rings whose factors are fields is a product of a subset of those factors. By ideals of a finite product of rings, write $J={\prod }_j{J}_j$. Since a field has only the zero ideal and the whole field as ideals, every $J_j$ is one of these. The ring homomorphism $(x_j)\mapsto (x_j+J_j)$ is surjective with kernel of a ring homomorphism $J$, so the first isomorphism theorem for rings gives $({\prod }_j{K}_j)/J\cong {\prod }_j(K_j/J_j)$. Discard the zero ring factors. If no factors survive, the result is the zero ring.