Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Stationary Gaussian density for a linear Fokker-Planck equation by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For linear drift and constant symmetric positive-definite diffusion matrix , a zero-current stationary Gaussian obeysThis reversible solution exists when is symmetric positive definite. Its covariance satisfies the Continuous Lyapunov equation
First two moments of a multivariate Fokker-Planck equation by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For a nonzero polynomial over a field, the multiplicity of a root is the largest integer such that divides it. Write with . For real polynomials, continuity keeps the sign of fixed sufficiently near , so an odd integer makes the graph cross the axis and an even integer makes it touch without crossing.
The right-hand panel above replaces by . For , its two roots of a polynomial are and ; for , they are . The unperturbed double root lies between these two cases. Small coefficient changes can therefore split a repeated root into distinct real roots or move it off the real axis, illustrating why repeated-root problems can be numerically sensitive.
For a null hypothesis that is a union , an intersection-union test rejects only when every component is rejected. If each component test has level , then under any point of at least one component null is true, so the combined test also has level at most .
Completely split small-prime obstruction to monogenicity by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let have degree , and suppose a rational prime factors into distinct prime ideals of norm . If , then is not monogenic. Otherwise the Dedekind factorization theorem would force the degree- minimal polynomial of a power-basis generator to have distinct linear factors over , although only the polynomials are available.
An element of a structure is definable without parameters when some first-order formula uniquely identifies it:
Minimaxity of the usual multivariate normal mean estimator by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For under quadratic loss, the estimator has constant risk and is minimax. Gaussian priors have Bayes risks , which tend to and therefore give the matching minimax lower bound.
Supercooling is persistence of a phase below the equilibrium temperature where a lower-temperature phase becomes favorable. A liquid remaining unfrozen below its equilibrium melting temperature is the standard example.
Creating a crystal nucleus gains bulk free energy but costs interfacial energy. Small embryos can disappear, while one exceeding the critical size can grow; this nucleation barrier permits a metastable liquid. A surface or suspended inclusion can lower the barrier through heterogeneous nucleation, whereas homogeneous nucleation occurs within the bulk. Measured freezing onset consequently depends on droplet size, purity and waiting time. Growth releases latent heat and can temporarily warm the remaining material toward the coexistence temperature, separating the onset of nucleation from the later heat-removal problem.
Superheating is persistence of a phase above the equilibrium temperature at which a higher-temperature phase becomes favorable. The familiar case is a liquid above its boiling point at the imposed pressure, although delayed melting can also be discussed as superheating.
The liquid can remain in a metastable state because producing a vapor bubble costs interfacial energy. A sufficiently large bubble overcomes the nucleation barrier and grows, converting the liquid and consuming latent heat. Smooth clean containers can delay nucleation, while cavities and boiling chips provide heterogeneous nucleation sites. The observed temperature of sudden bubble formation therefore need not equal the equilibrium boiling point. The amount of superheating is a kinetic and preparation-dependent observation, rather than a new equilibrium phase boundary.
Let be a finite set, let every singleton have positive probability, and let preserve that probability measure. For every ,so every has a preimage. Thus is a surjection, and every surjection from a finite set to itself is a bijection.
A measure-preserving system is a measure space together with a measure-preserving transformation . In ergodic theory the measure is commonly a probability measure.
The most probable speed is the mode, or density maximum, of the Maxwell speed distribution:For small equal-width speed bins, the bin near contains the largest expected fraction of particles. This does not mean that any exact speed has positive probability, or that every particle has this speed. The three common summaries obeyso . The first describes a density peak, the second the mean speed, and the third the root mean square associated with kinetic energy. [ref]
https://openstax.org/books/university-physics-volume-2/pages/2-4-distribution-of-molecular-speeds. OpenStax, characteristic molecular speeds
For a concrete scale , these are approximately , , and . The most probable velocity vector and each most probable component remain zero in the gas rest frame. A zero vector labels one small region of velocity space, whereas a positive speed labels an entire spherical shell.
A short check uses the derivative of the logarithm of the Maxwell speed distribution for :It is positive below and negative above it, locating the unique peak. The factor from the spherical shell supplies the term ; omitting it would incorrectly move the speed peak to zero.
For independent observations from the exponential distribution with rate , the log-likelihood is , soThe central limit theorem and delta method give
For a matrix Lie group with Lie algebra , choose neighborhoods on which and are inverse. Left translation gives a chart near byThe Baker--Campbell--Hausdorff formula expresses multiplication smoothly in these coordinates.
For a Matrix Lie group with Lie algebra , its exponential map is the restriction of the matrix exponential, . It maps into and is a local diffeomorphism at zero, but it need not be surjective globally.
A block matrix partitions its rows and columns into rectangular submatrices called blocks, allowing a matrix calculation to be expressed in terms of those blocks.
Let be the usual augmentation of the natural filtration of a standard Brownian motion . On a finite horizon , every has the representationfor a predictable process . Consequently every square-integrable martingale on has . The Itô isometry makes unique up to -almost everywhere equality. A proof first represents deterministic Gaussian exponentials, whose linear span is dense in L2 space, then uses the Itô isometry to close the class of represented terminal values.[ref]
Itō's representation theorem by Fabrice Baudoin. 2012 lecture, theorem and proof by density of stochastic exponentials
The natural-filtration qualification matters. In the filtration generated by independent Brownian motions , both are martingales, but cannot be an Itô integral against : its quadratic covariation with is zero, which would force the proposed integrand to vanish. A general Brownian filtration may therefore be too large.
For a decreasing sequence of sigma-algebras and an integrable random variable ,almost surely and in .
Bounded-exponent finitely generated nilpotent group order bound by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let be a nilpotent group of class at most in which every element has order at most . A subgroup generated by elements has order at mostIndeed, collection by the lower central series expresses every element as an ordered product of simple group commutators in the generators of weights at most . There are at most such commutators, and each exponent may be reduced to one of at most values.
A stochastic block model assigns each vertex of a graph to a class and, conditional on those classes, makes distinct edges independent random variables whose probabilities depend only on the classes of their endpoints.
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





