Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 4 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and write for the nonnegative cone, including the identity. Every element of this cone is its own absolute value in a lattice-ordered group, so the desired condition is equivalent toWe prove this equivalence with normal-valued lattice-ordered group without assuming any characterization of normal values. Membership of in a convex lattice subgroup is equivalent to membership of , so it suffices to discuss values of elements . A value in a lattice-ordered group of means a convex lattice subgroup maximal among those omitting . Its cover of a value in a lattice-ordered group will be denoted : normal-valued means , not .
We first record facts about values and the coset order. Zorn's lemma supplies a value omitting any , and supplies one containing any specified convex lattice subgroup that omits . If is a value of , every convex lattice subgroup strictly containing contains . Therefore is the least such subgroup and there are no intermediate convex lattice subgroups. Moreover, if and both strictly contain , then both contain , a contradiction. The criterion proved in part (i) thus makes a prime convex lattice subgroup: its right cosets are totally ordered. Equivalently, for with , at least one belongs to . The equivalence follows because the coset projection preserves finite meets; in proving this, inequalities with two elements of can be replaced by their join.
The right-coset order gives the useful testIndeed, gives , and convexity gives membership. Conversely the displayed positive part itself supplies such a . We will also use the basic lattice-ordered group identity that : the positive and negative parts of one element are disjoint.
Here is a squared bound from comparison at values. Suppose and for every value of . Then . To prove it, putand suppose . Choose a value of . If , then , so , a contradiction. Otherwise extend to a value of .
If , set . Since and , test (2) gives . The element is outside : membership would imply , contradicting . It is consequently outside . Its inverse positive part isbecause . These two positive parts have meet , so primeness of forces , again a contradiction.
If , then , and . Necessarily , since otherwise would put in . Hence . As before, is outside and outside , while its inverse positive part ishere . Primeness again yields the contradiction . Thus , proving the bound. This auxiliary argument uses no normality assumption.
Suppose first that all values are normal in their covers. Given , put . If , both factors are and (1) holds. Otherwise choose any value of . Since , both factors belong to . The quotient group is a linearly ordered group, because is prime and is normal in . It has no nontrivial proper convex subgroup of an ordered group, since such a subgroup would lift to an intermediate convex lattice subgroup between and .
This quotient is an Archimedean ordered group. If and all powers were bounded by some , the principal convex lattice subgroup generated by would be a nontrivial proper subgroup: it cannot contain , since would contradict . That contradicts the preceding paragraph.
For completeness, Archimedean linearly ordered groups are Abelian by the following elementary argument. If there is a least positive element , its powers are cofinal and every element lies between consecutive powers; absence of any element between and makes the group cyclic. Otherwise, for every there is with : choose and put . If , use ; if not, multiplication of gives , so use . If positive did not commute, interchange them to have and put . Choose and, by the Archimedean property, integers with and . Two-sided order invariance givesa contradiction. Arbitrary nonidentity elements can be replaced by their positive inverses without changing whether they commute. This proves commutativity without assuming the characterization being proved.
It follows that . Apply the squared-bound lemma with , and , for all values of this . We obtainTaking and gives the required inequality.
Conversely, assume (1). We need one-sided bounds for adjoining a positive element. If is any convex lattice subgroup and , thenFor the first equality, denote the indicated set by . The inequality (1) allows a positive power of to move past a positive element of , at the cost of squaring:Also and . Applying the bound in both orders, and taking the join of the two resulting elements of and the larger exponent, bounds in the same form. Inversion does not change . A common bound obtained from and the larger exponent proves closure under join, meet and order intervals. Thus is a convex lattice subgroup containing and . Conversely every such subgroup contains each and everything whose absolute value it bounds, proving equality. The same proof in the opposite group proves the second equality, since (1) with the variables interchanged reads .
Let now be any value and . For each , the subgroup strictly contains and is contained in , so the cover property makes it equal to . Formula (3) therefore gives power cofinality in the cover of a value: for every there are powers withHere the left cosets carry the order obtained by inversion from the right-coset order; equivalently means for some .
Take and . If , then andThe inequality uses . But (4), applied to and the target , gives for some . This contradicts ; equality of those two cosets would itself imply . Hence .
To obtain the other inclusion, suppose . ThenLeft-coset cofinality in (4) gives , contradicting . Thus too. Every element of is a quotient of its two nonnegative lattice parts, so both conjugation inclusions hold for all . Positive elements of lying in already normalize , and every element of is a quotient of two nonnegative elements. ConsequentlyAll values have this property, so is normal-valued. At no stage was normality in the whole group assumed or required.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 4 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First check the ordered right cosets of a convex lattice subgroup. Replacing by changes a witness into , so the relation is independent of representatives. Reflexivity uses . If and , two-sided invariance of the partial order gives , proving transitivity. If both inequalities hold in opposite directions, thenBoth endpoints are in , so convexity gives and hence . Thus , proving antisymmetry. The join and meet formulas are and . For example, if and , then , giving the least-upper-bound property.
The coset order is total exactly when is a prime convex lattice subgroup. If it is total and have , assume . The coset meet is then , so . Conversely, for , its positive and negative parts in a lattice-ordered group satisfy . Primality puts one of them in . If , then gives ; if , use to obtain .
It remains to identify the stated intersection condition. If is prime and properly contain it, choose positive and . The cosets are strictly above . Their meet is therefore strictly above , so . But belongs to by convexity, showing .
If is not prime, choose disjoint positive . The principal convex lattice subgroups and have . Indeed, disjoint positive elements commute, since , and Riesz decomposition in a lattice-ordered group shows for every positive . Now the distributivity of the lattice of convex lattice subgroups givesBoth joins properly contain , violating the intersection condition. This proves the requested equivalence.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 39 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
By the spectral theorem, write , where is orthogonal and each . Choose the whitening transformationA linear image of a multivariate normal vector is multivariate normal, and . Thus are independent random vectors. Their whole joint distribution is independent of .
Define and . These satisfyThereforeThe right side is a function of independent standard multivariate normal observations only, so its distribution depends on but not on . This is the same affine invariance of Hotelling's statistic that permits multivariate mean tests with unknown covariance. The proof concerns the jointly transformed mean and covariance; whitening the mean alone would not establish the conclusion. Inverses exist almost surely under . If is singular, no square matrix can whiten it to , so nonsingularity of the population covariance is necessary as well.
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





