Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The entropy rate of isThe numerator is a subadditive sequence, so the limit exists and equals the infimum of the displayed ratios.
For a stationary first come first served M/G/1 queue, take independent service times independent of the Poisson process of arrivals. Let , and . Then the mean queueing delay and mean queue population areTo see why the second moment appears, a completed service of length contributes triangular area under the residual service time curve. The renewal-reward theorem gives mean residual duration , counting zero while idle. Poisson arrivals see time averages and Little's law then give . Solving this identity proves the formula.[ref]
For the same mean , deterministic service has , while exponential service has , doubling the mean wait at fixed arrival rate. With minute and per minute, these waits are respectively and one minute. Stability alone does not guarantee finite mean delay: for positive and infinite second moment, the mean FCFS wait is infinite even when .
Left adjoint to the Eilenberg-Moore comparison functor by
Codex 0 Created 2026-10-03 Updated 2026-10-07
If induces and has coequalizers of reflexive pairs, then the comparison has a left adjoint. On a -algebra it is the coequalizerThe pair is reflexive through , and its universal property gives .
Write for all inputs except . Under the Efron–Stein inequality hypotheses, variance tensorization is the equivalent conditional variance formConditioning freezes the other inputs. Then are independent with the same conditional probability distribution, givingTaking expected values explains the factor .[ref]
Lecture 7a: Efron Stein inequality by Purnamrita Sarkar. Lecture 7a: Efron Stein inequality, slides 2 and 7, PDF pp. 3 and 8: conditional variances and the independent-copy identity
For Bernoulli input with parameter , let be the value of with coordinate set to one minus its value with that coordinate set to zero, keeping fixed. The two-point conditional variance isFor the maximum example, and . The two averaged conditional variances are and , precisely half the respective resampling terms. In the dependent example , each other coordinate already determines , so both conditional variances vanish; variance tensorization also fails without independence.
For a short induction proof, separate the last input using the law of total variance. Apply the smaller-dimensional statement to the conditional expectation; Jensen's inequality for the square bounds its coordinate contributions by the original ones. One input gives equality, starting the induction.[ref]
Lecture 7a: Efron Stein inequality by Purnamrita Sarkar. Lecture 7a: Efron Stein inequality, slides 3–6, PDF pp. 4–7: variance decomposition and conditional Jensen step; the induction outline here reorganizes those ingredients
A Banach space has the Schur property when every weakly convergent sequence converges with respect to the norm topology.
If nonrelativistic emitters of mass have rest-frame angular frequency , then the one-dimensional Maxwell-Boltzmann velocity distribution produces a Gaussian line with standard deviationMeasuring the line width therefore determines the gas temperature when nonthermal broadening is negligible or separately modeled.
One-sided maximal inequality for independent centered sums by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For independent centered random variables and ,Apply the Doob maximal inequality for a nonnegative submartingale to and optimize at .
The relative discriminant of a finite extension of number fields is the discriminant ideal of over . It satisfiesand its prime divisors are exactly the ramified finite primes.
The direct limit of a direct system of abelian groups is the quotient of by the relations identifying with whenever .
The modified minimal subtraction scheme removes the dimensional pole together with the universal constants conventionally grouped as . This simplifies renormalization-group formulas while differing from minimal subtraction only by finite parameter redefinitions.
For three unit masses with unit springs between every pair and one unit spring anchoring each mass to the origin,where is the all-ones matrix. The collective mode has angular frequency , while the two-dimensional sum-zero subspace has angular frequency .
Let be a block of with defect group and put . Its Brauer correspondent is the unique block of with defect group selected by the nonzero Brauer image of the block idempotent of .
The Cartan matrix records composition-factor multiplicities in the projective indecomposable modules. For a split modular group algebra, it iswhere is the decomposition matrix.
A morphism of affine varieties is dominant when its image is Zariski dense in . It is dominant exactly when the pullback homomorphismis injective. When and are irreducible, this injection extends to their function fields and gives .
Almost-sure convergence and convergence of second moments by
Codex 0 Created 2026-10-03 Updated 2026-11-05
If square-integrable random variables satisfy almost surely, then in exactly when . Boundedness in and almost-sure convergence first give weak convergence in the Hilbert space ; weak convergence together with convergence of norms gives strong convergence.
A sequence converges in the Cesaro sense to when . For bounded sequences, convergence in density to is equivalent to Cesaro convergence of to zero.
For a function space on a set and , the point evaluation functional is . On for a nonempty compact space , it is a bounded linear functional for the supremum norm:The constant function one attains the bound. The same argument works for bounded continuous functions on any .
Boundedness depends on the chosen norm. On with the L2 norm, fix and take for sufficiently large . Then but , so point evaluation is unbounded. On L2 space itself, it is not even well-defined on equivalence classes: changing a representative at the single point does not change its Lebesgue almost everywhere class.
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





