A -minimizing solution is an exact solution satisfying
The source condition in variational regularization says that some satisfies
where is the subdifferential.
Fix . The subgradient optimality condition for
at is
If the source condition holds, choose . Since , the displayed inclusion holds. Because the objective is a convex function, this condition is necessary and sufficient for global minimality.
Conversely, if the stated range condition holds for some , optimality supplies with
Thus , which is precisely the source condition. This proves the equivalence.
For , its total variation seminorm on a domain is
The corresponding bounded-variation space and its zero-mean subspace are
If , the Poincaré inequality for total variation is
In particular, for .
A problem is well posed in the sense of Hadamard when a solution exists for every admissible datum, is unique, and depends continuously on the datum. It is ill posed if any one of these three properties fails.
For the inverse problem , a regularization of an inverse problem is a family of bounded maps that approximate the generally unbounded Moore–Penrose inverse of an operator . It is a convergent regularization of an inverse problem if there is a parameter rule such that
as for every .
For a lattice of period , wavevectors differing by the reciprocal-lattice vector describe the same translation eigenvalue. The first Brillouin zone may therefore be chosen as
Bloch theorem states that every energy eigenstate in a periodic potential may be chosen in the form
To prove it, let be translation by one period:
Periodicity gives . The translation operator is unitary, so it can be diagonalized within each energy eigenspace. Choose a common eigenstate,
Unitarity gives , so for some real . Thus . Defining gives
which proves the theorem.

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