Past exam of the rings and modules course of the University of Oxford 2023 1 c i Solution 2026-10-25
Choose a generator of the cyclic group , so . Part (a)(iii) gives a unital ring homomorphism . Its image lies in the centre of , so even if is not a commutative ring, evaluating a polynomial at defines a ring homomorphismBecause , it factors through the quotient ring to giveIts image is the subring . Every unit of is a unit of , because an inverse in also lies in . Conversely, every member of is for some , and both and its inverse lie in . HenceThe inverse argument matters: merely belonging to a subring would not by itself make an ambient unit invertible there.
Perfect ring of characteristic p 2026-10-14
A commutative ring of prime characteristic is perfect in the Frobenius sense when its Frobenius endomorphism is an automorphism. It is necessarily reduced: if is nilpotent, some -power iterate is zero, and injectivity gives . This use of perfect is distinct from the homological notion of a perfect ring. The Absolute Frobenius morphism of a scheme is an isomorphism exactly when all its local rings are perfect in this sense, because it is the identity on points and is an isomorphism on every stalk.
Polynomial Created 2026-09-24 Updated 2026-10-18
A polynomial is a finite sum of monomials with coefficients in a ring. In one variable over a commutative ring , writeThe symbol is an indeterminate: it records powers formally before we choose an input value. Finite expressions are easy to add, multiply, evaluate, and differentiate, making polynomials a common language for exact algebra and approximate numerical analysis.
Consider the real polynomialThe expanded form displays the coefficients and the degree of a polynomial; the factored form displays its roots of a polynomial. At , either description gives . At and , the factored form makes the zero values immediate. Keeping several descriptions of one object is useful because each makes a different question easy.
A simple polynomial root crosses the axis, while a double root touches it; perturbing the double factor can produce real or complex roots
. Details. The graph shows another connection. The factor changes sign across , while stays nonnegative across . Thus the graph crosses the axis at the simple root of a polynomial and touches it at the double root. Multiplicity of a root turns an algebraic repetition into visible local behavior.
For calculations, Horner's method evaluates a polynomial through nested multiplication. For modeling, a Taylor polynomial describes local behavior near a point, while polynomial interpolation constructs a polynomial matching prescribed data. Their usefulness comes with assumptions: a local approximation and an exact identity are different claims, and changing the coefficient ring can change which polynomial roots exist.
Polynomial composition Created 2026-10-20 Updated 2026-11-05
For polynomials and over a common commutative ring, their composition is . It substitutes the whole polynomial for each occurrence of the indeterminate in , rather than multiplying their coefficient arrays.
Polynomial content Created 2026-09-24 Updated 2026-11-05
For a nonzero polynomial over a unique factorization domain, its content is a greatest common divisor of its coefficients, defined up to a unit. Over , choose the positive gcd. For example, has content two and primitive part . Gauss lemma for polynomials says that content is multiplicative up to units in this setting.
For a polynomial over a general commutative ring, another common convention uses the ideal generated by its coefficients as its content. This convention does not require gcds. The two descriptions agree through a principal coefficient ideal when that ideal is principal, but a unit gcd need not make the coefficient ideal the whole ring. For example, the coefficients of over have gcd one and generate the proper ideal . State the convention before using content to define a primitive polynomial.
Polynomial division Created 2026-09-24 Updated 2026-10-18
Polynomial division separates a polynomial into a multiple of a chosen divisor and a smaller polynomial remainder. Given over a field , with , there are unique polynomials satisfyingHere is the polynomial quotient. The bound concerns polynomial degree, rather than the sizes of the coefficients.[ref]
Fields and Galois Theory by James S. Milne. Fields and Galois Theory, version 5.10, Chapter 1, p. 10, §1.6: division algorithm, zero remainder alternative and uniqueness
For an original example over the rational numbers, takePolynomial long division first cancels by subtracting :Subtracting one more copy of cancels :ThusThe final polynomial remainder has polynomial degree one, below the divisor's polynomial degree two. Multiplying out the last identity checks every coefficient, including the constant term .
The polynomial degree bound makes this decomposition useful: it replaces a potentially long polynomial with a short polynomial remainder whenever multiples of can be discarded. At any root of a polynomial of , those multiples vanish under polynomial evaluation. Repeated polynomial division also drives the Euclidean algorithm for finding a greatest common divisor of polynomials.
The coefficient setting matters. Over a commutative ring, the same existence and uniqueness hold when the divisor's leading coefficient is a unit in a ring. A monic polynomial therefore works over the integers, even though they do not form a field; monic polynomial division over a ring explains why zero divisors cause no difficulty in that case.[ref]
Chapter 3 Ring theory. Abstract Algebra, Chapter 3 Ring theory, §3.9, Theorem 3.9.1: division with a unit leading coefficient
A nonzero divisor alone is insufficient over the integers. Dividing by with an integer polynomial quotient and a constant polynomial remainder would require for an integer , which is impossible. Over the rational numbers the division instead givesThe obstruction is the nonunit leading coefficient . This example separates existence from uniqueness: over an integral domain, the polynomial degree argument still makes any admissible pair unique, if it exists.
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 reduction of matrix powers 2026-10-18
By polynomial division, write with . Because is a monic polynomial, this division works even over a commutative ring. Evaluating at makes the multiple of vanish, leaving . This explains the reduction in two-coefficient reduction of matrix powers without multiplying out every intermediate matrix.
Over a field, the minimal polynomial divides and gives the strongest such universal reduction: use the polynomial remainder modulo instead. For the scalar matrix , the characteristic polynomial is , while the minimal polynomial is only . Every matrix power is then a scalar multiple of .
Polynomial remainder theorem 2026-10-18
Dividing a polynomial by leaves the constant polynomial remainder . Polynomial division makes the polynomial remainder constant because its polynomial degree must be below one; polynomial evaluation at identifies that constant. In particular, it is zero exactly when is a root of a polynomial of , which is the factor theorem.[ref]
Fields and Galois Theory by James S. Milne. Fields and Galois Theory, version 5.10, Chapter 1, p. 10, §1.7: division by X−a and evaluation of the constant remainder
In the worked example, division by leaves and division by leaves . Division by their product leaves , a polynomial remainder that stores both values at once. The argument also holds over a commutative ring for in that ring, because is a monic polynomial.
Powers of an ideal 2026-10-25
For an ideal in a commutative ring , put and let for be the product of ideals with factors equal to . It consists of finite sums of products of elements of . These ideals form a descending chain .
Every positive power has the same radical of an ideal as :One inclusion follows from . Conversely, if , then , giving the other inclusion. Different ideals can therefore define the same radical ideal, even when their successive powers are all distinct.
Primary ideal Created 2026-09-24 Updated 2026-11-05
A proper ideal of a commutative ring is primary when and imply for some positive integer . Equivalently, every zero divisor of the nonzero quotient ring is nilpotent. Its radical of an ideal is a prime ideal.
For example, is primary in when is prime and . In contrast, is not primary: , but and no power of three lies in . Requiring the ideal to be proper excludes the unit ideal, for which the elementwise implication would otherwise hold vacuously.
Primary ideals for a regular principal prime 2026-10-25
If a prime ideal is generated by a non-zero-divisor, its -primary ideals are exactly for , in any commutative ring. To prove is primary, if and , the prime ideal condition gives ; cancelling and inducting gives . Also . Conversely, for a -primary ideal , choose the least with . If , factor as far as possible with . Then , so the primary ideal condition forces , a contradiction. Thus . The powers are strictly decreasing: equality would let cancellation give . This also proves uniqueness of .
Primary submodule Created 2026-09-24 Updated 2026-11-05
Over a commutative ring , a proper submodule is primary when and imply for some positive integer . Equivalently, each scalar that kills a nonzero element of acts nilpotently on the entire quotient. Its radical annihilator is a prime ideal.
Prime-filter locale of a commutative ring 2026-10-14
For a commutative ring , this locale is presented by basic opens recording membership in a multiplicatively closed prime filter. Products give intersections. A ring map induces a locale map in the opposite direction. The basic opens satisfy exactly when , making unit-ideal calculations a substitute for choosing prime ideals.
Prime ideal Created 2026-09-24 Updated 2026-11-05
A proper ideal of a commutative ring is prime when implies or . Equivalently, the nonzero quotient ring is an integral domain. The properness condition excludes the unit ideal, which would satisfy the elementwise implication vacuously.
For a positive integer , is prime in exactly when is a prime number, while the zero ideal is also prime because is an integral domain. The ideal is not prime: the product of the classes of two and three vanishes in , although neither class is zero. Prime ideals are the points of the spectrum of a ring.
Prime ideal avoiding a multiplicative subset Created 2026-10-05 Updated 2026-11-05
In a Noetherian ring, an ideal disjoint from a nonempty multiplicative subset extends to an ideal maximal among those disjoint from , by the ascending chain condition. It is proper. If but neither factor belongs to , both and meet . Multiplying such representatives puts an element of in , a contradiction. Thus is a prime ideal. For a general commutative ring the same argument follows after applying the Zorn lemma to disjoint ideals; the union of a chain is disjoint from .
For a formal group law over any commutative ring , the invariant differential of a formal group law satisfies . Its coefficient is a unit in a ring, so . If , this means . When , the integer Bézout's identity implies , even if is a zero divisor. Put those coefficients into and the exponents divisible by into .
Primitive polynomial Created 2026-09-24 Updated 2026-11-05
For a polynomial over a unique factorization domain, primitive means that its polynomial content, in the gcd convention, is a unit. Thus its coefficients have no common nonunit divisor. For example, is primitive in , whereas has content two. Gauss lemma for polynomials makes products of primitive polynomials primitive.
This convention differs from requiring the coefficient ideal to be the unit ideal over an arbitrary commutative ring. The polynomial over the unique factorization domain is primitive in the gcd sense, although its coefficient ideal is proper. The distinction matters when transferring integer content arguments to more general coefficient 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.
Principal ideal ring 2026-10-25
A principal ideal ring is a ring whose left ideals and right ideals each have one generator. For a commutative ring, this says that every ideal is a principal ideal. The examples here use commutative rings. Unlike a principal ideal domain, it may have zero divisors: has this property, with ideals , , and . A finite direct product of rings that are principal ideal rings is again a principal ideal ring. Indeed, the coordinate idempotent elements show that every ideal is a product of coordinate ideals; a tuple of their generators generates the product.

