Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 4 1 Solution Created 2026-10-03 Updated 2026-10-14
A representation over is a homomorphism on a finite-dimensional vector space. It is irreducible if it has no nonzero proper invariant subspace, and has absolute irreducibility of a group representation if it remains irreducible after every field extension. A representation over the rational numbers is one over ; an ordinary character is the trace of a characteristic-zero representation.
A partition of an integer is a finite weakly decreasing sequence of positive integers of sum , extended by zero parts when convenient. Its Young diagram has cells in row ; its conjugate partition has cells in column . Conjugacy classes of are indexed by cycle lengths, hence by partitions of an integer. The number of ordinary irreducible characters equals the number of conjugacy classes; we now construct that many mutually distinct representations over the rational numbers.
A Young tableau of shape bijectively labels its cells by . Its tabloid remembers the set of labels in each distinguished row, not their order. The Young permutation module is the vector space on these tabloids, with acting by relabeling. Its tabloid bilinear form makes the tabloid basis orthonormal. Let be the subgroup permuting labels within each column and putThus is a polytabloid and is a Specht module. Relabeling takes to , so any polytabloid generates the module. It is nonzero over every field: the coefficient of in is one, since the row and column stabilizers of a Young tableau intersect trivially.
Here is the elementary identity behind irreducibility. If a row of a tabloid contains two entries from one column of , their transposition pairs and cancels the terms in , including in characteristic two. Otherwise, for a tabloid of the same shape, its rows can be matched to those of by a column permutation, and . Looking at the coefficient of gives, for every ,Consequently a submodule of either contains , if one of these pairings is nonzero, or lies in . This proves the James submodule theorem used below.
Over , the restricted form on is positive definite, so its Gram determinant in a rational basis is nonzero. Extending scalars to any characteristic-zero field preserves that nonzero determinant and hence keeps the restricted form a nondegenerate bilinear form. The James submodule theorem applied to a submodule of now forces it to be zero or the whole module. Therefore is absolutely irreducible, not merely irreducible over .
To distinguish shapes, the cancellation argument above works for a -tabloid too. If , its first rows contain at most entries from column , soThus dominates . The operator acts nontrivially on because the restricted form is a nondegenerate bilinear form. An isomorphism would therefore imply , and reversing the roles gives equality of the partitions of an integer. Counting conjugacy classes proves exhaustion. All matrices in a rational polytabloid basis have rational entries, giving the requested representations over the rational numbers.
For positive characteristic , call a partition of an integer a regular partition if no part is repeated or more times. DefineThe James submodule theorem shows that every proper submodule of lies in . Whenever the restricted form is nonzero, is proper and its quotient is simple.
We verify exactly when this happens. Let be the number of rows of length . In the integral pairing , common tabloids are acted on freely by permutations of equal-length rows. Such a row permutation has sign in both polytabloids, so its contribution to the product of coefficients is unchanged. Each orbit has size . Thus that integer divides every pairing. On the other hand, reverse each row of to obtain . A tabloid common to and can only interchange entries between rows of equal length. There are independent choices in each of their columns, and the two signs agree. HenceThese two products have exactly the same prime divisors. All pairings vanish modulo precisely when some . Therefore exactly for -regular .
For such a shape, the displayed pairing gives with , and has nonzero image in . If , the same operator must act nontrivially on a quotient of , forcing by the cancellation argument. Interchanging the shapes proves .
For exhaustion over an algebraic closure use the general Brauer character basis theorem: the number of simple modules over an algebraically closed field of characteristic is the number of conjugacy classes of elements of order prime to . Here these are the cycle partitions of an integer with no part divisible by . The generating-function identityshows that their number equals the number of -regular partitions of an integer. We have already constructed that many distinct simple modules, so they exhaust all simples. The form, its radical and its quotient commute with field extension, and the same simplicity proof holds after every extension. The modules defined over the prime field are therefore absolutely irreducible and form a split complete list over arbitrary as well. In summary,For characteristic zero the list is instead all . In positive characteristic a Specht module itself need not be irreducible; the radical quotient is essential.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 4 2 Solution Created 2026-10-03 Updated 2026-10-14
A standard Young tableau is a filling by , each used once, increasing along rows and down columns. A semistandard Young tableau is a filling by positive integers, weakly increasing along rows and strictly increasing down columns. Its content means that the entry occurs times. The Kostka number counts semistandard tableaux of shape and content . The dominance order on partitions isStrict dominance adds . The Young permutation module is .
Let be a composition factor of . It occurs as a submodule of some quotient , so its defining surjection gives a nonzero map . With the row reversal from Question 1, , , and the cyclic generator cannot have zero image under . Therefore acts nontrivially on , and hence on . The column-cancellation argument proves .
When , the identity shows more: the image of every nonzero map is . In a composition series of , a factor isomorphic to can thus occur only at the step where first becomes contained in the series term. Once contained, every later such map would have zero image. Since the quotient of the submodule certainly occurs when is regular, it occurs exactly once. If is not regular, no simple is indexed by . Consequently every other factor has a strictly dominating regular label. The same conclusion holds for ; when regular, its radical quotient supplies the unique factor.
The integral standard-basis theorem says that the standard polytabloids form a basis over every field. Thus is independent of characteristic. In the decomposition matrix, rows are indexed by all ordinary shapes and columns by regular shapes :Ordering shapes by a common linear extension of dominance gives a rectangular triangular matrix, whose regular-row square submatrix is unitriangular. The standard basis also gives .
Young's rule states that has a Specht filtration with copies of . In characteristic zero this is a direct-sum decomposition into irreducibles. In positive characteristic these are Specht factors, not simple factors; ratherFor content and shape , entries at most must lie in the first rows, because columns strictly increase. Their number is exactly the size of those rows, so successive rows must be filled by their row number. Hence . A one-row shape has a unique weakly increasing arrangement of any prescribed content, so . Content uses every label once, making semistandard and standard conditions identical, so .
For content only the entries are available; strict columns allow at most two rows. In shape every bottom entry is and every entry above it is . The remaining top row is uniquely fixed by the content, and such a filling exists exactly for when . Young's rule therefore giveswhere multiplication denotes induction from the indicated Young subgroup, not pointwise multiplication of characters of the same group. The dimension of this permutation module is . Subtracting the analogous identity with yieldswith for . This dimension holds over every field.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 4 4 Solution Created 2026-10-03 Updated 2026-10-14
Use the pair of partitions for a generalized Specht module convention appropriate to generalized Specht modules. Put and . Here is a sequence of nonnegative row lengths of total , and is a proper partition of an integer satisfying and . The row-length sequence is allowed to be a composition; it need not decrease. The first cells of row are marked. This construction is not an arbitrary pair of unrelated partitions of an integer and is not simply a skew diagram .
A word has type if it contains occurrences of . Read it from left to right. Every occurrence of is good; an occurrence of is good exactly when there have so far been more good occurrences of than good occurrences of . Otherwise it is bad. DefineThus is the set of all words of type , and consists of lattice words when is a proper partition of an integer. Marking the whole first row makes no difference because every is good.
For a Young tableau with row lengths , let permute labels within each column of its marked subdiagram, fixing all unmarked labels. Its generalized polytabloid and generalized Specht module areIn particular and . The Young tableau shape in this definition must be the row sequence .
We give the filtration argument, keeping its combinatorial and module-theoretic steps separate. Normalize , and if choose the first row with . Then . Define if ; otherwise the add branch is empty. Define by moving the unmarked tail of row into row :with other row lengths unchanged. Re-normalize the first marked row if necessary. The Basic Combinatorial Theorem supplies the counting and formal-character recursionsAt a terminal pair the formal term is . Thus the second recursion specifies the Specht multiplicities by the terminal leaves, with repeated leaves counted separately.
Define an equivariant map by summing, on each tabloid, over all choices of the labels retained in row , moving the remaining labels to row . Column cancellation givesFor the first identity, terms that put two marked labels of one column in the raised row cancel in pairs; the surviving marked antisymmetrizer is the one for the raised pair, and every target generator has a preimage. For the second, the extra marked cell makes such a collision unavoidable, so the sum vanishes. Also antisymmetrizing the extra cell expresses its generator as a sum of old generators, proving containment in .
There is a characteristic-independent lower bound . Given a word in , place the label in its letter's row: good occurrences fill that row from the left and bad occurrences fill it from the right. The marked cells form increasing column chains because each good has an earlier unmatched good . Its generalized polytabloid has the original row-assignment tabloid with coefficient one; every other term changes an earlier member of a marked chain. Ordering these row assignments gives a triangular coefficient matrix. The resulting vectors are independent over every field.
Start with , where equality holds because the tabloid basis is indexed by all words of type . Any pair is reached from such a pair by a sequence of add and raise operations: reverse a raise by splitting a raised tail, and reverse an add by unmarking a cell; row by row these recover an entirely unmarked composition. Suppose equality holds at a pair. The map and kernel containment above giveEvery inequality is therefore equality. In particular the containment is the whole kernel, andis exact. The process terminates because each add marks an extra cell and each raise decreases the total row index of unmarked cells. Induction from the terminal Specht modules, splicing their filtrations through these exact sequences, proves a Specht series with factors precisely . No splitting of these sequences in positive characteristic is asserted.
Applying the same marking, raising and straightening procedure to the two sets of column antisymmetrizers in , where , , leaves the cells of fixed and records the added cells by their row labels from . The column relations require strict increase down columns, the row relations weak increase along rows, and the good-letter matching in a tableau word test requires a lattice word. Thus the surviving terminal multiplicity is the number of Semistandard Young tableaux of skew shape of shape and content whose word, read right-to-left along successive rows from top to bottom, has at least as many 's as 's in every prefix. The same triangular leading-tabloid argument identifies each quotient with . Consequently the Littlewood–Richardson rule isIt describes ordinary irreducible constituents in characteristic zero and Specht filtration factors over arbitrary .
For induction by one letter, content permits exactly one added cell and each multiplicity is one. A Specht series for the requested induced module has successive quotients, ordered by addable nodes from bottom to top,Equivalently there is with these four quotients in order. Their dimensions sum to , the dimension of the induced module.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 4 6 Solution Created 2026-10-03 Updated 2026-10-14
For a cell in the Young diagram of , its hook of a Young diagram consists of that cell, the cells to its right in row and the cells below it in column . Its length isA removable rim hook is a connected border strip containing no square, whose removal leaves a Young diagram. Its leg length is the number of rows it meets minus one. The hook graph is the Young diagram labeled at each cell by ; here “graph” means this labeled array, not a graph of possible hook-walk moves.
Choose , pad with zeros and form the beta numbersThey are distinct nonnegative integers in decreasing order and recover . For they equal the first-column hook lengths, since . If is increased, old beta numbers shift upward by one and a new bead at zero is inserted.
For a prime-modulus partition abacus arrange the nonnegative positions in runners: position lies at level on runner , . Put beads at the beta numbers and leave the other positions empty. Replacing a bead at by a bead at a vacant removes a rim hook of length ; its leg length is the number of beads strictly between these positions. This follows by tracing the boundary of the diagram: bead positions record vertical steps and gaps record horizontal steps, and exchanging one bead and gap removes the intervening border strip. In particular a removable -hook is exactly a bead that can slide up one place on its own runner.
The partition core at modulus is the result of sliding beads up until there are no gaps above any bead on a runner. If runner initially has beads, its final occupied levels must be , independently of slide order. Thus its packed beta set, and hence its core partition of an integer, is unique. Increasing the number of beta numbers merely re-expresses the same boundary by shifting positions and adding the new initial bead; the packed configuration represents the same partition of an integer. This proves well-definedness both with respect to removal order and to the chosen padding. The number of slides isThe partition quotient components record how far each runner's beads lie above their packed positions, giving the hook-removal interpretation used in Question 5.
A block of a group algebra in characteristic for is a two-sided ideal for a primitive central idempotent , meaning a nonzero central idempotent that is not a sum of two nonzero orthogonal central idempotents. The identity is the sum of these block idempotents and the group algebra is their direct product. An indecomposable module belongs to when , equivalently every other block idempotent acts as zero. Indeed ; indecomposability makes exactly one summand nonzero.
The Nakayama block theorem, historically called the Nakayama Conjecture, statesEquivalently the ordinary characters assigned to one modular block have a common partition core at modulus . Its simple modules are the with regular having that core. Only cores for which is a nonnegative multiple of occur. The block weight is ; a core alone determines the block at this fixed degree.
One route to the proof separates the combinatorial core invariant from the algebraic center invariant. Let be the number of cells of residue . A length- rim hook has one cell of every residue: along its border strip the contents are consecutive integers. Therefore removal subtracts one from every . More precisely, choose the number of beta numbers divisible by and write the runner charges as . Reading the boundary, or adding a cell and checking its two changed beta positions, givesThe charges determine the packed runners and hence the core. For fixed , two equal cores have the same weight, so their full residue multisets are equal. Conversely equal residue multisets give equal charges and the same core. This establishesfor partitions of an integer of the same integer. The fixed-degree condition matters.
For the center invariant, use the commuting Jucys–Murphy elements , with . In the Young seminormal form basis, has eigenvalue equal to the content of the cell containing . A symmetric polynomial in them therefore acts on as the same scalar for every Young tableau: its value on the multiset of all contents of . The integral Specht lattice makes this a scalar identity before modular reduction, so modulo these central scalars depend only on the residue multiset, and every composition factor inherits them.
The substantive center theorem used in this proof is that the center of the symmetric-group algebra, integrally and over a field, consists of symmetric polynomials in the Jucys–Murphy elements. Centrality of elementary symmetric polynomials follows fromthe coefficients are central class-sum combinations. The reverse inclusion requires the integral triangular class-sum argument: expand symmetric monomials in the as products of transpositions, group the leading terms by reduced cycle type, and eliminate these leading class sums in the resulting unitriangular order. The integral coefficients, with no division by multiples of , are crucial; knowing the center only over would not prove the modular assertion. This is the central algebraic ingredient of this proof route.
Thus equal residue multisets yield equal characters of the entire modular center. Different residue multisets are separated already by the coefficients of the central polynomial : its scalar on the shape reduces to , whose unique factorization records the multiplicities exactly, even in characteristic . In a finite-dimensional split algebra, two simple modules are in the same block exactly when their central characters agree: the center of each block is local, while different block idempotents separate different blocks. It follows that equal cores give one block and different cores give distinct blocks. This proves both directions rather than just observing that core is constant on known blocks.
Finally, each ordinary Specht lattice has a single reduced central character, so all constituents of its reduction lie in that one block. Question 1 supplies every simple module and its label; the regular labels therefore identify all the simples in each core block. The constructions use integer coefficients and absolutely irreducible prime-field modules, so the block description descends to the arbitrary characteristic- field in the question. This completes the main steps of the block proof without presupposing semisimplicity in positive characteristic.
Past exam of the mathematics course of the University of Cambridge 2006 ii Paper 2 18H Solution Created 2026-09-24 Updated 2026-10-14
Begin with two points at distance one. A ruler draws the line through two known points; a compass draws a circle with a known centre and a constructible radius. New points are intersections of such lines and circles. A real number is constructible when it occurs as a coordinate of a point obtained by finitely many such operations; a complex point is constructible when both coordinates are.
If current coordinates lie in a field , a line-line intersection solves linear equations over , while line-circle or circle-circle intersections reduce to a quadratic equation over . Thus each step requires at most adjoining a square root. Consequently every constructible number lies in a towerConversely field sums and differences are obtained by laying off segments, products and quotients by similar triangles, and a positive square root by the geometric-mean construction in a semicircle. Hence every real number in such a tower is constructible. This proves the quadratic-tower criterion, not merely its necessity.
In particular a constructible algebraic number has degree a power of two. Degree alone is not sufficient in general; the exact criterion is containment in a quadratic tower. Equivalently the Galois group of its normal closure is a finite two-group: a tower's normal closure remains a two-extension, and a two-group admits a chain of subgroups with successive index two, yielding the converse by Galois correspondence.
The standard impossibility results follow. Doubling a unit-volume cube requires , whose polynomial is irreducible by Eisenstein and has degree three. Trisecting an arbitrary angle would in particular trisect degrees, requiring , a root of . This cubic has no rational root and is irreducible, so this construction is impossible, although some particular angles can be trisected. Squaring the unit circle requires side length , impossible because is transcendental whereas constructible numbers are algebraic.
For a regular -gon, constructibility is equivalent to that of . The cyclotomic extension is Galois of degree , so it is constructible exactly when this degree is a power of two. Writing the prime factorization of shows the equivalent conditionIndeed odd prime exponents must be one, and each must be a power of two. If is prime, must itself be a power of two by factoring when has an odd divisor. Conversely this factorization makes the cyclotomic Galois group a two-group and provides a quadratic tower. This gives both positive constructions, such as the regular seventeen-gon, and obstructions, such as the regular seven-gon.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 1 10G iii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 1 10G ii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 2 11G i Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 3 10G ii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 23 1 Solution Created 2026-10-03 Updated 2026-10-14
Use the quotient convention for projective space. To a scheme , associate the set of pairswhere is a line bundle, modulo isomorphisms carrying to . Pullback defines the contravariant functor. On , this means rank-one projective module quotients of ; the quotient need not be free. Thus merely listing generating tuples modulo multiplication by a unit would omit points over rings with nontrivial Picard group.
This functor is represented by . For each , the locus where generates is open. These loci cover , since a surjection onto a rank-one free stalk must have some coefficient a unit in its local ring. On this locus, trivialize by and writeThese functions specify a map to the standard chart . Their transition rules are exactly those of projective space, so the chart maps glue. Conversely the universal quotient on projective space pulls back to the given pair, and the construction is natural and unique. This proves that projective space represents invertible quotients.
Write its universal exact sequence asA first-order change of the quotient, with target trivialized locally, is a map . Changing the target trivialization by changes by . Restriction to removes this ambiguity, and every local map extends because the displayed sequence splits locally. Consequently the tangent sheaf of a scheme isThis identification can also be seen on : the first-order change of is after setting . Thus these maps are precisely the coordinate tangent directions.
Apply to the universal sequence. Since its terms are locally free and it splits locally, this gives the Euler sequenceIt remains exact after any base change. Taking its dual of a sheaf over a field givesFor , the first term has rank one; taking determinants yieldsExplicitly, for on the overlap of the two affine charts, , the same transition as after changing one local frame's sign.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 23 3 Solution Created 2026-10-03 Updated 2026-10-14
We prove the Birkhoff–Grothendieck theorem by induction on the rank of the vector bundle . Rank zero is immediate; rank one is the classification established above.
First there is a largest integer with . To see existence and boundedness directly, trivialize on the two standard affine charts: the associated finite projective modules over the principal ideal domains and are free. Let be its transition matrix, so a section of is a pair satisfyingIf exceeds the largest exponent in any entry of , the right side has only strictly negative powers; the left side has nonnegative powers. Hence both vanish. For sufficiently negative, take a nonzero constant vector and put ; all its exponents are nonpositive, so it supplies a nonzero section. Thus a largest exists.
Such a section gives a nonzero map . It is injective, since it is nonzero generically and the source is torsion-free. Saturate its image. The resulting line subbundle is for the degree of the effective divisor of zeros of the original map. If , its inclusion in would give a nonzero section of , contradicting maximality. Therefore andhas a locally free quotient. By induction, .
Twist this exact sequence by . The outer groups and are zero by the Čech cohomology of twists on the projective line. The long exact sequence in sheaf cohomology therefore givesThe first is zero by the choice of , so each vanishes. Thus for every . The extension class lies insince . The identification of this Ext functor with cohomology can be seen without additional duality: local splittings of a vector-bundle extension differ by a Čech cocycle in , and a coboundary changes them to compatible splittings. Vanishing therefore gives a global splitting. Consequentlycompleting the induction over any field .
The degrees can be arranged in nonincreasing order and their multiset is unique. Indeed, for any such decomposition,so the dimensions of the twisted global sections recover the number of summands of every degree.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 23 4 Solution Created 2026-10-03 Updated 2026-10-14
Write . A dualizing sheaf on a smooth projective curve, for the vector bundles in this question, consists of a line bundle and a trace making evaluation induce natural perfect pairingsIn particular it represents the functor through . We construct it by reducing to the proved residue duality on the projective line.
Choose a separating nonconstant rational function on . Such a choice exists over any field : the function field of a smooth algebraic curve is separably generated of transcendence degree one, and a choice with makes its finite extension of separable. The map extends across poles using in the discrete valuation ring at each point. It gives a finite generically separable morphismIndeed it is nonconstant, hence has finite fibres, and is proper; a proper quasi-finite morphism is finite. This finite map is flat: locally its direct-image module is finite and torsion-free over a discrete valuation ring, and hence free. The same argument works componentwise if needed.
For an affine chart with inverse image , form the -moduleThese modules glue to the relative trace-dual sheaf on . There are two algebraic identities used here. First, finite-map adjunction givesThe forward map evaluates at ; the inverse sends to . Second, the different–differential identity for a finite generically separable map between smooth curves givesTo explain its algebraic content, the field trace identifies with the inverse different ideal, while the different is the vanishing ideal of . These identities include wild ramification; one must not replace the different by just ramification index minus one. This is the identity allowed to be quoted in the question; the finite-map description is recorded in Stacks Project, finite morphisms, and its differential form in Stacks Project, Section 53.12.
Set . The second identity shows it is a line bundle and already identifies it with . For a vector bundle , the first identity gives the sheaf isomorphismThe sheaf is locally free: on an affine chart, the projective -module defining is a summand of , and is finite free over . Since is finite, affine-cover Čech cohomology identifies with for each of these sheaves. Apply the already established duality on to . It givesThe trace is obtained by evaluating the trace-dual module at and then using the trace . The adjunction formulas show the displayed isomorphisms are induced by evaluation against this trace and are natural in . They thus establish the requested dualizing property, not merely the existence of an invertible differential sheaf. Uniqueness follows from the Yoneda lemma applied to the representing functor on vector bundles.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 23 5 Solution Created 2026-10-03 Updated 2026-10-14
Use the finite map from the preceding solution. The inverse images of the two standard affine charts and of their intersection are affine, because is finite. The vanishing of quasi-coherent cohomology on an affine scheme therefore lets their two-term Čech cochain complex compute . It has terms only in degrees zero and one, provingThis actually applies to every quasi-coherent sheaf on .
For a smooth projective curve with , define its genus of a smooth projective curve byThe preceding Serre duality also gives . The condition on constants holds in particular for a geometrically connected smooth projective curve. It makes equal to the arithmetic genus . We state the theorem with this usual convention and then give the formula valid without that condition.
For a divisor on an algebraic curve and a canonical divisor with , the Riemann-Roch theorem isThe degree over an arbitrary field is weighted by residue degrees: when . Equivalently, for a line bundle ,We now prove it via Riemann-Roch via elementary modifications.
For any closed point and any line bundle , the exact sequencehas a skyscraper sheaf as its quotient, with -dimension . This follows locally from a uniformizer of the discrete valuation ring at : a local line-bundle generator modulo that uniformizer spans one copy of . The quotient has zero higher cohomology, as it is the direct image from a finite affine scheme. The long exact sequence in sheaf cohomology and the proved higher vanishing giveEvery line bundle has a nonzero rational section of a line bundle, whose local orders give a divisor on an algebraic curve with . Iterating the displayed identity, adding or subtracting closed points with their multiplicities, givesFor the constants convention above, . The dualizing sheaf on a smooth projective curve gives , which converts this Euler-characteristic identity into the stated Riemann-Roch theorem. This proves the formula over arbitrary , without assuming the closed points are -rational.
For vector bundles, the corresponding formula isTo see it, saturate a rational rank-one subspace to a line subbundle and induct on rank. Both Euler characteristic of a coherent sheaf and the degree of the determinant are additive in the resulting short exact sequence. The line-bundle formula just proved starts the induction.
Taking and using duality gives , , and hence . In particular a line bundle of degree greater than has zero first cohomology: its dual twisted by has negative degree, and a negative-degree line bundle has no nonzero section, since any section would have an effective divisor of zeros.
If the term “curve over ” is used without requiring , the unconditional formula we proved isWriting then replaces by . For example, viewed as a -curve for a finite separable extension has , so a literal constant term would be incorrect. Alternatively the arithmetic genus gives the formula with constant . The constants hypothesis for the usual genus is recorded in Stacks Project, genus of a curve.