Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a finite irreducible Markov chain with at least two states that is an aperiodic Markov chain and a reversible Markov chain, put and . This is the reciprocal of the absolute L2 spectral gap of a reversible Markov chain. It agrees with the reciprocal of the ordinary spectral gap for a lazy Markov chain, but need not agree when there are negative eigenvalues.
Dualize the relative tautological line bundle to obtain the positive relative hyperplane line bundle. It restricts to on each projective fibre. This sign depends on the convention that projectivization parametrizes lines; fixing the convention avoids confusing it with the tautological line itself.
For multiplicative resource-price dynamics with positive capacities, nonempty routes and strictly positive initial prices, full row rank of the link-route incidence matrix makesstrictly concave. There is a unique optimizing price vector, possibly on the boundary, and the relative-entropy Lyapunov function for resource prices proves convergence to it. Row-rank deficiency still gives unique optimal route prices and rates, but resource prices may depend on the initial state. Full column rank alone and unrestricted zero initial prices do not yield the same uniqueness theorem.
For a compact H-hull inside the disc of radius centred at a real point, its mapping-out function of a compact H-hull displaces every point of its domain by at most . After scaling and translation, the real boundary bounds for a unit-disc H-hull put the corresponding inverse boundary interval inside . Boundary cluster points of the inverse over this interval lie in the unit disc. The maximum modulus principle applied to gives the bound without assuming local connectedness of the hull. The nearly closed semicircular slit makes the constant three sharp.
Cancel the common polynomial factors of and before computing the degree of a rational map of the Riemann sphere. Removable common zeros do not contribute sheets. The reduced maximum polynomial degree is the number of inverse images of a generic target value, counted with positive holomorphic local degrees.
For finite irreducible Markov chains that are aperiodic Markov chains and reversible Markov chains, the ratio definition of cutoff and imply the Peres product condition, with . If on a subsequence, then and the eigenvalue lower bound for total variation mixing giveFor sufficiently small fixed , this contradicts the limit one forced by cutoff for Markov chains. The same argument proves the stronger conclusion .
The boundary partition has singleton blocks, so no different boundary vertices are identified. Open component counting is the ordinary counting in the finite graph, including isolated vertices. This is the least wired random-cluster boundary condition.
All boundary vertices are identified into one vertex for component counting. This is the most wired random-cluster boundary condition on a fixed boundary, and maximizes increasing-event probabilities when by boundary monotonicity of the random-cluster measure.
Boundary monotonicity of the random-cluster measure by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Here means each block of lies in a block of , and the measure order is stochastic domination of probability measures. The random-cluster single-edge conditional probability is increasing in both exterior open edges and wiring for . Couple two heat-bath Markov chains by identical update edges and uniform random variables, starting from ordered states. Order persists, and convergence of the finite chains to their stationary laws proves the displayed inequality. At , the law does not depend on the boundary partition.
For and a continuum of vertical wavenumbers, the growing branch of the radially stratified magnetorotational dispersion relation is maximized at , with . For the optimum moves to the boundary and the limiting rate is . For there is no exponential instability. Boundaries that discretize the allowed wavenumbers can alter the actual maximum.
For unit mass and , this prepoint kernel tends to the identity and generates the Time-dependent Schrödinger equation. The square-root branch follows the damped Fresnel integral. Its normalized moments are , , and at orders zero, one and two; these fix both the normalization and the kinetic sign.
For a scaling refinement equation , set . The quadrature mirror filter identity makes the two rows and a unitary matrix, where . The complementary coefficients yield . In a multiresolution analysis, coefficient-space completeness shows its translates form an orthonormal basis of , hence its dilations and translates form an orthonormal wavelet basis of the whole space.
In an abelian category, suppose a commutative square is a pullback in a category and is an epimorphism. Then is the categorical kernel of the epimorphism . Since an epimorphism is the cokernel of its kernel, any compatible pair , induces a unique map by factoring . Hence the square is also a pushout in a category.
Profile likelihood for a Gaussian precision matrix by
Codex 0 Created 2026-10-06 Updated 2026-11-05
For independent multivariate normal observations with unknown mean and nonsingular covariance, profiling the mean at its sample value gives negative log-likelihood proportional to over . The sample covariance matrix uses divisor . Its minimizer exists exactly when , and is then .
Conditional regression coefficients from a Gaussian precision matrix by
Codex 0 Created 2026-10-06 Updated 2026-11-05
In a Gaussian graphical model, regressing component on the others gives the displayed coefficients, residual variance and intercept . Opposite directions have identical zero patterns and signs because is symmetric with positive diagonal, but generally unequal coefficient magnitudes.
A planar Brownian motion starting at exits the disk of radius before leaving a wedge of opening , centered on the positive axis, with probability . The power-map reduction for Brownian exit from a wedge, the reflection identity for Brownian exit from a half-disc and the Möbius calculation of circular Brownian exit give the formula. Its large-radius decay exponent is .
A symmetric operator on a real Hilbert space is strictly positive definite when for every nonzero in its operator domain. Strict positivity proves uniqueness of a solution of , but in infinite dimension it need not prove existence for every . A uniformly positive definite symmetric operator additionally has a positive lower bound independent of . Symmetry must be stated separately when positivity is defined only by a real quadratic expression: adding a skew-symmetric matrix changes the operator without changing that expression.
For a bounded Hermitian operator , its positive part of a Hermitian operator isIt is a positive operator whose support is the positive spectral subspace. In a finite-dimensional spectral decomposition, ; the integral definition remains valid without an eigenbasis. Together with the negative part of a Hermitian operator, it obeys , and .
For a bounded Hermitian operator , its negative part of a Hermitian operator isIt is a positive operator, despite the word negative: its eigenvalues in a finite-dimensional diagonalization are the magnitudes of the negative eigenvalues of . For such a diagonalization, . The spectral-integral formula also covers a continuous spectrum without eigenvectors. Its support is orthogonal to the support of the positive part of a Hermitian operator, and .
For a compact oriented submanifold without boundary in an oriented manifold, the normal Thom class gives a compactly supported cohomology class dual to its pushed-forward fundamental class. It is independent of the tubular neighborhood and its ordinary-cohomology image vanishes on the complement of the submanifold. A noncompact submanifold closed only as a subset generally has its dual in ordinary cohomology, using locally finite homology instead.
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





