The following four assumptions are sufficient, with statements understood for -almost every and every :
The first two assumptions give . The last two allow the dominated convergence theorem to prove continuity of the normalized posterior density, which is equivalent to continuity in total variation distance.
The problem is a well-posed Bayesian inverse problem in total variation when a unique posterior exists for every and the posterior map is continuous:
Thus the metric supplies the precise meaning of continuous dependence on the observed data in the Bayesian version of Hadamard well-posedness.
A Bayesian inverse problem consists of a prior distribution on the unknown , a reference measure on the data space , and a jointly measurable likelihood such that is a probability density function for -almost every . For observed data , Bayes' theorem defines the posterior distribution by
provided .
Let be the singular system of a compact operator. Since for and for , the truncated operator has the finite singular value decomposition
Consequently
so .
For completeness, on and . These are self-adjoint orthogonal projectors, and hence
Thus all four Penrose equations hold, which verifies the formula independently of the singular expansion.
Suppose and that the interiors of and cover . The Mayer–Vietoris theorem gives the long exact sequence in homology
where all four displayed maps except the connecting homomorphism are induced by the relevant inclusion maps.
To prove it, let be the chain complex generated by those singular simplices whose images lie wholly in or wholly in . The sequence
is a short exact sequence of chain complexes. Repeated barycentric subdivision makes every singular simplex small enough to lie in or , and the subdivision operator is chain homotopic to the identity. The inclusion therefore induces an isomorphism on every homology group. The long exact homology sequence of a short exact sequence of chain complexes now gives the displayed sequence. Explicitly, if an -cycle with and , then lies in and represents the connecting class .
For the harmonic oscillator Hamiltonian ,
This rotation preserves the symplectic form , so it is a canonical transformation for every . Where , solving for the initial variables gives
and hence the type-2 generator
Its derivatives give the displayed transformation and . At the canonical rotation remains perfectly regular, but its projection to is singular, so no type-2 generating function in those variables exists there; another generating-function chart covers those isolated times.
Weak convergence in means
Norm convergence implies weak convergence because every is norm-continuous.
The minima occur at , where . Writing gives
The harmonic approximation near a potential minimum therefore has frequency
because . The two lowest localized energies are
In the tight-binding model, tunnelling between neighbouring wells broadens each localized level into a band,
For large , the hopping amplitudes are exponentially small compared with the oscillator spacing. Hence the gap between the first two bands is
up to exponentially small tight-binding bandwidth corrections.
The potential has period , so the first Brillouin zone is . At its boundary the free-particle states
are degenerate, with energy
The relevant Fourier coefficient is supplied by :
The term changes wavevector by two and has no matrix element within this degenerate pair. Thus degenerate perturbation theory gives the matrix
and the two band-edge energies
The nearly-free electron model therefore predicts the lowest band gap
For , the commutator subgroup of is . The group is nonabelian and simple, so its commutator subgroup is a nontrivial normal subgroup and must equal itself. Hence the derived series of is
and never reaches the identity. Therefore
The function is not partial computable. It is defined on every input, so if a register machine with code computed it, then and in particular would be defined. The first clause in the definition would give
which is impossible. This is the usual diagonal argument behind the noncomputability of the diagonal halting set.
Complete the square:
If is even, an integer can equal , giving the maximum . If is odd, every integer is at least from , giving the maximum . Thus

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