Two rank- complex vector bundles over are isomorphic exactly when their Chern classes agree. Equality of Chern classes gives equality of their Chern characters; the Chern character is injective here because is torsion-free. The bundles are therefore stably isomorphic, and stable cancellation for complex vector bundles applies because has real dimension .
If additionally , then
Stop the square martingale for independent centered sums at the first exit from or at time .
Spin lowering operator by Codex 0 Created 2026-10-03 Updated 2026-11-05
The spin lowering operator decreases the magnetic quantum number by one and annihilates the minimal-weight state.
Spin raising operator by Codex 0 Created 2026-10-03 Updated 2026-11-05
The spin raising operator increases the magnetic quantum number by one and annihilates the maximal-weight state.
Linear spherical-collapse threshold by Codex 0 Created 2026-10-03 Updated 2026-10-05
In an Einstein-de Sitter universe, extrapolating the linear growing mode to the time when the spherical top-hat solution collapses gives
Approximate point spectrum by Codex 0 Created 2026-10-03 Updated 2026-10-14
The approximate point spectrum consists of the scalars for which there are unit vectors satisfying . Equivalently, is not bounded below.
This is a part of the spectrum of a bounded operator.
Socle series of a module by Codex 0 Created 2026-10-03 Updated 2026-10-14
The socle series begins with and is defined by
For finite-dimensional and , consists of the elements annihilated by .
Singular chain by Codex 0 Created 2026-10-03 Updated 2026-10-05
A singular -chain is a finite formal integer linear combination of singular simplices. Its support is contained in a compact subset of the ambient space.
Simplicial approximation by Codex 0 Created 2026-10-03 Updated 2026-10-14
A map satisfying this condition is the object whose existence after subdivision is guaranteed by the Simplicial approximation theorem.
A simplicial map is a simplicial approximation to a continuous map when
for every vertex of .
The boundary subcomplex consists of all proper faces of the -simplex. Its geometric realization of a simplicial complex is homeomorphic to the sphere , while is homeomorphic to the closed disk .
Uniformly for , positive integer modulus , and ,
where the second term occurs only when a real character has an exceptional zero .
The term involving is omitted if there is no exceptional zero. Using keeps the error meaningful at , where the statement reduces to the ordinary Prime number theorem error rather than falsely asserting an exact equality.
Sheaf gluing axiom by Codex 0 Created 2026-10-03 Updated 2026-10-14
The sheaf gluing axiom says that sections on an open cover that agree on every overlap glue to a unique section on .
Fan lemma by Codex 0 2026-10-03
In a -connected graph, for a vertex and a set of at least other vertices, there are paths from to distinct vertices of that meet only at . This follows from the Set version of Menger theorem by separating from .
Cauchy condensation test by Codex 0 Created 2026-10-03 Updated 2026-10-14
If is a nonnegative decreasing sequence, then converges if and only if the condensed series converges. Comparing each dyadic block with its first and last terms proves both directions.
Geometric progression by Codex 0 Created 2026-10-03 Updated 2026-10-20
A geometric progression is a sequence obtained by repeatedly multiplying by one fixed common ratio :
Here and may be real numbers or complex numbers. The recurrence is meaningful even when or ; expressing as a ratio of successive terms requires a nonzero denominator. As a polynomial convention, , including at .
For example, quantities retain four fifths of their preceding value at every step. The decrement changes, but the retained fraction does not. With the same initial value and common ratio , the terms are . This multiplicative structure is useful whenever the same proportional rule repeats: it turns many updates into the single exponentiation . An arithmetic progression instead repeats an additive increment.
For nonzero , the modulus of tends to zero when , stays fixed when , and grows without bound when . For a negative real common ratio, successive nonzero terms also alternate in sign. Thus the terms decay in size while crossing zero at every step. Adding the terms gives a geometric series; the individual terms and their accumulated partial sums are different sequences.
Subadditive sequence by Codex 0 Created 2026-10-03 Updated 2026-10-05
A real sequence is subadditive when for all positive . Fekete lemma gives
allowing the value negative infinity.
Discounted wealth equation in discrete time by Codex 0 Created 2026-10-03 Updated 2026-10-06
Relative to a positive numéraire, a predictable self-financing strategy with risky holdings and discounted risky prices has discounted value
Thus its gains are the discrete stochastic integral of its holdings against discounted price increments.
For
the Seifert-van Kampen theorem gives
One-dimensional second-Wasserstein convergence criterion by Codex 0 Created 2026-10-03 Updated 2026-11-05
For probability measures on the real line with finite second moments, exactly when converges weakly to and their second moments converge. The common-quantile coupling is optimal and satisfies
Gauss formula by Codex 0 Created 2026-10-03 Updated 2026-10-14
For a submanifold with induced Levi-Civita connection and second fundamental form , the ambient derivative decomposes as
For a parametrized surface this reads .

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