Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The restriction coproduct on the graded symmetric-group character ring

Definition

Let RS=⨁n≥0R(Sn) be the graded abelian group of ordinary symmetric-group character rings (The graded ordinary representation ring of the symmetric groups). For n≥0 and a,b≥0 with a+b=n, regard Sn as the permutations of {0,1,…,n−1} (The finite symmetric group Sn, one-line notation, and cycle notation) and set

Aa,b:={0,1,…,a−1},Ba,b:={a,a+1,…,n−1},

with an empty block when its size is zero. Define

ιa,b:Sa×Sb⟶Sn,ιa,b(σ,τ)(i):={σ(i),i∈Aa,b,a+τ(i−a),i∈Ba,b.

The map is injective and respects composition: it acts as σ on the first block and as the translated permutation τ on the second. Its image

Ha,b:={g∈Sn:g(Aa,b)=Aa,b, g(Ba,b)=Ba,b}

is a subgroup (Subgroup) identified with Sa×Sb by ιa,b; indeed the identity, products and inverses in the image are respectively ιa,b(1,1), ιa,b(σσ′,ττ′), and ιa,b(σ−1,τ−1) (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, Monoid homomorphism and group homomorphism).

For f∈R(Sn), restrict its virtual character to Ha,b and pull it back along ιa,b. This is in R(Sa×Sb): write f=∑jmjχVj with mj∈Z and Vj finite-dimensional complex representations of Sn (Virtual characters and the character ring R(G) of a finite group, A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree, The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation); each Vj restricts to a representation of Ha,b and, after pullback, of Sa×Sb (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup). By Maschke's theorem it is a finite direct sum of irreducible representations, and additivity of characters then puts its character in the integral span of irreducible characters, namely R(Sa×Sb) (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, Characters add on direct sums, multiply on tensor products, and conjugate on duals). Denote the resulting character by

f∘ιa,b:Sa×Sb→C,(f∘ιa,b)(σ,τ)=f(ιa,b(σ,τ)).

The external-product map

Φa,b:R(Sa)⊗ZR(Sb)⟶R(Sa×Sb),χ⊗ψ⟼χ⊠ψ,

is an isomorphism (The character ring of a direct product is the tensor product of the factor character rings). Define Δa,b(f) to be the unique element satisfying Φa,b(Δa,b(f))=f∘ιa,b. The restriction coproduct is the Z-linear map

Δ:RS⟶RS⊗ZRS,Δ(f):=∑a=0nΔa,n−a(f)(f∈R(Sn)),

where the restriction and pullback maps and Φa,b−1 are Z-linear, and each summand is included in the (a,n−a) graded component. Extend this formula linearly to an arbitrary f=∑nfn∈RS; the sum is finite because RS is a direct sum. Thus Δ(R(Sn))⊆⨁a+b=nR(Sa)⊗ZR(Sb), so Δ has degree zero and is a finite sum in each degree, with no completion (The graded ordinary representation ring of the symmetric groups, The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). At the endpoints, Δ0,n(f)=1⊗f and Δn,0(f)=f⊗1; in particular Δ(c1)=c(1⊗1) in degree zero.

The coproduct is cocommutative. Let τ(x⊗y)=y⊗x. The ordered block subgroups need not be equal: in S3, the transposition (0 1) belongs to H2,1 but not to H1,2. They are conjugate by the block-swap permutation ρa,b∈Sn given by ρa,b(i)=b+i for 0≤i<a and ρa,b(a+j)=j for 0≤j<b. Directly from the block actions,

ρa,b ιa,b(σ,τ) ρa,b−1=ιb,a(τ,σ).

Since every virtual character of Sn is a class function, f(g)=f(ρa,bgρa,b−1); consequently the two restrictions, after exchanging factors, agree. Applying the injective maps Φa,b and Φb,a gives Δb,a(f)=τ(Δa,b(f)). Summing over all a+b=n proves τΔ(f)=Δ(f). No form of the axiom of choice is used.

Depends on

Used by

Dependency tree · two levels

46 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