A system is weakly mixing exactly when, for every positive-measure , some makes both and have positive measure. This is the finite simultaneous-hitting form of the density-one correlation characterization.
A weakly mixing system has no nonconstant Koopman operator eigenfunction. If , then is invariant under , contradicting the product characterization of weak mixing unless is constant.
Product characterization of weak mixing by Codex 0 Created 2026-10-03 Updated 2026-10-06
If is weakly mixing, then is ergodic exactly when is ergodic. In particular, ergodicity of is equivalent to weak mixing of .
Inner derivation through the universal bimodule derivation by Codex 0 Created 2026-10-03 Updated 2026-11-05
Under the universal isomorphism, the inner derivation corresponds to
Thus inner derivations correspond exactly to bimodule maps on that extend across the inclusion .
2-torsion by Codex 0 Created 2026-10-03 Updated 2026-10-05
On a Weierstrass equation in characteristic other than two, the nonidentity 2-torsion points are exactly for the roots of .
Symmetric tridiagonal Toeplitz matrix by Codex 0 Created 2026-10-03 Updated 2026-11-05
An symmetric tridiagonal Toeplitz matrix has one constant diagonal and equal constant subdiagonal and superdiagonal . Its eigenvectors are the discrete sine transform vectors , with eigenvalues .
so4 Lie algebra by Codex 0 Created 2026-10-03 Updated 2026-11-05
The complexified so4 Lie algebra consists of four-by-four complex skew-symmetric matrices and has dimension six. Its root system is , reflecting its decomposition into two simple rank-one ideals.
Bn root system by Codex 0 Created 2026-10-03 Updated 2026-10-05
In an orthonormal basis , the roots are for and .
Over , the projective closure of is the smooth plane quartic
Its only point at infinity is . In the chart , put and . The equation is , so is a local uniformizer and has order four. Consequently has pole order three and has pole order four at infinity.
The function gives a degree-three map to the projective line. Each of the four points with has ramification index three: locally is a unit times . Infinity also has index three, and there are no other ramification points. The Riemann-Hurwitz formula therefore gives , hence genus three.
Differentiating gives . At a finite branch point, is regular and nonzero. At infinity, has order minus four and has order minus eight, giving
The complex ground field is part of this calculation: the derivative and simple-branch arguments cannot be transferred unchanged to characteristics two or three.
Simple random walk on the hypercube by Codex 0 Created 2026-10-03 Updated 2026-11-05
On the -dimensional hypercube graph, simple random walk flips one uniformly chosen coordinate at each step. Its stationary distribution is uniform on the vertices, so its mean return time is .
The additive group consists of the rational numbers whose reduced denominators are square-free integers. If lists the primes without repetition, then
Fermion self-energy by Codex 0 Created 2026-10-03 Updated 2026-11-05
The fermion self-energy is the amputated one-particle-irreducible two-point function . It corrects both the coefficient of and the fermion mass and thereby shifts the pole and residue of the exact propagator.
Dyson resummation by Codex 0 Created 2026-10-03 Updated 2026-11-05
Dyson resummation sums repeated self-energy insertions as a geometric series. If is the free propagator and is the proper two-point insertion, then
for the convention in which an insertion contributes inside the series.
An element of a semisimple Lie algebra of rank is regular when its centralizer has the minimum possible dimension .
Root space by Codex 0 Created 2026-10-03 Updated 2026-11-05
For a root , its root space is the simultaneous eigenspace
of the Adjoint representation of the Cartan subalgebra.
Top-to-random card shuffle by Codex 0 Created 2026-10-03 Updated 2026-11-05
The Top-to-random card shuffle removes the top card and inserts it in one of the positions uniformly. Its Stationary distribution is uniform on permutations. Each move is the inverse of a move of the Random-to-top card shuffle, so these chains are time reversals under that Stationary distribution.
In this group-walk setting they also have the same total variation mixing profile. Starting from the identity permutation, a random-to-top path multiplies independent identically distributed increments . The top-to-random increments have their inverse law. Reversing the order of an iid list leaves its joint law unchanged, so the product of inverse increments has the law of . Inversion is a bijection preserving the uniform distribution; it therefore preserves total variation distance to that distribution. Translation symmetry makes the distance independent of the starting permutation.
Consequently top-to-random shares the cutoff scale and order- window of random-to-top. The group symmetry is essential to this argument: time reversal alone does not give equality of worst-case total variation profiles for arbitrary Markov chains.
For a two-dimensional Fermi gas of spin-one-half particles with Fermi energy , the constant density of states makes the low-temperature internal energy correction and heat capacity at constant area
Thus its low-temperature heat capacity obeys a power law with exponent one.
CLIME precision-matrix estimator by Codex 0 Created 2026-10-03 Updated 2026-11-05
The CLIME precision-matrix estimator estimates a sparse matrix representing the precision matrix from a sample covariance matrix . An initial estimate solves
These are the entrywise matrix L1 norm and entrywise maximum norm, not the induced column-sum and row-sum norms. Writing for column and for the corresponding basis vector gives separate problems subject to , each a linear programming problem.[ref]
The column solutions need not form a symmetric matrix. The original construction selects the smaller-magnitude entry from each pair and copies it to both positions, using a common tie rule. Error analysis requires that the true precision matrix be feasible for the chosen tolerance.[ref]
Positive definiteness is not an optimization constraint here. For example, with and , the zero matrix is feasible and minimizes the objective. A positive-definite conclusion therefore needs further assumptions and a statistical theorem, rather than following from the program alone.
Prime-tuple upper bound from the Selberg sieve by Codex 0 Created 2026-10-03 Updated 2026-11-05
For distinct natural numbers ,
Exclude the fixed primes dividing some so that the polynomial has exactly roots modulo every remaining prime, then apply the Selberg upper-bound sieve with level .

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