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.

The r-cycle virtual character filter

Statement

Let r≥1, n≥r and ν⊢n−r, and put Ψν:=∑λ⊢nλ/ν a removable border strip of size r(−1)ht⁡(λ/ν) χλ∈R(Sn), a virtual character of Sn (Virtual characters and the character ring R(G) of a finite group, Removable border strips and their height), and ψr:=∑x=1r(−1)r−xχ(x,1r−x)∈R(Sr). Then Ψν(σ)=0for every σ∈Sn whose cycle type has no part equal to r (Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type); equivalently, the signed sum over the partitions λ obtained from ν by adding an r-border strip vanishes on all classes that contain no r-cycle. Moreover Ψν is the outer induction product Ψν=χν∘ψr (The outer induction product of symmetric-group characters), and ψr vanishes on every class of Sr other than the class of r-cycles: it is the function that takes the value r on every r-cycle and the value 0 on every other element of Sr. No choice principle is used.

Facts & Assumptions

Given: Integers r≥1 and n≥r, a partition ν⊢n−r, and for every partition of an integer the character χλ of the complex Specht module Sλ (Column antisymmetrizers, polytabloids, and Specht modules).

[F1]

Ψν=∑λ/ν(−1)ht⁡(λ/ν)χλ is an integral combination of irreducible characters χλ of Sn, hence an element of R(Sn) and a class function, and ψr=∑x=1r(−1)r−xχ(x,1r−x) is an element of R(Sr); here λ/ν runs over the removable border strips of size r, with ht⁡(λ/ν)=r−c when λ/ν occupies c columns (Removable border strips and their height, Virtual characters and the character ring R(G) of a finite group).

[F2]

Character form of the cancellation lemma: ∑x=1r(−1)r−xχν∘χ(x,1r−x)=∑λ/ν(−1)ht⁡(λ/ν)χλ=Ψν in R(Sn) (Alternating hook induction cancels disconnected rim removals).

[F3]

The outer induction product is Z-bilinear in its two arguments and is the induction of the external tensor product: for f∈R(Sm), g∈R(Sp) one has f∘g=Ind⁡Sm×SpSm+p(f⊠g), and (f⊠g)(σ,τ)=f(σ)g(τ); the subgroup is the two-block subgroup acting on {1,…,m} and {m+1,…,m+p} (The outer induction product of symmetric-group characters, The induced character Ind⁡HGχ of a complex character).

[F4]

Frobenius' formula: for H≤G and a character χ of H, Ind⁡HGχ(g)=1∣H∣∑x∈G, x−1gx∈Hχ(x−1gx); for a virtual character of H the same display holds by finite linearity in χ (Frobenius' formula for the character of an induced representation).

[F5]

Full-cycle values: for r≥1, if ρ∈Sr is an r-cycle then χλ(ρ)=(−1)r−x when λ=(x,1r−x) for some 1≤x≤r, and χλ(ρ)=0 otherwise (The value of an irreducible character on a full cycle is supported on hooks).

[F6]

For a finite group G the standard inner product is ⟨φ,ψ⟩=1∣G∣∑g∈Gφ(g)ψ(g)‾ (The standard inner product on cf(G)); the irreducible complex characters of G are orthonormal (The first orthogonality relation for irreducible complex characters) and form an orthonormal basis of the space of class functions (The irreducible complex characters form an orthonormal basis of cf(G)); the irreducible complex characters of Sr are exactly the characters χλ with λ⊢r, distinct partitions giving distinct characters (Specht modules classify the complex irreducibles of Sn).

[F7]

Specht character values are integers (The characteristic of a Specht character is a Schur function, Statement). In particular χλ(σ)‾=χλ(σ).

[F8]

Conjugation preserves the cycle type: x−1σx has the same cycle type as σ for all σ,x∈Sn (Two elements of Sn are conjugate if and only if they have the same cycle type, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type); writing an element of the two-block subgroup K as a pair (u,v) means u acts on B1={0,…,n−r−1} and v on B2={n−r,…,n−1}, with the order-preserving relabelling sending cycles of v on B2 to cycles of the same length in Sr (The finite symmetric group Sn, one-line notation, and cycle notation).

Proof

technique · direct
1.1F1F2F3algebra

