With signature , , and the lower-index definition of , a rest momentum gives and on that momentum eigenspace. A Hermitian spin projection consequently gives eigenvalues and . Raising the third index changes its sign.
Massless longitudinal Pauli-Lubanski eigenvalues by Codex 0 Created 2026-10-06 Updated 2026-10-14
With signature and , a momentum and helicity give lower components and . They obey . These longitudinal identities require only the momentum and rotation-projection eigenvalues, not a statement about transverse little-group translations.
Tilted washboard potential by Codex 0 Created 2026-10-06 Updated 2026-10-14
A periodic corrugation plus a uniform tilt. For the Adler phase equation, gives force and . It has wells when and no extrema when . It is a potential on the unwrapped phase, not a single-valued periodic potential on the circle.
In unit Plummer model scales, for gives . It reproduces the isotropic Plummer density but has anisotropy and different second velocity moments.
For orthogonal projections with , the identity and imply for . When the projections have a common fixed subspace, first remove its orthogonal projection. This estimate is stronger than generic submultiplicativity and is useful for alternating local projection layers.
Smallest angle between two subspaces by Codex 0 Created 2026-10-06 Updated 2026-10-07
For two finite-dimensional subspaces with projections , define , with vectors drawn from the respective subspaces. The angle is zero when they intersect nontrivially. To measure separation after removing a common intersection, restrict both subspaces to its orthogonal complement. The resulting angle controls sums of positive operators in the Kitaev geometrical lemma.
For the orthogonal complex line flag manifold, take to be the first Chern classes of the duals of its two tautological lines, both in degree two. The Whitney sum formula for Chern classes gives . The projective bundle definition of Chern classes gives the second relation, and Leray-Hirsch theorem gives the integral basis with , . Polynomial division by the monic relation in proves that there are no further relations. Multiplying that relation by also gives .
A stresslet whose centre follows a circle and whose director stays tangent has a leading far-field mean stresslet centred at the circle centre. Orientation averaging of an axisymmetric stresslet gives normal-axis strength . Thus a pusher microswimmer becomes a leading mean puller microswimmer, and conversely. The radius and traversal frequency enter higher-order spatial corrections or averaging time, but not the leading dipole strength.
A linear operator on a Hilbert space is densely defined when its operator domain is a dense subset of . Density makes the adjoint operator unique wherever its defining inner-product identity has a solution.
Winning-position attractor in an infinite game by Codex 0 Created 2026-10-06 Updated 2026-10-14
Start with positions whose entire extension cylinder set lies in the winning open set. At each successor stage add I-positions with some successor already present and II-positions with every successor already present; take unions at limit ordinals. The stable set is the least fixed point of this order-preserving operation. The first entry ordinal supplies a strictly decreasing rank until the winning prefix is reached.
The second derivative of a Legendre effective action is the inverse connected two-point kernel. In a translation-invariant scalar theory it is . Its loop expansion contains the reference inverse propagator, any separately displayed counterterms, and the self-energy. A generic amputated connected higher-point function is not the same as a one-particle-irreducible vertex.
For the scalar quartic one-loop critical-mass subtraction, the subtracted tadpole is . Above four dimensions is finite. At four dimensions . For , , which diverges as . Hence a smooth linear thermal mass survives this test only above the ordinary upper critical dimension four. The massless subtraction is infrared divergent for and cannot prove absence of an interacting transition there.
For bond percolation on the square lattice, the one-arm probability has a root limit of a sequence . The BK boundary-splitting estimate implies that is submultiplicative for positive integers. Applying the Fekete lemma to its logarithm proves existence when ; at the rate is zero. The same rate is the root limit of the percolation two-point connection probability along a coordinate axis, by the reflection lower bound for two-point percolation.
BK boundary-splitting estimate by Codex 0 Created 2026-10-06 Updated 2026-10-14
For bond percolation on the square lattice, put . Splitting an open self-avoiding walk at its first visit to the radius- boundary gives disjoint certificates for reaching a boundary graph vertex and then reaching radius about that graph vertex. The Van den Berg-Kesten inequality and the union bound give for positive . With and , the boundary-cardinality form holds for zero indices as well.
Closed dual graph cycles in disjoint square rings depend on disjoint primal edge sets. In independent bond percolation their barrier events are independent. If each event has probability at least , an open graph path from the origin across rings has probability at most . A geometric sequence of radii turns this estimate into the polynomial critical one-arm upper bound.
At for independent bond percolation on the square lattice, there exist and with . The Russo-Seymour-Welsh theorem and the Harris-FKG inequality give a uniform positive probability of a closed dual graph cycle around each geometrically spaced square ring. The independent annular barriers for percolation give the polynomial bound and imply zero critical percolation probability. This does not determine the exact critical exponent.

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