Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 is an isometric graded ring isomorphism

Statement

Restrict the characteristic map to the integral lattice RS=⨁n≥0R(Sn) of The graded ordinary representation ring of the symmetric groups. Then

ch⁡:RS⟶Λ

is a degree-preserving Z-module isomorphism. It carries the outer induction product ∘ of The outer induction product of symmetric-group characters to multiplication, ch⁡(f∘g)=ch⁡(f)ch⁡(g), and the unit (the trivial character of S0) to 1; consequently RS is a commutative graded Z-algebra and ch⁡ is an isomorphism of graded rings onto Λ. With the sesquilinear Hall form, ch⁡ is an isometry as in The Frobenius characteristic is an isometry. After scalar extension, ch⁡⊗Q:RS,Q→ΛQ and ch⁡⊗C:RS,C→ΛC are isomorphisms. No choice principle is used.

Facts & Assumptions

Given: An integer n≥0, the graded abelian group RS=⨁nR(Sn) with the outer product ∘, the characteristic map ch⁡ on cfS, and the Specht characters χλ of Sn.

[F1]

R(Sn) is the character ring of Sn, the integral span of its irreducible complex characters; RS is the direct sum of the R(Sn) with degree-n homogeneous parts, and RS,Q=Q⊗ZRS, RS,C=C⊗ZRS (The graded ordinary representation ring of the symmetric groups).

[F2]

For f=∑iaiχi∈R(Sm), g=∑jbjψj∈R(Sn), the outer product is f∘g=∑i,jaibjInd⁡Sm×SnSm+n(χi⊠ψj); it is Z-bilinear and maps R(Sm)×R(Sn) into R(Sm+n), and the trivial character of S0 is the unit (The outer induction product of symmetric-group characters).

[F3]

ch⁡(f)=∑ρ⊢nf(ρ)pρ/zρ on cf(Sn) and ch⁡ is linear on cfS; the degree-n component of ch⁡(f) for f∈cf(Sm) is zero when n≠m, so ch⁡ preserves degrees (The Frobenius characteristic map).

[F4]

⟨ch⁡(f),ch⁡(g)⟩H=⟨f,g⟩Sn for all f,g∈cf(Sn), ch⁡ is injective on cf(Sn), and ⟨f,f⟩Sn=∑ρ⊢n∣f(ρ)∣2/zρ vanishes only for f=0 (The Frobenius characteristic is an isometry).

[F5]

For every μ⊢n, ch⁡(φμ)=hμ, where φμ is the character of the Young permutation module Mμ (The characteristic of a Young permutation character is complete homogeneous).

[F6]

ch⁡(f∘g)=ch⁡(f)ch⁡(g) for all f∈R(Sm), g∈R(Sn) (The Frobenius characteristic preserves outer products).

[F7]

For every d≥0, {hμ:μ⊢d} is a Z-basis of Λd (Elementary and complete families freely generate the stable ring).

[F8]

Young's rule: Mμ≅⨁λ⊢n(Sλ)⊕Kλμ, so φμ=∑λ⊢nKλμχλ by additivity of characters (Young's rule for complex permutation modules, Characters add on direct sums, multiply on tensor products, and conjugate on duals).

[F9]

The matrix (Kλμ) satisfies hμ=∑λKλμsλ and is unitriangular in a linear extension of dominance, hence invertible over Z (The Kostka change of basis is dominance-unitriangular).

[F10]

Every finite-dimensional complex representation of Sn is completely reducible (Maschke's theorem over C), and the modules {Sλ:λ⊢n} are pairwise inequivalent and exhaust the irreducible complex Sn-representations; hence every honest character of Sn is a nonnegative integral combination of the χλ, and the family {χλ:λ⊢n} is a Z-basis of R(Sn) (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, Specht modules classify the complex irreducibles of Sn, Distinct complex Specht modules are inequivalent, Virtual characters and the character ring R(G) of a finite group, Column antisymmetrizers, polytabloids, and Specht modules).

Proof

technique · direct
1.1F3F5F8F9F10

Membership ch⁡(R(Sn))⊆Λn: for μ⊢n, [F8] gives φμ=∑λKλμχλ∈R(Sn) and [F5] gives ch⁡(φμ)=hμ∈Λn. Since (Kλμ) is invertible over Z [F9], each χλ=∑μ(K−1)μλφμ and, by linearity of ch⁡ [F3], ch⁡(χλ)=∑μ(K−1)μλhμ∈Λn. As the χλ span R(Sn) over Z [F10], ch⁡(R(Sn))⊆Λn for every n, hence ch⁡(RS)⊆Λ.

1.2F3F4

Injectivity: if f=∑nfn∈RS satisfies ch⁡(f)=0, then each degree component ch⁡(fn) vanishes by degree preservation [F3]; the isometry formula [F4] then gives ⟨fn,fn⟩Sn=⟨ch⁡(fn),ch⁡(fn)⟩H=0, and vanishing of ∑ρ⊢n∣fn(ρ)∣2/zρ forces fn=0; hence f=0 and ch⁡ is injective on RS.

1.3F2F3F6

Multiplicativity and unit: for homogeneous f∈R(Sm), g∈R(Sn) one has ch⁡(f∘g)=ch⁡(f)ch⁡(g) [F6]; for general f=∑mfm, g=∑ngn bilinearity of ∘ [F2] and linearity of ch⁡ [F3] give ch⁡(f∘g)=∑m,nch⁡(fm)ch⁡(gn)=ch⁡(f)ch⁡(g). For the trivial character e of S0 one has ch⁡(e)=e(∅)p∅/z∅=1 since e(∅)=1 and z∅=p∅=1.

2.1F5F7step 1.1

Surjectivity onto Λ: step 1.1 shows ch⁡(RS)⊆Λ, and hμ=ch⁡(φμ)∈ch⁡(RS) for every partition μ [F5]; since {hμ:μ⊢d} is a Z-basis of Λd for every d [F7], the image contains a Z-basis of Λ and therefore equals Λ.

3.1F2F3F4step 1.2step 1.3step 2.1

By steps 1.1, 2.1 and 1.2 the map ch⁡:RS→Λ is a bijective degree-preserving Z-linear map, hence a Z-module isomorphism; by step 1.3 it is multiplicative and sends the unit to 1. Transporting the ring axioms of Λ along the bijection: for f,g,h∈RS, associativity and commutativity of ∘ follow from ch⁡((f∘g)∘h)=ch⁡(f)ch⁡(g)ch⁡(h)=ch⁡(f∘(g∘h)) and ch⁡(f∘g)=ch⁡(g∘f) together with injectivity of ch⁡, distributivity is the bilinearity of ∘ [F2], and e∘f=f because ch⁡(e∘f)=1⋅ch⁡(f); so RS is a commutative graded Z-algebra and ch⁡ is a graded ring isomorphism. The isometry clause is [F4].

4.1F1step 3.1algebra∎

Both RS and Λ are free Z-modules, graded with finitely generated homogeneous components; a Z-module isomorphism between them remains an isomorphism after tensoring with Q or C, with inverse ch⁡−1⊗id. Hence ch⁡⊗Q:RS,Q→ΛQ and ch⁡⊗C:RS,C→ΛC are isomorphisms.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

87 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