Set , for . These are distinct nonnegative integers with . Using the falling factorial, the matrix entry can be written
When , the falling factorial vanishes, agreeing with the stipulated convention for a negative factorial argument.
The column polynomials are monic of successive descending degrees. Subtracting lower-degree combinations of columns turns them into without changing the determinant. The Vandermonde determinant therefore gives
The positive sign comes from reversing the usual increasing-degree Vandermonde columns at the same time as writing the differences as .
We now match this denominator with the hook-length formula. The hook lengths in row are precisely
To verify the claim, the first hook in the row has length . As the column index passes from to , its hook length drops by plus the number of lower rows ending at column . The skipped lengths are exactly for those rows: if , then . At the right-hand end, lower rows having the same length as row account for the missing smallest lengths by the same formula. This describes all omitted values, and the remaining count is .
Consequently
Combining the two identities with the hook-length formula proves the determinantal dimension formula
For a cell in a Young diagram, its hook of a Young diagram consists of , all cells to its right in row , and all cells below it in column . If is the conjugate partition, its hook length is
The hook-length formula is
In the Greene–Nijenhuis–Wilf hook walk, a walk at a noncorner cell chooses uniformly one of the other cells in its hook, and stops at a corner. Moves are strictly rightwards or downwards, so termination is certain. A terminal cell must be a Removable node of a Young diagram. For a chosen corner , its probability is zero unless the start satisfies and .
For a start in that northwest rectangle, define
The corner conditions are and , so , and all earlier are positive. Define
and
Then the closed conditional probability is
In particular, if both inequalities are strict, this is
The separate definitions of handle starts in the terminal row, in the terminal column, or at the corner itself without division by zero.
To prove the formula, the product definitions give the identities
with the terminal zero identities interpreted as empty sums. For example, summing the recurrence backwards gives . Also
The first-step equation for the hook walk terminal probability is
Jumps beyond the target rectangle contribute zero. Substituting proves this equation, and gives its boundary value. Since every step increases a coordinate, backward recursion determines the probability uniquely. This proves the claimed expression.
Use the tableau representation supplied by Young seminormal form, stated explicitly in Question 5, or its normalized Young orthogonal form. It constructs the complex Specht module with one basis vector for each standard Young tableau of shape . Its adjacent-transposition matrices imply the content eigenvalues directly.
Indeed, start with and use . On an admissible pair , set , , , and . In the orthogonal basis, is and
Multiplication gives
For a nonadmissible swap, and the next content differs by the same , giving the same conclusion. Induction therefore proves . Every content vector of a standard Young tableau, reconstructed as a standard Young tableau in part (iv), is consequently a spectral weight. Together with the reverse inclusion,
An admissible adjacent swap has nonzero off-diagonal coefficient in Young orthogonal form, and the local spectral calculation in part (i) keeps it inside one irreducible representation. Thus implies .
Two standard Young tableaux of one shape are connected by admissible swaps. Regard each as a linear extension of a partially ordered set of cells. Move the first cell of the desired extension to the front of the other extension: every cell it crosses is incomparable with it, since otherwise their order would be forced in both extensions. Repeat after fixing that first cell. Each step swaps consecutive labels in incomparable cells. Such cells lie strictly northeast and southwest of each other, so their contents differ by at least in absolute value. These are exactly admissible swaps.
This also establishes irreducibility of the constructed tableau representations. A submodule is invariant under the commuting and hence under their joint spectral projections; since their weights are distinct, it is a sum of tableau lines. A nonzero off-diagonal coefficient propagates any included line along every admissible edge, and connectivity then includes all lines. Different shapes give nonisomorphic modules, since their content-vector sets are disjoint and content reconstruction determines the shape. Finally, the Robinson–Schensted correspondence gives , and the sum of squares of irreducible degrees leaves room for no other irreducible representations.
Thus within each irreducible module the weights are exactly the tableaux of one shape, so implies . Hence the two equivalence relations coincide.
We verify all three content vector of a standard Young tableau conditions using the spectral rules proved in part (i).
The first coordinate is zero by part (ii). For the neighbour condition, suppose some has neither nor among earlier coordinates. Try moving successively to the left. Each encountered difference is not ; if it is zero, we have an impossible adjacent equality, while otherwise the local spectral rule permits the swap. If , this procedure must encounter the original first coordinate and give that contradiction. If , it moves to the first position, contradicting . Therefore an earlier neighbour always exists. Starting from , this also proves inductively that every coordinate is an integer.
For the repeated-value condition, suppose it fails and choose a failing pair of equal coordinates with the shortest interval. There is no intervening , since a shorter pair would then also fail. There must be at least one intervening neighbour: otherwise the right-hand could be moved next to the left-hand by admissible swaps. Suppose, for example, that is missing. There cannot be two occurrences of in the interval: between them the required neighbour is missing, producing a shorter failing pair. Thus there is exactly one . All other intervening values differ from by more than , so the two copies of can be moved towards that unique neighbour until the forbidden consecutive pattern appears. Part (i) excludes it. The case in which is missing is identical, using . Both neighbours must therefore occur.
For completeness, these conditions really encode standard Young tableaux. If occurs for the th time, place the next label in
This is the next unfilled cell on diagonal of content . On the first occurrence of a positive diagonal, the earlier-neighbour condition forces its first left predecessor to exist: earlier diagonal values form an interval containing , so a first positive can only be reached through . The negative case uses the predecessor above. On later occurrences, the two neighbours appearing since the previous occurrence ensure that the new cell's left and upper predecessors have already been filled. For diagonal , the same two-neighbour condition supplies both predecessors after the first box. Thus each addition is an addable node of a Young diagram, and the labels form a standard Young tableau.
Conversely, a standard Young tableau starts at ; any later cell has a left or upper predecessor of neighbouring content. Two cells on one diagonal have the cells immediately to the right and below the earlier one between them in the tableau order, supplying both neighbours. Hence its content vector of a standard Young tableau satisfies precisely the stated conditions. The next position on a diagonal is unique, so this construction is a bijection between content vectors of standard Young tableaux and standard Young tableaux.
We have now proved without assuming the desired spectrum identification.
For , define when their Gelfand–Tsetlin basis lines occur in the same irreducible representation. This is well defined: contains the centre of , whose primitive central idempotents separate the irreducible modules, and part 1(ii) says these central elements are polynomials in the . Consequently the same weight cannot label two different irreducible modules.
For content vectors of standard Young tableaux, an admissible adjacent swap of a standard Young tableau exchanges coordinates whose difference has absolute value greater than . Define as the equivalence relation generated by such swaps within .
Equivalently, after reconstructing the tableaux, means that the two tableaux have the same final Young diagram. Indeed, an admissible swap exchanges consecutive entries in incomparable cells, preserves the diagram and leaves a standard Young tableau. Conversely, tableaux of a fixed shape are linear extensions of a partially ordered set, with the cells ordered by their row and column requirements; any two linear extensions are connected by adjacent swaps of incomparable elements. We explain this connectivity and its spectral consequence in part (v).
Since , every joint weight has . In , acts by on the trivial representation and by on the sign representation, which exhaust the irreducible representations. Thus
The content vector of a standard Young tableau conditions similarly require the second coordinate to be a neighbour of , so
These vectors correspond respectively to the single-row tableau of shape and the single-column tableau of shape .
The joint spectrum consists of the tuples of simultaneous eigenvalues of occurring in irreducible complex -modules. A Gelfand–Tsetlin basis is a Gelfand–Tsetlin basis: its vectors lie in the one-dimensional joint eigenspaces selected by successive restrictions. The weight of is when for every .
Define to be the integer tuples satisfying the content vector of a standard Young tableau conditions: ; for , at least one of occurs earlier; and between any two occurrences of the same integer , both and occur. We will justify their tableau interpretation in part (iv).
Here is the local spectral rules for Young–Jucys–Murphy elements calculation used in this question. Average a positive definite Hermitian inner product over , making the representation unitary. The are commuting self-adjoint operators because transpositions are self-adjoint involutions. Put and . The group-algebra relations are
For a unit weight vector , the first relation gives . Thus , , and
has the weight obtained by swapping , with . If , then and . If , then , providing an admissible spectral swap in the same irreducible module.
For the proposed three consecutive weights , these rules give and . But the braid relation in a Coxeter group would imply
a contradiction. Hence the proposed tuple is not in . The same argument, with the signs reversed, excludes as well.
Use the normal ordering identity for up and down operators, placing every before every . The commutator from part (a) implies
by induction on . Multiplying the normal-ordered expansion on the left by therefore gives
where negative indices have coefficient zero and .
We prove that unless and for some integer , and otherwise
The formula holds at . For the next step with , the three contributions in the recurrence, after factoring out , are respectively , , and . Terms with a negative index or are simply absent. Their sum is , giving the required numerator. Parity and nonnegativity exclude every remaining case. This proves the coefficient formula.
Apply the identity to the empty partition. Since , only terms with survive. To finish at , only can contribute, and its coefficient of is , by the Young branching graph correspondence with standard Young tableaux. For ,
Here is the odd double factorial, with . Thus
The operator counts oscillating tableaux, allowing both upward and downward steps. A strictly upward path to level would necessarily have length ; the printed operator specification is what determines when .
The Young lattice, or Young poset, has one vertex for each partition of an integer, including the empty partition, ordered by inclusion of their Young diagrams. A diagram covers another exactly when it adds one box. The Young branching graph is its graded graph: vertices at level are the partitions of , and edges join diagrams differing by one box.
A descending path from to determines a standard Young tableau: label the successive removed boxes , then label the remaining box . Every removed box is a Removable node of a Young diagram, so the resulting labels increase along rows and columns. Conversely, deleting boxes in decreasing label order from a standard Young tableau gives the path. Extending by the unique edge from to the empty diagram yields the usual path-to-tableau correspondence.
For the operator identity, compare the coefficients of each in and . If , a common upper cover exists exactly when a common lower cover exists, and each is then unique: the two diagrams differ by exchanging one box, their union is the upper cover and their intersection the lower cover. Since unions and intersections of partition diagrams are again partition diagrams, these off-diagonal coefficients agree.
The coefficient of in is the number of addable nodes of a Young diagram; its coefficient in counts the choices of a Removable node of a Young diagram. Along the diagram's boundary the two types of corners alternate, beginning and ending with addable corners. Hence there is exactly one more addable than removable corner. For the empty partition the counts are and .
Therefore the up and down operators satisfy
or at level . At level zero, interpret and the lowering contribution as zero. This makes the Young lattice a differential poset.
For an increasing chain of finite groups , regard every as a subalgebra of . The Gelfand–Tsetlin algebra is the unital algebra generated by their centres:
For this paper the chain is , so these centres are . The generators commute: if , an element of commutes with all of , including . Thus the Gelfand–Tsetlin algebra is commutative. Its joint eigenspaces record successive choices in the restriction of an irreducible representation down the chain.
Work over , with the standard inclusions fixing the letters . In the group algebra, the Young–Jucys–Murphy elements are
Thus adds all transpositions involving the newest letter. Conjugating by merely permutes the summands, so commutes with . In particular, if , then and . Hence the whole family is commuting.
Put , the transposition conjugacy-class sum in , with . Then
This identity will connect the Young–Jucys–Murphy elements with the centres of the successive group algebras.
Choose nested interior open sets . For small , part (b) gives a smooth equation on of the form
The divergence-forcing interior H1 estimate is
One can obtain this estimate directly by testing the smooth equation against and applying Young inequality, with a cutoff function equal to one on and supported in . The approximate identity and the convolution bound give, uniformly in ,
with analogous bounds for and . The coefficients need only be bounded on . Therefore is bounded in . It converges to in , and weak sequential compactness in a Hilbert space in this Sobolev space gives . Since was arbitrary, .
Now expand the distributional derivative:
Its right side belongs to , so the interior elliptic regularity estimate gives . More generally, if for an integer , multiplication by the smooth coefficients puts the right side in . Interior elliptic regularity then gives . This elliptic regularity bootstrap proves for every integer .
For any nonnegative integer , choose . The Sobolev embedding theorem on compact interior subsets gives . Taking all proves , for its smooth representative. The first gain from to is the step supplied by the mollified equation; assuming in the initial definition would miss that step.
Fix with and use as the test function in part (a). Its support lies compactly inside . Differentiating the convolution under the integral is allowed, and while . Consequently
Thus
at every stated interior point. This is the convolution derivative identity. The convolutions are local, so no integrability of the smooth coefficients all the way to the boundary is needed. In particular, is the convolution of the product; it must not be replaced by for a variable coefficient.

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