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 2017 iii Paper 205 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let denote the number of rejected null hypotheses and the number of rejected true null hypotheses. The familywise error rate is , whereas the false discovery rate is , with a zero contribution when . A valid true-null p-value satisfies for .
For the closed testing procedure, choose a level- local test of every nonempty intersection . Reject only if every intersection containing it is rejected by its local test. If any true null hypothesis is rejected, the local test of must reject. Since that intersection is true, its rejection probability is at most . If is empty there can be no false rejection. This proves strong closed-testing control of the familywise error rate, under arbitrary dependence, provided each local test is valid under its whole intersection null.
For the Benjamini-Hochberg procedure, order the p-values and setwith maximum zero if the set is empty; reject the first hypotheses. To prove its false discovery rate bound, fix a true-null index . Replace by zero and let be the modified rejection count. This is a function of the other p-values and satisfies .
The Benjamini-Hochberg leave-one-out identity isHere is its deterministic justification. If was rejected, lowering its value cannot decrease , and leaves all ordered values of ranks greater than unchanged. No such rank can newly satisfy its threshold, so . Conversely, if and , at least other values and are at most this threshold. Therefore the original procedure has . Monotonicity under decreasing also gives , so and is rejected. This establishes the identity; harmless deterministic tie-breaking also covers the artificial zero introduced in the modified data.
The assumed independence makes independent of . Conditional on , validity of the p-value impliesSum over to obtainIf true-null p-values are exactly uniform rather than merely valid, the first inequality is equality. No restriction on dependence among the false-null p-values is needed beyond their joint independence from the true-null values.
For the requested Simes inequality, apply this result to the true-null p-values alone, for . Every rejection is now false, so and the false discovery rate is the probability of any rejection. The event of at least one Benjamini-Hochberg procedure rejection is exactlyIts probability is at most . This holds for ; with no true nulls the written minimum and division by are undefined and the error-control statement is instead vacuous.
The final step-up rule is the Hochberg procedure. Use Simes tests as the local tests for a closed testing procedure: reject when . Under any true intersection all its p-values are valid and independent, so the Simes inequality proves level for its local test. The implication supplied in the question says that whenever the Hochberg procedure rejects , every intersection containing passes its local Simes test. Thus every such rejection is also a closed-testing rejection. ConsequentlyThe true-null independence assumption is essential to this particular proof of local-test validity; the arbitrary-dependence guarantee of closed testing does not create valid local tests automatically.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 205 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the normalizationfor the Lasso. A centered sub-Gaussian random variable with parameter satisfies for all ; for a noncentered variable apply this definition to . With fixed , independence of the errors givesThe exponential Markov bound, optimized over separately for the two signs, gives . Take and apply the union bound over columns:The specified positive tuning parameter requires ; at its formula is zero. For small the probability lower bound can be negative and hence uninformative. Although centering makes the centered errors dependent, means , so the preceding proof uses the original independent errors, not independence after centering.
The Karush-Kuhn-Tucker conditions, using the subdifferential of the L1 norm, areConsequently, for nonempty , on ,This establishes the required active-set inequality without any rank condition on .
For , a sufficient Compatibility condition for the Lasso isIndeed, for , comparison of the two Lasso objective values and the score bound on give the Basic inequality for the LassoIt follows that satisfies the Lasso cone condition and . Thus , including the trivial case. This proves the slightly stronger , and in particular the requested . If , the same basic inequality forces on ; no nonempty-support compatibility constant is needed.
For the support-size argument, use the stated prediction bound with constant . Set . By the Cauchy-Schwarz inequality and the definition of the sparse maximum eigenvalue,Combining with the lower bound and squaring gives for every nonempty . If and , choose of size ; this contradicts the strict inequality defining . If , proves the assertion directly. Hence in both cases.
When , minimality and monotonicity of the sparse maximum eigenvalues giveWhen , the first result gives , so the same final bound holds. Thus the finite-index conclusion is .
There is a genuine domain omission in the printed last assertion: the definition of only makes sense for , so is undefined when . This case can occur: take centered orthogonal columns with , , , and . Then for every available and none exceeds , so . A universally defined replacement, from and monotonicity, isAlternatively, explicitly extend the definition by for , including infinity. Under that added convention the printed final expression is meaningful and follows from this replacement bound. Neither convention nor finiteness should be silently assumed.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 205 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A real positive-definite kernel is a symmetric function such that, for every finite collection and every ,Thus every kernel matrix is a positive semidefinite matrix; “positive definite” here does not require strict positivity. A Reproducing kernel Hilbert space is a Hilbert space of functions on in which every point evaluation is a continuous linear functional. Its reproducing property is with , and . For a sum of positive-definite kernels, the quadratic form of its kernel matrix is a sum of nonnegative quadratic forms. Symmetry also survives summation. Consequently
For the representer theorem, put . This is a closed finite-dimensional vector space. The orthogonal decomposition by a closed subspace gives , where and . The reproducing property implies for every observed input, and thereforeSince , any minimizer must lie in . For , the reproducing property gives the evaluation vector and . Hence . If minimizes , its representation yields a minimizing . Conversely, if minimizes , then, for any , representing gives . ThusThis is an equivalence of minimizers, not an existence or uniqueness assertion: the loss function is arbitrary. A singular kernel matrix also allows nonunique coefficients, since differences in represent the zero function. Strict convexity of the loss was not used.
Now use the stated minimum-norm description of a sum of reproducing-kernel Hilbert spaces. Let . If the minimizing tuple did not attain the minimum total squared norm among decompositions of , replacing it by that unique minimum-norm tuple would preserve the loss function and strictly lower the penalty. This contradicts optimality. ThereforeFor an arbitrary , take its minimum-norm decomposition . Then , proving that minimizes .
Choose from the representer theorem for this minimizing sum, and define . Write for the component kernel matrices. ThenBy uniqueness of the minimum-norm decomposition, for every . This proves the common representer coefficients for a sum of kernels conclusion:The same coefficient vector works simultaneously. Even when is singular, changing that vector by leaves every component unchanged: forces each nonnegative squared component norm to vanish.
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





