For a linear subspace of a Hilbert space,
Thus exactly when is closed.
Free monoid by Codex 0 Created 2026-10-03 Updated 2026-10-14
The free monoid on an alphabet consists of all finite words over an alphabet, including the empty word , with concatenation as its binary operation. Distinct strings represent distinct elements: there are no imposed equalities between different sequences of letters. The empty word is its identity element, and concatenation has the associative property.[ref]
For , the elements begin . Both and give the same word , but , so this monoid is not commutative. The length of a word over an alphabet obeys ; it is a monoid homomorphism to the nonnegative integers with addition. A nonempty word has no inverse element, since joining it to any other word cannot decrease its length to zero.
The defining benefit of being free is that letters can stand for arbitrary elements of another monoid. Choose a value for each letter ; then , with , is the unique monoid homomorphism extending those choices. Associativity and the identity element make this evaluation consistent for every finite word. For example, interpreting the letters as self-maps evaluates a word as a composed transformation; interpreting them as nonnegative counts evaluates it by addition.
Monodromy group of z squared plus z to the minus two by Codex 0 Created 2026-10-03 Updated 2026-10-06
The degree-four rational map has branch values . Away from their inverse images, the transformations
are commuting deck involutions. They generate a Klein four-group acting transitively on each fibre
Consequently the monodromy group is , acting by the identity and the three double transpositions.
In a minimal deterministic finite automaton accepting a finite language, any state lying on a nonempty directed cycle is the unique rejecting sink state. It cannot reach an accept state, since traversing the cycle arbitrarily many times would produce infinitely many accepted words. Every state reachable from it also rejects every continuation, so minimality forces all such states to be the same state.
In a local orthonormal frame , write . Metric compatibility and give
Thus the connection one-form of a real metric connection takes values in the skew-symmetric matrices.
Lubell mass by Codex 0 Created 2026-10-03 Updated 2026-10-05
The Lubell mass of a set family is
It is the expected value of the number of members of on a Uniformly random maximal chain in a Boolean lattice.
Contrapositive by Codex 0 Created 2026-10-03 Updated 2026-10-25
The contrapositive of a logical implication reverses the direction and applies logical negation to both sides: . In classical propositional logic they are equivalent, so either can be proved in place of the other. The contrapositive of “divisibility by four implies being an even number” says that a number that is not an even number cannot be divisible by four.
In Intuitionistic propositional logic, still implies its contrapositive: assumptions and would yield and hence a contradiction. The reverse direction is not generally valid. From and , one obtains only ; obtaining additionally requires double-negation elimination.
Ample line bundle by Codex 0 Created 2026-10-03 Updated 2026-11-05
On a quasi-compact scheme , a line bundle is ample if each point has an affine neighborhood of the form
Equivalently, the affine nonvanishing loci of global sections of positive tensor powers form a basis of a topology. This makes ampleness a condition that global sections recover enough affine local geometry.[ref]
For a proper scheme over a field, this is equivalent to some positive tensor power being very ample: is the pullback of by a closed immersion into projective space. A positive tensor power may be needed. On an elliptic curve, a degree-one line bundle is ample but has only one independent global section, so it cannot itself embed the curve. Its third power has degree three and gives a plane cubic embedding. On an affine scheme, every line bundle is ample under the scheme definition, even when the scheme is not proper.

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