Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

The Frobenius characteristic preserves outer products

Statement

For all m,n≥0 and all f∈R(Sm), g∈R(Sn),

ch⁡(f∘g)=ch⁡(f) ch⁡(g)in ΛCm+n,

where ∘ is the outer induction product of The outer induction product of symmetric-group characters and the right-hand side is the algebra product in ΛC. If f and g are rational-valued, the identity holds in ΛQm+n.

Facts & Assumptions

Given: Integers m,n≥0, honest characters χ of Sm and ψ of Sn, an element w∈Sm+n of cycle type ρ⊢m+n, and the block-preserving subgroup H:=Sm×Sn≤Sm+n with blocks {1,…,m} and {m+1,…,m+n}.

[F1]

For f=∑iaiχi∈R(Sm) and g=∑jbjψj∈R(Sn), the outer product is f∘g=∑i,jaibjInd⁡Sm×SnSm+n(χi⊠ψj), where (χi⊠ψj)(σ,τ)=χi(σ)ψj(τ); the assignment (f,g)↦f∘g is Z-bilinear (The outer induction product of symmetric-group characters).

[F2]

The characteristic map is ch⁡(f)=∑ρf(ρ)pρ/zρ, is defined on every class function and is linear, and R(Sm) is by definition the set of integral combinations of the honest (irreducible) characters of Sm (The Frobenius characteristic map, Virtual characters and the character ring R(G) of a finite group).

[F3]

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

[F4]

For every d≥0, {pμ:μ⊢d} is a Q-basis of ΛQd, and pμ=∏jpμj, with p∅=1 (Power sums form a rational but not integral stable basis). Since each zμ is nonzero, {pμ/zμ:μ⊢d} is also a rational basis; extending scalars to C makes it a C-basis of ΛCd.

[F5]

Identify Sm×Sn with the subgroup of Sm+n preserving the blocks {1,…,m} and {m+1,…,m+n}. The two restrictions identify this subgroup with the direct product, including when a block is empty (The outer induction product of symmetric-group characters).

[F6]

For a partition ρ, zρ=∏iimi(ρ)mi(ρ)! is a positive integer (If σ∈Sn has ck cycles of length k, then ∣CSn(σ)∣=∏k=1nkckck!).

Proof

technique · direct
1.1F1F2algebra

Both sides of the asserted identity are Z-bilinear in (f,g): the outer product is bilinear by [F1], the characteristic map is linear by [F2], and multiplication in ΛC is bilinear. Since every element of R(Sm) is an integral combination of honest characters, and likewise for R(Sn), it suffices to prove ch⁡(χ∘ψ)=ch⁡(χ)ch⁡(ψ) for honest characters χ of Sm and ψ of Sn.

1.2F3F5

For honest χ,ψ, the character χ⊠ψ of H is honest, so Frobenius' formula [F3] applied to G=Sm+n and the subgroup H of [F5] gives (χ∘ψ)(w)=1m!n!∑x∈Sm+n: x−1wx∈H(χ⊠ψ)(x−1wx).

2.1F5step 1.2algebra

The condition x−1wx∈H says that x−1wx preserves {1,…,m}, equivalently that w preserves A:=x({1,…,m}). Hence the x occurring in the sum are exactly those with x({1,…,m})=A for some m-element w-invariant subset A⊆{1,…,m+n}, and for each such A there are exactly m! n! permutations x with x({1,…,m})=A. For all x with the same A, the permutation x−1wx∈H has its Sm-component conjugate through x to w∣A and its Sn-component conjugate to w∣Ac, so (χ⊠ψ)(x−1wx)=χ(μA)ψ(νA), where μA is the cycle type of w∣A and νA the cycle type of w∣Ac; this is independent of x. With the factor m!n!/m!n! cancelling, (χ∘ψ)(w)=∑Aχ(μA)ψ(νA), the sum over the m-element w-invariant subsets A.

3.1step 2.1algebra

An m-element set A is w-invariant exactly when it is a union of cycles of w, and then ∣μA∣=m and the multisets of parts of μA and νA merge to the multiset of parts of ρ. Conversely, every split ρ=μ⊎ν with ∣μ∣=m arises this way. For a fixed split, the number of m-element w-invariant A with μA=μ is ∏i≥1(mi(ρ)mi(μ)), because for each cycle length i one independently chooses which mi(μ) of the mi(ρ) cycles of w of length i are included in A. Therefore (χ∘ψ)(ρ)=∑μ⊎ν=ρ, ∣μ∣=m(∏i≥1(mi(ρ)mi(μ)))χ(μ)ψ(ν), an expression depending only on the cycle type ρ of w.

4.1F1F2F4F6step 3.1algebra

On the other side ch⁡(χ)ch⁡(ψ)=∑μ⊢m∑ν⊢nχ(μ)ψ(ν) pμpν/(zμzν), using pμpν=pμ⊎ν from [F4], the coefficient of pρ/zρ equals ∑μ⊎ν=ρχ(μ)ψ(ν)zρ/(zμzν); for a split μ⊎ν=ρ one has zρzμzν=∏i≥1mi(ρ)!mi(μ)! mi(ν)!=∏i≥1(mi(ρ)mi(μ)), since mi(ν)=mi(ρ)−mi(μ). This is exactly the coefficient in step 3.1; since {pρ/zρ:ρ⊢m+n} is a C-basis of ΛCm+n by scalar extension [F4] and [F2] gives the same power-sum coefficients for the characteristic, ch⁡(χ∘ψ)=ch⁡(χ)ch⁡(ψ).

5.1F1F2step 1.1step 3.1step 4.1∎

By step 1.1 the identity holds for all virtual characters f∈R(Sm) and g∈R(Sn). The cycle-split formula in step 3.1 also extends to these f,g by bilinearity: (f∘g)(ρ)=∑μ⊎ν=ρ, ∣μ∣=m(∏i(mi(ρ)mi(μ)))f(μ)g(ν). If f,g are rational-valued, every term is rational, so f∘g is rational-valued. By [F2], ch⁡(f)∈ΛQm and ch⁡(g)∈ΛQn, while their product and ch⁡(f∘g) lie in ΛQm+n. Thus the identity holds over Q as claimed.

Depends on

Used by

Dependency tree · two levels

31 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