Alphabeta Math
Pipeline-generated
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.

Frobenius Characteristic and the Symmetric-Group Character Dictionary — Examples

1 · Prerequisites

2 · Summary

These computations and counterexamples exercise the character dictionary of the companion page at the smallest symmetric groups. The first example expands all three Schur functions in degree three in the power-sum basis and reads off the full character table of S3 together with its orthogonality checks; the second recomputes the Young permutation module M(2,1) from both the fixed-tabloid count and Young's rule and matches it with h2h1=s(3)+s(2,1). The third verifies the omega/sign-twist rule on the conjugate pair (3,1) and (2,1,1) of S4, and the counterexample separates the outer induction product, which lands in R(Sm+n), from the Kronecker tensor product of two representations of one symmetric group.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Frobenius characteristic dictionary for S3

Example

For n=3, expand the three Schur functions s(3),s(2,1),s(1,1,1) in the power-sum basis and recover the character table of S3. The expansion is

s(3)=h3=p13+3p1p2+2p36,s(2,1)=h2h1−h3=p13−p33,s(1,1,1)=e3=p13−3p1p2+2p36,

so the coefficients of pρ/zρ give the table, on cycle types (13),(2,1),(3) respectively:

χ(3)=(1,1,1),χ(2,1)=(2,0,−1),χ(1,1,1)=(1,−1,1).

The degrees are f(3)=f(1,1,1)=1 and f(2,1)=2, matching the number of standard tableaux, and the columns are orthogonal with ∑λfλχλ(1)=1+4+1=6=∣S3∣.

Facts & Assumptions

Given: The partitions (3),(2,1),(1,1,1) of 3 and the cycle types (13),(2,1),(3) of S3.

[F1]

Jacobi–Trudi and dual Jacobi–Trudi: s(3)=h3, s(2,1)=det⁡(h2h3h0h1)=h2h1−h3, and s(1,1,1)=e3, with h0=e0=1 (Jacobi–Trudi and dual Jacobi–Trudi identities).

[F2]

h3=∑ρ⊢3pρ/zρ=p13+3p1p2+2p36, using z(13)=6, z(2,1)=2, z(3)=3; likewise h2=p12+p22 and h1=p1 (Complete homogeneous functions expand in power sums with cycle-distribution coefficients).

[F3]

The involution ω satisfies ω(hr)=er, ω(p1)=p1, ω(p2)=−p2, ω(p3)=p3, and it is an algebra homomorphism, so e3=ω(h3)=p13−3p1p2+2p36 (The omega involution conjugates Schur functions).

[F4]

ch⁡(χλ)=sλ for every λ⊢3, and χλ(ρ) is the coefficient of pρ/zρ in the power-sum expansion of sλ, i.e. χλ(ρ)=⟨sλ,pρ⟩H (The characteristic of a Specht character is a Schur function, Irreducible symmetric-group character values are power-sum coefficients).

[F5]

fλ=dim⁡CSλ is the number of standard λ-tableaux, so f(3)=f(1,1,1)=1 and f(2,1)=2 (Standard polytabloids form a basis of a complex Specht module).

Verification

technique · direct
1.1F2given

The cycle types of S3 are (13),(2,1),(3), with z(13)=13⋅3!=6, z(2,1)=2⋅1=2 and z(3)=3, so [F2] gives h1=p1, h2=p12+p22 and h3=p13+3p1p2+2p36.

1.2F1F3

The three relevant Schur functions are s(3)=h3, s(2,1)=h2h1−h3 and s(1,1,1)=e3=ω(h3) by [F1] and [F3].

1.3F5given

The numbers of standard tableaux are f(3)=1, f(2,1)=2 and f(1,1,1)=1 by [F5].

2.1F3step 1.1step 1.2algebra

Substituting step 1.1 into step 1.2: s(3)=p13+3p1p2+2p36; s(2,1)=p12+p22 p1−p13+3p1p2+2p36=3p13+3p1p2−p13−3p1p2−2p36=p13−p33; and s(1,1,1)=ω(h3)=p13−3p1p2+2p36.

