Topics (316k) Articles (327k) Users (379) Discussions (238) Comments (383) Files (10k) New article
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 2 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write for the order of the determinant character of an irreducible character . An extension has the same degree and restricts exactly to , rather than just containing it as a constituent.
Extension theorem. Thompson's coprime character extension theorem says that if , is -invariant, and , then extends to exactly when its determinant character extends to a linear character of . In particular, if also , there is a unique extension with determinant order coprime to the index. For a p-group quotient, the version used below gives a canonical extension whenever both the degree and the determinant order are prime to . This theorem is an assertion of extendibility, not the false statement that every invariant irreducible character extends.
The p-nilpotency lemma. Definewhere is the largest power of dividing an integer . Isaacs' character-degree criterion for p-nilpotency assertsEquivalently, . We prove both the divisibility and the criterion.
Let be the p-residual of a finite group, the least normal subgroup with p-group quotient. It can also be described as the subgroup generated by all p-prime-order elements: every homomorphism to a p-group kills those elements, and after quotienting by their generated subgroup the image of every element has p-power order, so the quotient is a p-group by Cauchy's theorem.
The residual is p-perfect, meaning . Indeed is characteristic in , hence normal in , and is an extension of the two p-groups and . Minimality of forces equality. Consequently has order prime to , since otherwise it would have a quotient of order . Every linear character of , in particular every determinant character of , therefore has order prime to .
Let consist of the -invariant irreducible characters of of degree prime to . Each extends to an irreducible character of by the extension theorem. The irreducible characters of lying over are exactlyHere is the representation argument for this description. If a representation lies over the invariant , its -module is copies of the module for . Identify it with that module tensored with its multiplicity space. Dividing the -action by the fixed extending action on the first factor leaves an action on the multiplicity space, trivial on . Irreducibility is equivalent to irreducibility of that quotient action, proving the displayed parametrization.
Every irreducible degree of the p-group is a power of , since it divides the group order. Thus the p-prime-degree characters lying over are exactly those with linear, and there areof them. For the last equality, is the largest abelian p-group quotient of , hence the p-primary part of its abelianization. In particular all these characters have degree .
Conversely, for any of p-prime degree, Clifford theory writes its restriction to as times the sum of a single orbit of irreducible characters. The orbit size divides and also divides , so it is one; the constituent is invariant and has p-prime degree. Hence . The preceding extension parametrization now forces the quotient character to be linear. We have therefore obtained the exact identityThis proves the required divisibility without assuming p-nilpotency.
The p-group acts on by conjugation. Every nonfixed orbit has size divisible by , and degrees are constant on each orbit. Fixed characters whose degrees are divisible by also contribute zero modulo . The sum of squares of irreducible degrees consequently givesThe quotient is prime to exactly when has order prime to . Since is a p-group, that is exactly the assertion that is a normal p-complement. Conversely, any normal p-complement equals because it contains all p-prime-order elements and has p-group quotient. This finishes the lemma.
Detection from the group algebra. For finite groups and with isomorphic complex group algebras, the Artin–Wedderburn theorem givesThe simple matrix-block sizes and their multiplicities are determined by the algebra isomorphism. Hence and have identical irreducible degree multisets. They have the same order, from the degree-square sum, and the same number of linear characters, which equals . Thus and coincide for every prime . The lemma shows that one group is p-nilpotent exactly when the other is.
A finite group is nilpotent exactly when it has a normal p-complement for every prime dividing its order. For completeness, if all those complements exist, set , where is the normal p-complement. The diagonal map is injective, so is prime to . At the same time, containment in each removes every prime other than from . Thus is a normal Sylow q-subgroup. Distinct normal Sylow subgroups commute, giving the direct-product decomposition. Conversely, the direct-product decomposition of a finite nilpotent group provides all the complements. We concludeThis is the assertion that the complex group algebra detects p-nilpotency and hence nilpotency. It needs the multiplicities of the degrees, not just their distinct values.
Normal-complement consequence. If divides every nonlinear irreducible degree, the p-prime-degree characters are exactly the linear characters. ThereforeThe lemma yields a normal p-complement immediately:This proves Thompson's character-degree normal complement theorem, including the abelian case where the hypothesis on nonlinear characters is vacuous.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For an oriented three-manifold M with prescribed framed boundary endpoints P, the relative Kauffman bracket skein module is the complex vector space generated by properly embedded framed tangles, modulo framed isotopy and the local bracket relations. A crossing resolves with coefficients A and , and adjoining an unknotted circle multiplies by . We now use the full bracket convention: the empty diagram has value one and a circle has value . For a nonempty uncolored link this full bracket is times the reduced bracket used earlier. Fixing this normalization is essential for the quantum dimensions. Gluing compatible boundary pieces composes skeins; disjoint union gives tensor products. With no endpoints this is the Kauffman bracket skein module. Framing is retained, so a Reidemeister-I curl is a framing change rather than an allowed isotopy.
For , the Temperley-Lieb algebra is the skein algebra of a rectangle cylinder with n marked endpoints on each horizontal side, multiplication being vertical stacking. Resolve crossings to get a basis of crossing-free matchings of its endpoints, with every closed circle removed with factor . There are such matchings. Conversely multiplication of these matchings by joining endpoints defines an algebra satisfying the skein relations, which proves their independence. Writing for an adjacent cap-cup and 1 for the n vertical strands givesEvery crossing-free matching other than 1 contains a turnback; removing an outermost cap successively expresses it in these generators. Thus these diagram rules give the usual generator presentation as well.
Put , interpreted as the Laurent sum if its denominator vanishes. Set . These quantum integers satisfy , , and . The Jones-Wenzl idempotent is characterized by identity-matching coefficient one andStarting with , , set and . Whenever the denominators are nonzero the recursion isHere is the induction proving its properties. Closing the last strand of gives . Consequently stacking two copies of C, and straightening the middle cap-cup, gives , where . Also . Expanding proves idempotence. The earlier turnbacks are killed by F; the last is killed because the same cap-cup calculation gives and its reflected identity. Only F contributes to the identity matching, with coefficient one.
For completeness, the partial-closure formula used in that induction follows from the recursion itself. Closing the last strand of F gives ; closing the last strand of C straightens its cap-cup to . Hence partial closure of is . Starting at , this proves both the inductive formula and total closure . Finally, any nonidentity matching is in the turnback ideal. If two normalized projectors kill that ideal, multiplying them gives each of them, proving uniqueness. Their normalization also gives absorption of smaller projectors on consecutive substrands. At exceptional A one must check the denominators; the recursion does not assert existence of every projector there.
A positive framing twist of an n-strand projected cable consists of n individual positive curls and positive braid crossings. Each curl contributes . A crossing is , so it acts on as A because the turnback vanishes. This proves the depicted Jones-Wenzl twist eigenvalue identity, including its exponent:A negative framing twist acts by the inverse scalar.
Choose , with an integer . Then but are nonzero. The projector exists and has trace zero. Pass to the reduced Temperley-Lieb skein theory by setting it to zero, including every diagram containing it. The surviving colors are , with dimensions and twistsTheir dimensions are nonzero. The recurrence decomposes into the two orthogonal channels and : the first is the new projector, while its complementary cap-cup idempotent is the latter, with inclusion/projection normalized by the nonzero partial-closure scalar. At the upper endpoint the channel vanishes. Iterating gives a complete decomposition of every tensor power into these colors. A matching between projected colors of different sizes has a turnback on the larger side and vanishes; on the same size only the identity matching survives. Thus their endomorphism spaces are one-dimensional and all matrix blocks split. Applying the recurrence to the decompositions proves the fusion of Jones-Wenzl colors ruleOne can verify the induction by multiplying by color 1: both sides satisfy the same adjacent-color recurrence and the same zero boundary at . Taking closures proves . Cups and caps make every color self-dual, so these fusion coefficients are symmetric in all three labels.
We next prove the Kirby color handle-slide identity, rather than assume it. In the annular skein space let be the closure of color b and define the Kirby color . For a fixed color a, choose inclusion/projection maps , for the fusion channels, with and . Bend the a strand with a cup and cap, obtainingClosing the resulting diagrams and straightening the bent strand gives . Since b is simple, . The symmetric fusion rule supplies all channels of , so their normalized projections are complete. ThereforeTo slide an a-colored strand over an -colored component, cut at the slide band and insert the resolution . Carrying the band across that loop bends its two maps into U and V. In each outgoing channel c, the boxed identity replaces the sum over the old loop color b by exactly the new loop weight ; the rest of the diagrams are isotopic as framed ribbons. This proves invariance for fixed a. Summing a with its own weight proves invariance when both surgery components are colored by . The band framing is carried in this argument, as required for a framed handle slide.
We must also show that the stabilization normalization is nonzero. Let be the full bracket of the zero-framed Hopf link with colors i,j. On a fusion channel k, its double braiding has eigenvalue : the full twist of the combined ribbon equals double braiding followed by the two separate twists. Taking the trace gives the balancing identityFor there are only the channels; substitution of their dimensions and twists gives , with a vanished endpoint channel simply omitted. A color-1 meridian therefore acts on the simple color i by that scalar. The annular closures obey , where X is a color-1 core, by the two-channel fusion decomposition. Applying this recurrence to meridians gives the Hopf pairing of Jones-Wenzl colorsIndeed the recurrence is the sine identity with , and its initial values are and the computed . Finite sine orthogonality now givesFor example, orthogonality follows by writing products of sines as differences of cosines and summing the finite geometric series of rth roots of unity; the result is . Thus no degeneracy remains in this pairing.
The Gauss sums of Jones-Wenzl colors are , the evaluations of the plus- and minus-one-framed -colored unknots. Balancing and dimension fusion proveIn the last step , by symmetry of the fusion coefficients. In vector notation this is , with . The matrix and vector are real, and each twist has modulus one, so conjugation gives . Apply H again and use its orthogonality to obtain . Hence neither factor vanishes.
We may use the surgery existence theorem and Kirby calculus: every closed oriented three-manifold has an integral framed-link surgery description, and two descriptions are related by handle slides and insertion/removal of disjoint plus- or minus-one-framed unknots. For an m-component surgery link L let be the signature of its symmetric surgery linking matrix, put , and define the Jones polynomial surgery invariantA handle slide preserves the colored bracket by the proved identity and changes the linking matrix by congruence, preserving its signature. Adding a disjoint plus-one-framed unknot multiplies the bracket by and changes to , so the net factor is . For a minus-one-framed unknot it is . Kirby calculus therefore proves that the displayed value is a well-defined oriented three-manifold invariant. Our normalization has ; reversing orientation conjugates the value. Its construction uses precisely the bracket and colored projectors underlying the Jones polynomial.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Wirtinger presentation assigns a meridian generator to each arc between undercrossings. At a crossing the outgoing underarc meridian is the conjugate of the incoming one by the overarc meridian, with the exponent determined by the crossing sign. One crossing relation is redundant for a connected knot diagram. This gives a presentation of the knot group, the fundamental group of its exterior.
For the trefoil knot, choose three arcs x,y,z so that two crossing relations are and . The third follows from these. Substituting for z gives , henceWe use the relator .
Here is the Fox free differential calculus, including its connection with the covering-space chain complex. Let F be the free group on , let be its group ring, and let be augmentation. Define additive maps byFor group words u,v the product rule reads . Differentiating forces . Thus for a reduced word one sums its prefixes at positive occurrences of , and subtracts the prefix including at negative occurrences. Inserting or deleting makes two cancelling contributions, proving that this definition is independent of word reduction. Linear extension proves the group-ring product rule and uniqueness.
The fundamental identity isIt holds on generators and inverses. If it holds for u and v, then proves it for their product, so induction proves it for every word. These Fox derivatives form the matrix for any chosen presentation.
Let be knot-group abelianization and put . Apply the ring map sending to , and set . Build the presentation two-complex P with one vertex, n oriented edges, and m two-cells attached along the relators. Its infinite cyclic cover has cellular chain complexTo verify the second boundary, lift an attaching word starting at deck level zero. An occurrence after prefix u traverses the jth edge at level , contributing . An occurrence traverses it backwards starting at level , contributing . Their sum is exactly the evaluated Fox derivative. The fundamental identity, with , gives .
The cover of P and the cover of the knot exterior both have fundamental group . Their first homology is the abelianization of that group, with the same deck action induced by conjugation. Thus no assumption that the presentation complex is aspherical is needed, and the complete relation with the Alexander module of a knot isFor meridian generators all . Then consists of vectors with coefficient sum zero, with basis , . Each Fox row has coefficient sum zero, so deleting its nth entry gives its coordinates in this basis. Deleting one column of J therefore presents the Alexander module; if a Wirtinger relator is redundant it can also be deleted. This proves the matrix procedure used for the displayed knot above. For arbitrary generators, the exponent vector is primitive because the generators map onto ; elementary changes of free generators implement the Euclidean algorithm and reduce it to . In that basis is free on the last edges, and their relator coefficients give a presentation. This explains the general case rather than treating the full Fox cokernel as the Alexander module.
For the trefoil relator, with , direct differentiation givesThe first boundary is , whose kernel is generated by . The relator boundary is , whenceFor a connected sum of knots, join Seifert surfaces in separated balls. Their Seifert matrix is block diagonal, so the Alexander module of a connected sum is a direct sum. Thus .
This module is not cyclic. The polynomial f is irreducible modulo two, since it has no root in , so is a maximal ideal of with residue field . The quotient has dimension two over that field, whereas the corresponding quotient of a cyclic module has dimension at most one.
Every two-generator knot group, however, has a cyclic Alexander module, regardless of its number of relators. Indeed its primitive abelianization vector can be changed to as above. The covering boundary is then ; its kernel is the free rank-one module on the second edge, and any quotient by lifted relators is cyclic. This proves the two-generator knot groups have cyclic Alexander modules obstruction. Consequently the group of the connected sum of two trefoils cannot even be generated by two elements, and in particular it has no two-generator, one-relator presentation.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be an oriented Seifert surface of genus for , and choose a basis of . Push a representative curve slightly in the positive normal direction to obtain . The Seifert matrix in our row convention isThe difference is the intersection form of F, up to the convention for its orientation; in a symplectic basis it is a direct sum of unimodular two-by-two skew blocks.
Write for the knot exterior. Linking number with K gives the epimorphism sending a positive meridian to one. Let be the associated infinite cyclic cover, with deck transformation t. The Alexander module of a knot is , regarded as a module over the Laurent polynomial ring . Its order, the greatest common divisor of the maximal presentation minors, is the Alexander polynomial of a knot, defined up to . Equivalently these minors generate its zeroth Fitting ideal; we will obtain a square presentation, so its determinant gives the order. No assertion that is a principal ideal domain is needed.
Here is the Seifert-matrix presentation of the Alexander module with its topological justification. Cut X along F, obtaining a connected manifold Y with two boundary copies and . Up to collars this is the complement of a thickening of F in . Alexander duality gives and the perfect linking pairing with . Choose generators satisfying . This homology statement does not require Y to be a handlebody. The two inclusions satisfyIndeed the first coefficients are the defining positive linking numbers; for the second, moving the two curves to opposite sides and using symmetry of linking gives .
Stack copies of Y, identifying the positive copy of F in one layer with the negative copy in the next. This is . The Mayer–Vietoris sequence, with all translates collected into Laurent modules, containsThe last map is injective because is an integral domain. Thus the entire Alexander module is presented by the row relations (transpose the matrix if using column vectors). At its determinant is , so the determinant is nonzero and the module is a torsion module. Consequentlywhere denotes equality up to a Laurent unit. The second conclusion follows because a determinant of size with entries linear in t has breadth at most ; minimize over Seifert surfaces.
For the displayed diagram, start on the outer lower arc near the lower left undercrossing and follow the arc through the lower outer loop toward the upper right undercrossing. Number successive undercrossings , and let label the incoming arc at crossing . Reading the overpassing arcs and the conjugation exponents in a consistent meridian convention givesThus the Wirtinger presentation relations are , with indices modulo ten. Their Fox derivatives after abelianization give row relationsDelete the redundant last relation and the last column, setting . This is a nine-generator presentation of the Alexander module. The cofactor determinant is ; here is a smaller elimination check. Retain . Seven relations solve the other generators asThe two remaining rows, at undercrossings two and seven, are the matrixIts determinant is , differing from the original cofactor only by a Laurent unit. ConsequentlyThe factor has value one at and is reciprocal, as required. Its Conway-normalized Alexander polynomial is , and its knot determinant is three.
For the genus upper bound, the over/under Gauss code from the same traversal isNumber these visits . The oriented smoothing permutation of a Gauss code has cyclesThere are seven Seifert circles, so the Seifert algorithm gives ten bands and seven disks: , hence . The Alexander breadth bound on Seifert genus supplies the matching lower bound from breadth four. Therefore .
Modulo two, the primitive Alexander polynomial becomes . It has neither zero nor one as a root, and it is not , the only possible product of irreducible monic quadratics over . It is therefore irreducible over , hence over and by Gauss lemma for polynomials. The full-degree irreducible Alexander polynomial implies a prime knot criterion now applies, since its breadth is exactly twice the genus. Thus the knot is prime. The full-degree condition is needed to rule out a nontrivial summand with unit Alexander polynomial.
To test reflection, calculate the Jones polynomial from the same crossing data. The diagram has nine positive crossings and one negative crossing, so its writhe of a link diagram is eight. Enumerate the bracket smoothing states, join their smoothed ends, and weight each state by . Correct by and put . This givesAs checks, and . The Jones polynomial of a mirror is , which differs from this polynomial. Therefore the knot is not equivalent to its reflection. Reversing all crossing conventions reciprocates the displayed Jones polynomial and leaves the conclusion unchanged.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
To form the connected sum of knots , remove a short unknotted arc from each oriented knot in two disjoint balls and join the remaining endpoints by a pair of parallel arcs respecting the orientations. Equivalently, a sphere meeting a knot in two points cuts it into two one-string tangles; close each by an arc in the sphere to recover its summands. Sliding the small joining balls along the knots shows that the isotopy type does not depend on these choices. The unknot is the identity for this operation. A prime knot is a nontrivial knot such that every expression has an unknot summand.
The Seifert algorithm supplies a Seifert surface for every oriented knot: smooth the crossings in their oriented directions, span the resulting Seifert circles by disks at different heights, and restore each crossing with a half-twisted band. If needed, join components by tubes away from the boundary. Thus the set of surface genera is a nonempty subset of the nonnegative integers and has a minimum, so exists.
We first prove additivity of Seifert genus, which also supplies a terminating measure for decomposition. Joining minimal Seifert surfaces along their boundary arcs gives . For the reverse inequality, let be a minimal-genus Seifert surface for the sum and a splitting sphere of a knot. Arrange transverse intersection so that consists of one arc joining the two boundary-intersection points and some circles, with the number of circles minimal among genus-minimizing surfaces.
Each circle separates the sphere into two disks; since it is disjoint from the intersection arc, one disk contains neither marked endpoint. Choose an innermost such circle and its disk , whose interior misses . If its boundary were essential in , compressing along would lower the genus of its component with boundary K: for a nonseparating curve genus drops by one, and for a separating essential curve the removed boundaryless side has positive genus. This contradicts minimal genus. Its boundary therefore bounds a disk in . Replace that disk by a small push-off of , removing the intersection circle without changing genus or boundary, again contradicting minimal intersection. Thus no circles remain.
Cutting along its single intersection arc gives two connected surfaces with boundaries the two summand knots after the closing arcs are added. Euler characteristic shows that their genera add to . Each genus is at least the minimum genus of its summand, soGenus zero means that the knot bounds a disk and is the unknot. Every nontrivial knot therefore has positive genus. Induct on this nonnegative integer: a nontrivial nonprime knot splits into two nontrivial summands, each with strictly smaller genus by the equality above, and induction decomposes both into primes. This proves every knot is a finite connected sum of prime knots, with the unknot the empty sum.
The same induction does not follow from the three suggested replacements. For crossing number of a knot, joining minimal diagrams gives only subadditivity; a reverse inequality giving strict descent for every nontrivial summand is not provided by this argument. The Jones polynomial of a connected sum does make its breadth of a Laurent polynomial additive, but the needed implication that zero breadth forces the unknot is the Jones unknot detection problem. For the Alexander polynomial, even this implication is false: nontrivial untwisted Whitehead doubles have Alexander polynomial one and hence breadth zero. The decisive genus property is both additivity and the exact characterization if and only if is the unknot.
For uniqueness use complete decomposing sphere systems for a knot. Cut each system and cap the marked boundary spheres with straight arcs; the resulting oriented factors are prime knots. Compare two systems in transverse position, and use the prime-ball exchange lemma to simplify their intersection. Choose an innermost intersection circle bounding a disk in a sphere of one system and lying in a prime-factor ball of the other. If the disk misses the knotted arc it cuts off an empty ball. If it meets the arc once it cuts the prime factor into two knots, so one is an unknot. Replace the old ball by the side carrying the same prime factor, perturb its boundary slightly, and remove that intersection circle. This preserves the unordered factors: the discarded empty or trivial ball merely changes the joining arc, and any intervening capped boundaries still carry their original factors. If the chosen disk contains both marked points, take another innermost disk without marked points, or the complementary disk when the intersection circle is the only one.
Iteration yields an innermost prime-factor ball disjoint from both systems. Its arc has no nontrivial further decomposition, so it represents one factor in each. The boundary can be included in both systems using the same ball exchange; replace its arc by a straight boundary arc and remove this common factor. Induction on the number of factors matches the remaining factors. When the systems already have no intersections, start directly with an innermost ball and the same removal step. All replacements preserve the arc orientation, so the match is of oriented knots, not only unoriented types. Hence the prime decomposition of knots is unique up to reordering and oriented link isotopy.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact






