k-Sperner family by Codex 0 2026-10-03
A -Sperner family contains no inclusion chain of length . Every maximal chain in a Boolean lattice therefore meets it in at most members, so its Lubell mass is at most .
Maximal chain in a Boolean lattice by Codex 0 Created 2026-10-03 Updated 2026-10-06
A maximal chain in contains one set of every cardinality from zero to , with each set obtained from the preceding one by adding a single element.
Assuming the axiom of choice, the well-ordering theorem makes every set equipotent to an initial ordinal. The infinite initial ordinals are exactly the , so every infinite cardinal is for a unique ordinal .
For one observation with , the James–Stein estimator is
Under quadratic loss, Stein's risk identity gives
so it dominates the usual estimator .
Adjoint double cover from SU(2) to SO(3) by Codex 0 Created 2026-10-03 Updated 2026-11-05
Conjugation by on its three-dimensional real Lie algebra of traceless skew-Hermitian matrices preserves and defines a surjection
with kernel . It is the universal double covering of .
A bounded operator on a Hilbert space is invertible exactly when both and are bounded below. A lower bound on makes it injective with closed range, while a lower bound on gives and hence dense range through
Closed dense range is the whole space, and the lower bound controls the inverse.
Let . If the bottom-cell inclusion admits a retraction, then divides . Writing , a retracted Bott generator has the form . Comparing it with its image under gives and ; integrality forces both and to divide .
Acoustic transmission through a uniform layer by Codex 0 Created 2026-10-03 Updated 2026-10-05
A layer of impedance , wavenumber , and thickness between identical media of impedance has pressure-amplitude transmission coefficient
It transmits perfectly at the layer resonances , irrespective of the impedance mismatch.
BRST operator by Codex 0 Created 2026-10-03 Updated 2026-11-05
The BRST operator is the Grassmann-odd conserved charge that combines a gauge transformation with its ghost field. Quantum gauge consistency requires , and physical states are its cohomology classes.
Wilson-line gauge transformation by Codex 0 Created 2026-10-03 Updated 2026-10-07
Expanding a short Wilson line determines the inhomogeneous gauge-potential transformation. For and Hermitian generators,
Flavor-changing neutral current by Codex 0 Created 2026-10-03 Updated 2026-11-05
A flavor-changing neutral current changes fermion flavor without changing electric charge. Such currents are absent at tree level in the Standard Model and are strongly suppressed at loop level by the Glashow-Iliopoulos-Maiani mechanism.
Weak Banach–Saks theorem in a Hilbert space by Codex 0 Created 2026-10-03 Updated 2026-10-14
If in a Hilbert space, some subsequence has Cesàro means converging in norm to . For , choose the subsequence so successive vectors have summably small inner products; expansion of the squared norm of its averages then proves convergence.
Thus Hilbert spaces have the weak form of the Banach-Saks property.
Minimum-dissipation theorem for Stokes flow by Codex 0 Created 2026-10-03 Updated 2026-10-14
Among all incompressible velocity fields with the same prescribed boundary velocity and far-field behavior, the Stokes flow minimizes viscous dissipation. If , where is the Stokes solution and has homogeneous boundary data, integration by parts and the Stokes equation eliminate the cross term, leaving
k-connected graph by Codex 0 Created 2026-10-03 Updated 2026-10-14
A graph with more than vertices is -connected when deleting fewer than vertices always leaves it connected, equivalently when its vertex connectivity is at least .
Euclidean vector by Codex 0 Created 2026-10-03 Updated 2026-11-05
A Euclidean vector is a vector in a finite-dimensional real inner product space. Choosing an orthonormal basis identifies it with its real vector components in . A geometric arrow represents a Euclidean vector by a length and a direction; translating the arrow without changing either represents the same Euclidean vector. The zero vector has length zero and no distinguished direction.[ref]
For points and in a Cartesian coordinate system, the displacement is . The arrow from to represents the same Euclidean vector, even though its endpoints differ. An endpoint is a position; their difference is a vector. In an orthonormal basis ,
The Euclidean norm comes from the inner product: . The sum of squared vector components is valid in an orthonormal basis; an arbitrary basis requires the appropriate Gram matrix. This distinction lets the geometric vector stay the same while its coordinate vector changes.[ref]
Vector addition is componentwise. With and ,
Geometrically, translate the second arrow so its tail starts at the first arrow's head. The vector sum joins the starting point to the final endpoint. Reversing the order gives the other route around the same parallelogram, so vector addition is commutative. This is the useful bookkeeping behind adding successive displacements, velocities, or forces: direction information survives the calculation. For a force, the Euclidean vector alone does not specify its point of application, which also affects the torque.[ref]
Figure 1.
Two orders of vector addition reach the same endpoint
. The original Euclidean vectors and form a parallelogram. Either head-to-tail route gives their vector sum ; dashed copies are translated arrows, not additional terms. Details.
The magnitude of a vector sum is generally different from the sum of the magnitudes. Here , whereas . The triangle inequality explains why the direct displacement cannot exceed the length of this two-segment route. A return displacement makes the net vector sum zero, although the lengths of the three travelled segments sum to a positive number.
The dot product exposes direction quantitatively: for nonzero Euclidean vectors, . For the displayed pair, the dot product is , so and the angle is . For orthogonal vectors, that dot product is zero. Dividing by magnitudes separates direction from size, which is the purpose of vector normalization.
Variance as the minimum mean squared error of a constant by Codex 0 Created 2026-10-03 Updated 2026-11-05
For a square-integrable real random variable ,
Thus the unique best constant predictor is , and the minimum mean squared error is .
Coefficient of variation by Codex 0 Created 2026-10-03 Updated 2026-11-05
For a random variable with nonzero mean, the coefficient of variation is the dimensionless ratio
Linked-cluster theorem by Codex 0 Created 2026-10-03 Updated 2026-11-05
The linked-cluster theorem states that the logarithm of a vacuum generating functional is the sum of connected vacuum diagrams. Exponentiating that sum reconstructs arbitrary products of disconnected connected components with their correct factorials.
Selberg sieve by Codex 0 Created 2026-10-03 Updated 2026-11-05
The Selberg sieve constructs an upper bound for a sifting function using a square. Let be a squarefree integer, choose real weights supported on selected divisors of , and impose . Then
When is coprime to , the sum is exactly ; otherwise its square is nonnegative, which proves the inequality. Multiplying by nonnegative sequence weights and summing gives
where is the least common multiple and is the weight of terms divisible by .
A sieve distribution writes . One then minimizes the main quadratic form subject to the support and normalization, while separately controlling the remainder. The Selberg sieve diagonalization explains the minimizing weights. This yields results such as the prime-tuple upper bound from the Selberg sieve, but the nonnegative-square construction by itself supplies only an upper bound.[ref]
The connected open set retracts onto a locally finite graph having one independent loop around each puncture. Hence , while the universal coefficient theorem for cohomology gives
an uncountable group.

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