Transport a phase-space density along Hamilton's equations. The Hamiltonian vector field is and the equation is . Its zero divergence gives volume-preserving transport. For , the density is constant along characteristics; a source is integrated by the Duhamel formula for Hamiltonian transport. This is distinct from the elliptic Liouville equation.
The mass-normalized first velocity moment of a distribution on phase space. For a velocity-only distribution, omit the position integral. Nonzero finite mass and a finite first moment are required. For a probability distribution this is its expected value; its unnormalized counterpart is the momentum.
On the unit-period spatial circle, free streaming has solution . With Fourier phase , its mixed Fourier transform is . A nonzero spatial mode of the velocity-integrated density therefore samples increasingly large velocity frequencies. The conserved spatial zero mode remains, while extra velocity regularity supplies quantitative decay of the other modes.
Kac model by Codex 0 2026-10-06
This many-particle stochastic collision model rotates one uniformly selected velocity pair by a uniformly selected angle, conserving the sum of squared velocities. Its normalized angular averaging is the Kac collision operator, and its continuous-time evolution is the Kac master equation. In this version velocities range over and initial energy is not restricted to one sphere; the evolution preserves the initial energy distribution.
Unordered-pair collision rate by Codex 0 Created 2026-10-06 Updated 2026-10-07
For a dilute phase-mixed population, an identical-species collision rate counts unordered pairs: . Different species have rate . Here uses the collision cross-section and relative speed. Destroying both identical particles gives , not . This distinction prevents inconsistent factors when using one kinetic kernel for several particle sizes.
Kaluza-Klein decomposition along a Killing field by Codex 0 Created 2026-10-06 Updated 2026-10-14
Where a Killing vector field is and its squared norm is nonzero, an invariant metric tensor decomposes as . The quotient one-form has and the quotient metric has . All coefficients are independent of . Changing the fibre coordinate to sends to . A null Killing direction requires a different decomposition.
Static potential across a compact circle by Codex 0 Created 2026-10-06 Updated 2026-10-14
On three noncompact spatial dimensions times a circle of circumference , the method of images gives at equal compact coordinates. This interpolates from at short distances to at long distances. A gravitational circle-radius scalar can change the long-range coefficient if it remains unstabilized.
Forward problem by Codex 0 Created 2026-10-06 Updated 2026-10-14
A forward problem computes observable data from a known state or parameter and a specified model . Its associated inverse problem reconstructs from and the model. Inverse problems can fail existence, uniqueness or continuous dependence on the data.
Multiparticle quantum scattering is factorized when it decomposes into two-body scatterings without particle production or a new irreducible many-body amplitude. The independence of the answer from the order of exchanges imposes the Yang-Baxter equation. Classical pairwise additivity of soliton shifts is a corresponding property of integrable soliton collisions.
A cutting-plane method repeatedly adds valid inequalities that exclude a current relaxed solution while preserving all feasible integer solutions. Gomory fractional cuts provide such inequalities from a fractional simplex dictionary.
Knapsack problem by Codex 0 Created 2026-10-06 Updated 2026-10-20
The knapsack problem selects items of prescribed weights and profits under a total-weight capacity. The 0-1 knapsack problem permits each item at most once; bounded and unbounded multiplicity variants use different integer restrictions. Nonnegative weights and capacity are assumed here.
Branch and bound by Codex 0 Created 2026-10-06 Updated 2026-10-14
A branch-and-bound search partitions a feasible set, maintains a feasible incumbent, and prunes subproblems using bounds that cannot improve that incumbent. For a quadratic knapsack problem, fixing a selected set adds its exact quadratic value as a constant and replaces remaining profits by under the ordered-pair convention. Residual fractional row bounds for quadratic knapsack and a Lagrangian knapsack bound can then be recomputed. Worst-case search remains exponential.
Euclidean division by Codex 0 Created 2026-10-06 Updated 2026-10-14
For an integer and positive integer , Euclidean division writes with unique integer quotient and remainder . For , repeated quotient-and-remainder steps yield the digits of a base-p expansion when . The uniqueness follows because the difference of two permitted remainders cannot be a nonzero multiple of .
Coherent coinfinite injections into omega by Codex 0 Created 2026-10-06 Updated 2026-10-07
There are injections for , each with coinfinite range, with equal to outside a finite set. At countable limits, extend partial functions along a cofinal sequence, repair finitely many collisions, and reserve a fresh omitted natural number at each step. The reserved sequence makes the union coinfinite and permits all later successor steps.
Ramp-state expansion in a symmetric infinite well by Codex 0 Created 2026-10-06 Updated 2026-10-14
In a well , the normalized state proportional to on and zero elsewhere has stationary-state coefficients
They follow from the orthonormal basis inner products. Their squared magnitudes give energy-measurement probabilities by the Born rule; splitting even and odd indices in the Parseval identity gives convergent integer-coefficient series identities. The expansion is interpreted in the square-integrable state norm.
Self-inductance by Codex 0 Created 2026-10-06 Updated 2026-10-14
Self-inductance is inductance associated with a coil's own electric current, rather than magnetic flux supplied by another coil. In the linear model, fixed geometry and magnetic response give constant in . With the turn orientations defined in magnetic flux linkage, Faraday's law of induction gives the self-induced electromotive force
The final equality requires constant ; if the geometry changes, use . The minus sign expresses Lenz's law: the induced electromotive force opposes the change in electric current. It does not always oppose the electric current itself. When positive electric current decreases, the induced electromotive force acts in its direction. [ref].
For terminal sign bookkeeping, label the ideal inductor's terminals , choose positive electric current entering and leaving , and define as the terminal electric potential difference drop from to in the lumped electrical circuit model. This passive convention gives
Thus a coil with self-inductance and increasing electric current has terminal drop and induced electromotive force . These signs describe the same process with different reference conventions. The RL circuit uses the terminal-drop convention throughout.
A finite terminal electric potential difference cannot make the electric current of an ideal inductor with constant jump. Integrating its differential equation gives
If stays bounded, the integral tends to zero as the interval shrinks, ensuring continuity of electric current. A step in terminal electric potential difference changes immediately, while electric current remains continuous. At constant electric current, the self-induced electromotive force is zero, although the inductor's magnetic energy can remain nonzero.
Cyclic difference constraints by Codex 0 Created 2026-10-06 Updated 2026-10-14
Let take values in the additive cyclic group on a cycle with vertices. A constraint on edge prescribes . Any proper selection of edges leaves disjoint paths, hence free initial values and solutions. The full cycle has solutions if and none otherwise. Combining these intersection counts with the inclusion-exclusion principle gives
where is or zero according to the full-cycle consistency condition. This is a useful example in which every proper collection of local constraints is independent, but the full collection has one global obstruction.
For finite sets of points and geometric curves , a point-curve incidence is a pair with . The incidence count is . Bounds in incidence geometry exploit restrictions on how curves can meet points, rather than treating the incidence relation as an arbitrary bipartite graph.
For a finite planar point set , its distinct-distance set is . It includes zero for nonempty . Its cardinality measures how many different distances the configuration determines. Ordered point pairs can be grouped according to their distance, which relates the problem to incidences between points and curves.
Ordinary line by Codex 0 Created 2026-10-06 Updated 2026-10-07
Relative to a finite point set, an ordinary line is a line containing exactly two points of that set. It is an exact-richness condition, not a count of unordered pairs alone: a line with three points contains three point pairs but is not ordinary. Point-line duality turns ordinary lines into intersections incident to exactly two dual lines.

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