Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
In zonally averaged barotropic quasi-geostrophic approximation flow with zero mean meridional transport, the Taylor identity for quasi-geostrophic flux relates the meridional potential vorticity flux to the convergence of Reynolds stress. A local downgradient closure , with , therefore gives westward mean acceleration where the background gradient is positive. Rossby wave breaking can stir PV into fine filaments; coarse-graining or weak diffusion produces the inferred mixing. Globally the momentum-flux convergence integrates to boundary stresses, so localized westward changes need compensating transport or momentum changes elsewhere in an isolated system.
For a semisimple Lie algebra, its nondegenerate Killing form turns a two-cocycle into an operator through . The cocycle identity makes a derivation. Choose by . Using and cyclicity of trace gives , so . Consequently is a coboundary. This proves that component Hamiltonians can be normalized to a Lie algebra homomorphism.
Suppose a symplectic Lie group action on a connected symplectic manifold has global component Hamiltonians and a common fixed point . Choose their constants linearly so . The difference has zero Hamiltonian vector field because fundamental fields and Hamiltonian fields have compatible Lie-bracket conventions; it is therefore constant. At , all fundamental fields vanish, so both terms in vanish. Thus everywhere and the Poisson brackets of the components reproduce the group Lie algebra. For a connected group this also yields coadjoint equivariance. A linear unitary action on a vector space has the origin as such a fixed point.
A module automorphism is an invertible module endomorphism. Equivalently, it is a bijective module homomorphism from a module to itself; its inverse is automatically a module homomorphism. They form a group under composition.
For with positive coefficients, linearize around using real amplitude and phase perturbations. Their two-by-two dispersion relation gives the displayed equation. The modulational instability band is , with maximum growth rate at .
For the complex Ginzburg–Landau equation , the uniform oscillation has a neutral phase mode whose growth rate is . Negative phase diffusion therefore causes a long-wavelength modulational instability. The Benjamin-Feir stability condition is the complementary positive-diffusion condition. On a finite domain an unstable wavenumber must actually be allowed by the boundary conditions.
The effective group is torsion-free, has index twelve and has two regular cusps. If its weight-two cusp form space is one-dimensional, any nonzero member has order one at each cusp and no interior zeros by the regular-cusp valence formula on a torsion-free modular curve. Its twelfth power and have the same weight and divisor. Their ratio is a holomorphic function without poles on the compactified modular curve, hence a nonzero constant. Normalizing the leading Fourier coefficient to one proves the displayed formula, with the holomorphic root chosen to start with . It equals .
The modular discriminant has a simple zero at infinity and no zero in the upper half-plane, by the valence formula for the modular group. Multiplication by it identifies weight- modular forms with weight- cusp forms. Conversely dividing a cusp form by it preserves interior holomorphy and removes one order of vanishing at infinity.
For fixed statistical parameters and , Bayes' theorem gives the mixture responsibilityIt is the conditional expectation of the mixture allocation indicator. This posterior probability concerns the hidden label, with held fixed; it does not require a prior distribution over . For a continuous , use the density ratio to define this conditional distribution, rather than dividing probabilities of the zero-probability event .[ref]
Finite Mixtures. Finite Mixtures, section Recovering posterior mixture proportions: Bayes formula for label probabilities conditional on the observation, component parameters, and mixing weights
For the Two-Gaussian mixture example, the component density ratio is , so the posterior probability ratio and the mixture responsibilities areAt the two unweighted component densities are equal, so the mixture responsibilities equal the mixture weights: , . At , the second component density is twice the first and its mixture responsibility is . Equal mixture responsibilities instead occur at : the more frequent second mixture component is favored even slightly to the left of the midpoint.
The mixture weights describe membership before learning ; mixture responsibilities describe membership after learning . The law of total expectation gives under this statistical model, although varies across individual values. In fitting by the expectation-maximization algorithm, evaluate mixture responsibilities at the current statistical parameters and recompute them after an update.
For , with invertible , a pure coefficient matrix transforms as . Its unnormalized determinant is multiplied by . The invertible filter bijects pure decompositions before and after conditioning, with branch weights rescaled by their success probabilities. Taking both infima in the convex roof extension gives the displayed exact scaling. If either filter has rank one, the retained state is separable across that party.
Posterior mean from adjacent mixed Poisson probabilities by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For a mixed Poisson distribution with known exposure , multiply the unnormalized posterior density by and compare its integral with the next probability mass. The factors give the displayed identity whenever . Both mass probabilities have the same exposure . For a future conditionally independent unit-exposure Poisson distribution count, this is also its posterior predictive expected value. It holds for arbitrary proper mixing distributions, with integrals taken against the prior measure when there is no density.
Overdispersion of nondegenerate mixed Poisson counts by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be a finite random variable with finite second moment, and let have a Poisson distribution of mean . Then conditional expectation and the law of total variance giveA nondegenerate mixing law has positive variance, so the count is overdispersed relative to a Poisson distribution with the same expected value. For example, equal mixing between means and gives count expected value and variance . The finite-moment assumptions justify these ordinary variance identities; a proper mixing law can instead yield infinite count moments.
A spatial example uses Poisson point process parent locations of intensity , independent Poisson distribution offspring counts of expected value , and an offspring displacement probability distribution . Given the parents, the count in a bounded measurable region is Poisson with random mean . Its excess variance isThis follows from Campbell theorem. If has positive finite volume, the integral is finite and positive: and its integral is the volume of . Thus shared random parent locations produce extra count variation even though the offspring counts are conditionally Poisson.
When the second partial derivatives are continuous in a neighborhood, the order of the mixed partial derivatives can be interchanged. Expressing a rectangular finite difference as either iterated integral by the fundamental theorem of calculus and shrinking the rectangle proves the equality. Mere existence of both derivatives does not imply this symmetry.
For away from the origin and zero at the origin, proves Fréchet differentiability with zero derivative. Yet and , giving the displayed unequal mixed partial derivatives. They exist but are not continuous at the origin, so Clairaut's theorem does not apply.
For the distinct-knot linear B-spline hats, let . The mixed-normalization spline Gram matrix has entriesOnly indices in the finite basis are retained. This matrix has a row strict diagonal dominance margin at least , so the inverse infinity-norm bound from diagonal dominance gives . Equidistant spline knots give off-diagonal entries . Both pieces of every hat are retained; repeated endpoint spline knots require different boundary formulas.
Let nonnegative partition-normalized B-splines form a basis, with on the integration interval and . The row-normalized mixed Gram matrix is . The normal equations for the orthogonal projection onto their linear span become , with and . The subpartition of unity for B-splines gives and proves the bound. The ordinary symmetric Gram matrix omits this essential row normalization. The projection maps continuous functions into the spline space, not onto all continuous functions.
The quantity is the largest cardinality of a length- code over an alphabet of size with minimum Hamming distance at least . The code need not be linear.
// Target: algebra.bigb
At an interior junction of two unit-speed geodesic segments, let be the incoming and the outgoing tangent. Choose points close to the junction in a common convex normal neighbourhood. Moving the junction with velocity changes the sum of the two segment lengths by , using the first variation of geodesic energy or the Gauss lemma. If , choose to reduce length. Hence a length-minimizing broken geodesic has matching tangents and is one smooth geodesic.
// Target: riemannian-geometry.bigb
Simple-pole formulas for minimal-subtraction renormalization group functions by
Codex 0 Created 2026-10-14 Updated 2026-11-05
In the minimal subtraction scheme, let , , and , . Define the renormalization-group beta function at fixed bare parameters by , and the running mass function by .
The bare coupling is scale independent, so . Its finite coefficient is , giving the first formula. Similarly has finite coefficient . The remaining poles cancel recursively: and . Thus the simple poles determine the finite renormalization group functions, while higher poles obey consistency conditions.
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






