This page is meant to provide a general example and template for new nLab-pages. You can look at its source code to see how the various parts are done. A minimal template is given first which can be copy-and-pasted into newly created pages. See HowTo for more details.
# Contents (or put a title here)
* this block creates the table of contents, leave as is
{: toc}
## Idea
(...)
## Definition
(...)
## Properties
(...)
## Examples
(...)
## References
(...)
A more detailed example follows. Check out the source code here to see how it’s coded:
It is an old observation that xyz. One notices that from the nPOV this is just an abc. This leads to the definition of a uvw. It is useful for doing klm and provides the basis for the more general theory of äöü.
A uvw is effectively a uv together with a w. Its main property is encoded in Somebody’s Theorem which says that it consists of precisely three letters. The archetypical example of a uvw is $\mu \nu \omega$; details will be explained in the special examples paragraph.
As Jacques Distler said,
(uvw)
A uvw is a UVW in which all letters are lower case.
This may be summed up in the slogan:
A uvw is just what it looks like.
By inspection.
Every uvw contains strictly more than one letter.
Use the above lemma and continue counting:
Along the lines of the above proposition, we use equation (1) and then conclude with
Notice that this is indeed independent of in which order we sum up the letters, in that the following diagram commutes:
No uvw contains more than three letters.
First case
Second case
Third case
For ease of reference, we will number the examples.
The first example is obvious.
The original definition appeared in section 3 of
Last revised on July 22, 2022 at 17:09:53. See the history of this page for a list of all contributions to it.