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 level-one partition Fock space and node residues
Definition
Let be the charge- part of the Fock space of Semi-infinite wedges are indexed by partitions and the action gives the node formulas, with basis indexed by all partitions and with the node operators defined by the stable finite-prefix action. Assign to the level-one weight
where the residue of a cell in row and column is , and the size is the separate grading. The vacuum is the empty partition ; adds and removes a node by the explicit finite node formulas of the same item. The toral action is with the addable-minus-removable count, proved to be the Cartan pairing in The addable-minus-removable node count is the level-one Cartan pairing, and .
A partition is -regular if each positive part occurs with multiplicity , and -restricted if for every (with beyond the length). These operators are declared linear endomorphisms here; the affine relations proved later establish the actual module structure, so nothing about is silently assumed in this Definition.
Facts & Assumptions
Given: The charge- Fock space with its partition basis, the node formulas and the toral and loop actions, and the residue convention .
Normal wedges are bijective with partitions through , and the stable finite-prefix action gives the finite node formulas for (Semi-infinite wedges are indexed by partitions and the action gives the node formulas).
A removable node of is a cell with , and an addable node is with or ; the conjugate partition has (Removable and addable nodes, Partitions, English diagrams, and conjugation).
Verification
The partition basis and the declared operators. By [F1] the map is a bijection from partitions to normal semi-infinite words and the stable prefix action gives well-defined linear ; the weights, residues and size grading are read off literally from , so the Definition introduces no new structure beyond the wedge construction.
The regular/restricted equivalence. For each , the number of columns of of height exactly is : such a column has index with . These column heights are the parts of . Thus is -restricted exactly when every part of has multiplicity less than , equivalently when is -regular. Column height itself is unrestricted; for example has one column of height and its only nonzero adjacent row difference is .
The boundary example. For the partition has parts of multiplicity exactly , so it is not -regular, while its adjacent differences are except for the final difference , so it is -restricted; this shows the two conditions are genuinely different and that the full Fock space contains non-regular labels. All partitions are vertices of the full Fock module; the regular ones will be the labels of the empty component.
Conclusion. The level-one partition Fock space is the charge- Fock space with weight and residues , its operators are the stable finite-prefix node operators, and the -regular and -restricted conventions are conjugate to each other with the column-height dictionary.
Depends on
Used by
- The whole partition Fock space is not the basic representation Counterexample
- Good and cogood nodes by residue-signature reduction Definition
- The node order and the signed exponents Nᵢˡ and Nᵢʳ Definition
- The symmetric-group level-one residue and partition-label convention Definition
- Node actions for partitions of size at most three Example
- The double-edge Serre cancellation in affine A₁ on partitions Example
- Standard Fock vectors expand in the upper global basis Lemma
- The addable-minus-removable node count is the level-one Cartan pairing Lemma
- The empty partition generates an integrable highest weight submodule of highest weight Λ₀ Proposition
- Graded Specht classes realize the standard Fock vectors Theorem
- The Fock space node formulas satisfy the quantum affine relations Theorem
Dependency tree · two levels
7 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
- Bernard Leclerc, Fock space representations (author-hosted complete 38-page treatment) (standard reference, not scraped)
- Kailash C. Misra and Tetsuji Miwa, Crystal base for the basic representation of $U_q(\mathfrak{sl}(n))$, Comm. Math. Phys. 134 (1990), 79-88 (standard reference, not scraped)
- Matthew Fayers, Partition models for the crystal of the basic $U_q(\mathfrak{sl}_n)$-module, arXiv:0906.4129 (standard reference, not scraped)