Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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 and restriction make the symmetric-group character ring a graded Hopf algebra

Statement

Let RS=⨁n≥0R(Sn) be the graded commutative ring of Outer induction makes the graded symmetric-group representation group a commutative graded ring, with outer product ∘, unit the trivial character e of S0 (so R(S0)=Z⋅1), and let Δ be the restriction coproduct of The restriction coproduct on the graded symmetric-group character ring. Let ε:RS→Z be the augmentation defined by ε(f)=f(1) on R(S0) and ε∣R(Sn)=0 for n≥1 (The graded ordinary representation ring of the symmetric groups, Virtual characters and the character ring R(G) of a finite group). Then:

(i) (RS,∘,e,Δ,ε) is a connected graded bialgebra over Z (Graded coalgebras, bialgebras and Hopf algebras over a commutative ring): Δ and ε are Z-algebra homomorphisms and satisfy coassociativity and the counit identities;

(ii) by A connected graded bialgebra has a unique antipode, given by the reduced-coproduct recursion, RS has a unique antipode and is a graded Hopf algebra, with the antipode computed by the reduced-coproduct recursion;

(iii) the Frobenius characteristic is an isomorphism of graded Hopf algebras from RS onto Λ equipped with the diagonal coproduct ΔΛf=f(x,y), multiplication of symmetric functions, counit the constant term, and antipode S(f)=(−1)nω(f) for f∈Λn. No choice principle is used.

Facts & Assumptions

Given: The graded character ring RS, its outer-induction product, the restriction coproduct, and the Frobenius characteristic.

[F1]

RS=⨁n≥0R(Sn) is the algebraic direct sum, R(S0)=Z⋅e, and every element has finite degree support (The graded ordinary representation ring of the symmetric groups).

[F2]

The outer product is f∘g=Ind⁡Sm×SnSm+n(f⊠g) on honest characters, extends Z-bilinearly, adds degrees, and has the trivial S0 character as unit (The outer induction product of symmetric-group characters).

[F3]

The (a,b)-component Δa,b(f) is defined by pulling f back from the ordered block subgroup Ha,b and applying the inverse external-product character isomorphism; the endpoints are Δ0,n(f)=e⊗f and Δn,0(f)=f⊗e (The restriction coproduct on the graded symmetric-group character ring).

[F4]

For finite groups G,H, external products of irreducible characters form an orthonormal Z-basis of R(G×H) and R(G)⊗R(H)→R(G×H) is an isomorphism (The character ring of a direct product is the tensor product of the factor character rings).

[F5]

The global convention is St=Sym⁡({0,1,…,t−1}) with composition acting right to left (The finite symmetric group Sn, one-line notation, and cycle notation).

[F6]

A group homomorphism preserves products (Monoid homomorphism and group homomorphism).

[F7]

Induced modules are covariant functions satisfying F(gh)=h−1⋅F(g), with left translation action (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F9]

Mackey's formula expresses Res⁡KGInd⁡HGθ as the sum over K\G/H of the induced restrictions of the conjugate character gθ to K∩gHg−1 (Mackey's double-coset formula for restricting an induced character).

[F10]

On a conjugate subgroup, the conjugate character satisfies gθ(ghg−1)=θ(h) (Conjugate representations and conjugate characters on conjugate subgroups).

[F11]

Induction from C×D to P×Q commutes with external tensor products, including identity-factor cases (Induction commutes with an external tensor factor).

[F12]

A graded bialgebra has a degree-zero coassociative coproduct, a counit, multiplicative structure maps, and convolution product on endomorphisms (Graded coalgebras, bialgebras and Hopf algebras over a commutative ring).

[F13]

A connected graded bialgebra over a commutative ring has a unique graded antipode given by the reduced-coproduct recursion (A connected graded bialgebra has a unique antipode, given by the reduced-coproduct recursion).

[F14]

The Frobenius characteristic ch⁡:RS→Λ is a degree-preserving ring isomorphism and sends e to 1 (The Frobenius characteristic is an isometric graded ring isomorphism).

[F15]