3.1F4step 2.1algebra

By [F4], χλ(ρ) is the coefficient of pρ/zρ in the expansion of step 2.1; since z(13)=6, z(2,1)=2, z(3)=3, the coefficients of p(13)/6,p(2,1)/2,p(3)/3 in s(3),s(2,1),s(1,1,1) are respectively (1,1,1), (2,0,−1) and (1,−1,1).

4.1step 1.3step 3.1algebra∎

The identity-column sum is 1⋅1+2⋅2+1⋅1=6=∣S3∣. The weighted squared row norms are 16+12+13=1, 46+0+13=1, and 16+12+13=1 in the displayed row order. The weighted products of the three distinct row pairs are 26−13=0, 16−12+13=0, and 26−13=0. The column squared norms are 1+4+1=6, 1+0+1=2, and 1+1+1=3, and the distinct column products are 1−1=0, 1−2+1=0, and 1−1=0. Thus the rows are orthonormal with weights 1/zρ, and the columns are orthogonal with squared norms zρ.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Young permutation characteristic for shape (2,1)

Example

For S3, the Young permutation module M(2,1) has ch⁡(M(2,1))=h2h1=s(3)+s(2,1), and its character takes the values (3,1,0) on cycle types (13),(2,1),(3), decomposing as χ(3)+χ(2,1); this agrees with Young's rule M(2,1)≅S(3)⊕S(2,1) and with the dictionary table.

Facts & Assumptions

Given: The partition (2,1) of 3, the cycle types (13),(2,1),(3) of S3, and a permutation w∈S3.

[F1]

ch⁡(φ(2,1))=h(2,1)=h2h1, where φ(2,1) is the character of M(2,1), and hλ=∏ihλi (The characteristic of a Young permutation character is complete homogeneous, Elementary and complete families freely generate the stable ring).

[F2]

φ(2,1)(w) is the number of (2,1)-tabloids fixed by w (The character of a permutation representation counts fixed points).

[F3]

Young's rule: M(2,1)≅(S(3))⊕K(3),(2,1)⊕(S(2,1))⊕K(2,1),(2,1)⊕(S(1,1,1))⊕K(1,1,1),(2,1), with Kλμ the number of semistandard λ-tableaux of content μ (Young's rule for complex permutation modules, Semistandard tableaux and Kostka numbers).

[F4]

For partitions of the same integer, hμ=∑λKλμsλ with Kλμ=0 unless λ⊵μ and Kμμ=1 (The Kostka change of basis is dominance-unitriangular).

[F5]

In the dictionary example for S3, s(3)=p13+3p1p2+2p36, s(2,1)=p13−p33, with χ(3)=(1,1,1) and χ(2,1)=(2,0,−1) on the cycle types (13),(2,1),(3) (The Frobenius characteristic dictionary for S3).

Verification

technique · direct
1.1F2given

Listing the three (2,1)-tabloids by their two-element row: {12}∣{3}, {13}∣{2}, {23}∣{1}. The identity fixes all three; the transposition (12) fixes exactly {12}∣{3}, because a fixed tabloid must have both its row sets w-invariant, and (12) preserves {1,2} and {3} but moves {1,3} to {2,3} and {2,3} to {1,3}; the 3-cycle (123) fixes none, since a row set of size 2 is never invariant under a 3-cycle. Hence φ(2,1)=(3,1,0) on the cycle types (13),(2,1),(3).

1.2F1

By [F1], ch⁡(φ(2,1))=h2h1.

1.3F3F4givenalgebra

The Kostka numbers for μ=(2,1) are K(3),(2,1)=1 (the single semistandard tableau 1 1 2 of shape (3)) and K(2,1),(2,1)=1 (the tableau with first row 1 1 and second row 2), while K(1,1,1),(2,1)=0 both because two entries equal to 1 would have to occur in the same column and because (1,1,1) does not dominate (2,1) [F4]; so Young's rule [F3] gives M(2,1)≅S(3)⊕S(2,1).

