Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 4 ii Solution Created 2026-10-03 Updated 2026-10-14
In Siegel's original convention, an E-function is an entire series with coefficients in a fixed number field, satisfying a nonzero linear differential equation over , together with these arithmetic bounds: for every , all conjugates of have size , and some positive integer makes every , , an algebraic integer. A frequently used stricter convention replaces both bounds by . The original and strict growth definitions should not simply be declared equivalent; the exponential examples below satisfy the strict one.
For sums, work in the compositum of the coefficient fields. Coefficient conjugate bounds add. The product of the two common denominators clears both lists; using in each original denominator bound gives the required product bound. Finally all derivatives of lie in the sum of the two finite-dimensional derivative spaces over that rational function field, so they satisfy a nontrivial linear dependence, giving a differential equation for the sum. Thus sums are again E-functions, the addition closure of Siegel E-functions.
The Siegel–Shidlovsky theorem states that if a vector of E-functions satisfies with rational-function matrix over , then at every nonzero algebraic which is not a pole of ,In particular algebraically independent functions give algebraically independent values.
Take for algebraic numbers linearly independent over . Their coefficients are with exponential conjugate and denominator bounds, and . A polynomial relation among the functions expands into a relation among exponentials with distinct exponents and polynomial coefficients after clearing rational-function denominators; exponential-polynomial independence excludes it. At the theorem gives algebraic independence of the . For arbitrary distinct algebraic , choose a rational basis of their span and divide that basis by a common denominator. The are distinct Laurent monomials in the corresponding algebraically independent exponential values, so are linearly independent over . This recovers the general Lindemann–Weierstrass theorem. Its simplest instance uses just at nonzero algebraic .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 1 ii Solution Created 2026-10-03 Updated 2026-10-14
The commutative Laurent polynomial ring is an integral domain and is invertible. Write nonzero elements asThe largest exponent in their product is , with coefficientThere is only one pair of exponents contributing at this degree, and the coefficient cannot vanish in the integral domain . Hence . Equivalently, forces or . This is skew Laurent extensions of domains are domains, and the argument works over the original field in any characteristic.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 1 i Solution Created 2026-10-03 Updated 2026-10-14
Put , and . The multiplication of matrix-coordinate triples is . In particular is central, , and every element has the unique normal form . ConsequentlyThe distinct normal-form monomials are the group basis, so this is an isomorphism, not merely a surjection from a presented algebra. This is the integral Heisenberg group algebra as a skew Laurent ring.
Here is the needed skew Hilbert basis theorem, including its proof. If is a left Noetherian ring and an automorphism, let be a left ideal of , where . DefineThese are left ideals of : adding lifts adds the coefficient, and left multiplication by multiplies its normalized value by . Multiplication of a lift by proves . The chain stabilizes at some . Choose finite generators for each , , and lifts with coefficient .
For of degree , write its normalized leading coefficient as . Thenhas smaller degree: the displayed summands have leading coefficients . For use the generators for without the shift. Induction on degree expresses every element of in terms of the finitely many chosen lifts. Thus is a left Noetherian ring. Passing to the opposite ring replaces by and proves the corresponding right-sided result.
This proof includes the ordinary Hilbert basis theorem when is the identity. Starting with the field , it makes Noetherian; localization at powers of makes Noetherian as well. Finally, for a left ideal in , its intersection with has finitely many generators. For each , some lies in , so is generated by those same elements in the skew Laurent polynomial ring. Right multiplication clears powers for a right ideal. Therefore is a left Noetherian ring and a right Noetherian ring.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 2 Solution Created 2026-10-03 Updated 2026-10-14
Work over , or another field of characteristic zero. The Weyl algebra is generated by with commuting 's, commuting 's and . Its ordered monomial basis of a Weyl algebra consists of the monomials . One way to verify independence is to apply a finite operator relation to the formal exponential : after canceling that exponential the relation becomes a polynomial identity , so every coefficient vanishes. The relations already reorder every word into that basis.
Give both generators degree one. The Bernstein filtration isThus . Commutator terms have lower degree, accounting for the commutative symbol algebra. Since that algebra is Noetherian, leading-symbol generation followed by finite downward degree cancellation proves that is Noetherian on both sides.
A left finitely generated module has a good filtration, for example for a finite generating set of the module. More generally one allows fixed degree shifts of the generators. The associated graded module is finite over the symbol algebra. DefineThis is the characteristic variety of a Weyl algebra module for the Bernstein algebra filtration. It records where the module's leading symbols remain nonzero and makes noncommutative module growth accessible to commutative algebra.
For a fixed algebra filtration it is independent of the good filtration. Any two such filtrations differ by bounded shifts and conversely, since each finite set of generators occurs in bounded degree in the other filtration. If a degree- operator has symbol annihilating , its th power maps into . For , bounded-shift comparison forces the power of that symbol to annihilate . Reversing the argument gives equal radicals of ideals of annihilators. This is independence of characteristic support from a good module filtration. Changing the algebra filtration itself, for example to the order filtration of a Weyl algebra with the in degree zero, need not preserve the same variety; the convention matters.
The Hilbert-Serre theorem gives an eventual cumulative polynomialHere is also the Gelfand–Kirillov dimension of a module, and is an integer multiplicity of a filtered module for nonzero . Finite generation bounds .
Here is a proof sketch of the essential lower bound, rather than an appeal to its name. For a nonzero , choose a nonzero monomial of greatest total degree in its ordered expansion, say . The operations and differentiate this expansion with respect to and . Apply them and times. Lower-degree terms die, and every other monomial of the same degree also dies unless it has exactly those exponents. The result is a nonzero scalar multiple of the chosen coefficient. Characteristic zero is essential for the factorials. Expanding the repeated commutators therefore givesChoose . If acted as zero on all , every would vanish, contrary to . Hence the linear action mapis injective. It follows that . Comparing polynomial degrees gives . ThusThis proves Bernstein inequality for Weyl algebra modules through the faithful finite-step action of a Weyl algebra.
The bound is sharp. The polynomial representation has the zero section as its characteristic variety of a Weyl algebra module, namely and dimension . It is a simple module: differentiate a nonzero polynomial sufficiently to obtain a nonzero constant, then multiply by the to generate the whole module. The module similarly has characteristic variety of a Weyl algebra module , a fiber of the cotangent bundle. A nonzero free module has the whole cotangent bundle and dimension . No nonzero finite-dimensional module exists for , also seen by taking the trace of .
Modules attaining dimension are holonomic Weyl algebra modules (with the zero module included conventionally). Every nonzero subquotient remains of dimension by the lower bound and monotonicity of growth. Compatible filtrations in a short exact sequence make the leading multiplicity of a filtered module additive. Since each nonzero factor has positive integer multiplicity of a filtered module, the number of factors in any strict submodule chain is bounded by . Together with Noetherianity, this proves finite composition length. It illustrates why characteristic variety of a Weyl algebra module and multiplicity of a filtered module provide useful structure beyond a list of presentations. In positive characteristic there are finite-dimensional Weyl modules, so the characteristic-zero inequality and this discussion must not be asserted without its field hypothesis.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 3 i Solution Created 2026-10-03 Updated 2026-10-14
Whenever the graded pieces are finitely generated over , define the Poincare series of a graded module byAdditivity means for every short exact sequence in the indicated category. Dimension over a field is a basic example; length is another when the modules have finite length.
The Hilbert-Serre theorem needs finite-generation hypotheses: take commutative Noetherian and generated over it by homogeneous of positive degrees . For finitely generated graded , every is then finite over , andIf negative grading indices are allowed for the module, the numerator is a Laurent polynomial instead. In standard degree one, the coefficients are eventually polynomial functions of the index.
To prove this, regard as finite over the surjective polynomial presentation . Induct on . At only finitely many homogeneous generator degrees occur, so the series is a polynomial. For the last variable of degree , put and . The polynomial ring is Noetherian by the Hilbert basis theorem, hence is finite; both and are finite modules over the ring with that variable removed. The degree- exact sequence isAdditivity, followed by summing over , givesThe induction hypothesis supplies the remaining denominator factors. This proves Hilbert-Serre theorem for an additive coefficient function. If all , expanding proves eventual polynomial coefficients directly.
An arbitrary positively graded ring in the introductory wording is not enough by itself. For example with every variable of degree one and is a cyclic graded module, but is not finite-dimensional over , so the dimension-valued series is not even defined. The theorem above states the standard hypotheses that make the requested definition and rationality valid.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 3 5 b Solution Created 2026-10-03 Updated 2026-10-14
For distinct coordinates , let , where is the matrix unit. For this is a transvection: it fixes the hyperplane with th coordinate zero pointwise, has determinant one and inverse . We show these elementary transvection matrices generate over any field.
Let . Row addition is left multiplication by an . If the current diagonal pivot is zero, a nonzero entry occurs below it in the same remaining column, since the remaining square block is invertible; adding that row makes the pivot nonzero. Row additions then clear the entries below the pivot. Repeating produces an upper-triangular matrix with nonzero diagonal. Clearing the entries above the diagonal, starting from the last column, gives a diagonal matrix with . Thus it remains to realize determinant-one diagonal matrices using elementary transvections.
In a two-coordinate block putDirect multiplication givesThe diagonal matrix is the product, for , of these blocks on coordinates , with entries . Their final th entry is . Therefore , and hence , is a product of elementary transvections. All row operations used are invertible transvections, and no division except by a nonzero pivot or has been made. This provesThe identity element can be omitted from the generating set. This is transvections generate the special linear group; ordinary row scaling alone would not prove it, because such a scaling can leave .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 3 5 c Solution Created 2026-10-03 Updated 2026-10-14
Let and let act on its one-dimensional subspaces. First identify the kernel of a group homomorphism in . A matrix fixing every coordinate line is diagonal, and fixing every line forces all diagonal entries equal. Thus the projective kernel of a group homomorphism is . These scalars are central. Conversely a central matrix commutes with all : comparing entries in shows all off-diagonal entries of vanish and all diagonal entries agree. Therefore the kernel of a group homomorphism is exactly . This proves scalar kernel of the projective linear action and faithfulness of the induced -action.
The action is doubly transitive. Given two ordered pairs of distinct lines, choose two independent representatives of each pair and extend them to bases. A linear map taking the first basis to the second sends the desired lines correctly. If its determinant is , postcompose with a diagonal map in the target basis that scales its first basis vector by and fixes all the others. It preserves the two target lines and corrects the determinant. Thus an element of sends either ordered pair to the other. Double transitivity implies primitivity: a block containing two distinct points must contain every point by the transitive point-stabilizer action.
For , considerProducts add the functionals, so is abelian. If fixes , write . Then , and the new functional still vanishes on . Thus the image of in is normal in the point stabilizer. Its conjugates contain all elementary transvections: changing the center line to gives every map with , including . Part (b) then shows that those conjugates generate .
It remains to prove perfectness, not assume it. Use . For , distinct giveEvery generator is therefore a group commutator, so . For and , choose with , possible because a quadratic polynomial has at most two roots. With ,Both coefficients are nonzero, so every upper and lower elementary transvection is again a group commutator. Part (b) proves perfectness in this case as well. Quotients of perfect groups are perfect, hence in exactly the stated range.
Apply part (a) to the faithful primitive -action and its abelian normal point-stabilizer subgroup . Every nontrivial normal subgroup contains , so it is the whole group. A transvection is not scalar, showing . We have provedThe proof works for infinite fields too and uses no finite-order count. The excluded two-dimensional fields give the familiar soluble exceptions and .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 4 1 Solution Created 2026-10-03 Updated 2026-10-14
Let be a finite affine open cover of the projective scheme . For a coherent sheaf , form the Čech cochain complexThe two ways to omit any pair of indices have opposite signs, giving . Its cohomology groups areA projective scheme over a field is a separated scheme. Finite intersections of its affine opens are affine, and a coherent sheaf is quasi-coherent. Higher sheaf cohomology of a quasi-coherent sheaf on an affine scheme vanishes. Thus this is an acyclic cover and the acyclic cover theorem identifies the displayed Čech cohomology with . In particular its degree-zero kernel glues compatible local sections to . A cover by opens also gives vanishing for .
For the cohomology of twists on projective space, take with the usual grading and . On an intersection indexed by the nonempty set ,This follows directly from the construction of the twisting sheaf on projective space: sections of the twist are the degree- homogeneous fractions in the corresponding localization. The Čech differential preserves each Laurent monomial , where and . Such a monomial appears precisely in summands withThe complex therefore decomposes as the direct sum of finite-dimensional cochain complexes indexed by these exponent vectors. Their differentials have only the alternating signs of the simplex incidence maps.
If , this is the ordinary unaugmented simplex cochain complex: its degree-zero kernel consists of the common value on every vertex and has dimension one, while all higher cohomology vanishes. If , choose . A cochain homotopy inserting into the ordered index list, with the sign of that insertion, contracts this subcomplex. Insertion or deletion of preserves the condition ; in , terms inserting and deleting different vertices cancel in pairs, while the term inserting then deleting is the identity. Thus this entire monomial subcomplex is acyclic. Finally, if all , the monomial occurs only in the full intersection, in degree , and contributes one copy of there.
For , these three cases give the complete answer:In the first case counting nonnegative exponent vectors gives . In the top case write with ; then , givingThis is the Laurent-monomial description of top cohomology on projective space. All intermediate degrees vanish for every twist, and the top degree vanishes when . If , then and every twist is trivial, so for every integer , with all higher groups zero.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 4 2 Solution Created 2026-10-03 Updated 2026-10-14
Use homogeneous coordinates . Multiplication by these degree-one sections defines the sheaf morphismOn , write , with , and let be the standard vector in component using the local line bundle frame of . Then , so is surjective since . Its kernel is a locally free sheaf with basisIndeed any vector in the kernel is uniquely a sum of these vectors, by solving for its -th component.
The Kähler differential sheaf has basis on , since this chart is a polynomial affine scheme. Define the local map . To check that these isomorphisms glue, on put and . ThenThe twisting sheaf on projective space frame changes by , henceFor , use , and ; the same formula applies. Thus the differential and kernel frames have identical transition matrices. We obtain the cotangent form of the Euler sequence:This construction works over any field, including positive characteristic.
The Kähler differential sheaf has rank . Taking determinant line bundles in this locally split short exact sequence of sheaves givesThe left side is the tensor product of copies of , and . ConsequentlyIt is the canonical bundle of projective space. The determinant identity can also be seen directly by taking the wedge of the kernel basis followed by a lift of the quotient basis; changing that lift by a kernel vector leaves the wedge unchanged.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 11 1 i Solution Created 2026-10-03 Updated 2026-10-14
Use the pair-design convention: each pair of distinct points must lie in exactly one Steiner block of size . With this convention the printed endpoint is false for every , since a singleton contains no pair. Thus the intended assertion requires . For , take all pairs as Steiner blocks for any . We now give a finite-field construction for every fixed , without assuming the desired design-existence theorem.
Put and take an odd prime power . By cyclicity of , it has a subgroup of index ; its order is even, so . We will find a -set such that its unordered pair differences occupy the distinct cyclotomic classes of a finite field modulo . The following argument supplies that set for every sufficiently large compatible .
First establish the required two-class intersection estimate by elementary character sums. Let be a multiplicative character of a finite field of order , with for a generator . Extend every power , including the trivial character, by zero at zero. For ,For a nontrivial additive character of and a nontrivial multiplicative character , its Gauss sum of a finite-field character satisfiesHere the inner sum equals for and otherwise, by additive-character orthogonality; multiplicative-character orthogonality gives the last equality. Such a nontrivial additive character exists by identifying the additive group with a vector space over its prime field and choosing a nonzero linear functional into that prime field.
If are nontrivial, substituting , in the product of their Gauss sums provesThe terms with sum to zero because is nontrivial. Hence . If exactly one character is trivial, subtracting the excluded zero and one terms gives absolute value one. If both are nontrivial but their product is trivial, the substitution gives , again of absolute value one. If both are trivial, the sum is . Expanding the two cyclotomic indicators and scaling a nonzero translate to one therefore gives, uniformly in and ,All constants depend only on the fixed .
To extend a prescribed difference pattern on coordinates, fix desired classes for the new differences and setAverage over all tuples, allowing repeated coordinates just for this average. With , counting choices for each independently givesFor the second moment, sum over the two potential extensions . The terms contribute . For , the choices of number each, by the preceding intersection estimate. ThusThe Chebyshev inequality shows that the proportion of tuples with is . Inductively, any fixed compatible difference pattern on distinct coordinates is realized by at least tuples, with independent of sufficiently large . The assertion starts with . Almost all tuples are outside the exceptional set, so at least half the realizing tuples have at least extensions. Each extension is distinct from the old coordinates because its differences belong to nonzero classes. This proves the assertion for . This cyclotomic pattern extension by a second-moment bound avoids the false assumption that every partial choice can be extended.
Prescribe a different one of the cosets to each pair , . Since , changing an orientation does not change its coset, so the prescriptions are compatible. The preceding induction supplies .
Choose containing one element from each pair . Form the Steiner blocksFor two distinct points , their difference identifies exactly one unordered pair of having the same -coset. Exactly one of and its negative lies in . Choose the orientation of that pair making , and then set . This yields , . Both the oriented base pair and are unique, so precisely one Steiner block contains the pair. In particular different Steiner block parameters cannot produce repeated Steiner blocks. Equivalently, the Steiner blocks form a difference family for a Steiner 2-design, and translation gives the cyclotomic construction of a Steiner 2-design.
There are infinitely many suitable field orders: choose one odd prime not dividing , and take for integers . Euler's congruence gives , and these orders become arbitrarily large. ConsequentlyThe qualification at is necessary for the standard pair-design definition.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 11 3 Solution 2026-10-14
The coefficient form of the Combinatorial Nullstellensatz is as follows. Let be a field, let have total degree at most , and suppose the coefficient of is nonzero. For finite subsets with , there is a point of where is nonzero.
For completeness, restrict to . The coefficient identity isBy Lagrange interpolation, the one-variable weighted sum on the right kills powers below and equals one on the power . Any monomial of total degree at most , other than the specified one, has some exponent below and therefore contributes zero; the specified monomial contributes its coefficient. Every denominator is nonzero in the field. Hence a nonzero coefficient forces a nonzero grid value. The two applications below use this coefficient form.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 17 4 Solution Created 2026-10-03 Updated 2026-10-14
Use finitely generated right projective modules throughout. The group K0 of a ring is the Grothendieck group of their direct-sum monoid, with . The group K1 of a ring is , equivalently the abelianization of the stable general linear group. Stabilization is ; is generated by elementary transvections. The stable elementary subgroup is the commutator subgroup: elementary transvections are commutators using a third index, and stable block interchange and elementary row identities make the quotient abelian.
Write for the lower-right ring, printed as in the source. A Milnor square has unital commuting maps, is a pullbackand has at least one of surjective. Interchange the two sides if necessary so that is surjective.
We first establish the patching fact used in the proof. For projective and an isomorphism , setFor free modules denote the result by . The block matrix identityexpresses as elementary matrices. Their entries lift through , and their elementary lifts remain invertible. A change of basis on the first side then trivializes this gluing. Thus , proving that is finitely generated projective. Notice that we lifted elementary matrices, not arbitrary invertible matrices.
For general , choose and . The reductions of and are isomorphic: insert the common reduced and reorder the two complements. Patch them by such an isomorphism. The sum with now patches two free modules of equal size, so is projective by the free case, making each summand projective. The same free change of basis followed by these direct-summand projections shows that extension to recovers . Conversely, write an -projective as the image of an idempotent over a finite free module. Since matrices over the pullback are compatible pairs of matrices, applying the compatible idempotents to the free pullback reconstructs this projective from its two reductions. Compatible module isomorphisms patch as well. This proves Milnor patching of projective modules in the form needed below.
The diagonal maps in the sequence are extension of scalars; the two maps to are differences . Define the connecting map byIt is unchanged by stabilization or elementary multiplication: an elementary factor lifts through and changes a free basis in the gluing. The identity and the preceding elementary factorization show after matching sizes. Thus is an additive homomorphism on .
Exactness at . If the two reduced classes agree, choose stabilized representatives of the same size. Their reductions differ by an elementary matrix over . Lift to an elementary matrix over and adjust without changing its class. Its reduction now equals that of . The compatible pair and its compatible inverse give an invertible matrix over , so the original pair of classes is in the diagonal image. The reverse containment follows from commutativity of the square.
Exactness at . A gluing obtained from a change of basis over either upper ring patches a free module, so the difference-map image is killed by . Conversely, means that becomes free after adding a common projective summand. Add a complement of that summand to obtain an actual isomorphism . Its two local bases express . Therefore , which lies in the image of the difference map. This uses stable equality of projective classes, not cancellation of arbitrary projectives.
Exactness at . Connecting classes reduce to zero on both sides. Conversely, write a class in the kernel as by adding a complement to its negative projective term. Its reductions have the same classes as . Equality in becomes an isomorphism after a finite common free summand, by taking a complement to the auxiliary projective. Use one sufficiently large free summand on both sides. The stabilized is then locally free with gluing , so the original class is .
Exactness at . Write a kernel pair as , using complements and padding to make the free sizes equal. Their reduced positive classes agree. Adding a common finite free summand makes those reductions isomorphic. Patch the resulting projectives, and subtract the matching free -module. Its restrictions are the desired pair. The reverse containment is immediate because both reductions to agree.
These arguments prove the Mayer-Vietoris sequence in algebraic K-theoryNo zero is inserted at either end; this fragment does not assert injectivity at the first term or surjectivity at the last.
For the group ring of the cyclic group, take the cyclotomic Milnor squareThe maps send the cyclic generator to and to ; the lower map sets , and the right map reduces modulo . Since , . To verify the pullback, represent an element by a polynomial of degree at most . If both evaluations vanish, it is a constant multiple of the minimal polynomial of an algebraic element , and evaluation at one forces that constant to be zero. Conversely, represent by of degree below . For a compatible integer , is divisible by ; replacing by yields the pair . The right map is surjective, so this is a Milnor square.
The hinted cyclotomic units are . If with , the geometric sum is their inverse, because . Their residues are , covering every unit of the common field. Gaussian elimination identifies with by determinant. Thus is surjective, and the connecting map vanishes.
The remaining exact sequence injects into , with image . Here , and reduction of a projective over the integral domain has dimension its rank: localize at , where the projective is free, and compare its residue-field dimension with its fraction-field dimension. Projection onto the second factor is therefore a bijection on this kernel. Hence extension along the cyclotomic evaluation givesThe essential step is reduction of cyclotomic units at the ramified prime; surjectivity of a ring map alone would not imply surjectivity on .
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 24 1 a Solution Created 2026-10-03 Updated 2026-10-14
Let be the point at infinity of the Weierstrass equation of an elliptic curve. It is the identity element for the elliptic curve group law. For an affine rational point , the inverse isIndeed, the two affine intersections with the vertical line have these ordinates, since their sum as roots of the quadratic in is . This reflection is valid for a generalized Weierstrass equation of an elliptic curve in every characteristic of a field.
For distinct , draw their line; for , draw the tangent line. Let be its third intersection with the elliptic curve, counted with intersection multiplicity. Then the sum is the reflection of the third intersection:A vertical line has third intersection , so . If a tangent has third intersection , then . Define addition with by ; these conventions include all exceptional cases of the affine construction.
The construction is defined over the coefficient field: after two known intersections, the remaining root is rational over that field. It gives a commutative group operation. To see why it is associative, use the elliptic curve group law from Riemann-Roch: the map identifies the elliptic curve with its degree-zero divisor class group. A line has intersection divisor linearly equivalent to , the divisor of the line at infinity. Thus . The geometric sum agrees with addition of divisor classes, which is associative.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 30 1 Solution Created 2026-10-03 Updated 2026-10-14
Let be distinct elements of a finite field , with . The Reed-Solomon code consists of the evaluation vectorsEvaluation is an injective linear map: a nonzero polynomial of degree at most cannot vanish at all distinct points. Thus the dimension is . The same bound on polynomial roots shows that every nonzero codeword has Hamming weight at least . Conversely, choosing any evaluation points and taking their product of linear factors gives a polynomial whose evaluation vanishes at exactly those points. Its Hamming weight is . HenceFor completeness, deleting coordinates from a linear code of minimum Hamming distance is injective on codewords, since two words with the same retained coordinates would differ in fewer than positions. Therefore , giving the Singleton bound . The Reed-Solomon code attains this bound and is a maximum distance separable code. Multiplying individual coordinates by nonzero field elements changes neither the dimension nor the Hamming weight, so the same proof applies to a generalized Reed-Solomon code.
To specify the generator polynomials of a cyclic code unambiguously, use the primitive cyclic Reed-Solomon code convention. Put , choose a primitive element of a finite field , and setExponents are taken modulo . This generator polynomial is a monic polynomial of degree dividing , so the dimension is . It agrees with the evaluation formIndeed, at a defining exponent , a monomial contributes the finite geometric series . Its exponent lies between and , so the sum vanishes: but its th power is one. Every displayed evaluation vector therefore lies in the cyclic code, and both spaces have dimension , proving equality. The narrow-sense choice is the ordinary unweighted evaluation linear code on all nonzero field elements.
The duality of primitive cyclic Reed-Solomon codes now follows directly. A vector in has coordinates , while a vector in has coordinates , with . Their dot product is . Every appearing exponent is between and , so every such finite geometric series is zero. The two spaces are orthogonal and their dimensions sum to , givingThus the full cyclic family is closed under dual codes. The offset matters: the dual code of the narrow-sense linear code generally has offset zero, rather than one.
For arbitrary evaluation points, the precise statement is closure of generalized Reed-Solomon codes under duality. If , put and . Lagrange interpolation shows whenever : this sum is the coefficient of in the interpolation formula for . Taking with and proves orthogonality of and . Comparing dimensions gives equality with . An unweighted evaluation linear code at arbitrary points need not have an unweighted evaluation dual at the same points; the multiplier form and the cyclic offset formula resolve that convention issue.
For the length-, dimension- linear code, choose and as in the field table. Then andThe field characteristic is two, and the table gives . In the basis , the four roots are represented by . Their elementary symmetric functions areThe repeated terms in cancel because the field characteristic is two. There are no alternating minus signs in this characteristic, soFor example, the coefficient vectors in ascending order are , giving the required single powers of .
For the length-, dimension- linear code over , take the table's primitive element of a finite field and again . The four roots are . Expanding in givesThusThe coefficients are reduced modulo , including the constant term .
A suitable two-error-correcting Reed-Solomon code over is precisely the first linear code:Two distinct codewords cannot both be within Hamming distance two of a received word, because the triangle inequality would put them at distance at most four. Thus this linear code corrects any two symbol errors. Its generator polynomial has four consecutive defining zeros of a cyclic code, and its dimension and exact minimum Hamming distance have already been proved.