Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a sphere falling with speed through a tube of radius , let be the downward laboratory volume flux. In the sphere frame the wall moves upwards and the narrow annulus carries upward flux per unit circumference . Couette-Poiseuille flow in a thin gap gives . Thus the pressure below minus above the sphere is , using lubrication resistance integrals for a nearly occluding sphere. A nearly piston-like laboratory flux can coexist with a nonzero relative gap flux.
For a smoothly moving circuit and a divergence-free magnetic field, the magnetic flux derivative is . The minus sign follows by orienting the swept side surface compatibly with the two spanning surfaces. Combining this transport identity with Faraday's law yields the moving-loop electromotive-force law.
A morphism of sheaves of modules is surjective when the induced map on every stalk is onto. Equivalently every target section can locally be lifted. It need not be onto on global sections; the long exact sequence in sheaf cohomology describes that obstruction.
A commuting isomorphism between two module extensions that is the identity on both end modules. Classifying middle modules up to arbitrary isomorphism is a different and generally coarser problem.
Pushing an inclusion along gives a new module extension with kernel and the same quotient. This pushout realizes the covariance of the degree-one Ext functor in its second argument.
Extension of trivial modules for an infinite cyclic group by
Codex 0 Created 2026-10-06 Updated 2026-11-05
With trivial action on both end modules, an extension has underlying abelian group and generator action . The integer matrix is invariant under equivalences fixing the ends. The one-element projective resolution with differential computes the same classification over the group ring.
In a planar force-driven encounter with a fixed equal sphere and positive impact parameter , the mobility correction from a fixed distant sphere gives . The moving sphere reaches maximum deflection and rotates clockwise through to leading order. The spin is obtained by integrating half the reflected Stokeslet vorticity, as prescribed by Faxén rotation law. These numerical formulas require a distant encounter.
For a finite Markov chain with transition matrix , define . If is a stationary distribution and , then . The first bound follows by writing and using the triangle inequality; the second uses the triangle inequality through .
If for a finite irreducible Markov chain with at least two states, then its worst-case total variation distance from its stationary distribution satisfies . Choose a possibly complex eigenfunction for an eigenvalue of modulus , normalize , and start where the maximum is attained. Since , ; the defining sum for total variation distance bounds this difference by . For , this yields for , because .
With and , the positive binding energy satisfies . The minimum-separation binding-energy bounds imply . At least one pair stays close; this does not bound every particle's distance or exclude a negative-energy gravitational collision.
At fixed outer boundary velocity, extending the inclusion velocity rigidly through its interior makes the particle flow an admissible competitor for the particle-free Minimum-dissipation theorem for Stokes flow. Its interior rate-of-strain tensor vanishes. For a linear background, the increase in viscous dissipation is force times relative translation, torque times relative rotation, plus the contraction of the particle stresslet tensor with background strain.
For , the posterior mean under has constant squared-error risk . Its unique Bayes property and constant risk make it the unique minimax estimator.
The flux of the minimal surface equation for a graph has a positive definite symmetric matrix derivative. Its eigenvalues are in the direction of and orthogonally; at every eigenvalue is one. On it satisfiesThus an averaged linearization of a nonlinear divergence-form equation is uniformly elliptic where the relevant gradients are bounded. Pointwise positivity alone does not supply a uniform bound on an unbounded gradient range.
The isothermal coordinates give the immersion . Its coordinate functions are harmonic and its metric is , so it is a complete immersed minimal surface with self-intersections.
An outer area-minimizing surface is a closed surface in a Riemannian initial-data slice whose area is no greater than that of any enclosing competitor. This is a variational property, not a consequence of containment alone. It is important when choosing the horizon-area quantity in the Riemannian Penrose inequality and when examining an apparent-horizon area comparison.
Two successive integrations by parts of the standard normal density tail give positive remainder integrals establishing these strict inequalities for every . The lower bound can be negative at small without invalidating the inequality.
A pseudo-marginal Metropolis–Hastings algorithm replaces an intractable likelihood function by a nonnegative unbiased likelihood estimator and includes its auxiliary randomness in the state. If for , the extended target is proportional to . An independence proposal for new auxiliary randomness cancels the factors in the Metropolis–Hastings acceptance probability. On rejection the old estimate must be retained. Integrating the extended target gives the desired marginal posterior distribution exactly.
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