2.1F1F5step 1.2algebra

By [F5] the dictionary example gives s(3)+s(2,1)=p13+3p1p2+2p36+p13−p33=3p13+3p1p26=p13+p1p22; on the other hand h2=p12+p22, so h2h1=(p12+p2)p12=p13+p1p22. Therefore h2h1=s(3)+s(2,1), and step 1.2 identifies this with ch⁡(φ(2,1)).

2.2F5step 1.1algebra

Adding the values of χ(3) and χ(2,1) from [F5] gives (1,1,1)+(2,0,−1)=(3,1,0) on the cycle types (13),(2,1),(3), exactly the values computed for φ(2,1) in step 1.1.

3.1F5step 1.3step 2.1step 2.2∎

The two routes agree: directly, φ(2,1)=(3,1,0)=1⋅χ(3)+1⋅χ(2,1) by step 2.2, matching the Young's-rule decomposition M(2,1)≅S(3)⊕S(2,1) of step 1.3; symmetrically, ch⁡(φ(2,1))=h2h1=s(3)+s(2,1) by steps 1.2 and 2.1, matching the dictionary table of [F5].

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Sign twist conjugates the (3,1) character of S4

Example

In S4, the character χ(3,1) has values (3,1,−1,0,−1) on the cycle types (14),(2,1,1),(2,2),(3,1),(4), and multiplication by the sign character, sgn⁡(ρ)=(−1)4−ℓ(ρ), gives (3,−1,−1,0,1), which are the values of χ(2,1,1). Thus S(3,1)⊗sgn⁡≅S(2,1,1), in agreement with ω(s(3,1))=s(2,1,1).

Facts & Assumptions

Given: The partitions (3,1) and (2,1,1)=(3,1)′ of 4 and the cycle types (14),(2,1,1),(2,2),(3,1),(4) of S4.

[F1]

Jacobi–Trudi and dual Jacobi–Trudi give s(3,1)=h3h1−h4 and s(2,1,1)=e3e1−e4 (Jacobi–Trudi and dual Jacobi–Trudi identities).

[F2]

h4=∑ρ⊢4pρ/zρ=p14+6p12p2+8p1p3+3p22+6p424, since z(14)=24, z(2,1,1)=4, z(2,2)=8, z(3,1)=3, z(4)=4 (Complete homogeneous functions expand in power sums with cycle-distribution coefficients).

[F3]

The involution ω satisfies ω(hr)=er and ω(pr)=(−1)r−1pr, and ω(sλ)=sλ′; consequently e4=ω(h4)=p14−6p12p2+8p1p3+3p22−6p424 and ω(s(3,1))=s(2,1,1) (The omega involution conjugates Schur functions).

[F4]

ch⁡(χλ)=sλ and χλ(ρ) is the coefficient of pρ/zρ in the power-sum expansion of sλ (The characteristic of a Specht character is a Schur function, Irreducible symmetric-group character values are power-sum coefficients).

[F5]

For w∈Sn of cycle type ρ, the sign is sgn⁡(w)=(−1)n−ℓ(ρ), and the tensor-product character satisfies χV⊗sgn⁡(w)=χV(w)sgn⁡(w); moreover Sλ⊗sgn⁡≅Sλ′ and χλ′(w)=(−1)n−ℓ(ρ)χλ(w) (A k-cycle has sign (−1)k−1, and sgn⁡(σ)=(−1)n−c(σ) when fixed points are counted as cycles, Sign twist corresponds to the omega involution).

Verification

technique · direct
1.1F2F3given

The cycle types of S4 together with their centralizer orders are (14) ⁣:24, (2,1,1) ⁣:4, (2,2) ⁣:8, (3,1) ⁣:3 and (4) ⁣:4; hence by [F2] and [F3], h4=p14+6p12p2+8p1p3+3p22+6p424 and e4=p14−6p12p2+8p1p3+3p22−6p424.

