Use the interior for the Sobolev space notation; the closed shell in the PDF specifies its boundary. Put . A weak solution has zero boundary trace in the sense of the Sobolev trace theorem, equivalently , and satisfies
The minus sign is necessary because the operator in the paper is positive divergence, not its negative. One can first test with functions and then use density in the zero-boundary Sobolev space. Smoothness of makes its restriction to the compact radial interval bounded, so both sides define continuous functionals on this space. Merely belonging to without the zero trace would omit the boundary condition.
Fix and . Write when a single addable node of a Young diagram turns into . For each positive part , let be the partition of an integer obtained by decreasing that part by one, sorting, and omitting zeros. The Vershik linear relations are
Equal row lengths must be counted separately on the right. Equivalently, if is the number of rows whose decrement produces , the right side is . There is no multiplicity coefficient on the left because irreducible restriction branching rule for a symmetric group is simple.
To prove the relations, restrict the Young permutation module to the subgroup fixing . The tabloids split into orbits of a group action according to which labeled row contains . Removing that entry gives, for row , the Young permutation module with composition , which is isomorphic to the one for its sorted partition. Hence
Its multiplicity is the right side. On the other hand decompose into irreducible representations first and apply the restriction branching rule for a symmetric group to each summand. Its multiplicity is then the left side. Equality proves the relation.
For example restricts to , so the coefficient is two rather than one. For , the regular representation, the relation reduces to . These checks emphasize why counting distinct resulting partitions without their row multiplicities would give a false recurrence.
The Specht module construction gives a nonzero inclusion over the complex numbers: a polytabloid has coefficient one at its original tabloid, because the row and column stabilizers have trivial intersection, and its span is the corresponding irreducible representation. This establishes without using the multiplicity-one conclusion. Similarly .
By the corrected tensor identity for induced representations and the conjugate-partition sign twist, the multiplicity of in is . The character inner product already computed is the sum of products of multiplicities of common irreducible representations. Thus
Both are positive integers, so . In particular
This deduction avoids assuming the full Young's rule, which would already contain the answer. Alternatively, the permitted one-dimensional R-module homomorphism space gives the same character inner product immediately.
There is an index error in the displayed identity of the original PDF. With its definition of the signed Young permutation module, the tensor identity for induced representations gives
Both superscripts must be . In particular , rather than the printed sign twist of . For , , the printed left side has dimension , while the printed right side has dimension one. Thus that identity cannot hold as written.
The requested character inner product between and nevertheless has a well-defined answer. Let be the row Young subgroup of a tableau of shape , and let be its column subgroup, conjugate to . By Frobenius reciprocity and the Mackey restriction formula, the inner product is a sum over of
These double cosets are encoded by nonnegative integer matrices with row sums and column sums , recording intersection sizes of row and column blocks. The intersection subgroup is a product of . Its sign representation is trivial exactly when every . Each zero-one matrix contributes one, and every other matrix contributes zero.
There is exactly one zero-one matrix with these margins. Its first row has length , equal to the number of nonzero column sums, so that row must consist entirely of ones. Delete it, subtract one from every column margin and discard zero columns. The remaining margins are those of and its conjugate partition; induction forces the rest. The unique matrix is precisely for . Therefore
This calculation uses the actual two modules requested in the PDF and does not depend on its erroneous displayed isomorphism.
The conjugate partition is , obtained by transposing the Young diagram. Transposition sends a standard Young tableau to a standard tableau and negates every Content of a Young-diagram cell.
Use the Young orthogonal form. For an admissible pair and axial distance , the action on is
In the transposed pair it is , whereas in the tensor product of group representations with the sign representation it is . Their diagonal entries agree, and their off-diagonal entries differ by a sign. Fix a reference tableau and let be the sign of the unique label permutation from it to . For every admissible swap , so
intertwines these two actions. In a nonadmissible pair, transposition exchanges row and column and changes the scalar from to or conversely, also agreeing with the sign twist. Since adjacent transpositions generate , this is an isomorphism:
The parity choice is globally well defined because the label permutation is unique; no arbitrary edge-by-edge phase choices are required.
The single-column Young diagram has exactly one standard Young tableau, so has dimension one. Consecutive labels are in one column, and the Young seminormal form gives for every adjacent transposition . These generators determine the representation, and the sign representation sends every one of them to . Consequently
At there are no adjacent generators and both modules are the trivial representation.
It suffices to handle one single-box up-move, and then use the chain already constructed. Suppose the affected row sizes are and , . Since is a partition of an integer, . Put . Over the complex numbers, the two-row Young permutation module decomposition gives
A zero second row is omitted. Therefore
Let be the product of the symmetric groups of the unaffected rows and the symmetric group on the union of the affected rows. The two relevant Young subgroups lie in . Transitivity of induced representations expresses and by inducing the preceding two-row modules, tensored with the trivial representations of the unaffected factors, from to . Induction preserves this direct sum, so
for an actual group representation , not merely a difference of characters. Iterate along the chain and take the direct sum of the induced complements. The resulting complement can be realized as an invariant subspace of , either through these isomorphisms or by Maschke's theorem. Thus
If , use the zero complement. The characteristic-zero hypothesis is essential to this use of the irreducible two-row decomposition.
Let each be a partition of an integer. Pad the lists of parts with zeros and use the dominance order on partitions
The total sums agree, so only finitely many inequalities matter. This is a partial order: reflexivity and transitivity hold term by term, and equality of all partial sums forces equality of every part, proving antisymmetry. For example . It compares concentration in the top rows, whereas diagram inclusion compares individual cells and is a different relation.
Put and take the subgroup permuting the first and last letters. Define the skew representation of a symmetric group as the multiplicity space
The last-letter copy of commutes with , so it acts on a map by . This gives a genuine -module, without claiming that the whole restricted module is itself the skew representation. Equivalently,
Fix a prefix tableau of shape and complete it to shape . Iterated restriction branching rule for a symmetric group identifies the multiplicity-space orthonormal basis with standard skew Young tableaux, using labels for the last cells. The Young orthogonal form restricts to this basis. When is standard and ,
An admissible interchange has , so its off-diagonal coefficient is nonzero. Consequently belongs to the group algebra span of . The preceding reduced-path argument reaches every standard skew tableau, so this span is the whole module. Every is a cyclic vector for a group representation. The inherited invariant inner product makes this a unitary representation.
The inclusion here is inclusion of Young diagrams, not the dominance order on partitions. The skew Young diagram is the set difference of their cells. Two cells are adjacent when they share an edge. It is connected when any two cells can be joined by such steps, and is a rim hook when it is connected and contains no square. Under the usual edge-adjacency convention a totally disconnected skew Young diagram has only singleton components, equivalently no two cells share an edge. A horizontal strip instead means at most one cell per column; this distinction matters for the last part of this question.
A standard skew Young tableau is a linear extension of a partially ordered set: the cells are ordered by the row and column inequalities, and the tableau lists them in increasing label order. Write the current list as and let be the desired label of in . Then is the one-line notation of the unique permutation with .
Whenever this list of desired labels is not increasing, there is an adjacent descent . The cells are incomparable in the cell partial order: if they were comparable, both and would have to put them in the same order. Interchanging their consecutive current labels is therefore admissible. It removes exactly one inversion of a permutation from the list of desired labels. Repeating ends at after exactly the original inversion count, which is the Coxeter length . Thus
This proves the reduced adjacent-swap path between linear extensions and applies equally to ordinary tableaux.
The local spectral interchanges preserve an irreducible representation, and standard Young tableaux of a fixed shape are connected by admissible adjacent interchanges. Different shapes have different multisets of Young-diagram cell contents. Their elementary symmetric functions in the Young–Jucys–Murphy elements are central: the identity
proves this coefficient by coefficient. By the Schur lemma, one irreducible representation cannot therefore contain two different shape classes. The multiset determines a diagram because the counts on its positive and negative diagonals determine its arm and leg lengths at the diagonal cells.
Different irreducible representations cannot share a joint eigenvalue vector: the Gelfand–Tsetlin algebra is generated by the Young–Jucys–Murphy elements, so all its elements would act identically on that vector in both representations, whereas a central primitive idempotent distinguishes their two blocks. Thus distinct irreducibles give distinct shape classes.
The number of irreducible representations is the number of conjugacy classes, each indexed by a partition of an integer. Every spectral vector gives a tableau by the preceding construction. Closure under admissible interchanges makes every shape class that occurs occur in full. The two counts then force every shape to occur, with exactly one irreducible representation per shape. This supplies .
On restricting to , delete the last coordinate. For tableaux of shape , the entry occupies one Removable node of a Young diagram. Grouping by that node gives one copy of the corresponding module; the path decomposition has simple multiplicities. Hence the restriction branching rule for a symmetric group is
The different removable nodes produce distinct partitions. The multiplicity-free structural input defining the Gelfand–Tsetlin basis is distinct from identifying this graph with the graph of Young diagrams.
Necessity is a property of standard Young tableaux alone. The first entry occupies , with Content of a Young-diagram cell zero. Every subsequent cell has a cell immediately above or to its left, of content one larger or one smaller, already present. If two entries occupy the same diagonal, the later cell lies strictly southeast of the earlier. The cells immediately right of and immediately below the earlier one exist and have contents ; their entries lie strictly between the two given entries. This proves all three conditions for content vectors of standard Young tableaux.
For sufficiency, build the Young diagram one cell at a time. All coordinates are integers, because each new coordinate differs by one from an earlier coordinate, starting at zero. Cells of any fixed content are ordered northwest to southeast. For their positions are , ; for they are .
At the first occurrence of a positive , the candidate is . The occurrence of earlier would already force a cell of content in its row, so the neighbor condition must instead supply the content . This supplies the left predecessor. The negative case is symmetric, supplying the upper predecessor, and the first zero gives .
At any later occurrence of , take the next position on its diagonal. The preceding occurrence already supplied all but the next necessary predecessor on each neighboring diagonal. The repeated-entry condition supplies both and after that preceding occurrence, so those next predecessors are present. More explicitly, for and the th occurrence, the left predecessor is the th cell of content , and the upper predecessor is the st cell of content . For both are the st cells on their respective diagonals; for the roles are reversed. These are exactly the predecessors supplied by the two new neighboring occurrences.
The new cell is therefore an addable node of a Young diagram. Induction produces a partition of an integer at every stage, and filling the added cell by its insertion time gives a standard Young tableau. No choice was possible because addable nodes of a Young diagram have distinct contents. Thus
and the construction also proves uniqueness of the tableau with a specified vector.

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