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 QG Fock-crystal arrows are the modular good-node operators
Statement
Consider the modular reading on the one hand (the top-to-bottom residue signature with good first surviving and cogood last surviving of The symmetric-group level-one residue and partition-label convention, whose operators delete the good node and add the cogood node on -restricted labels) and the level-one Fock crystal , on the other. Conjugation sends the modular operators on -restricted partitions onto the normalized operators of the empty connected component of the QG full partition Fock crystal, with the colors negated: including the zero values: the left side is zero exactly when the right side is. The survivor counts are the same on both sides, and , and the weight transforms by the diagram reflection, . With the transported full module of The symmetric-group level-one residue and partition-label convention, the modular signatures likewise give its normalized operators on all partitions (the transported operators , ), and the restricted subset of that full crystal is its basic component. In both conventions good means removable (deletion, ) and cogood means addable (addition, ): there is no opposite naming-polarity dictionary exchanging deletion with addition. Ordinary Chevalley coefficients, especially negative powers such as , do not define these arrows.
Facts & Assumptions
Given: A finite integer , the residue and signature conventions of The symmetric-group level-one residue and partition-label convention, and the node-order dictionary of Residue-node reading orders and the conjugation dictionary.
The modular signature of an -signature lists corners top to bottom, cancels above , counts surviving and surviving , and selects the good removable node and the cogood addable node; is -restricted if and only if is -regular, and transports and on all partitions (The symmetric-group level-one residue and partition-label convention).
For every partition and color , transposition is a sign-preserving bijection from the top-to-bottom -node list of to the increasing-content -node list of , and the two reductions cancel + and select the first surviving and the last surviving ; the survivor counts agree and the selected nodes correspond under transposition (Residue-node reading orders and the conjugation dictionary).
On the set of -restricted partitions the partial operators , of Good-node deletion and cogood-node addition operators delete the good -node and add the cogood -node, are undefined exactly when respectively , satisfy , and lower/raise the rank by one; at most one good and one cogood node occur per residue (Residue signatures, normal, good, conormal and cogood nodes). Good is a removable node and cogood is an addable node.
The Fock-space node combinatorics uses the reference order of increasing content and reads the selection as: cancel , the first surviving is the good node for (a removable node) and the last surviving is the cogood node for (an addable node); a missing chosen sign means the operator is zero. This is combinatorial string data and is not a selection by minimum ordinary Chevalley exponent (Good and cogood nodes by residue-signature reduction).
The whole level-one Fock module has crystal basis with ; its actual normalized Kashiwara operators remove the good normal -node and add the cogood conormal -node of the reference signature, and its empty connected component is precisely the -regular partitions (The crystal of the level-one Fock space is the good-node partition graph).
Proof
For every partition and every color , the selection operations of the two readings correspond under transposition. By [F2] the top-to-bottom -node word of equals the increasing-content -node word of position by position, with the same signs, so the reduced survivor words coincide; consequently and , and if then the good -node of is the transposed node of the good -node of , while if then the cogood -node of is the transposed node of the cogood -node of . In particular if and only if .
There is no naming-polarity swap between the two conventions: in the modular reading the good node is by definition removable and the cogood node addable ([F1]), in the -restricted operator definition the good node is removable and the cogood node addable ([F3]), and in the Fock-space reading the good node is the surviving , hence removable, while the cogood node is the surviving , hence addable ([F4]); the normalized Fock operators remove the good node and add the cogood node ([F5]). Hence both dictionaries compare a deletion with a deletion and an addition with an addition, and the only change is the color reflection .
The transported crystal operators on all partition residues are given by the modular signature rule. The field operators and preserve by [F5]; let . The induced map of residue spaces sends to . By [F4]-[F5] its raising image is the residue of the partition obtained by deleting the good -node of , or zero when no such node exists. Step 1.1 identifies that node with the transpose of the modular good -node of , so when , and zero otherwise. The same argument gives for the modular cogood node , and zero when . These are equalities of crystal residues: on raw standard vectors they assert congruences modulo , including at zero arrows, rather than exact field-vector equalities.
Weights transform by the reflection. By [F1] the transported weight satisfies and ; hence , and the weight of a crystal arrow is preserved by the node moves of step 2.1 because those moves change one residue count by one on each side consistently.
Restricted case. Let be -restricted, so that is -regular by [F1] and hence a vertex of the empty component of the full Fock crystal by [F5], on which the operators , of [F5] act. By step 2.1 applied at , the modular operator on (delete the good -node, zero if ) is intertwined with on : , and likewise , both sides being zero together by the count agreement of step 1.1. Since transposition is a bijection from the -restricted onto the -regular labels and [F5] identifies the latter precisely as the vertex set of the empty component, the conjugation of the modular restricted graph is exactly that empty component, with colors negated; for prime the modular side is the operator system of [F3], and in general it is the reading fixed in [F1].
Finally, the arrows are not read off from ordinary Chevalley coefficients. The selection is the signature reduction of [F4], and [F4]-[F5] record that a pole or a unique Chevalley term does not determine the crystal arrow; the transported operator of step 2.1 is the normalization inherited from , not the transported Chevalley operator , whose coefficients (such as from the formulas of Leclerc (38)-(39)) differ from the arrow data.
Depends on
- The symmetric-group level-one residue and partition-label convention
- Residue-node reading orders and the conjugation dictionary
- Good-node deletion and cogood-node addition operators
- Residue signatures, normal, good, conormal and cogood nodes
- Good and cogood nodes by residue-signature reduction
- The crystal of the level-one Fock space is the good-node partition graph
Used by
Dependency tree · two levels
19 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
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. AMS 47 (2010) 419-481, arXiv:0909.4844 (complete 66-page survey) (standard reference, not scraped)
- Matthew Fayers, Partition models for the crystal of the basic U_q(sl_n)-module, arXiv:0906.4129 (complete 31-page paper) (standard reference, not scraped)
- Bernard Leclerc, Fock space representations (complete author-hosted 38-page lecture notes) (standard reference, not scraped)