1.2F1F3

With h1=p1 and h3=p13+3p1p2+2p36 and e3=ω(h3)=p13−3p1p2+2p36, [F1] gives s(3,1)=h3h1−h4 and s(2,1,1)=e3e1−e4.

2.1F3step 1.1step 1.2algebra

Substituting step 1.1 into step 1.2: s(3,1)=p14+3p12p2+2p1p36−p14+6p12p2+8p1p3+3p22+6p424=p14+2p12p2−p22−2p48, and s(2,1,1)=p14−3p12p2+2p1p36−p14−6p12p2+8p1p3+3p22−6p424=p14−2p12p2−p22+2p48.

3.1F4step 2.1algebra

By [F4] the values χλ(ρ) are the coefficients of pρ/zρ in step 2.1; with the centralizer orders of step 1.1 this gives χ(3,1)=(3,1,−1,0,−1) and χ(2,1,1)=(3,−1,−1,0,1) on the cycle types (14),(2,1,1),(2,2),(3,1),(4).

4.1F3F5step 3.1algebra∎

Multiplying pointwise by the sign values sgn⁡(ρ)=(−1)4−ℓ(ρ), namely (+1,−1,+1,+1,−1), turns the values of step 3.1 into (3⋅1, 1⋅(−1), (−1)⋅1, 0⋅1, (−1)⋅(−1))=(3,−1,−1,0,1), which are exactly the values of χ(2,1,1); this agrees with the module isomorphism S(3,1)⊗sgn⁡≅S(2,1,1) and with ω(s(3,1))=s(2,1,1) of [F3].

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Outer induction is not the Kronecker product

Statement refuted

The claim refuted is: the outer induction product of two symmetric-group characters is the same operation as the Kronecker (tensor) product of two representations of one symmetric group, so that for f,g∈R(Sn) the outer product f∘g∈R(S2n) coincides with the tensor product f⋅g∈R(Sn). Take n=1 and let 11 be the trivial character of S1. The outer product 11∘11=Ind⁡S1×S1S2(11⊠11) is the permutation character of S2 on the two cosets of S1×S1, with values (2,0) on the cycle types (12),(2) and decomposition χ(2)+χ(1,1); its characteristic is p12=s(2)+s(1,1). By contrast, the tensor product of the two one-dimensional trivial representations of S1 has dimension 1⋅1=1, lies in degree 1 and remains a representation of S1. Hence the outer induced product and the same-rank tensor product are different operations: an outer coefficient such as c(1),(1)(2)=1 records a multiplicity for representations of S1×S1 inducing to S2, not a tensor-product multiplicity for two representations of one symmetric group.

Facts & Assumptions

Given: The trivial characters 11 of S1 and 12 of S2, the transposition τ∈S2, and the subgroup H:=S1×S1={1}≤S2.

[F1]

The outer product is f∘g=∑i,jaibjInd⁡Sm×SnSm+n(χi⊠ψj) for f=∑iaiχi∈R(Sm), g=∑jbjψj∈R(Sn), with (χi⊠ψj)(σ,τ)=χi(σ)ψj(τ); for m=n=1 the subgroup S1×S1 is the trivial subgroup of S2 (The outer induction product of symmetric-group characters).

[F2]

Frobenius' formula: Ind⁡HGθ(g)=1∣H∣∑x∈G: x−1gx∈Hθ(x−1gx) for a character θ of a subgroup H≤G (Frobenius' formula for the character of an induced representation).

[F3]

ch⁡(f)=∑ρ⊢nf(ρ)pρ/zρ is linear, and ch⁡(f∘g)=ch⁡(f)ch⁡(g) for f∈R(Sm), g∈R(Sn) (The Frobenius characteristic map, The Frobenius characteristic preserves outer products).

[F4]

