Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Sign twist corresponds to the omega involution

Statement

Let sgn⁡ be the sign representation of Sn and let V be a finite-dimensional complex representation of Sn with character χV and characteristic F=ch⁡(χV). Then

ch⁡(χV⊗sgn⁡)=ω(F),

where ω is the involutive algebra endomorphism of Λ with ω(er)=hr, extended to ΛC by complex linearity. In particular, for every λ⊢n,

ch⁡(χSλ⊗sgn⁡)=ω(sλ)=sλ′,

so Sλ⊗sgn⁡≅Sλ′ and χλ′(w)=(−1)n−ℓ(ρ)χλ(w) on elements of cycle type ρ.

Facts & Assumptions

Given: An integer n≥0, a finite-dimensional complex representation V of Sn with character χV, the sign representation sgn⁡, and w∈Sn of cycle type ρ⊢n with ℓ(ρ) parts.

[F1]

ch⁡(χ)=∑ρ⊢nχ(ρ)pρ/zρ for a character χ, where χ(ρ) is its value on cycle type ρ and zρ=∏iimi(ρ)mi(ρ)! (The Frobenius characteristic map).

[F2]

For finite-dimensional complex representations V,W of Sn one has χV⊗W(g)=χV(g)χW(g) for every g, where V⊗W is the tensor product representation with g⋅(v⊗w)=gv⊗gw (Characters add on direct sums, multiply on tensor products, and conjugate on duals, The tensor product of two complex representations).

[F3]

The sign representation of Sn is one-dimensional with σ⋅a=sgn⁡(σ)a; a k-cycle has sign (−1)k−1, and sgn⁡(w)=(−1)n−c(w), where c(w)=ℓ(ρ) is the number of cycles of w counted with fixed points (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup, A k-cycle has sign (−1)k−1, and sgn⁡(σ)=(−1)n−c(σ) when fixed points are counted as cycles).

[F4]

The Z-algebra endomorphism ω:Λ→Λ with ω(er)=hr is an involution and satisfies ω(pr)=(−1)r−1pr in ΛQ and ω(sλ)=sλ′ for every partition λ; it extends to a C-linear algebra endomorphism of ΛC (The omega involution conjugates Schur functions).

[F5]

ch⁡(χλ)=sλ for every λ⊢n, where χλ is the character of the Specht module Sλ (The characteristic of a Specht character is a Schur function).

[F6]

Two finite-dimensional complex representations of a finite group are isomorphic if and only if their characters are equal (Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters).

[F7]

The characteristic map is injective on cf(Sn) (The Frobenius characteristic is an isometry).

Proof

technique · direct
1.1F2F3

By [F2] and [F3], for w of cycle type ρ the tensor-product character is χV⊗sgn⁡(w)=χV(w)sgn⁡(w)=χV(ρ)(−1)n−ℓ(ρ).

1.2F4given

Since ω is a C-algebra endomorphism of ΛC [F4] and pρ=∏ipρi with ℓ(ρ) factors, ω(pρ)=∏iω(pρi)=∏i(−1)ρi−1pρi=(−1)∑i(ρi−1)pρ=(−1)n−ℓ(ρ)pρ.

2.1F1step 1.1

From the definition of the characteristic [F1] and step 1.1, ch⁡(χV⊗sgn⁡)=∑ρ⊢nχV⊗sgn⁡(ρ) pρ/zρ=∑ρ⊢nχV(ρ)(−1)n−ℓ(ρ) pρ/zρ.

2.2F1F4step 1.2

By C-linearity of ω [F4], [F1] and step 1.2, ω(F)=ω(∑ρ⊢nχV(ρ)pρ/zρ)=∑ρ⊢nχV(ρ)ω(pρ)/zρ=∑ρ⊢nχV(ρ)(−1)n−ℓ(ρ)pρ/zρ.

3.1step 2.1step 2.2

Steps 2.1 and 2.2 exhibit two equal expressions, so ch⁡(χV⊗sgn⁡)=ω(F) for every finite-dimensional complex representation V of Sn.

4.1F4F5step 3.1

Taking V=Sλ in step 3.1 and using [F5], ch⁡(χSλ⊗sgn⁡)=ω(sλ)=sλ′ by [F4].

5.1F5F6F7step 1.1step 4.1∎

Since ch⁡ is injective on cf(Sn) [F7] and ch⁡(χλ′)=sλ′ [F5], step 4.1 gives χSλ⊗sgn⁡=χλ′; by [F6] this equality of characters is equivalent to Sλ⊗sgn⁡≅Sλ′. Evaluating the character identity from step 1.1 for V=Sλ gives χλ′(w)=(−1)n−ℓ(ρ)χλ(w) for w of cycle type ρ.

Depends on

Used by

Dependency tree · two levels

49 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