Past exam of the rings and modules course of the University of Oxford 2021 1 a i Solution 2026-10-25
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 giveThe 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
Past exam of the rings and modules course of the University of Oxford 2023 1 c ii Solution 2026-10-25
Using the assumed square-free polynomial property, factorinto distinct monic polynomials that are irreducible polynomials, with . Part (b)(iii) identifies with , where .
By the first isomorphism theorem for rings, the image from part (c)(i) is , where is the kernel of a ring homomorphism. By part (a)(ii), for ideals . A field has only the zero ideal and the whole field as ideals, so each is either or the zero ring. Consequently, for a subset ,This is the quotient of a finite product of fields principle. The subset is nonempty because , whereas the zero ring has only one unit. By part (a)(i),Each factor is a positive integer. Since is a prime number, exactly one factor is and all remaining factors are one. Thusso is a Mersenne prime. If with , then would be a proper divisor of ; thus is itself a prime number, although only the displayed form is needed.
The assumed square-free polynomial property can also be checked directly: in characteristic of a ring two, the formal derivative of is because is odd. These two polynomials have greatest common divisor one, since does not divide , so no repeated irreducible polynomial factor occurs.
Past exam of the rings and modules course of the University of Oxford 2023 3 a ii Solution 2026-10-25
The nonconstant invariant factors of a linear operator satisfy . By part (a)(i), is an irreducible polynomial, so every must equal . Their polynomial degrees sum to , giving .
The companion matrix of , in the basis of , isTherefore, for each fixed even , every such has rational canonical formThere are no such matrices when is odd. This is an instance of the rational canonical form with irreducible minimal polynomial principle; equality of minimal polynomials alone does not determine rational canonical form in general.
Past exam of the rings and modules course of the University of Oxford 2023 3 a i Solution 2026-10-25
Since , its minimal polynomial divides . The polynomial is an irreducible polynomial over the rational numbers: a reducible quadratic would have a rational root, whereas for every .
Because , the constant polynomial one evaluates to the nonzero identity matrix , so . Both and are monic polynomials; hence the only remaining divisor is
For a complex reduced plane curve of degree , the number of distinct singular points is at most . For an irreducible polynomial of degree , is nonzero, since a binary homogeneous polynomial over factors into linear factors. It has no common factor with . Each singular point contributes at least two to the intersection with the polar curve , so Bézout's theorem gives .
For an irreducible curve with , one can improve this to . Place a nonsingular point at . The Euler theorem for homogeneous functions gives and , so the polar curve is nonsingular and tangent to the curve at . This consumes at least two further units of intersection multiplicity. For a reducible curve with component degrees , add the irreducible bounds and at most intersections per component pair. The sum is because .
Polynomial sieve Created 2026-10-20 Updated 2026-11-05
A polynomial sieve enumerates irreducible polynomials by marking polynomials divisible by smaller irreducible polynomials, analogously to a number-theoretic sieve. Over a finite field , there are only monic polynomials of each polynomial degree , so one can sieve all monic polynomials through a prescribed degree .
Process monic polynomials in increasing polynomial degree. Each unmarked nonconstant polynomial is irreducible; mark its monic polynomial multiples through degree . Every reducible polynomial of degree at most has an irreducible polynomial factor of degree at most , so these factors suffice. For example, over the field with two elements, the degree-one factors and mark , and . The remaining monic quadratic is irreducible. This gives small defining polynomials for constructing finite fields as quotient rings.
Primary decomposition theorem for linear maps Created 2026-10-25 Updated 2026-10-31
For a linear map on a finite-dimensional vector space over a field , factor its minimal polynomial as with distinct monic polynomials that are irreducible polynomials. ThenEach is an invariant subspace, since commutes with every polynomial in . These are canonical vector subspaces, determined by , without requiring any eigenvalues in .
For a proof, put and . The coprime polynomials admit a Bézout's identity for polynomials . Set . Its image is contained in because . The polynomial is divisible by every , hence by their product, so . On , ; on with , because divides . These facts prove the direct sum and identify as its projection operators. Finally, if the minimal polynomial of any restriction had a smaller exponent, would annihilate every summand and hence all of , a contradiction.
Primitive polynomial over a finite field Created 2026-10-14 Updated 2026-11-05
A monic polynomial of degree over 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 . All its roots are Frobenius conjugates and then have the same order . 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.
Quotient by an irreducible polynomial is a field Created 2026-10-06 Updated 2026-11-05
If is an irreducible polynomial over a field , then a nonzero residue modulo has . The Euclidean algorithm supplies , giving inverse for . Thus the quotient ring is a field. If and has elements, polynomial division supplies exactly residue classes.
For an integral generator of a number field, let and suppose is coprime to . Localizing at makes and the ring of integers equal, so reduction gives the displayed quotient ring. If with distinct monic irreducible polynomials, the Chinese remainder theorem gives local factors . Their residue fields have degrees and their maximal ideals have nilpotence indices of an ideal . Localizing the Dedekind domain at the corresponding prime ideals gives discrete valuation rings, where this same nilpotence index of an ideal is the ramification index of a prime ideal. Thus and each residue degree is .
Rational canonical form with irreducible minimal polynomial Created 2026-10-25 Updated 2026-11-05
Let act on a nonzero finite-dimensional vector space over a field , with minimal polynomial an irreducible polynomial of polynomial degree . The nonconstant invariant factors of a linear operator all divide , so each equals . Their degrees sum to the dimension of a vector space, giving and rational canonical form consisting of copies of the companion matrix . Equivalently, make the vector space a module over the field by letting act as ; a basis over this field gives the same block decomposition.
Separable algebraic element Created 2026-09-24 Updated 2026-11-05
An algebraic element over is separable when its minimal polynomial over has no repeated root in a splitting field. For an irreducible polynomial , this is equivalent to , because then .
For a linear operator on a finite-dimensional vector space over a field , all polynomial kernels stabilize at their first power exactly when its minimal polynomial has no repeated irreducible polynomial factor in . This formulation does not require those factors to be linear.
To prove it, the Bézout's identity for polynomials gives : a greatest common divisor is a combination of and , while is its multiple. If is square-free, , proving the displayed equality. Conversely, if an irreducible factor occurs to exponent , its primary decomposition theorem summand has minimal polynomial . On this summand is nonzero, while . Thus the kernels of those two powers differ. An eigenbasis follows from this criterion precisely when the distinct factors of are also linear over ; a real rotation through a right angle has square-free but no real eigenvalues.
Square-free polynomial Created 2026-10-25 Updated 2026-10-31
A nonzero polynomial over a field is square-free if no square of a nonconstant irreducible polynomial divides it. Equivalently, in its factorization of polynomials, every irreducible polynomial factor occurs with exponent one. For example, is square-free over the real numbers, whereas is not. Square-freeness over a given field concerns factors in that field; over the real numbers or complex numbers, it is equivalent to having no repeated polynomial roots after splitting over the complex numbers.