ch⁡(χλ)=sλ for the Specht characters of Sn, and χ(2),χ(1,1) are the two pairwise inequivalent irreducible characters of S2 (The characteristic of a Specht character is a Schur function, Specht modules classify the complex irreducibles of Sn, Distinct complex Specht modules are inequivalent, Column antisymmetrizers, polytabloids, and Specht modules).

[F5]

Jacobi–Trudi and dual Jacobi–Trudi: s(2)=det⁡(h2)=h2 and s(1,1)=det⁡(e2)=e2 (Jacobi–Trudi and dual Jacobi–Trudi identities).

[F6]

The involution ω satisfies ω(h2)=e2 and ω(pr)=(−1)r−1pr (The omega involution conjugates Schur functions).

[F7]

h2=p12+p22 in ΛQ2, since z(1,1)=2=z(2) (Complete homogeneous functions expand in power sums with cycle-distribution coefficients).

[F8]

The tensor product of two finite-dimensional complex representations of a group G is a representation of G on the same group, with χV⊗W(g)=χV(g)χW(g) and dim⁡(V⊗W)=(dim⁡V)(dim⁡W) (The tensor product of two complex representations, Characters add on direct sums, multiply on tensor products, and conjugate on duals).

[F9]

Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters (Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters).

Counterexample

technique · direct
1.1F1F2

The subgroup H=S1×S1 is the trivial subgroup of S2, and 11⊠11 is the trivial character of H. By [F2], Ind⁡HS2(11⊠11)(1)=11∑x∈S21=2, while for the transposition τ the condition x−1τx∈H={1} fails for every x, so Ind⁡(τ)=0.

1.2F3given

Since 11 is the trivial character of S1, whose only cycle type is (1) with z(1)=1, [F3] gives ch⁡(11)=p1; hence ch⁡(11∘11)=ch⁡(11)2=p12.

1.3F6F7algebra

By [F7], h2=p12+p22, so e2=ω(h2)=p12−p22 by [F6], and therefore h2+e2=p12.

1.4F8given

The tensor product of two 1-dimensional complex representations of S1 is a 1-dimensional complex representation of S1 with character the product of the two characters, so it lies in cf(S1) and has degree 1; the value of the product of two trivial characters at the identity is 1.

2.1F5step 1.3algebra

By [F5] and step 1.3 applied to the identities s(2)=h2, s(1,1)=e2, one has s(2)+s(1,1)=h2+e2=p12.

2.2F3F4step 1.3

By [F4] and [F3], ch⁡(χ(2))=s(2)=h2=p12+p22 and ch⁡(χ(1,1))=s(1,1)=e2=p12−p22; reading the coefficients of pρ/zρ in these expansions with z(1,1)=z(2)=2 gives χ(2)=(1,1) and χ(1,1)=(1,−1) on the cycle types (12),(2).

3.1step 1.2step 2.1

Steps 1.2 and 2.1 give ch⁡(11∘11)=p12=s(2)+s(1,1) in Λ2.

4.1F4F9step 1.1step 3.1step 2.2

Step 3.1 and step 2.2 show that the character of the induced module 11∘11 equals χ(2)+χ(1,1), namely (2,0) as computed in step 1.1; by [F9] the induced module is isomorphic to S(2)⊕S(1,1), so the outer coefficient c(1),(1)(2)=1 is the multiplicity of S(2) in a module induced from S1×S1 to S2.

5.1step 1.4step 4.1∎

The two sides are therefore objects attached to different symmetric groups: the outer product 11∘11 is an element of R(S2), namely the degree-2 character (2,0) with ch⁡(11∘11)=p12, while the tensor product of the two one-dimensional trivial representations of S1 is an element of R(S1) of degree 1 with value 1 at the identity [step 1.4]; a class function on S2 with value 2 at 1 and a class function on the one-element group S1 cannot be the same function, and an outer product coefficient records a multiplicity for representations of Sm×Sn inducing to Sm+n, not a tensor-product multiplicity inside one R(Sn). This refutes the identified claim.

Sources