Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 e-restricted labels) and the level-one Fock crystal e~iQG, f~iQG on the other. Conjugation C(λ)=λ′ sends the modular operators on e-restricted partitions onto the normalized operators of the empty connected component of the QG full partition Fock crystal, with the colors negated: C e~iλ=e~−iQGCλ,C f~iλ=f~−iQGCλ(λ e-restricted), including the zero values: the left side is zero exactly when the right side is. The survivor counts are the same on both sides, εi(λ)=ε−i(λ′) and φi(λ)=φ−i(λ′), and the weight transforms by the diagram reflection, wt⁡(λ′)=τ(wt⁡(λ)). With the transported full module Fsym 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 J−1e~−iQGJ, J−1f~−iQGJ), and the restricted subset of that full crystal is its basic component. In both conventions good means removable (deletion, e~) and cogood means addable (addition, f~): there is no opposite naming-polarity dictionary exchanging deletion with addition. Ordinary Chevalley coefficients, especially negative powers such as q−1, do not define these arrows.

Facts & Assumptions

Given: A finite integer e≥2, 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.

[F1]

The modular signature of an i-signature lists corners top to bottom, cancels − above +, counts εi surviving − and φi surviving +, and selects the good removable node and the cogood addable node; λ is e-restricted if and only if λ′ is e-regular, and JMμ=∣μ′⟩ transports Fisym=J−1F−iQGJ and Eisym=J−1E−iQGJ on all partitions (The symmetric-group level-one residue and partition-label convention).

[F2]

For every partition μ and color i, transposition is a sign-preserving bijection from the top-to-bottom i-node list of μ to the increasing-content (−i)-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).

[F3]

On the set of p-restricted partitions the partial operators e~i, f~i of Good-node deletion and cogood-node addition operators delete the good i-node and add the cogood i-node, are undefined exactly when εi(μ)=0 respectively φi(μ)=0, satisfy μ=f~iν  ⟺  ν=e~iμ, 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.

[F4]

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 e~i (a removable node) and the last surviving + is the cogood node for f~i (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).

[F5]

The whole level-one Fock module has crystal basis (F0,BF) with F0=⨁all λA0∣λ⟩; its actual normalized Kashiwara operators remove the good normal i-node and add the cogood conormal i-node of the reference signature, and its empty connected component is precisely the e-regular partitions (The crystal of the level-one Fock space is the good-node partition graph).

Proof

technique · direct
1.1givenF2

For every partition μ and every color i, the selection operations of the two readings correspond under transposition. By [F2] the top-to-bottom i-node word of μ equals the increasing-content (−i)-node word of μ′ position by position, with the same signs, so the reduced survivor words coincide; consequently εi(μ)=ε−i(μ′) and φi(μ)=φ−i(μ′), and if εi(μ)>0 then the good i-node of μ is the transposed node of the good (−i)-node of μ′, while if φi(μ)>0 then the cogood i-node of μ is the transposed node of the cogood (−i)-node of μ′. In particular εi(μ)=0 if and only if ε−i(μ′)=0.

1.2givenF3F4F5

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 p-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 i↦−i.

2.1givenF4F5step 1.1

The transported crystal operators on all partition residues are given by the modular signature rule. The field operators J−1e~−iQGJ and J−1f~−iQGJ preserve (F0)sym by [F5]; let bμ:=Mμ+q(F0)sym. The induced map of residue spaces sends bμ to ∣μ′⟩+qF0. By [F4]-[F5] its raising image is the residue of the partition obtained by deleting the good (−i)-node of μ′, or zero when no such node exists. Step 1.1 identifies that node with the transpose of the modular good i-node A of μ, so e~isymbμ=bμ∖A when εi(μ)>0, and zero otherwise. The same argument gives f~isymbμ=bμ∪B for the modular cogood node B, and zero when φi(μ)=0. These are equalities of crystal residues: on raw standard vectors they assert congruences modulo q(F0)sym, including at zero arrows, rather than exact field-vector equalities.

3.1givenF1step 1.1step 2.1

Weights transform by the reflection. By [F1] the transported weight satisfies wt⁡(Mμ)=Λ0−∑imi(μ)αi and mi(μ)=m−i(μ′); hence wt⁡(∣μ′⟩)=Λ0−∑jmj(μ′)αj=Λ0−∑jm−j(μ)αj=τ(wt⁡(Mμ)), 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.

3.2givenF1F5step 1.1step 2.1

Restricted case. Let λ be e-restricted, so that λ′ is e-regular by [F1] and hence a vertex of the empty component of the full Fock crystal by [F5], on which the operators e~QG, f~QG of [F5] act. By step 2.1 applied at μ=λ, the modular operator e~i on λ (delete the good i-node, zero if εi(λ)=0) is intertwined with e~−iQG on λ′: C e~iλ=e~−iQGCλ, and likewise C f~iλ=f~−iQGCλ, both sides being zero together by the count agreement of step 1.1. Since transposition is a bijection from the e-restricted onto the e-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 e=p prime the modular side is the operator system of [F3], and in general it is the reading fixed in [F1].

4.1givenF4F5step 2.1∎

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 e~isym of step 2.1 is the normalization inherited from e~−iQG, not the transported Chevalley operator Eisym=J−1E−iQGJ, whose coefficients (such as q−1 from the formulas of Leclerc (38)-(39)) differ from the arrow data.

Depends on

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