Algebra over a field Created 2026-09-24 Updated 2026-11-05
An algebra over a field is a vector space with a bilinear multiplication . Bilinearity means and for . Associativity, commutativity, and a multiplicative identity are additional properties, not consequences of this definition.
The polynomial ring and the matrix algebra are associative unital examples; the latter is generally noncommutative. A Lie algebra is another kind of algebra over a field, with its bracket as multiplication, obeying antisymmetry and the Jacobi identity instead of associativity. Specifying which axioms are intended makes statements about all algebras precise.
An almost commutative algebra over a field is an algebra with an exhaustive increasing nonnegative multiplicative filtration whose associated graded ring is commutative and finitely generated as an algebra over the field. A common presentation uses finitely many degree-one generators, scalar degree-zero part, and commutators that lower degree. The finite-generation requirement is essential: an infinitely generated commutative polynomial ring has commutative associated graded algebra but need not be Noetherian.
Alternating polynomial Created 2026-10-07 Updated 2026-10-14
Over a field of characteristic zero, an alternating polynomial changes sign when two variables are interchanged. It vanishes when two coordinates agree, so each factor divides it. These distinct linear factors are relatively prime in the polynomial ring, hence their product, the Vandermonde determinant, divides it. The quotient is a symmetric polynomial.
Associate element Created 2026-10-14 Updated 2026-11-05
Two elements of a commutative ring are associates if for some unit . This is an equivalence relation: reflexivity uses , symmetry uses , and transitivity uses a product of units.
In , the units are , so associates differ only by sign. In the polynomial ring over a field, two nonzero polynomials are associates exactly when one is a nonzero scalar multiple of the other. Unique factorization identifies factors up to this unavoidable ambiguity. In an integral domain, nonzero elements generate the same principal ideal exactly when they are associates.
Augmentation ideal of the infinite cyclic group Created 2026-10-06 Updated 2026-11-05
The group ring of an infinite cyclic group is the Laurent polynomial ring , with augmentation . Multiply any element in the kernel by a power of to obtain a polynomial vanishing at one. The factor theorem makes it divisible by . Thus the augmentation ideal is . Since is an integral domain, multiplication by is an injective module map, so this ideal is a free -module of rank one, even though its additive group has infinite rank.
Automorphism of a polynomial ring Created 2026-10-03 Updated 2026-11-05
An automorphism of a polynomial ring is an invertible ring homomorphism from the ring to itself. For example, has inverse , so translating the variable preserves reducibility.
Bernstein filtration Created 2026-10-06 Updated 2026-11-05
Give both position and differentiation generators of a Weyl algebra degree one. The ordered monomial basis gives and equal to a polynomial ring in variables. Commuting a filtered element with any generator lowers its degree by at least one.
Bernstein growth dimension of a Weyl algebra module Created 2026-10-06 Updated 2026-11-05
For a nonzero finitely generated Weyl algebra module, choose a finite-dimensional generating subspace . Under the Bernstein filtration, is eventually polynomial because the graded module is finite over a polynomial ring. Its degree is independent of the generating subspace, since two generating filtrations bound each other after fixed shifts. It equals the Gelfand–Kirillov dimension of a module.
Binomial coefficients with even interior terms Created 2026-10-05 Updated 2026-10-06
For a positive integer , all binomial coefficients with are even exactly when is a power of two. Write the binary expansion . In the polynomial ring , repeated squaring gives
If has one element, there are no interior terms. If it has more than one, the coefficient of is one and that exponent lies strictly between zero and . This characterization gives a useful parity obstruction directly from the binary expansion.
Check polynomial of a cyclic code Created 2026-10-14 Updated 2026-11-05
For a cyclic code with monic generator , the canonical check polynomial is . A word belongs to the code exactly when is zero modulo , since cancellation in the polynomial ring turns this condition into . The kernel condition alone allows additional polynomials: it is equivalent to . Requiring the monic divisor of the modulus singles out the canonical choice.
// Target: algebra.bigb
If is a finite-type integral domain over an algebraically closed field and , every maximal ideal has height of a prime ideal . Choose a Noether normalization . The contraction of is a maximal ideal of the polynomial ring and has height ; going-down theorem lifts its full chain since the polynomial ring is integrally closed domain. The upper bound is . A principal open subset containing a closed point consequently has dimension , because the whole chain under that point survives localization.
Commutative ring Created 2026-09-24 Updated 2026-10-14
A commutative ring is a ring in which multiplication satisfies for every pair. The integers and the polynomial ring are examples. So is , the quotient ring whose elements are residue classes in modular arithmetic. We represent these by and reduce each sum or product to its remainder. All following calculations modulo use this convention.
In , , although neither factor is zero. Thus and are zero divisors: nonzero elements whose product with another nonzero element can vanish. Also . Removing the common factor would falsely assert . The entire row for multiplication by is
The repetitions explain the linear congruences directly. The equation has exactly the two solutions , whereas has none. A common factor can erase information, and a nonzero coefficient does not guarantee that an equation has a solution.
Figure 1.
Multiplication modulo 6 repeats outputs, while every nonzero row modulo 5 is a permutation
. Details.
A unit in a ring is an element with a multiplicative inverse, meaning for some . In , the units are exactly and , since . The other nonzero elements, , are zero divisors; for , use . In a nonzero commutative ring, a unit cannot be a zero divisor: multiplying by its multiplicative inverse forces . But a nonzero element need not be a unit or a zero divisor: the integer is neither in .
By contrast, in , every row for a nonzero multiplier is a permutation of . Each such row contains exactly once, giving a multiplicative inverse: , , , and . Hence this commutative ring is a field. For example, now has the unique solution . Reading the tables reveals which algebraic steps the arithmetic permits.
Constant polynomial 2026-10-25
A polynomial consisting only of a constant term. Over an integral domain, a nonzero constant polynomial has polynomial degree zero; it is a unit of the polynomial ring exactly when its value is a unit of the coefficient ring.
Coprime polynomials Created 2026-10-06 Updated 2026-11-05
Two polynomials over a field are coprime if their only common factors are nonzero constants. Equivalently, their greatest common divisor is a unit in the polynomial ring. In one variable this is equivalent to a Bezout identity with polynomial coefficients. Independent members of a pencil spanned by coprime polynomials are themselves coprime.
For every fixed positive integer , the polynomial ring with integer coefficients in indeterminates is countably infinite. Polynomials of bounded total degree have only finitely many possible monomials, so they are encoded by a finite Cartesian power of the integers. Taking a countable union of countable sets over degree bounds proves countability; constant polynomials supply an infinite subset. Nonzero one-variable polynomials have finitely many real roots, so the real algebraic numbers form a countable set as well.
Let
This ring consists of finite sums of rational multiples of nonnegative dyadic rational powers of , interpreted as functions on . Every pair of elements lies in one polynomial ring , so is an integral domain. The constant term defines a surjective ring homomorphism . Its kernel of a ring homomorphism is nonzero and is a maximal ideal, by the maximal ideal quotient criterion.
Every has the form for some and some polynomial . The identity
expresses it as a product of two elements of . Therefore , and for all . This shows that strict descent of powers of an ideal can fail in an integral domain, even for a nonzero maximal ideal. By the determinant trick, such an ideal cannot be finitely generated, so this ring is not a Noetherian ring.
Evaluation homomorphism Created 2026-09-24 Updated 2026-11-05
For an element of a commutative -algebra, evaluation on a polynomial ring is the ring homomorphism
Factorial invariant ring with no linear characters Created 2026-10-07 Updated 2026-11-05
If a finite group has no nontrivial homomorphism to , its polynomial invariant ring is a unique factorization domain. Factor an invariant in the ambient polynomial ring and collect its irreducible factors into orbit products. Each orbit product transforms by a linear character, hence is invariant. It is prime in the invariant ring, and the invariant factorization is a product of these primes.
Field with four elements Created 2026-10-06 Updated 2026-10-14
Build this finite field by taking a quotient ring of a polynomial ring:
The polynomial has in the prime field . 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 , with : precisely .
The defining relation is . Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes . Addition acts separately on the two coefficients:
All coefficient calculations use modular arithmetic modulo two. For example, and . Encoding as the pair of bits gives , , , and ; addition is bitwise exclusive or. These are coordinates in the basis , so the label does not make the element .
For multiplication, expand using the distributive property and replace every by :
For example, , while . 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.
Figure 1.
Computed addition and multiplication tables for the field with four elements
. Details.
The nonzero multiplicative inverses are , , and . Consequently the equation has the unique solution . Repeated multiplication gives , , , and . They cycle through every element of the multiplicative group of a finite field.
Compare the ring , also with four elements. Its addition satisfies , and its multiplication satisfies . Thus is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by collapses different inputs to the same output: both and give , while both and give . In the field with four elements, multiplying by instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.
Figure 2.
Four elements with different arithmetic: a field and integers modulo four
. Details.
Filtered algebra Created 2026-10-03 Updated 2026-11-05
A filtered algebra over a field has increasing vector subspaces with . In the usual exhaustive nonnegative convention, , , and . Multiplication on the associated graded ring is induced by multiplying representatives and retaining their highest filtered degree.
For a polynomial ring, polynomials of degree at most give this filtration. For a Weyl algebra, the Bernstein filtration assigns degree one to coordinates and derivatives. Its defining commutators have lower degree, so the associated graded algebra becomes commutative. A filtration of a module compatible with the algebra filtration similarly gives an associated graded module.