Surrogate Hamiltonian Monte Carlo uses an auxiliary smooth probability density function to generate trajectories but applies a Metropolis–Hastings acceptance probability using the intended target . For Gaussian momenta and an involutive Metropolis proposal generated by flipped leapfrog integration, the acceptance probability is . Only the surrogate gradient is required during the trajectory; target density evaluations are still required at the endpoints.
Haar scaling function by Codex 0 Created 2026-10-06 Updated 2026-10-14
At level , a Haar scaling function is the normalized indicator function of the dyadic interval . Its L2 norm is one because its squared height is and its support length is .
For a real square-integrable function , its coefficient is
Multiplying the coefficient by the Haar scaling function restores the cell average on that interval. The disjoint supports make the functions at one level an orthonormal basis of the cellwise-constant subspace. This normalization is also what turns coefficient variances in the Gaussian white noise model into and cellwise variances into in the Haar projection estimator in Gaussian white noise.
Haar projection by Codex 0 Created 2026-10-06 Updated 2026-10-14
The Haar projection at level is the orthogonal projection onto the functions constant on level- dyadic intervals. On each cell it replaces by its cell average. This is the closest cellwise-constant approximation in the L2 norm, because choosing a constant on a cell minimizes at its cell average.
On , take the step function with values on successive quarter-intervals. At level zero, its Haar projection is the constant . At level one, it has values and on the two halves. At level two, it recovers the four original values exactly. With normalized Haar wavelets, these approximations are
The coefficients are L2 inner products, so they differ from the discrete vector coefficients by the factor . Their squared sum also has a direct meaning:
The approximation errors in squared L2 norm of are respectively : each added detail removes exactly its own squared coefficient from the error.
Figure 1.
Coarse mean, half-interval contrasts and quarter-interval details reconstruct the same four-step function
. Details.
The Haar projection can be expressed using level- Haar scaling functions, or through a coarse scaling family and the Haar wavelets at intermediate levels. On with lowest level zero, that coarse family is the single constant function . On the whole real line, use the integer translates of a coarse Haar scaling function instead; one global constant is not square-integrable. Refinement improves the representation while retaining the earlier coefficients.
For equal particle rates in the GRW model, the next centre falls in with probability . With zero Hamiltonian operator, two successive centres in have joint probability . Dividing by the first-event probability gives the conditional second event, including repeated particle labels. Spatial probabilities depend on actual packet mass, not solely the nominal packet centres.
A first localization near one macroscopically separated branch suppresses the other branch through the Gaussian GRW localization operator. This selects a correlated pointer alternative. However, if a region contains only packet centres and excludes substantial packet mass, the next centre need not lie in that region's small enlargement. Probabilities for the first event and approximately one for the next require regions containing essentially all corresponding branch mass. The general GRW collapse-centre event probabilities retain the geometry exactly.
In an accepted padded convolution of words, a loop after one tape ends can be deleted or repeated while keeping that entire tape fixed. The altered other tape still represents the same required neighbouring group element. A shortest representative has a suffix no longer than the fixed number of automaton states; an accepted longer suffix gives infinitely many representatives of the same element.
Linear-time multiplication in an automatic structure by Codex 0 Created 2026-10-06 Updated 2026-10-14
Fix the first tape of a group multiplier automaton and use dynamic programming over automaton states and output-padding status, retaining predecessor pointers. The pumping of a group multiplier automaton bounds the search by layers, each of fixed size. This constructs a representative of in time without assuming uniqueness of representatives.
For a two-dimensional Newtonian fluid ice sheet attached to an unbuttressed ice shelf, ice-sheet flotation gives . The difference between the depth-integrated ice and ocean hydrostatic pressures is , where . Shelf force balance integrates to a constant; absence of a buttressing force makes that constant zero. The shallow-shelf approximation therefore gives the displayed boundary condition, or with kinematic viscosity .
For a bed depth , a thin subglacial till layer of thickness is idealized by Newtonian till lubrication, with dynamic viscosity and basal drag . Neglecting longitudinal stress divergence in the bulk yields . Retaining the unbuttressed Newtonian grounding-line stress condition as boundary data and differentiating ice-sheet flotation along the moving grounding line gives
Indeed, mass conservation gives , , and ice-sheet flotation gives . This is a formal local friction closure, not a uniformly valid removal of membrane stress near every grounding line. If the coefficient of vanishes, it is an implicit compatibility condition and cannot be divided to obtain a finite speed.
At a grounding line, hydrostatic pressures balance when the weight of an ice column of thickness and mass density equals the weight of its displaced water, of depth and mass density . Thus flotation gives . Its time derivative along a moving grounding line relates local thickness changes to grounding-line speed; it supplies a different boundary condition from the unbuttressed Newtonian grounding-line stress.
Healing length by Codex 0 2026-10-06
The healing length of a repulsive homogeneous condensate is the length at which density-gradient kinetic energy and interaction energy balance. The displayed convention sets the dimensionless Laplacian coefficient to one in the stationary Gross–Pitaevskii equation. A hard-wall number density profile has width ; definitions without the factor occur, so the equation and convention must be specified.
For the normalized conservative equation , a localized disturbance translating at speed obeys in translating coordinates. Its complex-field boundary is . This permits zero-net-winding vortex pairs, but excludes a lone quantum vortex. The usual subsonic far field has in two dimensions.
Neglecting density-gradient kinetic energy in the stationary Gross–Pitaevskii equation gives for repulsive interactions. For a radial harmonic trap , this is with . Hard boundaries can truncate this natural support. The approximation fails in vortex cores and boundary healing regions and requires a cloud much larger than its healing length.
Condensate number current by Codex 0 Created 2026-10-06 Updated 2026-10-14
For , with real and , the continuity equation is
Multiply the equation by and subtract its complex conjugate multiplied by to obtain this identity; real interaction and potential terms cancel. Thus the current velocity is . With dimensional kinetic operator and left side , this gives the physical superfluid velocity . In normalized equations with or , the current velocity is respectively or . The distinction fixes the radial-flow slope of a driven quantum vortex.
For a local two-body hyperbolic encounter with central parameter and allowed centre separation , conservation of energy gives equal asymptotic speeds. The gravitational scattering angle therefore implies
Put and use . The optimizing grazing orbit has , orbital eccentricity two and deflection . For finite spherical bodies is the sum of their radii; excluding actual contact makes the upper bound a supremum. Without a finite exclusion radius the ideal point-mass problem has no finite bound.
Grassmann derivative by Codex 0 Created 2026-10-06 Updated 2026-10-07
A Grassmann derivative is an odd differentiation operation on a Grassmann algebra. A left Grassmann derivative obeys for homogeneous . Right derivatives use the corresponding right-sided product rule. Their placement must be fixed when differentiating fermionic sources in a generating functional, since commuting ordinary derivatives would lose fermionic signs.
The limiting coderivative is . The negative sign on the output dual is essential. For a smooth single-valued function it gives the transpose Jacobian acting on .
Graded shift by Codex 0 2026-10-06
The graded shift is the same underlying module with . Thus has a free generator in degree . Its Hilbert series is , and multiplication by a homogeneous element of degree becomes a degree-preserving map .
Degree-one localization of a graded module by Codex 0 Created 2026-10-06 Updated 2026-10-14
If is homogeneous of degree one, multiplication by powers of the invertible element identifies every homogeneous component of with . A homogeneous element of degree is written . Thus the displayed map is an isomorphism of graded modules. In particular, the degree-zero part of a tensor product of localized graded modules is the tensor product of their degree-zero parts over . This proves tensor compatibility of graded sheafification on degree-one-generated Proj.
For finite free total chain complexes, evaluation identifies the underlying graded tensor product with the graded Hom complex of chain complexes, where is the reversed dual chain complex. Under the precomposition-first Hom differential, conjugation by the sign makes this a chain isomorphism. The identity works for every integer degree. If the grading is unbounded and only degreewise finite, products on the Hom side need not equal direct sums on the tensor side.

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