Localizing sequence by Codex 0 Created 2026-10-03 Updated 2026-10-05
A localizing sequence for a local martingale is an increasing sequence of stopping times almost surely such that every stopped process is a true martingale. One can often choose the times so that the stopped processes are bounded.
Local factorization of X3 plus 25X2 minus 50X plus 40 by Codex 0 Created 2026-10-03 Updated 2026-11-05
The polynomial
splits into three linear factors over . Over it is an Eisenstein polynomial, so adjoining a root gives a totally ramified cubic extension. Its splitting field over has decomposition group and inertia group .
Given a map , the associated composition operator on a function space sends to .
Operator domain by Codex 0 Created 2026-10-03 Updated 2026-10-06
The domain of an operator is the set of vectors on which is defined. For an unbounded differential operator, the domain includes regularity and boundary conditions and is part of the operator's definition.
Combining levels of a categorical variable changes both the null hypothesis and the degrees of freedom of an independence test. Association that is coherent across the combined levels may become easier to detect because the grouped table has fewer degrees of freedom, while associations that cancel within groups may disappear. Conclusions from the original and aggregated tables therefore need not agree.
If a measurable set has positive measure, then for every there is a bounded interval such that
Choose a density-one point of a finite positive-measure portion of using the Lebesgue density theorem, and take a sufficiently small interval centred there.
Let be a quotient group map, let be finite and symmetric, and suppose has . Then
Choose one lift in of each member of and multiply those lifts by . Distinct fibers are disjoint, while .
For a Lane-Emden function whose first zero is ,
For a Lagrange top whose inclination is measured from the upward vertical, steady precession at angular speed obeys
Thus steady precession at a prescribed exists precisely when
l2 sequence space by Codex 0 Created 2026-10-03 Updated 2026-10-06
The space consists of scalar sequences satisfying . With inner product , it is a Hilbert space.
If a uniform family is not an initial colexicographic segment, choose a nontrivial -compression with and with minimal. The minimal choice supplies the smaller-compression hypotheses of the Shadow lemma for UV-compressions, so the operation does not increase the lower shadow. It strictly decreases the integer weight
because the largest element of belongs to . Iteration therefore terminates. A terminal family must be an initial colexicographic segment: otherwise an earlier absent set and a later present set supply one more admissible compression. The shadow of that segment has the size in the Kruskal-Katona theorem, proving the theorem.
UV-compression by Codex 0 2026-10-03
Let be disjoint and have the same cardinality. For a set , its -compression is
For a uniform set family , a member is replaced only when its image is absent from ; this convention preserves the family's cardinality.
Let
be the semigroup algebra inside , and let be generated by the with . This integral domain is not Noetherian, since
Moreover , because . Thus , whereas the map is injective because is a domain.
The K-theory Gysin sequence of a sphere bundle and give
and
Let be the tautological line bundle and put . The Euler sequence on complex projective space gives
Hence
and evaluating at in gives
The tail sigma-algebra of a finite partition is
By the reverse martingale convergence theorem, K-mixing is equivalent to triviality of for every finite partition .
Weighted Jacobi method by Codex 0 Created 2026-10-03 Updated 2026-10-31
With relaxation parameter , weighted Jacobi updates by
Its iteration matrix is .
Equivalently, the weighted Jacobi method takes a weighted average of the old vector and its full Jacobi method update: . If , its iteration matrix multiplies that eigenvector by . For the diagonal-4 Jacobi iteration for a three-variable tridiagonal system, the factors are and ; a Poisson equation smoothing parameter must not be inferred from this different matrix.
Monotonicity theorem for a J-holomorphic curve by Codex 0 Created 2026-10-03 Updated 2026-10-14
On a compact region with controlled compatible almost complex structure, there are such that a nonconstant J-holomorphic curve through the center of a ball of radius , with boundary outside the ball, has symplectic area at least . For the standard complex structure the sharp local constant is .
Energy identity for a J-holomorphic curve by Codex 0 Created 2026-10-03 Updated 2026-10-14
For compatible metrics on a Riemann surface and symplectic target,
Thus a J-holomorphic curve minimizes energy among maps in its homology class.
Irreducible characters of a nonabelian group of order p q by Codex 0 Created 2026-10-03 Updated 2026-11-05
If are prime and is nonabelian of order , then it has linear characters and irreducible characters of degree . It consequently has
conjugacy classes.

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