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 -cycle virtual character filter
Statement
Let , and , and put a virtual character of (Virtual characters and the character ring of a finite group, Removable border strips and their height), and Then (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 -border strip vanishes on all classes that contain no -cycle. Moreover is the outer induction product (The outer induction product of symmetric-group characters), and vanishes on every class of other than the class of -cycles: it is the function that takes the value on every -cycle and the value on every other element of . No choice principle is used.
Facts & Assumptions
Given: Integers and , a partition , and for every partition of an integer the character of the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules).
is an integral combination of irreducible characters of , hence an element of and a class function, and is an element of ; here runs over the removable border strips of size , with when occupies columns (Removable border strips and their height, Virtual characters and the character ring of a finite group).
Character form of the cancellation lemma: in (Alternating hook induction cancels disconnected rim removals).
The outer induction product is -bilinear in its two arguments and is the induction of the external tensor product: for , one has , and ; the subgroup is the two-block subgroup acting on and (The outer induction product of symmetric-group characters, The induced character of a complex character).
Frobenius' formula: for and a character of , ; for a virtual character of the same display holds by finite linearity in (Frobenius' formula for the character of an induced representation).
Full-cycle values: for , if is an -cycle then when for some , and otherwise (The value of an irreducible character on a full cycle is supported on hooks).
For a finite group the standard inner product is (The standard inner product on ); the irreducible complex characters of 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 ); the irreducible complex characters of are exactly the characters with , distinct partitions giving distinct characters (Specht modules classify the complex irreducibles of ).
Specht character values are integers (The characteristic of a Specht character is a Schur function, Statement). In particular .
Conjugation preserves the cycle type: has the same cycle type as for all (Two elements of 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 as a pair means acts on and on , with the order-preserving relabelling sending cycles of on to cycles of the same length in (The finite symmetric group , one-line notation, and cycle notation).
Proof
By the character form of the cancellation lemma [F2], ; since the outer product is -bilinear [F3] and by [F1], the same sum is . Hence in .
We prove the evaluation , where is the conjugacy class of the -cycles of and is its indicator function. Let be an -cycle. For every , orthonormality [F6] gives , which equals if is a hook and otherwise; by the full-cycle lemma [F5] this is exactly . On the other hand, for the definition of the standard inner product [F6], the integrality [F7] and the constancy of on give , because consists of the cyclic orderings of the points up to rotation. Thus for every ; the exhaust the irreducible characters of and form an orthonormal basis of the class functions [F6], so , that is, for every -cycle and for every that is not an -cycle.
Let have cycle type with no part equal to ; we show . By step 1.1, , and by [F3] this outer product is for the two-block subgroup with and ; applying Frobenius' formula [F4] to the honest characters of the finite expansion of and extending by linearity gives For an index of the sum write with and ; then by [F3]. If , then fixes the single point of , so no conjugate of (which has no fixed point) lies in and the sum is empty; hence assume . If were an -cycle on , then the disjoint-cycle decomposition of would contain that -cycle, so the cycle type of would have a part equal to , contradicting [F8] and the hypothesis on . Therefore is not an -cycle, so by step 1.2 and every term of the sum vanishes; hence and therefore by step 1.1.
Step 1.1 identifies with the outer product , step 1.2 shows that equals on the class of -cycles of and vanishes on every other class, and step 2.1 shows for every whose cycle type has no part equal to . These are exactly the three assertions of the statement.
Remarks
-
The value on the -cycle class is , not a sign. Evaluating the definition of at an -cycle by the full-cycle lemma gives , in agreement with step 1.2; in particular must not be confused with the sign character, which takes the value there. For the identity is not an -cycle, so by step 1.2. Frobenius' formula [F4] at the identity gives , so has degree in that range.
-
Dictionary to symmetric functions. Under the Frobenius characteristic the alternating hook combination corresponds to the power sum (Macdonald I §3 (2)), whose expansion coefficient at is the value of 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
- Removable border strips and their height
- The value of an irreducible character on a full cycle is supported on hooks
- Alternating hook induction cancels disconnected rim removals
- The outer induction product of symmetric-group characters
- Virtual characters and the character ring $R(G)$ of a finite group
- The induced character $\operatorname{Ind}_H^G\chi$ of a complex character
- Column antisymmetrizers, polytabloids, and Specht modules
- Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Frobenius' formula for the character of an induced representation
- The determinantal form of a Specht character
- Young permutation modules are induced trivial modules
- The trivial representation, the regular representation, and permutation representations from finite $G$-sets
- Specht modules classify the complex irreducibles of $S_n$
- The first orthogonality relation for irreducible complex characters
- The irreducible complex characters form an orthonormal basis of $\mathrm{cf}(G)$
- The standard inner product on $\mathrm{cf}(G)$
- Two elements of $S_n$ are conjugate if and only if they have the same cycle type
- The characteristic of a Specht character is a Schur function
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
- G. D. James, The Representation Theory of the Symmetric Groups, Lecture Notes in Mathematics 682, Springer 1978 (complete author-hosted scan, 161 pp.) (standard reference, not scraped)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford Mathematical Monographs, 1995 (complete author-hosted scan, 486 pp.) (standard reference, not scraped)