Use the Weyl algebra convention , with , where the brackets are commutators. Its order filtration of a Weyl algebra is
Thus has degree zero and degree one. By the ordered monomial basis of a Weyl algebra, the associated graded ring is
where is the symbol of .
The Rees ring of a filtered algebra is the graded ring
where is a central indeterminate. Here it is generated by , , and , with degrees , respectively, and relations
It interpolates between the associated graded ring and the original filtered ring:
A good filtration for the order filtration on is an increasing exhaustive family of complex vector subspaces , zero for sufficiently negative , with , such that the associated graded module
is a finitely generated module over . Equivalently, there are finitely many and integer shifts such that . In particular, choose any finite generating family of and put
This is a good filtration for the order filtration.
For , its dimension of a Weyl algebra module for the order filtration is
Here support of a module, annihilator of a module, and Krull dimension are taken over the commutative polynomial ring . The corresponding algebraic set is the order characteristic variety of a Weyl algebra module. This dimension is independent of the chosen good filtration for the order filtration; one may set .
The pieces generally have infinite complex dimension, since they contain all polynomials in the . Thus a polynomial-growth definition based directly on would be inappropriate for this order filtration of a Weyl algebra.
Divide by in the polynomial ring over the field: , where or . If , then , and minimality forces . Conversely a multiple of vanishes at . Therefore
This includes the zero polynomial.
A Euclidean domain is an integral domain with a Euclidean function such that, for with , there exist satisfying
The polynomial ring has this property with . To perform polynomial division, subtract an appropriate multiple of the divisor to cancel the leading term of the current remainder. Its polynomial degree decreases strictly at each step, so the process terminates below the divisor's degree. The required division of leading coefficients is possible in the field . Thus a polynomial ring over a field is Euclidean, with the same argument applying to every field.
Now let be a nonzero ideal of a Euclidean domain, and choose with the least possible value of . For every , divide . The remainder belongs to , since . If it were nonzero, its smaller Euclidean value would contradict the choice of . Thus and every lies in . Conversely because is an ideal. Hence . The zero ideal is already , proving every Euclidean domain is a principal ideal domain.
Regard as the polynomial ring . The coefficient ring is a Euclidean domain, hence a principal ideal domain. The element is a prime element: the quotient ring is an integral domain.
The monic polynomial has its other coefficients divisible by , while . Part (a)(i), with playing the role of and the indeterminate, proves that is an irreducible polynomial.
Now use the automorphism of a polynomial ring
Its inverse fixes and sends to . A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Since
we obtain
Applying the Eisenstein criterion directly to the second expression with the prime element would fail, since ; the change of indeterminate supplies the required argument.
We prove the stated Eisenstein criterion directly. Assume . Suppose in the polynomial ring . Since the principal ideal domain is an integral domain, polynomial degree is additive under polynomial multiplication, and the product of the leading coefficients of is the leading coefficient of . These two coefficients are therefore units. Multiplying and by inverse units, without changing their product, makes both factors monic polynomials.
If either factor is a constant polynomial, that factor is now , so the original factor was a unit. It remains to rule out and .
The prime element generates a maximal ideal in the principal ideal domain . Indeed, if , then , and the irreducible element property of forces either or . Consequently is a field. Apply reduction modulo an ideal to every coefficient. The monic polynomial factors retain their polynomial degrees, and the hypotheses give
The polynomial ring over a field is a unique factorization domain, and is an irreducible polynomial. Thus its only monic polynomial divisors in are powers of . Hence and . Both have zero constant term, so and . This gives , a contradiction.
The monic polynomial has positive polynomial degree, so it is a nonzero nonunit. Every factorization therefore has a unit factor, proving
The polynomial ring is a Euclidean domain under polynomial degree, hence a principal ideal domain. By part (b)(i), each
is a field. By polynomial division, every residue class has exactly one representative of polynomial degree less than . Thus form a basis over , and .
For , the ideals and are distinct maximal ideals, so they are comaximal ideals: their sum is an ideal properly containing and must be the whole ring. The Chinese remainder theorem for ideals and part (b)(ii) therefore give the ring isomorphism
In particular, this is a product of finite fields of the required sizes. The map preserves multiplication as well as addition and is surjective by the Chinese remainder theorem for ideals.
Poisson algebra Created 2026-10-13 Updated 2026-11-05
A Poisson algebra has two compatible products on one vector space: a commutative, associative multiplication and a Lie bracket . Compatibility is the Leibniz rule
Thus fixing makes an algebraic derivation. The Lie bracket also satisfies the Jacobi identity; an arbitrary bilinear bracket satisfying antisymmetry of a Lie bracket and the product rule need not do so.[ref]
For example, the polynomial ring becomes a Poisson algebra with the canonical Poisson bracket
The partial derivatives give and , illustrating how the Leibniz rule extends the bracket from generators to their products. More generally, smooth functions on a symplectic manifold form a Poisson algebra. A finite-dimensional Lie algebra of moment map components need not be closed under ordinary multiplication: adding all their products normally gives a much larger Poisson algebra.
Polynomial identity Created 2026-10-14 Updated 2026-11-05
A polynomial identity is equality of formal polynomials: every corresponding polynomial coefficient agrees. For example, holds in the polynomial ring over every commutative ring. Polynomial evaluation preserves such an identity, so it gives an equality of values at every allowed substitution.
The converse requires a hypothesis on the coefficient field. Over an infinite field, a polynomial that vanishes at every point is zero: use the Lagrange root bound over a field in one variable, and induction on the number of variables. Over the finite field , the nonzero formal polynomial induces the zero polynomial function. Thus equality of polynomial functions on a finite domain need not be a formal polynomial identity. Coefficient comparison, as used with the binomial theorem, concerns formal polynomial identities.
Polynomial identity testing Created 2026-09-24 Updated 2026-10-18
Polynomial identity testing asks whether a polynomial represented implicitly, such as by an arithmetic circuit or a remainder computation, is the zero polynomial.
Here zero means that every coefficient vanishes after collecting equal monomials in the polynomial ring. Testing equality of two polynomials amounts to testing for zero. An arithmetic circuit can permit cheap polynomial evaluation even when expanding all monomials is expensive. The random evaluation test for a polynomial identity exploits this: one nonzero value disproves the polynomial identity, while a known total degree limits how often a nonzero polynomial can evade detection.[ref]
For example, for an integer , has distinct monomials, one for each subset of the variables. Its factored expression needs only additions and multiplications for one polynomial evaluation. Evaluating the compact expression avoids creating its expanded list of coefficients. The saving is especially attractive in many variables; it does not make a zero result into a proof of identity.
The polynomial model of a regularity structure realizes abstract monomials as ordinary coordinate differences around each base point. It is the example that turns a regularity structure into familiar Taylor polynomials. In dimensions, use a polynomial ring in symbols , graded by total degree. For a multi-index ,
Re-expansion uses . Substitution immediately gives and , the compatibility identities of a model of a regularity structure.[ref]
For example, has local abstract expansion at . At it has . Transporting the latter substitutes :
The coefficients change because the expansion point changes; the represented function is still .
The analytic scaling also follows by calculation. For a smooth test function and , changing variables gives
Thus the assigned degree predicts exactly the power of in the model bound. Anisotropic scaling can assign different weights to different coordinates instead; ordinary total degree is the isotropic choice. General regularity structures retain this organization of local expansions while admitting symbols that are not polynomials.
A linear operator on a vector space over a field makes a module over the polynomial ring : let act as , let constants act as the original scalars, and define . The identity for polynomials verifies the multiplication axiom. The submodules are precisely the invariant subspaces of . This construction is described in Keith Conrad's Introductory Notes on Modules, section 6.
For a computed example, take , , and
Then , , and . Consequently
Every equals . The module homomorphism , , is therefore surjective, and its kernel is the ideal . It induces a module isomorphism . This is a cyclic module and a torsion module over , since . Over it is a free module with basis and has no nonzero torsion elements of a module. Over its nonzero elements also have infinite additive order of a group element. Changing scalars changes the questions one asks about the same addition law.
Polynomial polyvector field Created 2026-10-05 Updated 2026-11-05
For a polynomial ring , a degree- polynomial polyvector field is an element of . Its product is the exterior product. Together with the Schouten-Nijenhuis bracket these spaces form a Gerstenhaber algebra.
Polynomial ring Created 2026-09-24 Updated 2026-11-05
For a prime ideal of a polynomial ring over a field, the quotient's Krull dimension is the transcendence degree of its fraction field, and its height is 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 , polynomial division makes the one-variable polynomial ring a Euclidean domain with Euclidean function equal to the polynomial degree. For a divisor , subtract a suitable scalar multiple of to cancel the leading coefficient of the current remainder. Its degree strictly decreases. Iteration terminates at , where or . Division by the leading coefficient is valid because it is nonzero in a field.
Prime ideals below a principal prime Created 2026-10-25 Updated 2026-10-31
Let be a unique factorization domain and let be a prime element. The only prime ideals contained in the principal ideal are and . To prove this, suppose . Then . For , unique factorization allows us to write with . Since is a prime ideal and , repeated primality gives , a contradiction.
In the particular polynomial ring , when is a prime number, the same proof uses only the integer coefficients: factor out the largest common power of from the coefficients of a nonzero polynomial . This gives with directly, without requiring the general unique factorization domain theorem for polynomial rings.
Principal ideal Created 2026-09-24 Updated 2026-11-05
In a commutative ring, a principal ideal is generated by one element:
For example, every ideal of has the form , whereas in a two-variable polynomial ring over a field is not principal.
In a noncommutative ring, the two-sided ideal generated by consists of finite sums ; it need not equal the principal left ideal . In , the matrix unit generates the entire matrix ring as a two-sided ideal, since . The left ideal only contains matrices with zero second column. The side is therefore part of a principal-ideal statement outside the commutative setting.
Reynolds operator on a polynomial invariant ring Created 2026-10-14 Updated 2026-11-05
In characteristic zero, averaging over a compact group, or over a Zariski-dense compact form of a complex reductive group, gives a degree-preserving projection onto the polynomial invariant ring. Its module property is for invariant . This property turns finite ideal generation in the ambient polynomial ring into finite algebra generation of the invariant subring.
Ring Created 2026-09-24 Updated 2026-10-14
A ring is a set with two binary operations, addition and multiplication, satisfying three requirements. Under addition, is an abelian group: there is a zero, every element has an inverse element, and grouping or exchanging summands does not change the result. Multiplication is associative and has an identity element , so and . Finally, both versions of the distributive property hold:
Here every ring is unital, but the zero ring, with , is allowed. Commutativity of multiplication is an additional condition defining a commutative ring. These conventions agree with [ref].
The integers form a ring with their usual operations. The polynomial ring is another: addition combines coefficients, while multiplication uses the distributive property. For example,
The same rules justify symbolic calculations in both rings; this is why one definition can organize apparently different kinds of arithmetic. In every ring, , and . The first identity follows by distributing and subtracting ; the second follows by distributing . Thus familiar sign rules are consequences of the structure.
Order still matters in some rings. In the matrix ring , take
Then matrix multiplication gives
Nevertheless, matrix multiplication is associative, distributes over addition, and has the identity matrix as its identity element. This is a valid ring. On a column vector, applies first and second: swapping coordinates before discarding the second coordinate differs from doing those actions in reverse. The failure of commutativity records a meaningful difference in function composition.
Figure 1.
Two orders of matrix multiplication give different outputs on the same vector
. Details.
Sullivan minimal model Created 2026-10-06 Updated 2026-11-05
A Sullivan minimal model of a topological space is a quasi-isomorphism
from a free graded-commutative differential graded algebra over the rational numbers to the rational polynomial differential forms of . Here raises degree by one and . The notation means a polynomial ring on even-degree generators tensored with an exterior algebra on odd-degree generators.
There is a well-ordered homogeneous basis of such that the expression for each generator uses only earlier generators. Minimality additionally requires each to be decomposable, with no linear term. These are distinct requirements; freeness and absence of linear terms alone do not replace the earlier-generator condition.[ref]
For odd spheres , , the model is . For even spheres , , it is
The equation kills the square while retaining the fundamental cohomology class. For simply connected finite-type CW complexes, is dual to : the extra generator for an even sphere records a second nonzero rational homotopy group. A proposed model must therefore specify its actual quasi-isomorphism and cohomology, beyond listing plausible relations.