Standard Young tableau Created 2026-10-05 Updated 2026-10-14
A standard Young tableau of shape is a Young tableau that uses exactly once and strictly increases left to right along every row and top to bottom down every column. Formally, a bijection is standard whenwhenever the indicated cells belong to the Young diagram. We write for the set of such fillings and for its cardinality.
For , the five standard Young tableaux are listed below, with each pair giving the top row followed by the bottom row:There are no others: the upper-left entry must be , and choosing the two bottom-row entries fixes both increasing row orders. Of the six choices of two entries from , only bottom row fails, because its would lie below . Hence by direct enumeration, independently of the hook-length formula.
The cells occupied by form a Young diagram: every cell above or to the left of an occupied cell has a smaller label. Consequently a standard Young tableau is equivalently a path from the empty shape to in the Young branching graph, adjoining one addable node of a Young diagram at each step. For , the successive shapes areConversely, number the cell added at step by to recover the standard Young tableau. This path interpretation also makes a standard Young tableau a linear extension of a partially ordered set defined by the row and column requirements; see Stanley's Algebraic Combinatorics, Chapter 8, on tableaux and paths in Young's lattice.
The usefulness goes beyond counting: the standard polytabloid basis of a Specht module over the complex numbers is indexed by , so . Each of the five pictured standard Young tableaux therefore labels one basis element of the irreducible representation of the symmetric group , whose dimension over the complex numbers is five. The filled diagrams index the basis; the actual vectors are polytabloids. The hook-length formula computes this dimension without listing all the standard Young tableaux.
Symmetric group Created 2026-09-24 Updated 2026-11-05
The symmetric group is the group of all bijections of an -element set, with multiplication given by function composition. There are such permutations, since one chooses the images successively in ways.
For , composition is not commutative: but the reversed product is , applying the rightmost permutation first. Every permutation decomposes into disjoint cycles and into transpositions. By Cayley's theorem, every finite group embeds in some symmetric group, so permutation actions provide a universal concrete model of finite group operations.
Symmetric group action on subsets Created 2026-09-24 Updated 2026-11-05
Symmetric product 2026-10-14
The th symmetric product of a space is , where the symmetric group permutes the factors. Its points are unordered -tuples, with repetitions allowed. If is a Riemann surface, elementary symmetric functions in local complex coordinates make its symmetric product a smooth complex manifold, including along the locus of repeated points. A collection of disjoint circles in gives a product torus in this symmetric product.
Symmetry depends on preserved structure 2026-10-14
Take the four-point setthe vertices of a polygon of a rectangle whose side lengths are four and two. Three choices of structure give three different symmetry groups on these same points.
As an unstructured set, has all permutations as symmetries, forming the symmetric group . If Euclidean distance is part of the data, the allowed maps are only the identity, a half-turn rotation, and the reflections across the two coordinate axes. They form a Klein four-group of group order four. To see that nothing is missing, fix the image of one vertex of a polygon: its three other distances, , , and , are distinct, so they uniquely determine the images of the remaining vertices.
Preserving affine structure permits more. The affine mapcycles all four points of . It sends a horizontal side of length four to a vertical side of length two, so it is not an isometry. Yet it preserves the rectangle's vertex set and all affine combinations among those points.
Let and let be the square's quarter-turn rotation. ThenConjugating every square symmetry by gives eight affine maps preserving . This group isomorphism makes the affine symmetry group a dihedral group, although some of its maps do not preserve the original Euclidean distances. There are no further affine symmetries: an affine map preserves the common midpoint of the diagonals, so it must preserve opposite pairs. The image of one vertex has four choices and the image of an adjacent vertex has two; those choices determine the map through three noncollinear points.
ThusAn arbitrary permutation need not be an affine map. For example, exchanging the two top vertices while fixing the two bottom vertices sends the common diagonal midpoint to two different points, which no single affine map can do. The phrase "the symmetry of these points" becomes unambiguous only after stating which structure matters.
Symplectic quotient of the binary subset module Created 2026-10-14 Updated 2026-11-05
Let be even and let be the vector subspace of even-weight vectors. Its dot product is an alternating bilinear form, since on . The orthogonal complement of in is spanned by the all-one vector , which lies in . Consequently the radical of a bilinear form on is , andis a nondegenerate symplectic vector space of dimension . The symmetric group acts by coordinate permutations, preserving this alternating bilinear form.
At , this group action is faithful. A weight-two vector and its complement have weights two and four, so a permutation fixing its quotient class must fix that two-element subset itself. Fixing every two-element subset forces the identity. The resulting embedding is an isomorphism, because the symplectic group over a finite field order formula gives .
Tetrahedral symmetry Created 2026-10-06 Updated 2026-10-07
A regular tetrahedron has a proper rotational symmetry group of order 12, isomorphic to the alternating group acting on its four vertices. Its full spatial symmetry group has order 24 and is isomorphic to the symmetric group ; the additional operations reverse orientation. Three-fold vertex/face-axis rotations and half-turns about opposite-edge midpoints generate the proper group. The distinction matters when a field symmetry uses only proper rotations, but a scalar density also admits reflections.
Transitive group action Created 2026-10-03 Updated 2026-10-25
A group action on a nonempty set is transitive when every two points lie in the same orbit of a group action, equivalently when for all there is a group element with . There is exactly one group orbit: every position is reachable from every other. Requiring avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.[ref]
Transitive Group Actions by Keith Conrad. Definition 1.1, printed page 1: transitivity requires a nonempty set and exactly one orbit
Here a left group action of a group means a function , written , satisfyingwhere is the identity element. Products move the point by first, then by . Transitivity says that an orbit map , , is surjective for every ; it suffices to check one chosen point.[ref][ref]
For example, the symmetric group acts on by . This is a transitive group action, but it is not a free group action: the stabilizer subgroup of is . Both the transposition and the cyclic permutation send to . In contrast, the cyclic group acts on itself by , using modular arithmetic. The group element sending to is uniquely . These two group actions reach the same number of points, but only the second has unique transport between them.
Transitive group actions with and without unique transport
. The symmetric group on three labels has a stabilizer subgroup of group order two at each point, hence two group elements sending any chosen point to any other. The cyclic group acting on itself has trivial stabilizer subgroups and one transport per pair. Red arrows show a generating cyclic permutation; blue arrows show the extra transposition in . Gray loops show the identity element in both group actions. Details.The stabilizer subgroup measures the ambiguity of transport. If , thenThe first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, exactly when . Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives , and there are exactly transports for each pair of points. The example counts are for and for . This separates the number of reachable positions from the number of ways to reach each one.[ref]
Associate a transposition to each edge of a finite connected graph. For a simple path , let . Then , using rightmost-first composition. Thus edge transpositions generate every transposition, and hence the full symmetric group.
Trefoil knot Created 2026-09-28 Updated 2026-10-14
The trefoil is the torus knot . It is the simplest nontrivial knot by crossing number of a knot: . A standard three-crossing alternating knot diagram is reduced, so the Tait crossing-number theorem establishes minimality. The four-crossing knot diagram shown below also represents the trefoil knot, illustrating that a particular projection need not achieve that minimum. Its Seifert genus is one.
Here is a small algebraic certificate that a trefoil knot cannot be deformed into an unknot. One Seifert matrix for a trefoil knot isTaking the determinant gives the Alexander polynomial of a knotwhere allows multiplication by a Laurent unit in the Laurent polynomial ring. No such multiplication turns this three-term Alexander polynomial of a knot into the unknot's value . Since the Alexander polynomial of a knot is a knot invariant, this computation rules out every possible ambient isotopy between the two knots; it does not merely rule out the deformations we happened to try.
The knot group supplies another certificate. The presentation maps onto the symmetric group by and , since both sides of the relation map to the identity. These images generate a non-abelian group, so the knot group cannot be the unknot's infinite cyclic group. However, a trefoil knot and its mirror of a link have isomorphic knot groups: the abstract knot group alone does not distinguish all knots.
Unlabelled combinatorial structure 2026-11-05
An unlabelled combinatorial structure is a combinatorial structure considered up to an appropriate isomorphism, so the names assigned to underlying elements do not distinguish objects. For graphs, this means a bijection of vertices preserving adjacency. A different drawing or vertex numbering can therefore represent the same unlabelled graph.
On three labelled vertices there are simple graphs, but only four unlabelled types: the empty graph, one edge with an isolated vertex, the two-edge path, and the triangle. Simply dividing eight by cannot work because these types have different numbers of automorphisms.
More generally, relabelling gives a group action of the symmetric group on labelled structures. Unlabelled structures are its orbits, and the orbit-stabilizer theorem explains how automorphisms affect orbit size. Burnside's lemma counts the orbits by averaging fixed-point counts.
Variable-permutation action on polynomials Created 2026-10-06 Updated 2026-11-05
The symmetric group acts on multivariate polynomials by replacing each variable by . With , substitution gives . Thus it is a left group action. A polynomial encoding a combinatorial partition has a group orbit encoding all relabelings and a stabiliser subgroup encoding its label symmetries.
Young symmetrizer Created 2026-10-07 Updated 2026-11-05
For a Young tableau , let sum its row permutations and be the signed sum of its column permutations in the group algebra of the symmetric group. The product is a Young symmetrizer. The other order is another conventional realization. It satisfies , where is the hook product of a partition, so division by that scalar gives a primitive idempotent in characteristic zero. Acting on a tensor power constructs a Schur module.
Young-symmetrizer tensor decomposition Created 2026-10-07 Updated 2026-11-05
The standard-tableau right-ideal decomposition of , tensored over that algebra with , gives this direct sum of general linear group modules. With , the map is an isomorphism. Individual summands generally need not be symmetric group submodules; instead each is a Schur module for the commuting action.
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.


