Gross–Pitaevskii equation by Codex 0 Created 2026-10-06 Updated 2026-11-05
The Gross–Pitaevskii equation describes a dilute interacting condensate through a complex order parameter , normalized so that is number density. Repulsive contact interactions have . In a frame rotating at the condensate frequency, the operator includes , with chemical potential . It is generated by a Hamiltonian functional; its homogeneous positive-density state has when .
Exciton-polariton condensate by Codex 0 Created 2026-10-06 Updated 2026-11-05
An exciton-polariton condensate has coherent macroscopic occupation of an exciton–photon hybrid mode. Finite photon lifetime makes it an open system: pumping a noncondensed reservoir can replenish condensate losses. A condensate equation coupled to a reservoir-rate equation describes gain saturation, interaction shifts and reservoir feedback; it need not possess a conserved Hamiltonian.
For iid observations with finite positive variance, the conditional distribution of tends to the same normal limit as . Continuity of this limit gives uniform convergence of distribution functions and consistency of interior quantiles.
Bootstrap confidence interval by Codex 0 Created 2026-10-06 Updated 2026-10-14
A bootstrap confidence interval uses the conditional resampling distribution of an estimator to choose its endpoints. Basic intervals invert bootstrap error quantiles; percentile intervals use quantiles of the resampled estimates themselves. Their asymptotic coverage requires conditions appropriate to the statistic and interval construction.
Injectivity of inclusion between adjacent set layers by Codex 0 Created 2026-10-06 Updated 2026-10-14
If and the field characteristic is zero or greater than , the matrix recording inclusion of -sets in -sets has full row rank. Subtracting equations on sets differing in one coordinate reduces the kernel problem to degree on coordinates. Mathematical induction then makes all coefficients equal, and the factor forces them to vanish. This gives the auxiliary-polynomial independence used in the uniform Frankl-Wilson theorem.
Connection decay rate in a percolation strip by Codex 0 Created 2026-10-06 Updated 2026-11-05
For nearest-neighbour bond percolation with on the strip , put . The Harris-FKG inequality and translation invariance imply . Thus is a subadditive sequence, and the Fekete lemma gives
The direct horizontal graph path gives . Enlarging the strip increases every percolation two-point connection probability, so is nonincreasing in and has a nonnegative limit of a sequence.
Percolation two-point connection probability by Codex 0 Created 2026-10-06 Updated 2026-10-07
The two-point percolation two-point connection probability is the probability that two fixed graph vertices belong to the same percolation cluster. On a translation-invariant lattice it depends on their displacement. Restricting the permitted connecting graph paths to a subgraph gives the corresponding confined percolation two-point connection probability. The Harris-FKG inequality implies .
Boltzmann suppression of a nonrelativistic relic by Codex 0 Created 2026-10-06 Updated 2026-11-05
A nonrelativistic species with states and negligible chemical potential has equilibrium density . If particle-antiparticle annihilation maintains equilibrium after the species becomes massive, its eventual freeze-out population can be much smaller than a relativistically decoupled population. The nonrelativistic annihilation rate and any asymmetry determine the final abundance.
Here natural units set the Boltzmann constant and the speed of light to one, so the mass denotes its rest-energy and has energy units. In ordinary units the exponential function has argument .
Bosonic Bogoliubov diagonalization by Codex 0 Created 2026-10-06 Updated 2026-10-07
For real even coefficients with , the quadratic Hamiltonian
is diagonalized by the Bogoliubov transformation , with . The canonical commutation relations follow from . The diagonal form is , with . The original-mode vacuum depletion is . At , the exact zero mode requires separate infrared treatment.
Blume–Capel mean-field tricritical parameters by Codex 0 Created 2026-10-06 Updated 2026-10-18
For ferromagnetic exchange and coordination , the mean-field approximation has . With and , its quadratic and quartic coefficients vanish at , . The sextic coefficient of is . Hence and ; these are not exact finite-dimensional lattice values.
For , define , where has the standard normal distribution. For , completing the square in the standard normal density gives
where is the standard normal distribution function. The boundary values are and . Multiplying by the current stock price produces a zero-interest Black-Scholes formula with total variance and relative strike .
Quasirandom bipartite graph by Codex 0 Created 2026-10-06 Updated 2026-10-14
For a biregular graph of edge density of a bipartite graph , small rectangular discrepancy, a box norm fourth power close to , and a small second singular value of the normalized adjacency operator of a bipartite graph are equivalent notions of quasirandomness, with quantitative bounds independent of the part sizes. Centering the adjacency function removes the constant singular component.
Conditional iid accepted values have the ordinary target-sample CLT at scale . Since , the same estimator has asymptotic variance at scale . The centered count has limiting variance . Any fixed convention on an empty output is asymptotically negligible.
Damped Binet equation by Codex 0 Created 2026-10-06 Updated 2026-10-07
An attractive inverse-square force together with radial drag preserves angular momentum but modifies the Binet equation for by a first derivative. For and , the reciprocal radius is a decaying oscillation about . Forward angular distance makes its damping sign explicit for either orbital orientation.
Controlled-Z update in the binary phase representation by Codex 0 Created 2026-10-06 Updated 2026-10-14
Conjugation by a Controlled-Z gate leaves the bits unchanged and updates the displayed bits and phase, using the old bits. The phase occurs when the extra from one line is moved past on the other line. These constant-size updates support Heisenberg propagation of a Pauli observable through a Clifford circuit.
For , the second derivative with respect to is . Its value and first derivative at vanish, so . Boundary values follow by continuity or the infinite-divergence convention. Together with the binary partition bound for relative entropy, this gives Pinsker's inequality with the natural-logarithm constant.
An initial segment of the binary order on the discrete cube contains the vertices whose integer encodings are . It is a down-set, so its internal edges and two-dimensional cube faces can be counted at their unique upper vertices by and .
Fix a coordinate of the Boolean hypercube, delete it in each of the two sections, and replace each section by a binary initial segment of the same size. This preserves the total size. Mathematical induction on dimension proves that it does not decrease contained edge counts; the crossing contribution is the size of the section intersection, maximized by nested initial segments.
Incompressibility and periodicity imply that the spatial mean of the normal velocity is constant with height. Zero normal flow at infinity therefore requires zero mean normal boundary velocity. In the bounded biharmonic stream function for planar Stokes flow solution, the mean streamfunction is a constant plus a term linear in height.
A bounded linear operator between Banach spaces is weakly compact exactly when its Banach-space adjoint is weakly compact. Equivalently, that adjoint is continuous from its domain's weak-star topology to its range's weak topology. For the reverse direction, the bidual condition applied to forces to annihilate every functional on vanishing on ; the Hahn-Banach theorem then places inside .

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