By the character form of the cancellation lemma [F2], ∑x=1r(−1)r−xχν∘χ(x,1r−x)=Ψν; since the outer product is Z-bilinear [F3] and ψr=∑x=1r(−1)r−xχ(x,1r−x) by [F1], the same sum is χν∘ψr. Hence Ψν=χν∘ψr in R(Sn).

1.2F5F6F7algebra

We prove the evaluation ψr=r⋅1C, where C is the conjugacy class of the r-cycles of Sr and 1C is its indicator function. Let ρ∈Sr be an r-cycle. For every λ⊢r, orthonormality [F6] gives ⟨ψr,χλ⟩=∑x=1r(−1)r−x⟨χ(x,1r−x),χλ⟩, which equals (−1)r−λ1 if λ=(λ1,1r−λ1) is a hook and 0 otherwise; by the full-cycle lemma [F5] this is exactly χλ(ρ). On the other hand, for f:=r⋅1C the definition of the standard inner product [F6], the integrality χλ(σ)‾=χλ(σ) [F7] and the constancy of χλ on C give ⟨f,χλ⟩=1r! r∑σ∈Cχλ(σ)=r ∣C∣r! χλ(ρ)=χλ(ρ), because C consists of the r!/r=(r−1)! cyclic orderings of the r points up to rotation. Thus ⟨ψr−f,χλ⟩=0 for every λ⊢r; the χλ exhaust the irreducible characters of Sr and form an orthonormal basis of the class functions [F6], so ψr−f=0, that is, ψr(ρ)=r for every r-cycle ρ and ψr(τ)=0 for every τ∈Sr that is not an r-cycle.

2.1step 1.1step 1.2F3F4F8given

Let σ∈Sn have cycle type with no part equal to r; we show Ψν(σ)=0. By step 1.1, Ψν=χν∘ψr, and by [F3] this outer product is Ind⁡KSn(χν⊠ψr) for the two-block subgroup K=Sym⁡(B1)×Sym⁡(B2) with B1={0,…,n−r−1} and B2={n−r,…,n−1}; applying Frobenius' formula [F4] to the honest characters of the finite expansion of χν⊠ψr and extending by linearity gives (χν∘ψr)(σ)=1∣K∣∑x∈Snx−1σx∈K(χν⊠ψr)(x−1σx). For an index x of the sum write x−1σx=(u,v) with u∈Sym⁡(B1) and v∈Sym⁡(B2); then (χν⊠ψr)(u,v)=χν(u)ψr(v) by [F3]. If r=1, then K fixes the single point of B2, so no conjugate of σ (which has no fixed point) lies in K and the sum is empty; hence assume r≥2. If v were an r-cycle on B2, then the disjoint-cycle decomposition of x−1σx would contain that r-cycle, so the cycle type of x−1σx would have a part equal to r, contradicting [F8] and the hypothesis on σ. Therefore v is not an r-cycle, so ψr(v)=0 by step 1.2 and every term of the sum vanishes; hence (χν∘ψr)(σ)=0 and therefore Ψν(σ)=0 by step 1.1.

3.1step 1.1step 1.2step 2.1∎

Step 1.1 identifies Ψν with the outer product χν∘ψr, step 1.2 shows that ψr equals r on the class of r-cycles of Sr and vanishes on every other class, and step 2.1 shows Ψν(σ)=0 for every σ∈Sn whose cycle type has no part equal to r. These are exactly the three assertions of the statement.

Remarks

  • The value on the r-cycle class is r, not a sign. Evaluating the definition of ψr at an r-cycle by the full-cycle lemma gives ∑x=1r(−1)r−x(−1)r−x=r, in agreement with step 1.2; in particular ψr must not be confused with the sign character, which takes the value (−1)r−1 there. For r≥2 the identity is not an r-cycle, so ψr(1)=0 by step 1.2. Frobenius' formula [F4] at the identity gives (χν∘ψr)(1)=[Sn:K]χν(1)ψr(1)=0, so Ψν has degree 0 in that range.

  • Dictionary to symmetric functions. Under the Frobenius characteristic the alternating hook combination ψr corresponds to the power sum pr=∑x=1r(−1)r−xs(x,1r−x) (Macdonald I §3 (2)), whose expansion coefficient at pρ/zρ is the value of ψr on the class ρ; this is the symmetric-function form of the evaluation proved in step 1.2 and is consistent with the counterterm structure of Alternating hook induction cancels disconnected rim removals.

Depends on

Used by

Dependency tree · two levels

92 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