Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let be Borel. If for , the closed graph theorem makes the inclusion continuous. Applying its norm bound to indicators of shows that their measures are uniformly bounded, hence .
If in for , choose a subsequence with . Tonelli's theorem makes finite almost everywhere, so almost everywhere. For , norm convergence itself gives almost-everywhere convergence after removing one common null set.
Kernel of localization away from one plus an ideal by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let be Noetherian, an ideal, , and a finitely generated -module. ThenIf with , then for every . Conversely, apply the Artin-Rees lemma to . For sufficiently large it givesso for some and .
Kernel linear discriminant analysis performs regularized linear discriminant analysis in a Reproducing kernel Hilbert space, using kernel evaluations to obtain nonlinear decision boundaries in the original input space.
Laplace contour-integral method for a linear differential equation by
Codex 0 Created 2026-10-03 Updated 2026-11-05
The Laplace contour-integral method for a linear differential equation seeks a solution asDifferentiation in inserts powers of , while multiplication by can be moved to differentiation in through integration by parts. The resulting differential equation for is first order for some important equations, rather than for every linear differential equation. Polynomial dependence on can produce higher derivatives of .
For the Airy equation , this calculation givesChoosing kills the integral term. A contour whose ends lie in appropriate cubic exponential-decay sectors makes the boundary term vanish and produces an Airy function solution; after , this has the standard cubic-exponential form.[ref]
NIST Digital Library of Mathematical Functions. section9.5(ii), equation9.5.4, standard Ai contour integral
The contour is part of the construction. Finite endpoints may require vanishing or canceling boundary terms; infinite ends require convergence of the integral and its differentiated forms. For comparison, gives after two integrations by parts, showing explicitly why the transformed equation need not be first order.
The past light cone of a spacetime event is the past-directed part of its light cone. In Minkowski spacetime, its spacetime events satisfy with . They are the possible emission events of light rays arriving at . The interior also contains events that can send slower signals to . The retarded potential of a moving point electric charge, given by the Liénard–Wiechert potential, uses the emission event where the source's world line intersects this boundary.
A connected Lie group is simple when its Lie algebra is nonabelian and simple. Some conventions additionally quotient out or exclude a discrete center; the infinitesimal gauge fields depend only on the Lie algebra.
A matrix Lie group is a subgroup of a general linear group that is also a Lie group for its matrix topology. Near the identity, the matrix exponential and matrix logarithm give inverse coordinate charts whenever they are restricted to sufficiently small neighborhoods in the group and its tangent space.
A Lie group action is a smooth group action of a Lie group on a smooth manifold. Differentiating the action gives an infinitesimal action of its Lie algebra by vector fields.
A Lie algebra isomorphism is a bijective linear map satisfying . Its inverse automatically preserves the Lie bracket.
For a Matrix Lie group , its tangent space is closed under the matrix commutator. Indeed, for , the group commutatorlies in , and the mixed derivative at of its matrix logarithm is . Thus belongs to .
A set generates a Lie algebra when the smallest Lie subalgebra containing is . Equivalently, every element is a finite linear combination of iterated Lie brackets of elements of . A basis is always a generating set, but a generating set need not span by linear combinations alone: in the Heisenberg Lie algebra, generate because , although their linear span has only two dimensions.
In a Matrix Lie group, physicists also call the matrices specifying infinitesimal transformations generators. Under the Hermitian quantum generator convention, a transformation has the form ; the corresponding genuine Lie algebra elements are . A list of such generators may be a basis or a smaller generating set, so the distinction matters.
A Compound Poisson process has the formwhere is a Poisson process and the independent identically distributed marks are independent of . It is a Lévy process with a finite Lévy measure.
The Lévy measure of a Lévy process records the intensity of its jumps: for every measurable set bounded away from zero, is the expected number per unit time of jumps whose sizes lie in . It satisfies
The expectation-maximization algorithm fits a latent-variable model by alternating a conditional expectation over the latent variables with a maximization over the statistical parameters. Its target is the observed-data likelihood function, although its updates use the simpler complete-data log-likelihood.[ref]
Maximum Likelihood from Incomplete Data via the EM Algorithm by Arthur Pentland Dempster and others. Section 2, printed p. 6, equation (2.17) and the general E-step/M-step definition
Write for the observations, for the latent variables, and for their joint probability density function or probability mass function. The observed-data log-likelihood iswhere the integral becomes a sum for discrete . Directly maximizing a logarithm of this sum can be awkward. The E-step instead computes a conditional distribution at the current statistical parameters ; the M-step uses it to construct a new fit. The attractive idea is to retain uncertainty about the hidden labels while recovering simple weighted means and other complete-data updates. The Known-variance Gaussian mixture EM example shows the mechanism without estimating a variance or mixture weight.
Arthur Pentland Dempster, Nan M. Laird, and Donald B. Rubin gave the general framework its name in their 1977 paper, which also discusses earlier special-case algorithms.[ref]
Maximum Likelihood from Incomplete Data via the EM Algorithm by Arthur Pentland Dempster and others. Section 1, printed pp. 1 and 3: naming of the two steps and earlier special cases
Let be the abelianization map and let be a finite -approximate group. Suppose a coset progression lies in and has size at least . ThenA section of is multiplicative up to a bounded power of inside the commutator subgroup; successively separating the subgroup and progression coordinates proves the inclusion needed for this estimate.
A metastable state is locally stable against small disturbances but has a higher thermodynamic potential than another accessible phase. In a free-energy landscape it occupies a local minimum separated from the stable state by a barrier.
A liquid undergoing supercooling illustrates the distinction: small fluctuations can relax without freezing, but a sufficiently large crystal nucleus can grow. The nucleation barrier depends on the competition between interfacial cost and bulk free-energy gain. Waiting time is therefore affected by sample volume, impurities, surfaces and observation duration. A spinodal point is the mean-field limit where the metastable minimum loses local stability; it is distinct from the coexistence condition where the stable phases have equal appropriate intensive potentials. Metastability explains hysteresis without making the equilibrium phase boundary path dependent.
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





