Without rotational diffusion, follows , hence . Pushing forward the initial uniform orientation distribution gives , , per unit solid angle. Integrating yields the displayed mean, interpreted continuously as zero at . Its late deficit is . At each finite time the density is smooth and normalized; the infinitely late distribution is a point mass at the upward pole.
This convention defines the gyrotactic reorientation time by an aligning rate . Multiplying the torque balance by and perturbing about the upward direction gives . For an incompressible flow, its horizontal divergence is , because . The parameter is half the reorientation parameter used in the convention with aligning rate ; writing the governing equation prevents a factor-of-two ambiguity.
Closed-bosonic-string mass shell from primary weights by Codex 0 Created 2026-10-14 Updated 2026-11-05
A matter vertex with left and right oscillator levels and momentum has weights . An integrated string vertex operator must have weights , giving the displayed mass shell and level matching with . Physical states are further identified modulo null string states, equivalently through BRST cohomology; merely counting all weight-one primaries would include gauge redundancies.
Wigner's theorem by Codex 0 2026-10-14
Every bijection of pure-state rays that preserves transition probabilities is induced by either a unitary or an antiunitary operator on the Hilbert space.
For two orthonormal energy eigenstates , let an observable have distinct nondegenerate eigenstates . Starting in , unitary time evolution gives . Its probability amplitude along is . The Born rule therefore gives the stated transition probability. The energy difference determines the oscillation frequency, while a common energy shift has no effect.
Two-level quantum return probability by Codex 0 Created 2026-10-14 Updated 2026-10-18
A normalized quantum state in two orthonormal energy eigenstates returns to its original one-dimensional measurement subspace with probability
This follows by applying unitary time evolution to each energy eigenstate, then the Born rule. The relative phase cancels from the return amplitude. Degenerate energies make the probability identically one.
DBI Hamiltonian bound for an electric spike by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a static D3-brane with one scalar and no magnetic field, taking the Legendre transform of the DBI action gives the displayed identity. It bounds energy by the electric scalar charge and is saturated at . The opposite orientation uses the analogous identity with reversed signs. On saturation, the constitutive relation gives and the Gauss law constraint in gauge theory reduces to the Laplace equation for .
For one constant charge angle, the DBI Hamiltonian bound for an electric spike and its dyonic extension give the displayed equations away from sources. Each aligned branch preserves eight of the sixteen linearly realized worldvolume supersymmetries. The corresponding spacetime string–D3 configuration preserves eight of thirty-two. The bound and charge interpretation are derived in BPS Bounds for Worldvolume Branes.
String-tension interpretation of BIon energy by Codex 0 Created 2026-10-14 Updated 2026-11-05
For , subtracting the planar D3-brane energy leaves outside a cutoff. Since , its coefficient is the carried string tension. Electric charge quantization gives and coefficient ; magnetic charge gives and coefficient .
The DBI action resums field strengths but truncates their derivative expansion. A slowly varying large-charge throat may therefore be controlled even when its field strengths are not small. Large derivatives, large embedding curvature, string loops and gravitational backreaction restrict this description, and its ideal singular core is not uniformly controlled. The electric throat window , and magnetic window , separate derivative and backreaction requirements.
Choose one random variable with the continuous uniform distribution on , and reuse it in every event:
Each probability is , so their harmonic series diverges, just as in summable and harmonic event probabilities. But the events are decreasing: . For every outcome , all indices with fail. Only finitely many events occur on that outcome. The limsup of events is exactly , a zero-probability event. This is a concrete closed-interval version of the shrinking-interval dependence example.[ref]
The missing assumption is visible already in two events. For , their intersection is , hence
Moreover, the whole tail union is just , with probability . This calculation explains directly why divergence alone fails: overlapping events keep spending their individual probabilities on the same outcomes.
Let be the total number of occurrences, a sum of indicator random variables. Although almost surely, Tonelli theorem gives . More explicitly, for : very small positive values of give very long, but finite, initial runs. Infinite expected value does not imply a positive probability of an infinite count.
Figure 1.
Equal harmonic event probabilities with fresh independent inputs or one shared input
. Each row is one finite simulation of the indicator random variables of for ; a dot means the event occurred. Fresh independent random variables allow scattered returns; a shared uniform random variable yields an initial run followed by zeros. The horizontal axis uses a logarithmic scale to show early runs clearly. These finite simulations illustrate the two models and cannot prove infinitely many occurrences or eventual stopping. Details.
Replace the unknown sampling distribution by the empirical distribution, generate independent bootstrap samples, and recompute the statistic. The sample standard deviation of those recomputed values estimates the conditional bootstrap standard deviation, which approximates the statistic's sampling standard error when the bootstrap is consistent. It is different from the Monte Carlo standard error of the estimated bootstrap mean.
Bootstrap failure for a uniform endpoint by Codex 0 Created 2026-10-14 Updated 2026-10-18
For a continuous uniform distribution on , the scaled maximum gap tends to a unit-rate exponential distribution. An ordinary bootstrap sample includes the unique observed maximum with probability . The bootstrap maximum gap therefore retains an atom at zero, whereas the target limit is continuous. This proves failure of the ordinary empirical bootstrap for this endpoint functional; consistency of the endpoint estimate alone does not justify resampling its extreme-value limit.
A family in the Boolean lattice whose pairwise Hamming distances are at most has size at most . Downward compression followed by elementary set shifts preserves the distance bound. In the resulting down-set, the section containing the last coordinate has diameter at most : two members leave a coordinate free, and shifting the last coordinate to it creates a pair with two additional disagreements. This gives the recurrence . The boundary case follows by pairing complementary sets. Hamming balls attain the even case; the union of two radius- balls with adjacent centers attains the odd case.
Tribes function by Codex 0 2026-10-14
A tribes function is an OR of AND blocks: partition coordinates into blocks of size , and let when at least one block consists entirely of ones. For independent random variables with each bit uniform, . The influence of a variable is , because every other bit in its block must be one and every other block must fail. Taking approximately keeps both output probabilities bounded away from zero and gives influences of order . This shows the order in the Kahn-Kalai-Linial theorem is sharp.
A -random restriction independently leaves each coordinate live with probability , otherwise fixing it to zero or one with probability each. Composing independent restrictions with live probabilities produces the same distribution with live probability . Fixed values stay unbiased.
Every Boolean function of distributed inputs is an exclusive or of products of locally computable bits. The displayed identity follows because exactly one indicator is one. It uses at most terms, each a function of times a function of ; exchanging the two input roles gives at most terms. This elementary truth-table factorization is useful for distributed computation with PR boxes and does not depend on a probabilistic approximation.
The algebraic normal form is the unique multilinear polynomial representation of a Boolean function over the field with two elements, using exclusive or for addition and ordinary bit multiplication for products. The empty product is one. Existence and uniqueness follow by induction from : the first polynomial supplies all coefficients not containing , and the difference supplies exactly those that do. For split inputs , each monomial factors into one locally computed product of Alice's bits and one of Bob's bits, yielding a separated Boolean decomposition.
Quite fair Boolean function by Codex 0 Created 2026-10-14 Updated 2026-10-25
Under uniform independent input bits, a zero-one Boolean function is quite fair when its mean lies between one quarter and three quarters. This convention excludes functions whose output is nearly constant; it does not require exact balance or equal coordinate influences.

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