For a row composition and a weakly decreasing marking with , mark the first cells of each row. Antisymmetrize within the marked columns and span the resulting polytabloids in the Young permutation module . This gives ; and for a proper partition . Its characteristic-independent Specht filtration is obtained by successively marking a cell or raising an unmarked row tail, with column-cancellation maps and the good-letter counting recursion.
An ordinary Specht module of non-self-conjugate shape stays irreducible on the alternating group, and conjugate shapes give the same restriction. A self-conjugate shape splits into two irreducibles of equal degree, interchanged by an odd permutation. The index-two inner-product identity is , and Frobenius reciprocity proves exhaustion. The statement applies for ; is trivial.
For a partition of an integer , let sum all tabloids obtained by retaining elements of row and moving its other elements into row , leaving the other row sets unchanged. Here and replaces by ; Young permutation modules are defined for compositions too. Then over every field. Pairwise column cancellation gives inclusion of the Specht module in each kernel. The reverse inclusion follows by straightening the tabloid coefficients using these adjacent-row relations: the remaining free leading coefficients are exactly those of the standard polytabloid basis.
A filling of shape and content defines a module homomorphism : given a numbered tableau, sum over distinct assignments obtained by permuting within its rows, and put each numbered entry into output row when its assigned label is . Restricting to gives . For Semistandard Young tableaux , these restrictions are linearly independent over every field. They form a basis of if the characteristic of a field is not two, or if is a two-regular partition of an integer. For two-singular shapes in characteristic two, they need not span. Column antisymmetrization and triangular leading tabloids establish independence; straightening the images of a cyclic polytabloid establishes spanning under the stated hypotheses.
Standard polytabloid basis by Codex 0 Created 2026-10-14 Updated 2026-10-31
The polytabloids indexed by standard Young tableaux of shape form a basis of over every field, and a basis of its integral lattice over . Column antisymmetry and Garnir relations straighten any polytabloid into this set. Ordering leading tabloids by the rows containing successive entries makes the corresponding coefficient matrix triangular with diagonal entries one, proving independence. In particular the dimension is the standard-tableau count in every characteristic.
Spin orbital by Codex 0 Created 2026-10-14 Updated 2026-10-20
When spatial and spin factors separate, a spin orbital combines a spatial orbital with a normalized spin state . For an electron, choose spin one-half along an axis with . The two spin orbitals and are orthogonal even though their spatial orbital is identical, since their inner product contains . When spatial and spin variables do not separate, the complete one-particle state is instead a multicomponent wavefunction ; exclusion still applies to that complete quantum state.
For the irreducible highest-weight representation of the special linear Lie algebra with Dynkin labels , let be a dominant integral weight. Put and . If these are not integers, the weight multiplicity is zero; otherwise it is .
To derive the formula, use the sl3 interlacing character formula with top row . The target diagonal exponents are , and an interlacing middle row has , with bottom entry . Thus
Every integral in this interval gives exactly one Gelfand–Tsetlin basis vector. The upper bound minus the lower bound is the minimum of six differences: . Since , this minimum reduces to . Counting the interval proves the formula, including absent weights of a representation. This converts a two-dimensional weight diagram calculation into four elementary boundary distances.
In a finite-dimensional representation of an sl2 triple, start with a nonzero vector satisfying and , and set . The commutator identities give the displayed weight and lowering formulas by induction. If and , then forces , a nonnegative integer. The nonzero terminal vector is essential: choosing a later index after the ladder has already vanished gives no constraint. Applied to the Adjoint representation of a semisimple Lie algebra, this argument proves integrality of Cartan integers.
Let and for . For the sl2 Lie algebra, the raising and lowering operators are , , and has weight . A weight basis of the irreducible representation is
A weight basis of the complementary is
The first vector in each list is a highest-weight vector. Applying along the first list gives successive coefficients ; along the second it gives . The final vectors are killed by . At the overlapping weights , the two listed vectors are independent, proving the direct sum.
// Target: semisimple-lie-algebra.bigb
In a finite-dimensional sl2 Lie algebra representation, raising and lowering operators are nilpotent operators, so their exponentials are finite sums. In the defining two-dimensional representation, the displayed product is . It sends to by conjugation, lifting the nontrivial Weyl group reflection. Its square acts on the irreducible highest-weight module by . Thus a Weyl reflection can have a representative of order four on a representation.
// Target: linear-operator-theory.bigb
For the nearest-neighbor symmetric walk on , a return at time uses positive and the same numbers of negative steps along each axis, with . Counting arrangements gives the displayed identity. The sum of squares of the three-category multinomial distribution probabilities is at most their maximum. This maximum occurs at balanced counts and is by Stirling's formula; the central binomial factor is . The total return probability is therefore summable. The expected number of visits is finite, so the probability of returning after time zero is strictly below one, proving that the origin is a transient state.
The relative tangent sheaf is the dual of a sheaf of Kähler differentials. Its sections are derivations of the structure sheaf that kill base scalars. For a smooth morphism it is locally free and describes first-order deformations of sections into the scheme.
Expanding a configuration-space path integral about a classical trajectory with fixed endpoints gives , where obeys homogeneous Dirichlet boundary conditions. The Gaussian functional integral contributes with the phase prescribed by continuation of the quantum-mechanical propagator. Relative to the free operator , the prefactor is . In a general potential the operator, and thus the prefactor, depends on the endpoints through . For a quadratic potential is constant and all higher fluctuation terms vanish, so the approximation is exact away from singular focusing times. At a zero mode the simple determinant formula requires a limiting prescription or a different treatment of the zero mode.
A compact invariant curve with consecutive rays on a smooth toric surface contracts torically to a smooth point exactly when , equivalently when its self-intersection is . Deleting then reverses a toric blowup at a torus-fixed point.
// Target: geometry-and-topology.bigb
The integrated squared second derivative measures a smooth density's curvature in L2. It supplies the leading integrated squared bias constant of a second-order kernel density estimator. For nonzero second moment , the asymptotic mean integrated squared error has bias term , so greater curvature calls for a smaller smoothing bandwidth.
The product Riemannian metric of the round unit two-sphere and a circle has Ricci curvature equal to on the sphere directions and zero on the circle direction. Its scalar curvature is constantly two, but no single scalar multiple of the whole metric equals that Ricci tensor. In two dimensions the identity does make constant scalar curvature equivalent to an Einstein metric.
For a symmetric nonnegative integer matrix, the two neighboring prefix shapes along the diagonal are equal. In the RSK growth-diagram local rule, set and take alternating sums of row lengths. The two occurrences of the alternating sum of cancel, leaving . Induction along the diagonal proves the formula. Each column contributes one to this alternating sum exactly when its length is odd.
A root system spanning a real inner product space is irreducible when it cannot be partitioned into two nonempty mutually orthogonal root systems. Its Dynkin diagram is connected. This condition concerns the roots themselves, rather than an arbitrary ambient space larger than their span.
For nonproportional roots in a reduced root system which is a crystallographic root system, the negative Cartan integers and satisfy . At least one of equals , so reflecting one root in the other produces their sum. The exclusion of opposite roots is essential: their inner product is negative but their sum is zero, which is not a root.
Negative root by Codex 0 2026-10-14
After choosing positive roots in a root system, a negative root is the negative of a positive root. Equivalently, for a regular linear functional defining the positive roots, its value on a negative root is negative. Relative to the associated simple roots, the coefficients of a negative root are all nonpositive integers.

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