Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A wetting liquid penetrates pore space under a pressure difference that includes capillary suction. With a planar front, fixed pressure drop and negligible gravity/inertia, Darcy's law and pore-volume storage give . The front pressure must be defined relative to the gas phase consistently; adding a positive suction to the inlet pressure is different from prescribing a positive liquid front pressure.
Without transverse exchange, a particle chosen uniformly from pore volume samples each streamline's transit time with resident-volume weight. This differs from the flux-weighted residence time in a porous layer, which samples at the inlet proportionally to . For constant porosity and a linear positive velocity , the two means are and , respectively. Their limits agree for uniform velocity.
For a nonzero multivariate polynomial of total degree over a field, and a finite subset of that field, at most points of are zeros. For one variable this is the root bound for a polynomial. If , the bound is already trivial. Otherwise, in the inductive proof write the polynomial as degree in its last variable, with a nonzero leading coefficient of degree at most in the other variables. The leading coefficient vanishes on at most fibers; outside those fibers there are at most roots of a polynomial per fiber. Counting the bad fibers with the trivial bound gives the asserted inequality.
Suppose every point of lies on an affine line in a vector space meeting a subset in at least points, with . A smaller would admit a nonzero multivariate polynomial of total degree at most vanishing on it, by the dimension of a bounded-total-degree polynomial space. Each selected line then has more roots of a polynomial than the degree of its restriction, so the polynomial vanishes at every point. The Schwartz-Zippel lemma forbids this because . Thus the displayed bound holds, and is at least . This is a point-covering condition; the finite-field Kakeya set condition instead quantifies over directions.
An asteroid is a small rocky or metallic body orbiting a star. Asteroid dynamics can involve mean-motion resonances, planetary scattering and secular perturbations. Solar-system asteroids illustrate how phase protection can prevent close encounters even when orbital paths approach a planet.
For the orthonormal coframe of a planar warped spacetime, Cartan's first structure equation gives and , where and . All other connection 1-forms vanish. Cartan's second structure equation gives and for . Lowering the first index makes both the connection 1-forms and the curvature 2-forms antisymmetric. Contraction yields , , and .
For a real on shell photon of null momentum , a physical polarization satisfies and is defined modulo . The two-dimensional quotient carries the two physical photon helicities. In a transverse gauge choose and . A Ward identity ensures that replacing an external polarization by its momentum gives zero in the summed physical amplitude.
Absorption of an ionizing photon leaves energy in a photoelectron above the binding energy. Thermalization supplies heat to the gas. Photoionization heating competes with the astrophysical cooling function, can establish thermal equilibrium, and can raise the pressure enough to inhibit baryon accretion into shallow dark-matter haloes.
A cyclic ordering of a finite ground set records its elements around an oriented circle, identifying permutations that differ by rotation. There are such orderings for . A uniformly random permutation induces a uniformly random cyclic ordering.
Thermokarst is subsidence and related landscape change caused by thaw of ice-rich permafrost. Resulting lakes and saturated sediments can promote methanogenesis.
A Gaussian auxiliary-field identity replacing a quadratic expression in a composite field by a linear coupling to a new field. Completing the square in yields an exponential after integrating , with normalized Gaussian prefactors. It converts suitable quartic field interactions into bilinear couplings and permits fermionic fields to be integrated out.
A quadratic path integral becomes a product of Gaussian integrals after diagonalizing its fluctuation operator. One real coordinate per mode gives an inverse square root of the functional determinant; one complex coordinate, or two real coordinates, gives its inverse. A regulator and normalization are essential: determinant ratios are often meaningful before an absolute determinant is defined.
For a Hamiltonian operator with kinetic term , insert position-basis resolutions between Trotter product formula factors. The measure is the limit of , and the exponent contains . Its continuum notation is , with fixed endpoint values. A damping prescription defines the oscillatory limit.
For a radiation-filled expanding universe with and no cosmological constant, set . The particle horizon radial proper distance is . An inverse-hyperbolic-sine antiderivative gives the formula. The spatially flat limit is ; radial proper distance is distinct from the area radius of the corresponding horizon sphere.
The Pareto frontier consists of feasible payoff vectors that no other feasible vector weakly improves in every coordinate and strictly improves in at least one. A Nash bargaining solution with positive gains lies on this frontier, because increasing either gain without decreasing the other raises its Nash product.
Angular momentum of a homogeneous harmonic polynomial by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For a homogeneous harmonic polynomial of degree in three dimensions, the Euler theorem for homogeneous functions gives , where . The orbital angular momentum identity therefore gives . This constructs angular momentum eigenstates directly from polynomials.
A stochastic control problem chooses an admissible control input using information available in a filtration to optimize an expected objective for a random dynamical system. Dynamic programming often characterizes its value function through a Hamilton-Jacobi-Bellman equation.
Interval bisection solves a target equation by repeatedly halving a closed interval known to contain a solution. It is the bisection method applied to , so the target becomes a zero of a function. This reduction from an equation to root finding is described in Demanet's notes.[ref]
https://ocw.mit.edu/courses/18-330-introduction-to-numerical-analysis-spring-2012/5b325bfa56a599794c7196de926844b0_MIT18_330S12_Chapter4.pdf. Laurent Demanet, MIT 18.330, Chapter 4, §4.1, pp. 1–2, 2012
Here the emphasis is on a continuous strictly increasing function: the target identifies one input, making interval bisection a way to evaluate its inverse function without an explicit inverse formula.Let be a continuous function, with and . The intermediate value theorem guarantees existence; a strictly increasing function also guarantees uniqueness. Check endpoint equality first. Otherwise, for the current root bracket , evaluate its midpoint . If , retain ; if , retain ; if , return that exact solution. These comparisons preserve the target bracket. General bisection method needs continuity and opposite signs of at the endpoints, without requiring monotonicity or a unique zero of a function; see limitations of bisection.
An original dimensionless polynomial example isHere and the derivative , so there is exactly one solution. In fact ; knowing this lets us check the computed absolute error independently of the guarantee. The first four halvings give the following exact rational numbers:
The beauty of interval bisection is that the enclosure itself supplies the certificate: one comparison removes half the possible inputs, regardless of the steepness of the function graph. In exact arithmetic, after completed halvings without exact termination, the width and the bisection error bound for the new midpoint areThe reported midpoint after update four is , rather than the last tested point . Its certified absolute error is at most , and its actual absolute error is . For a requested position tolerance , the bisection stopping criterion requires eleven halvings: ten give , while eleven giveThe actual absolute error is . The new midpoint need not be evaluated to obtain this certificate.
The signed output residual is ; the position approximation error is . They answer different questions: how close is the output to the target, and how close is the input to the solution? Driscoll and Braun explain why a small residual needs information about the derivative to imply small position error.[ref]
https://fncbook.com/rootproblem/. Toby A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §4.1.1, Conditioning, error, and residual
For this particular polynomial, direct factorization givesThus at the residual is , despite position absolute error . If a differentiable function satisfies throughout the bracket, the mean value theorem gives the rigorous conversionOur example permits and on . Strict increase alone supplies no positive lower derivative bound: is strictly increasing but . A small residual alone is therefore not a universal position certificate; even the target equation has residual at , a full unit from its solution.The guarantees require continuity and correct evaluations, not just narrowing endpoints. For the strictly increasing function when and when , the target lies between and but is never attained: a jump discontinuity defeats the existence argument. With floating-point arithmetic or an approximate evaluation, an incorrect comparison can discard the true solution. A certified interval enclosure of wholly below or above certifies the corresponding decision; an enclosure containing is inconclusive, rather than proof of equality. If rounding makes the midpoint equal an endpoint, report the precision limit; see bisection stopping criterion for the rounded position bound. Both figures are exact mathematical examples, not measured data.
The finite volume method follows the amount of a conserved quantity inside each control volume. Its unknowns are cell averages, rather than values at isolated points: a cell's width times its stored average approximates that cell's total. A numerical flux transfers an amount across a face. Using one shared transfer for both neighboring cells makes the loss from one exactly the gain of the other, as explained in shared face flux cancellation.[ref]
Riemann Problems and Jupyter Solutions by David I. Ketcheson, Randall J. LeVeque, and Mauricio J. del Razo. Approximate solvers, §Finite volume methods, equation FVupdate and the following cancellation argument
For a one-dimensional scalar conservation law without sources, let , with conservation law flux . Fix cells of widths . Define the exact cell average and its numerical approximation byThe integral balance over one cell and one time interval of length isFor a smooth solution this follows by integration of the differential equation; with jump discontinuities, it expresses the conservation law in integral form, using appropriate face traces when they exist. Replacing each time-averaged face conservation law flux by a numerical flux givesThus the finite volume method implements a balance directly, without needing a pointwise derivative at a jump. The tube balance in Riemann Problems and Jupyter Solutions by David I. Ketcheson, Randall J. LeVeque, and Mauricio J. del Razo (Advection, §Conservation of mass) motivates this construction from conservation of mass.
This is useful for shock waves: their speed is constrained by the Rankine-Hugoniot condition, itself an integral balance. A nonconservative approximation can give a visibly plausible jump with the wrong speed. Conservation is one requirement; a nonlinear scalar conservation law also needs the correct entropy solution, and the chosen numerical flux and update need their own stability and accuracy analysis.[ref]
Riemann Problems and Jupyter Solutions by David I. Ketcheson, Randall J. LeVeque, and Mauricio J. del Razo. Approximate solvers, §§Finite volume methods, Godunov's method, High-resolution methods: wrong shock speeds, time-step restrictions and smeared jumps
The original periodic upwind finite volume advection example isolates the shared-transfer mechanism in a problem with a known translated solution.Suppose a ring has an underlying real normed vector space and its norm is multiplicative, without initially assuming real bilinearity of multiplication. For fixed , distributivity makes additive, while makes it continuous. Additivity gives rational scalar compatibility, and continuity extends it to every real scalar. Apply the same argument in the other variable to obtain a bilinear map. The norm identity also excludes nonzero zero divisors.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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







