Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A nonzero finitely generated Weyl algebra module over is holonomic when it attains the lower bound in the Bernstein inequality for Weyl algebra modules. The zero module is also conventionally called holonomic. Nonzero subquotients of a holonomic module remain holonomic. Additivity and integrality of the leading Hilbert-polynomial multiplicity then bound the number of nonzero factors in any submodule chain, giving finite composition length.
A good Bernstein filtration on a finitely generated module produces a finite graded module over . Its support is the characteristic variety for this filtration. Its algebraic dimension is the Bernstein growth dimension of a Weyl algebra module, which is independent of the choice of good filtration.
Write on . Endpoint evaluation gives and , while midpoint evaluation gives . Thus implies and . These bounds are sharp: has uniform norm one and coefficients .
The explicit Bernoulli stochastic differential equation solution remains positive and finite on every finite interval when . For it diverges when the displayed integral reaches its threshold. At this occurs deterministically. At , Brownian motion has positive probability of making the integral exceed any threshold on a fixed interval, so global existence is not almost sure. The distinction between positive explosion probability and certain explosion matters: the negative linear drift of makes its total positive-power exponential integral finite almost surely when .
For benign subgroups , amalgamate their finite-presentation witnesses over the finitely generated , then adjoin independent stable letters centralizing their finite-generation witnesses. Britton's lemma identifies the subgroup generated by with the extension centralizing . In it, and . Both conjugate witnesses are finitely generated, proving benignity. For the second identity, the subgroup generated by is the iterated amalgamated free product ; its normal forms show that adjoining each outer copy intersects the central copy only in the subgroup already generated by .
If is a benign subgroup, use its witness inside a finitely presented group. Enumerate words on the generators of , together with proofs that each equals a substituted word on the generators of . This enumerates exactly the null words of , giving a recursive presentation of a group. The Higman embedding theorem then embeds the finitely generated quotient in a finitely presented group.
A nonprincipal ultrafilter on the natural numbers gives a Banach limit by taking the ultralimit of the Cesàro means of each bounded sequence. Compactness of a closed bounded interval, or disk for complex sequences, supplies the limit. Finite intersections in the filter give linearity; nonnegative averages give positivity; constants give norm one. The Cesàro theorem for convergent sequences gives agreement with ordinary limits because the ultrafilter contains every cofinite set. For the left shift on bounded sequences, the two means differ by , which tends to zero, proving shift invariance.
The displayed sublinear functional on the real l-infinity sequence space agrees with the ordinary limit on convergent sequences. A dominated extension by the Hahn-Banach theorem therefore defines a generalized limit bounded between the lower and upper limits of the Cesàro means. For the left shift on bounded sequences , the averages of equal , which tend to zero. Domination applied to both signs gives , hence shift invariance. Positivity, agreement on constant sequences and the operator norm one follow from the bounds, so is a Banach limit.
For a nonempty ordered coordinate set , write and . An exact -cover satisfies . A short proof uses the chain rule for information entropy contributions : each conditional subset entropy bounds on the appropriate side, by conditioning reduces entropy. Weighting gives the lower inequality for a fractional packing and the upper inequality for a fractional cover. See Madiman and Tetali, "Information Inequalities for Joint Distributions".
The proportionally fair allocation on a four-cycle has aggregate service on each active odd route and on each active even route. With Poisson arrival rates and exponential document-size parameters , the departure intensity is . The adjacent ratios of the displayed binomial coefficient weight cancel those intensities in detailed balance, with .
For linear smoothers, let and . The centered fixed-point equations of the backfitting algorithm have diagonal identity blocks and off-diagonal blocks . On the centered component space, a consistent system has a unique answer exactly when its homogeneous system has only the zero solution. For two components the reduced equation is . A common centered vector reproduced by both smoothers yields opposite perturbations of the components without changing their sum.
// Target: probability-and-statistics.bigb
For increasing sites and an ordered nonnegative normalized B-spline basis, the matrix is a totally nonnegative matrix. One way to see the minors' signs is knot insertion. Each inserted knot changes coefficients by with , using the standard constant endpoint pieces. This is a nonnegative rectangular bidiagonal map, whose minors are nonnegative. Products preserve that property by the Cauchy–Binet formula. Insert each site to full knot multiplicity; a suitable refined coefficient is then the value . Thus collocation is an ordered row submatrix of the refinement map, and has nonnegative minors. The strict support conditions give invertibility by the Schoenberg–Whitney theorem; its inverse has the checkerboard inverse of a totally nonnegative matrix sign pattern.
For and , this surface integral is finite: near its integrand has size and the two-dimensional area element supplies one further power of distance. Rotational covariance and symmetry make it an axisymmetric symmetric rank-two tensor. Put . Polar integration about the axis gives and . Solving and gives and . Thus the weighted chord tensor becomes an isotropic tensor exactly at .
In a mixed particle-laden gravity current, a size class with settling speed has concentration . The shared reduced gravity is , and . Finite runout therefore requires . A positive minimum settling speed guarantees this; a distribution with arbitrarily small settling speeds need not. For at zero, with , the integral converges precisely when .
For a slender centreline , , let and use local force density , , . Rotation with angular speed gives , henceAxial translation with speed gives exactly the same coefficient for the torque: . Indeed . Both forces and torques here are exerted on the fluid. In the circular case , this reduces to . The equality is also a consequence of the Lorentz reciprocal theorem, since the local resistance tensor is symmetric.
For , the averaged amplitude for position-dependent damping has the displayed logistic-type equation. With , its positive solution is . Small amplitudes grow and large ones decay toward the stable value two; the leading oscillation is .
A correlation time measures how rapidly a stationary stochastic process loses temporal dependence. Specify whether it means an exponential decay time, an integral of the normalized autocorrelation, or another width. For , the exponential time and the one-sided integral both equal .
An augmenting path maximizing the possible increase in flow, namely its smallest residual network edge capacity. If the remaining maximum flow is and the original undirected network has edges, a path has bottleneck at least . Otherwise the vertices reachable through arcs of capacity at least define a cut of capacity strictly less than , contradicting the max-flow min-cut theorem. Only one directed arc per original crossing edge contributes to that cut.
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