The characteristic coproduct identity is (ch⁡⊗ch⁡)Δ(f)=ΔΛ(ch⁡(f)), where ΔΛ(sλ)=∑μ⊆λsμ⊗sλ/μ (The restriction coproduct is Schur skewing).

[F16]

Λ=⨁d≥0Λd is the algebraic graded ring of stable symmetric functions, with coordinatewise finite-rank specialization and finite degree support (The stable graded ring of symmetric functions).

[F17]

In finite rank, sλ/μ and sλ are generating functions for semistandard skew and straight tableaux with row-weak and column-strict inequalities (Skew Jacobi–Trudi and tableau expansion).

[F18]

A skew diagram is [λ]∖[μ] when μ⊆λ, and semistandard skew fillings are weakly increasing along rows and strictly increasing down columns (Skew diagrams and semistandard skew tableaux).

[F19]

The stable skew Schur symbol sλ/μ is the skew Schur function defined by Hall adjointness (Skew Schur functions by Hall adjointness).

[F20]

At finite rank, hk=∑a1+⋯+aN=kx1a1⋯xNaN and h0=1 (Power sums pk and complete homogeneous symmetric polynomials hk).

[F21]

The complete functions h1,h2,… freely generate Λ as a polynomial algebra (Elementary and complete families freely generate the stable ring).

[F22]

The elementary and complete generating series satisfy E(−t)H(t)=1, hence ∑i=0n(−1)ieihn−i=δn0 (The generating-series identity E(−t)H(t)=1).

[F23]

The fundamental involution ω is a graded ring automorphism and ω(hn)=en (The omega involution conjugates Schur functions).

[F24]

A partition is a finite weakly decreasing sequence, and its English Young diagram is [λ]={(i,j):1≤i≤k, 1≤j≤λi} (Partitions, English diagrams, and conjugation).

Proof

technique · direct
1.1F2F3F5F6F7

For each t, set Gt0:=Sym⁡({0,…,t−1}) and Gt1:=Sym⁡({1,…,t}), and let βt(i)=i+1, with the unique empty bijection for t=0. Conjugation ct:Gt0→Gt1, ct(σ)=βtσβt−1, is a group isomorphism by [F5, F6] and carries the standard zero-based block embeddings of [F3] to the one-based embeddings used in [F2]. Given a one-based subgroup H1≤Gt1, set H0:=ct−1(H1) and pull an H1-module W back to W0 by h⋅0w:=ct(h)⋅1w. The map from the induced-function model for (Gt1,H1,W) to that for (Gt0,H0,W0) [F7], F1↦F0 with F0(g):=F1(ct(g)), is invertible and satisfies F0(gh)=ct(h)−1⋅1F0(g)=h−1⋅0F0(g). It intertwines left translation because ct(g0−1g)=ct(g0)−1ct(g). Pulling class functions back along ct therefore transports induction characters, and ct−1 maps the one-based outer-product blocks to the zero-based blocks of [F3]. Thus the outer product and restriction coproduct can both be computed in the zero-based realization.

1.2F1F3F4F12

Fix f∈R(Sn) and a+b+c=n. Under the iterated external-product isomorphism from [F4], the (a,b,c)-component of either (Δ⊗id)Δ(f) or (id⊗Δ)Δ(f) is the restriction of f pulled back along the same embedding of Sa×Sb×Sc acting on the three consecutive blocks of sizes a,b,c: composing the first two-block inclusions in either parenthesization gives that identical map on each triple (σ,τ,ρ). The iterated external-product maps agree on every tensor χ⊗ψ⊗η because both evaluate it as χ(σ)ψ(τ)η(ρ), so the triple components are equal. Summing the finitely many triples proves coassociativity. The endpoints in [F3] show (ε⊗id)Δ=id=(id⊗ε)Δ for the augmentation in the Statement.

1.3F15F16F17F18F19F24

