Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A spin wave is a smooth long-wavelength fluctuation of the orientation of an ordered continuous-symmetry field. In an phase it is a fluctuation of the angle governed at leading order by the Gaussian gradient energy.
If is a countable transitive model, , and , enumerate the dense subsets of belonging to and recursively choose a decreasing sequence starting below that meets each one. Its upward closure is a generic filter over containing .
Let be a polynomial root of the generator polynomial of a cyclic code over a finite field , viewed in an field extension. Every codeword satisfies , so a received polynomial has syndrome . A single-symbol error givesTo identify both value and position from this one syndrome, the maps must be injective over the allowed nonzero values and coordinate positions. Equivalently, the powers for distinct positions must not be proportional by a nonzero element of the base finite field. In the binary case , distinct powers suffice.
For square matrices of the same size, their generalized characteristic polynomial is . If it is not identically zero, the pair is a regular matrix pencil, and its finite generalized eigenvalues are precisely the roots of : singularity of gives a nonzero vector with .
If is invertible, has full degree and reduces to an ordinary characteristic polynomial. A singular can lower the degree, accounting for generalized eigenvalues at infinity in the projective description. For example, , gives , with one finite generalized eigenvalue and one eigenvalue at infinity. If is identically zero, a singular-pencil analysis is needed instead of treating this zero polynomial as an ordinary degree- characteristic polynomial.
Let be a centered Gaussian process with a separable version: its relevant suprema are captured by a countable dense index subset. Give the canonical pseudometric of a Gaussian process , and assume it is totally bounded. With metric covering number and diameter , the Dudley entropy integral boundsfor a universal constant . Finiteness of the integral gives a finite expected supremum. For an absolute supremum, include an anchor: . The anchor term cannot generally be omitted.
The proof builds successively finer nets. Write each increment as a telescoping sum between neighboring net scales, bound each finite Gaussian maximum by its scale times the square root of the logarithmic net size, and sum over scales. This becomes the displayed entropy integral.[ref]
The version assumption is substantive. If is uniform on and , every finite vector is zero almost surely and is therefore a degenerate Gaussian vector; the canonical pseudometric is identically zero. Yet for every outcome. Its all-zero separable modification has supremum zero. Finite-dimensional laws alone do not control the supremum of an arbitrary uncountable version.
For a Gaussian random vector and an -Lipschitz function in the Euclidean norm, put . If , the Gaussian concentration inequality givesand thereforeWrite with a standard Gaussian random vector . The composed function has Lipschitz constant at most . The Gaussian logarithmic Sobolev inequality and Herbst argument give the exponential bound, and the Chernoff bound supplies the tails.[ref]
Probability in High Dimension by Ramon van Handel. Theorems 3.24–3.25 and their exponential-moment proof
For example, has , so its deviations depend on the largest covariance eigenvalue rather than directly on the number of coordinates. The center can still grow with dimension. If , is constant almost surely and every positive deviation has probability zero.
Let latent values have a multivariate normal distribution , and observe with independent Gaussian noise . Integrating over gives , where . If is positive-definite, its log-marginal likelihood isThe first term measures the residual under the proposed covariance matrix; the determinant term accounts for the volume of the proposed observation law. Both matter when comparing covariance function parameters. With a single observation, and , this reduces to .[ref]
Gaussian Processes for Machine Learning by Carl Edward Rasmussen and Christopher K. I. Williams. Chapter 2, equation (2.30); nonzero-mean extension by centering
A positive-definite observation-noise covariance matrix makes positive-definite even when is singular; mutually independent errors with strictly positive variances are one sufficient case. If is singular, a Gaussian observation law still exists but has no ordinary density on the full observation space; the inverse-and-determinant formula above is then not valid. This is a likelihood for kernel and mean parameters after latent-value integration, rather than an assertion that estimated parameters have no further uncertainty.
The Gribov ambiguity is the nonperturbative failure of a local gauge condition to intersect every gauge orbit exactly once. Distinct gauge-equivalent fields satisfying the same condition are Gribov copies.
A zero mode of a quadratic field operator is a nonzero field variation that the operator maps to zero. Infinitesimal pure-gauge variations are zero modes of an unfixed gauge kinetic operator, preventing it from having an inverse propagator.
Normalized counting measures on a Følner sequence have a convergent subnet in the compact product . The limit is a left-invariant finitely additive probability measure, so every group satisfying the Følner condition is an amenable group.
Under the axiom of countable choice, the first uncountable ordinal has cofinality . Indeed, the supremum of any countable set of countable ordinals is still a countable ordinal, so no countable sequence is cofinal in .
Put for the profile parametrizationWith unit normal , the principal curvatures areConsequently and .
Higman criterion for finite representation type of a group algebra by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For a finite group and a field of characteristic , the group algebra has finite representation type exactly when a Sylow p-subgroup of is cyclic. Restriction and induction reduce the assertion to a Sylow p-subgroup, using projectivity detected on a subgroup of invertible index. A cyclic p-group has only the finitely many indecomposable modules for a cyclic p-group.[ref]
https://www.staff.city.ac.uk/a.g.cox/LTCC/Week5.pdf. Section 5.1, Higman's finite representation type criterion
A noncyclic finite p-group has a quotient group . Here is an infinite collection of indecomposable modules that works even over a finite field. On with , let send identically onto and kill , and let send onto by one Nilpotent Jordan block and kill . All products of vanish, so the defining group algebra relations hold. A commuting endomorphism has block form with . The quotient by the square-zero ideal of blocks is , a local ring. The entire endomorphism ring is therefore local, so the module is indecomposable. Their unbounded dimensions give infinitely many isomorphism classes over every , rather than relying on an infinite scalar parameter set.
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





