Column group action Created 2026-10-20 Updated 2026-11-05
A column group action often means the action of a matrix group on column vectors by left multiplication: . The rule makes this a left group action, and the identity matrix fixes every column.
The same term is used in Young symmetrizers for the group permuting entries within each column of a tableau. In that setting the action permutes labels rather than multiplying a coordinate column. The surrounding representation must specify which meaning is intended. For a concrete coordinate example, a permutation matrix exchanges two entries of a column vector.
Read each column from top to bottom, with columns ordered from left to right, and compare the resulting words lexicographically. With Young symmetrizer convention , this order gives triangular vanishing of Young-symmetrizer products. Changing the symmetrizer product convention requires a compatible order, rather than retaining a fixed vanishing direction automatically.
Hook product of a partition 2026-10-07
The product of all hook lengths in a Young diagram is the denominator in the hook-length formula, and the scalar in the quasi-idempotence identity for its Young symmetrizer.
Mixed SU(3) tensor representation 2026-10-14
A mixed tensor has defining indices and dual indices. The SU(3) action applies to every upper index and to every lower index. Young symmetrizers select permutation types, while invariant Kronecker deltas take traces and invariant alternating tensors convert an antisymmetric pair of defining indices into a dual index, or conversely. Repeated fundamental and dual tensor rules decompose it with multiplicities: and the conjugate rule, omitting negative labels.
Past exam of the groups and representations course of the University of Oxford 2021 4 a Solution 2026-10-25
For , Dynkin labels correspond to a Young diagram with row lengths . Numbered boxes below give representative Young tableaux; they specify the shapes, not additional component values:Here the dimensions are , , , and . The third is the dual representation : the invariant volume tensor identifies . The last is the Adjoint representation, equivalent to the shape Young symmetrizer construction after converting its three-box column to one lower index and removing the trace.
For , the tensor transformation laws areThese preserve antisymmetry and tracelessness. The Adjoint representation can be treated as complex traceless matrices; a real adjoint scalar field is conventionally represented by Hermitian traceless matrices with the same conjugation action.
Adding one box to the one-box Young diagram gives row shapes and . Thus the first tensor product splits into the symmetric square and exterior square:Their tensors are respectively and . Adding one box to the three-box column gives shapes and . The full four-box column is the determinant representation, trivial because . ConsequentlyFor a mixed tensor , the corresponding pieces are and .
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 43 3 Solution Created 2026-10-03 Updated 2026-10-14
Let be the defining SU(3) representation. A mixed SU(3) tensor representation belongs to , with transformation lawThe unrestricted tensor has dimension . The upper and lower counts are independent; setting them equal would lose part of the printed generality.
For an irreducible tensor, impose the appropriate Young symmetrizer on each set of indices and subtract all upper-lower contractions. Antisymmetric pairs can be converted using the invariant alternating tensor, since and . A full alternating triple is a singlet because . Traces use the invariant Kronecker delta and yield lower-rank tensors. Repeating these operations gives invariant irreducible subspaces, with multiplicities retained.
An explicit algorithm for the complete decomposition starts at , tensors with exactly times, and then with exactly times. At each step applyomitting terms with negative labels and adding multiplicities of coincident terms. The first is the sl3 highest-weight tensor rule: a Young diagram of row lengths gains a box in one of its three rows. The third-row term loses a determinant column of height three, leaving labels . The second rule follows by conjugation, which exchanges and . Thus the procedure determines all constituents of the general tensor, not just one selected symmetry type.
The separately symmetric, traceless component has labels . Before imposing traces its dimension is . The contraction map has target the separately symmetric tensors of degrees and is onto: in polynomial coordinates it is , the adjoint of multiplication by in the monomial-factorial inner product. Multiplication is injective, so the adjoint is surjective. Hence the symmetric traceless SU(3) tensor representation has dimensionFor or the subtracted term is zero. The highest tensor is trace-free and has highest weight . The three positive-root factors in the Weyl dimension formula are , and , giving exactly the kernel dimension above. Thus the whole symmetric traceless kernel is that irreducible constituent.
There is a genuine distinction between this highest-weight constituent and the literal largest-dimensional constituent. For example, contains , obtained by antisymmetrizing one pair, with dimension , whereas the fully symmetric has dimension . Thus cannot be the answer to “largest dimension” for every unrestricted pair of counts.
The maximal dimension in mixed SU(3) tensor powers can nevertheless be determined exactly. Every constituent highest weight differs from by with nonnegative integers , where and . Its labels therefore satisfyIf both are positive, subtracting from both increases the labels to , whose dimension is strictly larger. The resulting boundary labels occur in the tensor: use disjoint antisymmetric upper pairs or disjoint antisymmetric lower pairs, and then take the separately symmetric traceless component. Consequently the exact answer is the finite formulaThis supplies a practical closed finite computation for arbitrary . To reduce it to at most four evaluations, put , and . The first continuous maximum is at , clipped to ; test its two neighbouring allowed integers. The second is similarly at , clipped to . Indeed differentiating the first cubic gives a derivative with the sign of , which changes sign once at that root. For equal upper and lower counts, both maxima are at zero and the familiar result is .
For three quarks, the unconstrained flavour product isThe brackets indicate permutation symmetry: symmetric, mixed, and alternating. The three-quark colour singlet is proportional to and is alternating. The fermion wavefunction must be alternating overall. In the usual spatially symmetric ground-state S-wave, the spin-flavour part must therefore be symmetric.
The three-spin-one-half space has a symmetric spin- sector and mixed-symmetry spin- sectors; it has no fully alternating sector because . Symmetric flavour can pair with symmetric spin, giving the baryon decuplet of spin . The flavour-octet multiplicity space and the spin- multiplicity space both transform as the two-dimensional standard representation of the symmetric group. Their product contains exactly one symmetric combination: its characters at the identity, a transposition and a three-cycle are , so the symmetric multiplicity is . This gives one baryon octet of spin . Alternating singlet flavour would need alternating spin to make the spin-flavour part symmetric, and that sector does not exist. Therefore the Pauli constraint on three-quark flavour multiplets yieldsThe spin-flavour dimension check is , the symmetric spin-flavour SU6 representation.
The spatial-symmetry qualification matters if the wording is interpreted as total alone. Rotationally scalar excited orbital functions can have mixed permutation symmetry. For example, the two independent differences among , multiplied by a symmetric radial factor, span such a space while remaining rotational scalars. Combining this standard permutation representation with the spin- standard representation gives an alternating spin-orbital combination; multiplying by alternating singlet flavour makes it symmetric, and the colour factor restores overall fermionic antisymmetry. Thus total without a symmetric ground-state orbital assumption would not by itself exclude a singlet.
For a quark-antiquark pair, colour singletness selects the contraction , and the independent flavour product givesQuark and antiquark are distinguishable, so there is no three-identical-quark exclusion of either flavour multiplet or either spin. Both the octet and singlet admit spin singlets and spin triplets. Their baryon number is zero. The flavour octet has rows , while the singlet has . The octet's zero-isospin state is , and the singlet is . Each row contains all , and electric charge is .
For ground-state mesons with , opposite intrinsic quark-antiquark parities give . The neutral self-conjugate states have charge conjugation , so both flavour multiplets occur as pseudoscalar mesons and vector mesons, forming a flavour nonet in each channel. Charged and open-flavour states have no individual charge-conjugation eigenvalue. The meson request does not restrict orbital excitation: in general , , and the same formula for applies where defined. Thus the flavour representations stay , with these additional orbital-spin quantum numbers.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 1 Solution Created 2026-10-03 Updated 2026-10-07
A partition of an integer is a finite sequence with sum ; append zeros when comparing lengths. Its Young diagram has cells with . A Young tableau is a bijective filling of these cells by . Write for its row and column stabilizers, and fix the conventionPermutations act on entries on the left, with the rightmost factor acting first. This defines the Young symmetrizer used throughout. In the dictionary order on integer partitions, means that at the first differing part ; equality is allowed in .
Suppose there is no row-column collision between of shape and of shape . Each column of contains at most one entry from each row of . The first rows of therefore contain at mostentries, where is a column length. Thus for every : dominates in dominance order on partitions. If in dictionary order on integer partitions, a first strictly larger part would contradict the corresponding prefix inequality. Hence .
All the bounds must now be equalities. Every column of contains exactly one entry from row of whenever . Choose sending that entry to the entry of in cell . These prescriptions are bijections within the rows. The columns of then have exactly the same sets of entries as the columns of , so for some . ConsequentlyIf a collision was present instead, its two entries supply the first alternative. This proves the row-column collision lemma, including the prescribed order of the two stabilizer factors.
We next prove the Specht module classification. By Maschke's theorem, the group algebra is a semisimple algebra. Use the permitted basic quasi-idempotence of a Young symmetrizer,and put . The coefficient of in is one, because , so .
For , consider . A collision between the rows of and the columns of gives a transposition . Row symmetrization fixes , whereas column antisymmetrization changes its sign, so . If there is no collision, the proved lemma gives with , andIt follows that is zero or . Since permutations span , . In a semisimple algebra this means that is a primitive idempotent, so is an irreducible left module.
If in dictionary order on integer partitions, the collision lemma applied to every gives , and therefore . Sincethe two simple modules cannot be isomorphic. Conversely, Young tableaux of the same shape are related by a permutation, which conjugates their Young symmetrizers and gives isomorphic left ideals. Finally, the center of has the conjugacy-class sums as a basis. Conjugacy classes are indexed by cycle-type partitions, so its dimension is the number of partitions of . The Artin–Wedderburn theorem gives exactly that many simple-module isomorphism classes. We have already produced one for each partition. Thus the form a complete set of pairwise nonisomorphic irreducible modules.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 4 Solution Created 2026-10-03 Updated 2026-10-07
For a partition with at most parts, let be the Schur module constructed in Question 3, equivalently the image of a Young symmetrizer on . For a weakly decreasing integer tuple , put and . Define the rational Schur module byHere is the one-dimensional representation . This is rational, and it is irreducible under the permitted irreducibility assumption; for nonnegative it is the original polynomial Schur module. Larger shifts give the same module, as will also follow from the character formula below.
Write and . For a permutation of the given cycle type, the trace of a permuted tensor power isIn a tensor basis, the trace contracts the matrix entries of around each cycle of ; a cycle of length contributes . This proof applies to nondiagonalizable endomorphisms as well. The eigenvalues give .
The Schur–Weyl duality decomposition, on which and act on the two respective factors, gives the same trace asFor a partition, the character extends polynomially to all endomorphisms because the tensor-power action does. This extension is not asserted for determinant-twisted modules at singular matrices.
We now derive the alternant character formula for the general linear group. Put andUse the permitted symmetric-group character result, the Frobenius alternant character formula:It concerns characters of , rather than assuming the character formula we seek for the general linear group. Substitute the proved trace identity and setThen for every conjugacy class. Independence of the irreducible symmetric-group characters forces .
Each character on diagonal matrices is a symmetric homogeneous polynomial of degree , since conjugation by permutation matrices permutes its arguments. Thus is alternating of degree . Every alternating polynomial of this degree has a unique expansion in alternants : a monomial with repeated exponents has zero coefficient, while each strictly decreasing nonnegative exponent vector is uniquely for a partition of with at most parts. Its coefficient at is the coefficient of that alternant. The identities for therefore give . We have derived the Weyl character formulaFor partitions the quotient is the Schur polynomial, with removable apparent singularities when eigenvalues coincide. For arbitrary dominant integer tuples, multiply the formula for by ; this shifts every numerator exponent by and yields the same boxed formula. The variables must then be nonzero. The expression also shows independence of the shift used to define the determinant twist. Equality of characters identifies these irreducible modules: the group-algebra image on a direct sum of two irreducibles is finite-dimensional and semisimple, and its span of group operators detects the traces on every simple block.
Finally, the character of a dual representation evaluates the original character at . Reverse the numerator's columns after making this substitution. The exponents become . Factoring converts these into for . The denominator undergoes the identical column reversal and factor, so both signs and factors cancel. Hence , andThis tuple is again weakly decreasing, so it is precisely the required dominant label.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 5 3 Solution Created 2026-10-03 Updated 2026-10-07
For a Young tableau , let permute the entries within its rows and within its columns. We use the Young symmetrizer conventionReversing the order gives another usual realization of the same irreducible polynomial module. On the tensor power , the actions areThey commute because applying to every factor commutes with permuting the factors.
We state the permitted combinatorial input explicitly. A Young symmetrizer satisfies , where is the nonzero hook product of a partition. Thus is a primitive idempotent. The standard-tableau decomposition of the right regular module is . Tensor this right-module direct sum with the left module . The map sending to is an isomorphism, with inverse . Therefore the Young-symmetrizer tensor decomposition isThis is a direct sum of -modules; individual summands need not be -invariant.
We also state the allowed Schur algebra result, namely Schur–Weyl duality: the two actions are mutual commutants, andwhere the are pairwise nonisomorphic irreducible homogeneous polynomial representations of degree . We also use the standard Schur algebra equivalence between its modules and homogeneous degree- polynomial representations, so these exhaust the irreducibles in that category. A primitive idempotent has one-dimensional image on and zero image on the other simple factors, so . This identifies the requested irreducibles. They classify the polynomial degree- representations in this tensor power, not all rational representations of every degree.
The length bound for a Schur module is if and only if . A column of length greater than antisymmetrizes more than vectors and gives zero. Conversely, for , fill every tensor position in row with the th basis vector of . Row symmetrization multiplies it by , and column antisymmetrization is nonzero because the vectors within each column are distinct basis vectors.
A rational representation of an algebraic group is a regular morphism into the general linear group of its representation space. For , its matrix entries belong to ; rational here permits determinant denominators but not arbitrary poles on . A one-dimensional rational character of is a Laurent polynomial with and . Comparing Laurent coefficients shows that just one monomial occurs and its coefficient is , hence for .
Restrict a one-dimensional rational character of to its diagonal torus. The same argument in several variables gives . Conjugation by permutation matrices makes all equal. On every diagonalizable invertible matrix it consequently agrees with . The allowed Zariski-density statement, and equality of regular functions on a dense subset, giveThese are the one-dimensional rational characters of the general linear group.
For complete reducibility of rational GL and SL representations, use the compact-group averaging argument. Average any positive definite Hermitian inner product over using normalized Haar measure. The orthogonal complement of an invariant subspace is then -invariant. Differentiating makes it invariant under and therefore under its complex span . The elementary unipotent matrices generate , so the complement is -invariant. This proves complete reducibility. Averaging over similarly gives complete reducibility for rational representations.
Here is an explicit rational extension from SL to GL. Decompose the representation space by the finite scalar center of into subspaces on which acts as , with and . These subspaces are invariant. For , choose with , set , and defineChanging to changes to , so the two factors cancel. It is a homomorphism, since scalar roots multiply up to the same harmless factor, and it restricts to on .
It is rational as well. Every matrix coefficient of has a polynomial representative on . Averaging that representative over the finite scalar center selects its homogeneous parts with . Substitution in the extension gives , a regular function on . Each -invariant subspace decomposes into its parts, and the extension acts on each part by a scalar times an action. Thus these subspaces are also invariant under the chosen extension. Consequently is irreducible if and only if this is irreducible. For , is trivial and the trivial extension supplies the same conclusion.
Row group action Created 2026-10-20 Updated 2026-11-05
A matrix group acts on row vectors on the right by , with . To turn this into a left group action, use . The inverse is necessary to preserve the order of composition.
In Young symmetrizers, a row group instead consists of the permutations preserving each row of a tableau as a set. Its action on entries supports row symmetrization. These two usages concern different objects, so the row representation or tableau convention should be specified.
Schur functor Created 2026-10-07 Updated 2026-11-05
Over the complex numbers, for a partition of an integer , applying a Young symmetrizer of that shape to the tensor power of each vector space gives a Schur functor. The construction respects linear maps because their tensor powers commute with place permutations. For single rows it gives symmetric powers, and for single columns exterior powers.
Schur–Weyl duality 2026-10-07
The commuting actions of the symmetric group and the general linear group on a tensor power are mutual commutants. The displayed sum ranges over partitions with at most rows. The Specht modules and Schur modules are the simple factors for the two actions. In particular a primitive Young symmetrizer selects one copy of the matching Schur module.
Specht modules as minimal left ideals Created 2026-10-07 Updated 2026-11-05
In the complex symmetric-group algebra, normalize a Young symmetrizer by . The row-column collision lemma proves , so is a primitive idempotent and is an irreducible left module. Different shapes are separated by the vanishing corner for . Counting conjugacy classes then proves that these modules exhaust the simple modules.
Young tableau Created 2026-09-28 Updated 2026-10-14
A Young tableau is a filling of a Young diagram with entries, typically positive integers. The shape is the partition of an integer giving its row lengths. We draw Young tableaux in the English convention of Young diagram, with left-aligned rows arranged from top to bottom. A filling need not obey increasing conditions unless these are specified: standard Young tableaux use each of exactly once and strictly increase along rows and down columns; Semistandard Young tableaux permit repetitions and require weakly increasing rows and strictly increasing columns.
In the constructions for a symmetric group involving Young symmetrizers, tabloids, and polytabloids, an unqualified numbered Young tableau means a bijective filling by , with no increasing condition imposed. This narrower convention is compatible with the broader use needed for Semistandard Young tableaux. Historically, Young's work connected these fillings to representation theory of the symmetric group; in particular, the equality between standard Young tableau counts and irreducible representation degrees over the complex numbers predates the modern hook-length formula. See Stanley's Algebraic Combinatorics, historical notes to Chapter 8.