Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

77 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