Define ΔΛf=f(X,Y) by substituting the disjoint union of finite alphabets into a stable symmetric function; this is well defined by [F16], is an algebra homomorphism, is coassociative by associativity of alphabet concatenation, and has counit evaluation at the empty alphabet, which is the constant term. Let X=(x1,…,xp) and Y=(y1,…,yq) be disjoint finite alphabets, ordered with every xi<yj. In a semistandard tableau of straight shape λ on X⊔Y, the cells filled from X form an initial segment in each row by [F17, F18]. If a cell in row i+1 and column j is filled from X, then the cell above it exists by the partition shape [F24]; column strictness forces that upper entry to be smaller, hence it is also in X. Thus the row lengths of the X-cells are weakly decreasing and form a partition diagram μ⊆λ. Restriction gives a semistandard tableau of shape μ on X and one of shape λ/μ on Y. Conversely, such a pair combines to a semistandard tableau of shape λ: within each piece the inequalities hold, and at each horizontal or vertical boundary every X-letter is smaller than every Y-letter. This is a weight-preserving bijection, so the diagonal coproduct satisfies ΔΛ(sλ)=sλ(X,Y)=∑μ⊆λsμ(X)sλ/μ(Y), with stable passage justified by [F16, F17, F19]. This is exactly the skew-Schur expansion in the characteristic coproduct identity [F15], so that identity intertwines the restriction coproduct with ΔΛ on every Schur function.

2.1F2F3F5F8

Use the common zero-based realization fixed in step 1.1. For honest characters χ∈R(Sm) and ψ∈R(Sn), let N=m+n, let H=Sm×Sn preserve consecutive source blocks C1,C2, and let K=Sa×Sb preserve consecutive target blocks R1,R2, where a+b=N. For g∈SN define M(g)=(rsuv), where r=∣C1∩g−1R1∣, s=∣C1∩g−1R2∣, u=∣C2∩g−1R1∣, and v=∣C2∩g−1R2∣. Its row sums are m,n and column sums a,b, and left multiplication by K and right multiplication by H preserve these counts. For each matrix with these margins, split C1,C2 into consecutive pieces of sizes (r,s) and (u,v), and split R1,R2 into consecutive pieces of sizes (r,u) and (s,v); the increasing bijections between paired pieces define a canonical representative gM. If g has this matrix, then the sets Cj∩gM−1Ri and Cj∩g−1Ri have equal sizes. On each Cj, the unique increasing bijections from Cj∩gM−1Ri onto Cj∩g−1Ri combine to hj∈S∣Cj∣; these give h∈H. Define ki on the disjoint pieces gh(Cj∩gM−1Ri)⊆Ri by ki(gh(x))=gM(x); the pieces partition Ri on both sides, so ki is a permutation of Ri, and together they give k∈K with kgh=gM. Thus the matrices classify K\SN/H, and the explicitly defined gM form a complete finite set of Mackey representatives, including zero-size blocks.

2.2F12F16F20F21F22F23step 1.3

For finite alphabets X,Y, the coefficient of tn in HX(t)HY(t) is ∑i+j=nhi(X)hj(Y); by the defining sum for hn in [F20], this enumerates every degree-n monomial in X⊔Y once. Thus ΔΛ(hn)=∑i+j=nhi⊗hj, and stable specialization is valid by [F16, F21]. Define T(f)=(−1)dω(f) for homogeneous f∈Λd. Since ω is a graded ring automorphism [F23], T is a graded algebra homomorphism and T(hi)=(−1)iei. The finite-rank identity E(−t)H(t)=1 [F22], together with compatibility of the stable generators under specialization [F21], gives coefficientwise in Λ that ∑i+j=n(−1)ieihj=δn0; reindexing gives ∑i+j=nhi(−1)jej=δn0. Therefore T∗id and id∗T agree with the constant-term counit on each generator hn, including h0=1. Both convolutions are algebra homomorphisms: (T∗id)(fg)=∑T(f(1))T(g(1))f(2)g(2)=(T∗id)(f)(T∗id)(g) because ΔΛ and T are algebra maps and Λ is commutative; the same calculation with T in the second tensor factor proves multiplicativity of id∗T. Since h1,h2,… freely generate Λ by [F21], both convolutions equal the counit on all of Λ. Thus T is a two-sided antipode and SΛ(f)=(−1)dω(f) on Λd.

