Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Young's rule for M^(2,1)

Statement

Work over C. Let μ=(2,1)⊢3 and let v1,v2,v3 be the (2,1)-tabloids, vi being the tabloid whose singleton second row is {i}, so that its first row is the complementary pair. Then:

  1. (Kostka numbers.) K(3),(2,1)=1, K(2,1),(2,1)=1 and K(1,1,1),(2,1)=0.
  2. (Young's rule.) There is an isomorphism of CS3-modules M(2,1)≅S(3)⊕S(2,1), the shape (1,1,1) contributing no summand.
  3. (Concrete decomposition.) Inside M(2,1) one has M(2,1)=C(v1+v2+v3)⊕S(2,1), where C(v1+v2+v3) is the trivial submodule, isomorphic to S(3), and S(2,1)=span⁡C{v3−v1, v2−v1} is the sum-zero hyperplane. In particular the dimension count is 3=1+2, and the multiplicity of S(2,1) in M(2,1) is 1.

Facts & Assumptions

Given: the group S3, the partition μ=(2,1), the three partitions (3),(2,1),(1,1,1) of 3, and the tabloids v1,v2,v3 of the Statement.

[F1]

The (2,1)-tabloids form a basis of M(2,1), the action is by relabelling the entries, and a tabloid of shape (2,1) is determined by the label of its singleton second row (Young subgroups, tabloids, and permutation modules).

[F2]

A semistandard filling of [λ] with content μ satisfies: the entry i occurs μi times, entries weakly increase along rows and strictly increase down columns; Kλ,μ is the number of such semistandard fillings (Semistandard tableaux and Kostka numbers).

[F3]

Over C one has M(2,1)≅⨁λ⊢3(Sλ)⊕Kλ,(2,1) as CS3-modules, and the multiplicity of Sλ is Kλ,(2,1) (Young's rule for complex permutation modules).

[F4]

For a (2,1)-tableau s the polytabloid is es=κs⋅{s} with κs=∑γ∈Cssgn⁡(γ)γ over the column stabilizer Cs, and a transposition has sign −1. The tabloid of a tableau is determined by its two row sets, so {t}=v3 for t=123 and {u}=v2 for u=132; their column stabilizers are Ct={id,(13)} and Cu={id,(12)} (Column antisymmetrizers, polytabloids, and Specht modules, Row and column stabilizers, Young subgroups, tabloids, and permutation modules, A k-cycle has sign (−1)k−1, and sgn⁡(σ)=(−1)n−c(σ) when fixed points are counted as cycles).

[F5]

The standard polytabloids of a partition form a basis of the complex Specht module (Standard polytabloids form a basis of a complex Specht module).

[F6]

The complex Specht modules are irreducible (Complex Specht modules are irreducible). For the one-row shape (3) the unique tabloid is fixed by every permutation and the column stabilizer is trivial, so its polytabloid is that tabloid and S(3) is one-dimensional and trivial (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).

No form of the Axiom of Choice is used; all enumerations below are finite and explicit.

Proof

technique · direct
1.1givenF1

The tabloids v1,v2,v3 are distinct by [F1], since their singleton second rows {1},{2},{3} are distinct; by [F1] they form a basis of M(2,1), so dim⁡CM(2,1)=3.

1.2givenF2

The semistandard fillings with content (2,1) are enumerated by shape. Shape (3): the single row carries two 1's and one 2 weakly increasingly, so the only filling is 112 and K(3),(2,1)=1. Shape (2,1): the entry in the box (2,1) must strictly exceed the entry in the box above it, and only the entries 1,2 occur, so (2,1) carries 2 and (1,1) carries 1; the remaining entry 1 fills the box (1,2), whose left neighbour is 1, and weak increase holds; hence the unique filling is 112 and K(2,1),(2,1)=1. Shape (1,1,1): the three boxes form a column with strictly increasing entries, but the content has the entry 1 twice, so no such filling exists and K(1,1,1),(2,1)=0.

2.1F1F4F5step 1.1algebra

The shape (2,1) has exactly two standard tableaux: the entry 1 must occupy the box (1,1), and the remaining boxes (1,2) and (2,1) receive 2 and 3 in either order, both fillings being standard, namely t=123 and u=132. By [F4] one has κt=id−(13) and κu=id−(12), and the action on tabloids is by relabelling, so (13)⋅v3=v1 and (12)⋅v2=v1. Hence et=v3−v1 and eu=v2−v1, whose coordinate vectors (−1,0,1) and (−1,1,0) in the basis v1,v2,v3 of [F1] are linearly independent. By [F5] the standard polytabloids of shape (2,1) form a basis of S(2,1), whose dimension is therefore the number 2 of standard tableaux, so {et,eu} is a basis of S(2,1).

2.2F3step 1.2algebra

Substituting step 1.2 into [F3] gives the CS3-isomorphism M(2,1)≅(S(3))⊕1⊕(S(2,1))⊕1⊕(S(1,1,1))⊕0=S(3)⊕S(2,1), which is claim 2 and shows that the multiplicity of S(2,1) in M(2,1) is one.

2.3givenF1step 1.1algebra

Put w:=v1+v2+v3 and let H:={a1v1+a2v2+a3v3:a1+a2+a3=0} be the sum-zero hyperplane. Every σ∈S3 permutes the tabloid basis, so σw=w and Cw is a submodule isomorphic to the trivial representation; and H is σ-stable, since σ merely permutes the coefficients. For any a=a1v1+a2v2+a3v3 with c:=(a1+a2+a3)/3 one has a=cw+(a−cw) with a−cw∈H, so M(2,1)=Cw+H; and Cw∩H=0, since cw∈H forces 3c=0, hence c=0. Therefore M(2,1)=Cw⊕H with dim⁡CH=2.

3.1F5F6step 1.1step 2.1step 2.2step 2.3algebra

By step 2.1 the standard polytabloids et=v3−v1 and eu=v2−v1 form a basis of S(2,1), and both lie in H because their coordinates sum to zero; hence S(2,1)=span⁡{v3−v1,v2−v1}⊆H with dim⁡CS(2,1)=2=dim⁡CH, so S(2,1)=H. By [F6] S(3) is one-dimensional and trivial, whereas S(2,1) has dimension two by step 2.1; they are therefore non-isomorphic, and Cw≅S(3) and H=S(2,1) are exactly the two summands found in step 2.2; combined with step 2.3 this proves claim 3 and the dimension count 3=1+2.

4.1F1F2F4F6step 2.2step 2.3step 3.1∎

Consistency and boundary audit. The third partition (1,1,1) of 3 contributes nothing, as computed directly from the strict column increase in step 1.2; the value K(2,1),(2,1)=1 follows from the unique filling enumerated in step 1.2; the row shape (3) contributes exactly one trivial summand, realized concretely as C(v1+v2+v3); and the column shape (1,1,1) would require three distinct entries, which content (2,1) does not provide. The decomposition Cw⊕H is σ-stable for every σ∈S3 by step 2.3, and the ambient module has dimension three over C, so 3=1+2 is the complete dimension count. This proves the Statement.

Remarks

  • What the example checks. The example checks both halves of the picture in one three-dimensional module: the multiplicities 1,1,0 are read off from the semistandard fillings, and the abstract decomposition is realized by the familiar splitting of the permutation module into constants and sum-zero vectors, with S(2,1)={a1v1+a2v2+a3v3:∑iai=0} (this basis is computed in step 2.1 and the identification of the hyperplane with S(2,1) is step 3.1; see also Polytabloids of shape (2,1) for the same polytabloid computation).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources