Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 14 1 a Solution Created 2026-10-03 Updated 2026-10-14
Choose homogeneous polynomials defining the two projective plane curves. Their absence of a common irreducible component makes them coprime. For a point outside both curves, they have degrees in and nonzero constant leading coefficients. The resultantis therefore nonzero. Indeed, a vanishing resultant over would give a common factor there, and Gauss's lemma would give a common component of the original curves.
The homogeneity of makes a homogeneous polynomial of degree : scaling by scales their -roots by , and the product of the differences of roots scales by . Every point in the intersection projects from to a zero of in the projective line. Each such projection line contains only finitely many points of either curve, since it passes through outside them. Thus the intersection is finite already.
We may now choose also outside the finitely many joining lines of distinct intersection points. Projection is then injective on the intersection. A nonzero degree- homogeneous polynomial on the projective line has at most distinct zeros, so the resultant bound for intersections of plane curves givesThis derives the required cardinality bound without assuming the full intersection-multiplicity statement of Bézout's theorem.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 8 2 Solution Created 2026-10-03 Updated 2026-10-14
For genuine degrees three and two, the resultant is the Sylvester matrix determinantEquivalently, if are the roots of , counted with multiplicity, then . Thus means that the polynomials have no common root, or equivalently are coprime over . One can also see this from the matrix: its singularity gives a nonzero relation with , . If were coprime, would force , then , a contradiction. Conversely, a common factor supplies such a relation after dividing by that factor. When a leading coefficient is zero, use the resultant for the actual polynomial degrees rather than assuming the displayed fixed-degree criterion unchanged.
An algebraic addition theorem for a meromorphic function means a nonzero polynomial withidentically where the values are finite. A local relation extends meromorphically to the other regular arguments.
For a polynomial of positive degree , let be the roots of and the roots of . FormIts coefficients are separately symmetric polynomials in the two sets of roots. The Fundamental theorem of symmetric polynomials and the fixed nonzero leading coefficient of show they are polynomials in . The expression is monic of degree in , so it is nonzero. If , , one factor vanishes at . This proves the addition relation, including at exceptional multiple-root values by polynomial identity. A constant polynomial instead has the relation .
For the elliptic case, let . A nonconstant elliptic function defines a finite morphism , so the function field of is a finite algebraic extension of . The elliptic function-field decomposition expresses it as , withThe Weierstrass addition formula makes translation algebraic:Differentiating and using the cubic differential equation also makes rational in the four separate values. Therefore lies in a finite algebraic extension of . Its algebraic equation, after clearing denominators, is the required polynomial relation. This sketches why every elliptic function, not only , has an algebraic addition theorem. Constants are already covered.
For the final assertion, consider , an entire function. If is a period, then for every . The continuous exponent must be a constant integer multiple of ; its derivative forces . Hence its periods are exactly , making it a simply periodic function.
Suppose it had an algebraic addition theorem . There are only finitely many values for which is identically zero: a nonzero coefficient polynomial in already bounds this exceptional set. Choose a positive irrational with outside this set, and set . Specializing gives a nonzero polynomial and, with ,All exponents with nonzero coefficients are distinct, by irrationality of . Divide by the exponential with largest real exponent and let ; its nonzero coefficient would have to tend to zero. This contradiction proves that simple periodicity does not imply an algebraic addition theorem. It is the simply periodic entire function without an algebraic addition theorem example.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 1 ii Solution Created 2026-10-03 Updated 2026-10-14
The polynomial discriminant satisfiesA polynomial has no repeated roots over the algebraic closure exactly when it is coprime to its derivative. Consequently the assumed squarefree reduction has nonzero resultant with its derivative, so . On the other hand the power basis is a basis of the order in a number field , and the discriminant-index formula for an integral lattice givesHere the field discriminant is an integer. ThereforeThis is squarefree reduction excludes a prime from the power-basis index; its argument establishes the index condition before applying the Kummer-Dedekind theorem.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 18H iv Solution 2026-10-14
Irreducibility modulo two implies irreducibility over by Gauss lemma for polynomials, so the Galois group embeds transitively in . The discriminant is , hence primes two and three are unramified. The factor-degree theorem says that square-free reduction with factor degrees provides an element of the Galois group with cycle lengths . The reductions already found therefore give a 4-cycle and a 3-cycle.
The group order divides 24 and is divisible by four and three, so is 12 or 24. An order-12 subgroup of has index two and must be : in its quotient every transposition has the same nontrivial image, since transpositions are conjugate and generate , making the quotient map the sign. But a 4-cycle is odd. Therefore the order is 24 andThe discriminant can also be obtained from and the resultant, giving .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 4 i Solution Created 2026-10-03 Updated 2026-10-06
Heights measure arithmetic size, and their finiteness and growth properties turn finite divisibility information into finite generation. For an elliptic curve over a number field , the resulting Mordell-Weil theorem isThe distinction between this statement and the Weak Mordell-Weil theorem, which only asserts that is finite, is exactly where heights enter.
For a rational point of the projective line, choose coprime integers and define the logarithmic projective heightFor a fixed number field, its absolute logarithmic version iswith the usual normalized absolute values. The product formula makes this independent of scaling , and the local degree formula makes it independent of enlarging the number field. Heights are nonnegative and are useful precisely because they control numerator and denominator together, unlike an ordinary real absolute value.
The Northcott theorem states that algebraic points of bounded degree and bounded height form a finite set. Over this is immediate from the coprime numerator-denominator description. In general, bounded degree and height bound the coefficients of the primitive minimal polynomial: their elementary symmetric functions are bounded by its Mahler measure, which is the appropriate power of the multiplicative height. There are only finitely many such integer polynomials.
On a Weierstrass equation of an elliptic curve, define the naive logarithmic height and . Since an -coordinate has at most two points above it, Northcott theorem implies that only finitely many points of have bounded .
Duplication descends to a rational map of the projective -line of degree . More generally, if a morphism has degree , thenuniformly in . Write as two homogeneous degree- polynomials without common zeros. Bounding their coefficients gives the upper estimate at each place. A nonzero resultant, or homogeneous Bezout identities, prevents simultaneous cancellation and gives the lower estimate; only finitely many places contribute a nonzero constant. Applied to duplication, this gives the height growth under a morphism of the projective line estimate
Define the canonical height of an elliptic curve byThe factor is a convention making it the height for the degree-one symmetric divisor . If , then , so the limit exists by a geometric-series estimate. Summing that estimate also provesThus bounded canonical height still gives only finitely many -points, and exactly.
The addition formula on the quotient by negation gives the uniform approximate parallelogram identityThis height parallelogram identity follows as follows. One way to obtain it is to express the unordered pair of their -coordinates as a morphism of bidegree ; the height of that unordered pair is the sum of the two heights, up to a bounded constant. It is also the height identity for the symmetric divisor . Apply this identity to , divide by , and take limits. The errors disappear, givingTogether with evenness and , the recurrence implies for every integer . The associated canonical height pairingis bilinear. Nonnegativity of the height implies its Cauchy-Schwarz inequality, by applying it to integer combinations and then rational approximations. In particular,The height vanishes precisely at torsion points: torsion gives a finite set of multiples, whereas if , every multiple of has bounded naive height and therefore the set of multiples is finite by Northcott theorem.
Now apply the Weak Mordell-Weil theorem with , proved cohomologically in the other essay. Choose a finite set of representatives for , and put . Write an arbitrary point as . ThenIf , this decreases the height by more than . Repeat until the current point has height at most . There are only finitely many such points. Unwinding the equations shows that is generated by this finite bounded-height set together with . This is the height descent lemma, and proves the Mordell-Weil theorem.
Once finite generation is established, the structure theorem for finitely generated abelian groups gives the displayed decomposition. The canonical height pairing is positive definite on the real vector space of the free part: a null direction would, by approximation with integer combinations of generators, give infinitely many lattice points of bounded height, contradicting Northcott theorem. Its determinant is the regulator of an elliptic curve, and its geometry gives practical tools for searching for generators and comparing independence. Thus heights supply both the finiteness mechanism in the proof and the quadratic size function used in arithmetic computations.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 125 1 a Solution Created 2026-10-03 Updated 2026-10-05
For a nonzero isogeny of elliptic curves , its degree of an isogeny is the degree of the induced extension of function fields. Since commutes with negation, its first coordinate is a rational function of alone. Write it in lowest terms asThe coordinate maps are finite morphisms of degree two. Multiplying function field degrees in the commutative diagram gives the degree of an isogeny from its x-coordinate map:This is the total degree, so the argument also covers an inseparable isogeny of elliptic curves. Counting distinct points in the kernel of an isogeny would give only its separable degree. The zero group homomorphism is assigned degree zero separately.
On a Short Weierstrass form in characteristic of a field other than two, the elliptic-curve addition formula givesThere is no cancellation: at a root of , the numerator equals , which is nonzero because the elliptic-curve discriminant is nonzero. The numerator has degree four and the denominator degree three. HenceFor completeness, the same answer holds in characteristic two, where the displayed short equation is not a nonsingular model. On a general Weierstrass equation of an elliptic curve usewhere , , , and . The resultant of this numerator and denominator is . Their resultant is therefore nonzero in every nonsingular case; even when the denominator drops degree, the numerator retains degree four.
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 4 18G a Solution Created 2026-09-24 Updated 2026-09-29
Let . Its polynomial discriminant isThe squared Vandermonde determinant is a symmetric polynomial in the roots. By the Fundamental theorem of symmetric polynomials, it is a polynomial in their elementary symmetric functions, which are the coefficients of by Vieta formulas; hence . Equivalently, the resultant formula puts it directly in .
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 125 4 a Solution Created 2026-09-28 Updated 2026-10-03
For in lowest terms, the naive height on the projective line isHomogenize the coprime numerator and denominator of to degree . The triangle inequality gives the upper estimate . Since the two homogenized forms have no common projective zero, their resultant is nonzero, and the Bézout identities for the resultant express fixed multiples of and as combinations of their values with coefficients of degree . After cancellation this gives , which is the lower estimate with .
Now write in lowest terms and putSince , the equation givesClearly for . Homogenizing the supplied polynomial identity givesIts coefficient sum is at most , so . The same lower bound is immediate from when . Thus
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 125 3 a Solution Created 2026-09-24 Updated 2026-10-03
For represented by coprime integers, its naive height on the projective line isWrite the degree- morphism as , where are homogeneous of degree with no common projective zero. Bounding their coefficients gives
For the reverse inequality, the nonvanishing of the resultant of and gives homogeneous Bézout identities expressing fixed nonzero integer multiples of powers of and as polynomial combinations of and . Evaluating at , removing the common divisor of and , and taking the larger of givesThus for constants depending only on .
For projective plane curves without a common irreducible component, project from a point outside both curves. In coordinates where that point is , their defining homogeneous polynomials have constant nonzero leading coefficients in . The resultant in is nonzero by Gauss's lemma, and is homogeneous of degree in the remaining two coordinates. Every intersection projects to one of its zeros. Each projection line has only finitely many intersections with the curves, so their intersection is finite. Choose the center again outside all joining lines of pairs of intersection points; the projection is now injective on that finite set, proving the bound.
For an algebraic integer generating a number field, the polynomial discriminant of its minimal polynomial equals the discriminant of elements of a number field for its power basis. A squarefree reduction modulo has nonzero resultant with its derivative, so . The discriminant-index formula for an integral lattice, , proves the assertion.
// Target: arithmetic.bigb
Sylvester matrix 2026-10-14
For polynomials of degrees , the Sylvester matrix has shifted coefficient rows of and shifted rows of , with coefficients in descending-power order. It represents, after transposition, the map for , . Its determinant is the resultant. Its kernel is nonzero exactly when a common polynomial factor exists: divide by that factor to obtain a nonzero cancelling pair; conversely, coprimality and imply , forcing the degree-bounded and then to vanish.