3.1F4F8F10step 2.1

For the representative gM in step 2.1, the intersection L=K∩gMHgM−1 consists exactly of permutations preserving each of the four intersections R1∩gMC1, R1∩gMC2, R2∩gMC1, and R2∩gMC2, hence is Sr×Su×Ss×Sv. Pulling the Mackey conjugate character gM(χ⊠ψ) back to the source blocks by gM−1 and using [F10] gives the product of α=Res⁡Sr×SsSmχ and γ=Res⁡Su×SvSnψ. Expand these honest product-group characters in the external-irreducible bases [F4], say α=∑iciξi⊠ξi′ and γ=∑jdjηj⊠ηj′. Regroup the four factors from source order (r,s,u,v) into target order (r,u,s,v); on L the Mackey input character is then ∑i,jcidj(ξi⊠ηj)⊠(ξi′⊠ηj′), a character of (Sr×Su)×(Ss×Sv).

4.1F2F3F9F11step 3.1

Apply Mackey's formula [F9] to Res⁡KSNInd⁡HSN(χ⊠ψ). For the M-summand, apply the external-factor induction identity [F11] to each summand of the character in step 3.1, inducing from Sr×Su to Sa and from Ss×Sv to Sb. By the outer-product definition [F2], this Mackey term becomes under Φa,b the image of ∑i,jcidj(ξi∘ηj)⊗(ξi′∘ηj′), precisely the product of the (r,s)-component of Δ(χ) and the (u,v)-component of Δ(ψ).

5.1F1F2F3F4step 2.1step 4.1

The matrices of step 2.1 are in bijection with all degree allocations r+s=m, u+v=n, r+u=a, s+v=b. Hence summing the Mackey terms in step 4.1 gives exactly the (a,b)-component of Δ(χ)Δ(ψ); injectivity of Φa,b in [F3, F4] gives Δa,b(χ∘ψ)=(Δ(χ)Δ(ψ))a,b. This holds for every a+b=m+n, so Δ(χ∘ψ)=Δ(χ)Δ(ψ). Since the character rings consist of finite integral combinations of honest characters and ∘,Δ are bilinear, the identity extends to all virtual χ,ψ. The endpoints in [F3] also give Δ(e)=e⊗e.

6.1F1F2F3F12step 1.2step 5.1

If f∈R(Sm) and g∈R(Sn) are homogeneous, then ε(f∘g)=0=ε(f)ε(g) whenever m+n>0, since the outer product has degree m+n by [F2]. When m=n=0, R(S0)=Ze and ∘ is integer multiplication, so the same equality holds. Bilinearity gives that ε is a unital algebra homomorphism on RS. Together with steps 1.2 and 5.1, this verifies all bialgebra axioms in [F12].

7.1F1F12F13step 6.1

RS is nonnegatively graded by [F1], and its degree-zero component is exactly Ze, with unit map Z→∼R(S0); hence the bialgebra of step 6.1 is connected by [F12]. The antipode lemma [F13] gives a unique graded antipode with the reduced-coproduct recursion, proving parts (i) and (ii) of the Statement.

7.2F14F15F16step 6.1step 1.3

By [F14], ch⁡ is a degree-preserving graded-ring isomorphism sending e to 1, and [F15] says it intertwines Δ with ΔΛ. Since it preserves degree, it also carries the augmentation of step 6.1 to the constant-term counit: degree-zero elements map to constants and positive-degree elements have zero constant term. Thus ch⁡ is a bialgebra isomorphism from the bialgebra of step 6.1 to the diagonal bialgebra on Λ.

8.1F13step 2.1step 7.1step 7.2step 2.2∎

Transporting the antipode of step 7.1 through the bialgebra isomorphism of step 7.2 gives an antipode on Λ; by uniqueness of two-sided convolution inverses it is the map T of step 2.2. Hence ch⁡ intertwines the antipodes and is an isomorphism of graded Hopf algebras, proving part (iii). All double-coset representatives were explicitly determined by a finite matrix, all tableaux sums are finite in each degree, and the recursive antipode uses no selections; no form of the axiom of choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

93 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