Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let . Without a separation assumption,For , each point belongs to at most integration arcs in the Sobolev–Gallagher inequality. For , is the total number of points, and the Cauchy-Schwarz inequality bound suffices.
Since the differential of the Exponential map of a Lie group at zero is the identity, the inverse function theorem makes it a diffeomorphism on a sufficiently small neighborhood of zero. Its local inverse is a logarithm near the group identity. It need not extend to a global logarithm, even for the real general linear group.
A convex normal neighbourhood is an open set whose points have unique smoothly varying joining geodesics, with the joining geodesic contained in the set. The corresponding star-shaped restriction of each exponential map is a diffeomorphism onto the neighbourhood. Hence its differential is invertible and no such joining geodesic admits a nonzero Jacobi field vanishing at both endpoints. Every point of a Riemannian manifold has arbitrarily small such neighbourhoods. This is stronger than merely requiring the existence of a minimizing geodesic in the set.
For the Riemannian exponential map , uniqueness of the geodesic equation gives . Differentiation at yields . Smooth ODE dependence and the inverse function theorem therefore make a diffeomorphism on a neighborhood of zero, producing geodesic normal coordinates. This is a local assertion and requires no geodesic completeness.
For simple random walk on a finite connected loopless unweighted graph, start at and stop on first hitting . Ifthen and for the graph Laplacian . The incoming-visit balance equation is for ; at the Laplacian value is because all its coordinates sum to zero. Thus is the voltage for unit current from to , and . In particular, the expected number of directed transitions before is .
Hitting time of the bridge vertex between two cliques by
Codex 0 Created 2026-10-06 Updated 2026-11-05
For simple random walk on two disjoint complete graphs of size joined through one new vertex , let be the expected hitting time of from either vertex attached to , and the expected hitting time from any other clique vertex. First-step analysis gives and , so and . The expected hitting time from is zero. In discrete time the random walk is an aperiodic Markov chain only for .
For a common unconstrained Markov kernel on the edges of a rooted tree, let be the conditional expectation of the number of transitions , given observed leaves and the old Markov kernel. The expectation-maximization algorithm maximizes over row probability distributions, giving . A row with zero total count is unrestricted by this objective. Belief propagation computes the counts exactly on a tree.
The exobase marks the transition between a collisional atmosphere and its exosphere. For a neutral, approximately hydrostatic ideal gas, take mean free path and atmospheric scale height . The criterion givesAn order-one collision convention can change this coefficient. The pressure is not universal: the collision cross-section, composition, local gravity, and ionization must be specified. A strongly escaping, non-hydrostatic atmosphere requires an appropriate density-gradient length instead of a hydrostatic .
An exoplanet passes in front of its host star as seen by an observer and blocks part of the stellar flux. Exoplanet transit photometry infers geometry and radii from the resulting light curve. A true alignment involves the true anomaly, not generally the mean anomaly.
For an edge-on orbit crossing the centre of a uniformly bright stellar disk at distance , projected speed is and chord time is . A steady cross-sectional-area current therefore places area in front of the star, givingThis requires a geometrically narrow, optically thin wire with negligible overlap. A noncentral chord, limb darkening, finite angular extent and large optical depth change the estimate; it cannot predict dimming greater than one.
In leading mean-conjunction geometry a common observer phase for two resonant arguments requires and modulo . With , the exact modular criterion isNecessity follows by subtracting the two congruences after multiplication; sufficiency follows from the integer linear combinations of and , whose set is . For exterior centres and interior centres at orders one to three, only satisfies it. This is phase compatibility, not a guarantee of an observed exoplanet transit: timing, observer orientation, resonant-argument libration widths and true-versus-mean longitude must also be considered.
If has algebraically prime models and every inclusion between models of is a simple closure, then has quantifier elimination. For a common base , embed its algebraically prime extension into both models. Simple closure transfers a witness into that extension; the second embedding transfers it to the other model.
For reservoir kinetics , adiabatic elimination gives . Expanding for and inserting into the condensate equation gives a complex Ginzburg–Landau equation withFast reservoir response and weak depletion are separate assumptions. Without the number density expansion the gain is saturable, not cubic. The coefficients depend on position when the pump does.
For the cubic complex Ginzburg–Landau equation with , is spatially uniform, with . In the reservoir reduction of a polariton condensate, its pump threshold is and its number density is . The full two-field homogeneous model instead gives . These agree near threshold only to the expansion's accuracy. Existence of the homogeneous solution does not imply stability for arbitrary interaction coefficients.
In a compact connected orientable three-manifold with no spherical boundary components, every embedded knot is homotopic to a knot with an excellent three-manifold as exterior. In particular this can preserve the generator class in , or the winding number of a satellite pattern one class in a solid torus. Homotopy here is weaker than isotopy.
On a nonempty compact -dimensional symplectic manifold without boundary, with , the class in top-degree de Rham cohomology is nonzero, since its integral in the symplectic orientation is positive. In particular cannot be an exact differential form: if , then and the Generalized Stokes theorem would make that integral zero. Thus vanishing second de Rham cohomology obstructs a closed positive-dimensional symplectic manifold.
Under independent exponential death and censoring, a rate fit using only observed-death times estimates . Multiplying by the observed death fraction consistently estimates . This plug-in correction generally differs in a finite sample from the full maximum-likelihood estimate, which uses observed exposure from both deaths and censored subjects.
An option whose payoff depends on an average of the underlying stock prices over time. The displayed arithmetic-average call differs from a geometric-average call, which uses the geometric mean. A convex payoff and a nondecreasing positive numéraire give an upper bound by the average costs of same-strike European call options at the averaging dates.
A maturity- claim is attainable if a predictable self-financing strategy with fixed initial capital has terminal wealth equal to the claim payoff almost surely. In discrete time its wealth is . The strategy replicates the claim; attainability is a statement about exact pathwise replication, not only equality of expectations.
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





