Move to a rotating frame. With detuning (changing sign with the phase convention), the constant two-level Hamiltonian has generalized Rabi frequency . Starting in state zero,
The transition envelope is maximized on resonance, , namely for the matrix phases printed in the question.
First-order time-dependent perturbation theory gives
The lowest nontrivial transition probability is , with errors of higher order in .
The covering graph has at least one primitive cycle of lengths two and four and two inequivalent primitive cycles of length five. Thus the guaranteed minimum numbers of distinct orbits are respectively .
Order a period-three orbit as . Its images produce two subintervals with covering relations and . Any closed walk in this directed graph gives, by the interval-covering lemma and the intermediate value theorem, a fixed point of the corresponding iterate. Primitive closed walks of every length exist, giving an orbit of every positive period; this is the period-three case of Sharkovsky theorem.
Since , two real independent approximations are
The Liouville-Green approximation gives
Here
The control ratio tends to zero, verifying consistency.
The standard removal of the first derivative, , gives with .
After setting , the transformed coefficients have a singularity beyond the regular-singular growth bounds at . Thus infinity is an irregular singular point.
On the simplex define . Strict positivity makes the denominator positive and maps the simplex continuously into its interior. By Brouwer fixed-point theorem, for some . Thus , where , and because is strictly positive, so is .
The equivalent no-retraction theorem says there is no continuous retraction of the closed disk onto its boundary circle. A fixed-point-free map gives a retraction by projecting from through to the boundary; conversely a retraction composed with the antipodal boundary map gives a fixed-point-free self-map.
Apply Cameron-Martin theorem to the absolutely continuous path up to and thereafter. Its derivative is on and zero later, so the Radon-Nikodym factor is , yielding the formula for every bounded measurable functional of the path after .
The joint Gaussian density of the independent increments changes under shifts by
Multiplying the density and integrating the bounded cylinder function proves the identity.
The transformed process is centred Gaussian and
The Brownian strong law makes almost surely as , giving continuity at zero; elsewhere continuity is immediate. Part (a) now applies.
A Brownian motion starts at zero, has continuous paths, and has independent increments with . The stated covariance makes every finite collection jointly Gaussian; disjoint increments have zero covariance and hence are independent. Their variances are interval lengths, proving all defining properties.
Neither proper gamma prior yields the condition in part (c). The risk in part (a) is unbounded as because . The risk in part (b) is analytic, tends to zero at infinity, and is not identically zero, so its prior average is strictly below its supremum for a gamma prior with positive density everywhere. Thus this sufficient condition proves neither estimator minimax for any .
An admissible Bayes estimator whose Bayes risk equals its maximum risk is minimax. Indeed every estimator has maximum risk at least its prior-average risk, which is at least the Bayes risk; equality for the stated estimator attains this lower bound. Admissibility excludes a distinct estimator improving it everywhere.
Put . The posterior mean of is . Using the Poisson probability-generating function, its risk is

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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