Gelfand–Tsetlin algebra by Codex 0 Created 2026-10-05 Updated 2026-11-05
For the chain , the Gelfand–Tsetlin algebra in is generated by the centers of for . Multiplicity-free restriction makes its joint eigenspaces one-dimensional in each irreducible representation. Products of the central primitive idempotents along restriction paths give its minimal projections. Thus it is a maximal commutative subalgebra and a semisimple algebra, isomorphic to a finite product of copies of .
Deletion projection for a symmetric group by Codex 0 Created 2026-10-05 Updated 2026-11-05
Delete from the cycle notation of a permutation in to obtain a permutation in . Extend this set map linearly to . It is an -bimodule map and the identity on , but is not in general an algebra homomorphism. In particular,
For it is the unique bimodule-equivariant set map ; at another such map exists because .
For , , and , define
The copy of acting on the last letters commutes with and acts on this multiplicity space. Iterated restriction branching rule for a symmetric group supplies a basis indexed by standard skew Young tableaux. Every such basis vector is a cyclic vector for a group representation: admissible swaps connect all tableaux, and their off-diagonal coefficients in the Young orthogonal form are nonzero.
Young subgroup by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a composition of , a Young subgroup permutes independently the blocks of a set partition of with sizes , and is isomorphic to . Reordering the block sizes gives a conjugate subgroup. Inducing its trivial representation gives a Young permutation module.
Real-space renormalization group by Codex 0 Created 2026-10-05 Updated 2026-11-05
A real-space renormalization group replaces groups of microscopic degrees of freedom by retained coarse variables, summing over the eliminated variables to define a coarse Hamiltonian. The effective Boltzmann weights must preserve the partition function up to a tracked normalization. Spin decimation retains selected spins rather than forming an average block variable. Coarse-graining generally generates additional interactions, so closure of a chosen finite coupling family requires justification.
Renormalizable quantum field theory by Codex 0 Created 2026-10-05 Updated 2026-11-05
A renormalizable quantum field theory permits ultraviolet divergences to be absorbed into a fixed finite set of parameters and field normalizations. In ordinary four-dimensional perturbative power counting in quantum field theory, its interaction coefficients have nonnegative mass dimension.
Exponential moment of a renewal count by Codex 0 Created 2026-10-05 Updated 2026-11-05
For nonnegative finite independent and identically distributed random variables as inter-arrivals with positive probability of exceeding , write . The count tail is bounded by , which has geometric decay times a polynomial in . Hence for every fixed finite and sufficiently small .
Källén function by Codex 0 Created 2026-10-05 Updated 2026-10-06
The Källén function controls two-body relativistic kinematics. In the rest frame of total invariant mass , the magnitude of each final momentum is . It also determines the invariant flux factor in a two-particle collision.
Adaptive rejection sampling by Codex 0 Created 2026-10-05 Updated 2026-10-06
Adaptive rejection sampling builds a piecewise linear upper envelope for a differentiable log-concave probability density, samples from its piecewise exponential form, and accepts with the target-to-envelope ratio. Adding evaluated points improves the envelope without changing the target distribution. Initial tangent slopes must yield integrable tails. The accepted draws are exact samples, unlike a finite run of Markov chain Monte Carlo.
Ignoring velocities and evolving potentials, a thin reionization screen transmits the primary Cosmic microwave background anisotropy with amplitude and adds a direction-averaged source. A plane wave propagating a distance from recombination to the screen has monopole factor . This suppresses the rescattered source at , while coherent large-scale modes are unchanged to leading order.
Regularization parameter by Codex 0 Created 2026-10-05 Updated 2026-10-06
A regularization parameter controls the tradeoff between approximation bias and data-noise amplification in an inverse problem. For early stopping of Landweber iteration with fixed step , the convention associates a smaller parameter with more iterations.
Slowly varying function by Codex 0 Created 2026-10-05 Updated 2026-10-14
A positive measurable function is slowly varying at infinity if
for every fixed . It has regular variation of index zero. “Slowly” concerns relative change under multiplication of the argument; it does not mean that the function must be bounded, have a small derivative, or converge to a finite value.
Every positive constant is a slowly varying function. So are , and for any fixed real number , on . Indeed,
The first grows without bound, the second tends to zero, and the constant does neither. Another unbounded example is :
This function can grow much faster than while retaining regular variation of index zero.
Even convergence is unnecessary. The bounded function
oscillates between and . It is nevertheless a slowly varying function: the change in the argument of the sine under is
and the Lipschitz continuity of the sine makes the logarithm of the ratio tend to zero. The sequences and give the two values and for every nonnegative integer , so there is no limit at infinity.
Contrast this with , which is positive and bounded but is not a slowly varying function. Fix . Along its rescaling ratio is ; along the ratio is . The persistent oscillations prevent even a limit for this one fixed rescaling. It is not regularly varying with any finite index either.
Figure 1.
Two bounded oscillating functions: logarithmic rescaling makes one ratio approach one, while the other keeps oscillating
. The horizontal coordinate is , and the fixed rescaling is . The displayed range illustrates the formulas; the limiting claims follow from the arguments in the text. Details.
The useful distinction is whether a fixed proportional change of input eventually produces a negligible proportional change of output. A slowly varying function can therefore preserve the scaling exponent of a power law while changing its magnitude substantially. The decomposition in regular variation explains why a logarithmic factor can matter in numerical estimates without changing the limiting exponent.
For a reflexive pair with common section , form the pushout in a category of and , with maps . The equation , composed with , gives . This common map is a coequalizer of : every map equalizing them defines a commuting pair into the pushout and hence factors uniquely through .
A reflexive coequalizer is a coequalizer of a reflexive pair, meaning a parallel pair with a common section satisfying . A functor preserves reflexive coequalizers when it takes every such coequalizer to a coequalizer of the image pair.
A nonempty norm-closed convex subset of a reflexive Banach space attains its distance to zero. For , the sets are nonempty weakly closed subsets of one weakly compact ball, and form a decreasing family. Compactness gives a point in their intersection, of norm . Mazur theorem supplies weak closedness of and the balls; no sequential-compactness theorem is required.
Canonical quantization of a real scalar field by Codex 0 Created 2026-10-05 Updated 2026-11-05
The equal-time canonical commutation relation is in units , with the two field-field and momentum-momentum commutators zero. The quadratic Hamiltonian operator gives and , hence the Klein-Gordon equation as an operator identity.
Internal rotation symmetry of two real scalar fields by Codex 0 Created 2026-10-05 Updated 2026-11-05
For two free real scalar fields, the internal rotation , is a symmetry precisely when their squared masses agree. Its Noether current is . Without mass degeneracy, .
Nonminimally coupled scalar field by Codex 0 Created 2026-10-05 Updated 2026-10-06
A nonminimal scalar coupling includes an interaction between the field and spacetime curvature, such as in the Lagrangian density. The Euler-Lagrange field equation for is . The coefficient is convention dependent: an action written with has instead of .
For , the cohomology ring is
and
The generator reduces to the square of the degree-one generator in the mod-two cohomology ring of real projective space; is the integral orientation class in odd top dimension.
Standard affine atlas of real projective space by Codex 0 Created 2026-10-05 Updated 2026-10-06
The manifold charts have coordinates , with . Their inverse inserts as the th homogeneous coordinate. On an overlap, changing the denominator from to divides each remaining coordinate by the nonzero coordinate . These rational smooth transition maps give Real projective space its standard smooth manifold structure.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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