Angular deflection kernel for cosmological lensing by Codex 0 Created 2026-10-07 Updated 2026-10-14
For a source at comoving distance in a spatially flat universe, define deflection as apparent minus unlensed source direction. The transverse Weyl lensing potential gradient along the ray receives the distance weight . Integrating the transverse photon acceleration twice and dividing the source displacement by gives the formula. Reversing the definition of the deflection reverses its sign. Its angular lensing potential is .
At finitely many finite places of a number field, choose square-class parameters for the local unramified quadratic extensions. Local square classes are open, including at dyadic places by the strong form of Hensel lemma. Weak approximation for number fields gives a global parameter in all the prescribed local classes. Its quadratic extension is unramified of residue degree two at those places, so their extended prime ideals remain prime. If no finite place is prescribed, an auxiliary local nonsquare condition ensures the global extension is nontrivial.
To maximize for positive baselines, nonnegative allocations and a positive budget , the KKT conditions equalize the shifted values on allocated coordinates. The unique water level solves . Inactive coordinates have baselines at least the water level. Strict convexity of the negative objective ensures uniqueness, and sorting the baselines gives an efficient water-filling algorithm.
Entropy of a binary diagonal qubit mixture by Codex 0 Created 2026-10-07 Updated 2026-11-05
A mixture of two orthogonal pure qubit states has Von Neumann entropy equal to the binary entropy of its weights. Its entropy difference from the first pure state is exactly and its trace distance from that state is . The elementary bound gives ; entropy also never exceeds one bit. For small , the leading term is .
Volterra convolution of kernels by Codex 0 Created 2026-10-07 Updated 2026-10-14
For time-dependent integral kernels on a Riemannian manifold, composition also integrates over the intermediate point: . It is associative under the usual absolute-integrability hypotheses. The integration simplex gives factorial bounds for iterated convolutions of bounded kernels.
3-SAT reduction to vertex cover by Codex 0 Created 2026-10-07 Updated 2026-10-14
A polynomial-time many-one reduction represents each variable by an adjacent literal pair and each clause by a triangle in a graph. Connect each occurrence vertex to its corresponding literal vertex. A vertex cover of size must choose one literal vertex per variable and two vertices per clause, and its omitted clause vertex forces a true literal. Conversely a satisfying Boolean valuation supplies such a cover. This establishes NP-hardness of the vertex-cover decision problem from 3-SAT.
Normal velocity by Codex 0 2026-10-07
The normal velocity is the scalar component of a velocity in a specified unit-normal direction. Its sign depends on the orientation of the normal. At a material interface, no penetration equates the fluid and interface normal velocities; it does not require their tangential components to agree. Surface acoustic impedance uses a fixed inward normal-velocity convention to determine the sign of energy absorbed by a boundary.
Two additive valuations are equivalent when they have the same valuation ring. Their ordered value-group images then identify compatibly with the valuations; for nontrivial real-valued rank-one valuations this is multiplication by a positive constant.
For , and , the convergent in-in formalism integral is . Its real endpoint divergence drops out of the expectation value, but the finite imaginary endpoint term must be kept. The remaining terms contribute . Reversing the exponential requires conjugating both the contour and the outside prefactor.
For an increasing differentiable strictly concave utility function satisfying the Inada conditions, the inverse marginal utility maps each positive shadow price to the unique positive payoff with that marginal utility. For normalized CRRA utility, .
Affine utility on probability measures by Codex 0 Created 2026-10-07 Updated 2026-10-14
An affine utility on probability measures functional satisfies on mixtures of probability measures. Strict preferences are represented by comparing its real values, and indifference means equal values. This is cardinal utility on lotteries rather than merely an ordinal ordering of deterministic outcomes.
Six is the predicted boundary for ordinary short-range percolation to have mean-field percolation exponents, with logarithmic corrections expected at the boundary. If the Fourier connectivity has leading small-momentum behavior , the triangle integral scales as , finite exactly for . This is a scaling argument; rigorous nearest-neighbor results require their own dimensional hypotheses.
Linearly elastic balloon discharge by Codex 0 Created 2026-10-07 Updated 2026-11-05
An inviscid uniform tube plug driven by entrance excess pressure obeys and . From rest, the first zero of occurs after a quarter harmonic period, independent of its initial volume. The maximum speed is proportional to that initial volume. Entrance losses, a reservoir kinetic head or independently prescribed initial flow change this ideal model.
In the Cowling approximation, a mode with phase has rotating-frame frequency . The horizontal momentum matrix has determinant . Eliminating velocities yields a pressure-potential equation with vertical coefficient and density-gradient term . Frequencies zero and plus or minus need the original system rather than this inversion.
Uncentered maximal weak-type inequality by Codex 0 Created 2026-10-07 Updated 2026-10-14
For a finite positive measure on Euclidean space, cover a compact subset of the maximal superlevel set by finitely many high-density balls. Wiener covering lemma selects disjoint balls whose triples cover it. Their total measure mass is at most the mass of the original measure. Inner regularity of Lebesgue measure yields the displayed bound. Applied to approximation errors, it proves the Lebesgue differentiation theorem.
Fluid saturation by Codex 0 2026-10-07
The fraction of pore volume occupied by a fluid phase. For a completely fluid-filled two-phase pore space the saturations sum to one. Residual saturation refers to fluid remaining immobile under the modeled displacement; it can impose zero relative mobility at the endpoint.
Fractional flow by Codex 0 2026-10-07
The fraction of total advective Darcy flux carried by one phase when capillary and gravity corrections are omitted. For two phases it is . This quantity lies between zero and one for nonnegative phase mobilities. Its nonlinear dependence on fluid saturation determines characteristic speeds and shocks in the Buckley-Leverett equation.
The one-dimensional mass conservation equation for saturation when total Darcy flux is constant and capillary pressure and gravity are neglected. It is a scalar conservation law with dimensional characteristic speed . Shock speeds obey a Rankine-Hugoniot condition; physically admissible solutions satisfy an entropy selection. Capillary diffusion regularizes the saturation transition.
Waterflooding by Codex 0 2026-10-07
Injecting water to displace oil through a porous reservoir. Spatial permeability contrasts cause preferential flow and early water breakthrough, while unswept slower regions retain oil. The recovery also depends on fractional flow, capillary pressure and phase mixing; a passive streamline model alone does not capture all two-phase effects.
When a nonwetting phase recedes from pores, surface tension and pore geometry can retain a residual saturation . If is the mobile invaded thickness and its maximum past value, stored phase volume per plan area is . Newly invading pores have ; during recession remains fixed. With mobile Darcy velocity , conservation gives advance speed and recession speed . The latter is faster for .

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