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.
Fixed-residue node cubes realize the actual Fock strings
Statement
For the declared charge- node operators and a fixed residue and partition , the orbit obtained by toggling the addable/removable -cells of is a finite Boolean cube: the availability of one such cell is unchanged by every other -toggle, including . Order the -slots by decreasing content, call a vertex state when the slot is empty (addable) and when it is occupied (removable), so that the state word records the configuration. Then the node operators on this cube are exactly the tensor power of the two-vertex rank-one string with the fixed coproduct and -exponent ; in particular the raw -partition span is stable under the actual normalized string operators. On the residue classes in , applies to the first surviving and to the last surviving in decreasing-content order, equivalently to the last and to the first in increasing-content order, with the surviving minus/plus counts; if the required sign is absent, the residue operator is zero. These are congruences modulo , not equalities on standard field vectors. The standard partition form is the normalized rank-one polarization, and all divided - and -powers have Laurent-integral matrices.
Facts & Assumptions
Given: The partition Fock space with node formulas and content order, the fixed residue , and the rank-one tensor crystal of the vector module.
A corner's addability/removability is determined by its horizontal and vertical neighbours, whose residues are and never for ; toggling another -cell does not change any such neighbour (The node order and the signed exponents and , Removable and addable nodes).
On the two-vertex rank-one string the operators have coefficients , , and the tensor rule is the fixed-coproduct rule with the strict /non-strict comparison (Divided-power commutation and the simple string modules, The crystal basis of a tensor product and the two-case operator rule).
The node operators are the stable prefix operators; their coefficients are and and the exponents agree with the tensor cube weights (Semi-infinite wedges are indexed by partitions and the action gives the node formulas, The node order and the signed exponents and ).
Proof
Independence of the -slots. If two -cells are toggled, the neighbours determining each corner's availability are of residues , and the toggled cell has residue , so it is not a neighbour of any other -cell; hence toggling one -cell never changes the availability of another, every subset of the finitely many slots is realizable, and the orbit is a Boolean cube with distinct partition diagrams.
The cube is the rank-one tensor power. In decreasing-content order, the -th slot's toggling multiplies by or according to occupancy and the iterated coproduct coefficient at slot is for and for ; these are exactly and by [F3], so the map from tensor bit vectors to partitions is a rank-one module isomorphism onto the cube.
The string rule, lattice and divided powers. The tensor crystal theorem [F2] gives stability of the -span of the cube basis under the normalized string operators. On the residue basis modulo , unrolling its strict/non-strict comparison cancels in decreasing order, with acting on the first surviving and on the last surviving ; reversing the order cancels and selects the last / first . For divided powers, write on an empty slot and on an occupied slot. If empty slots are filled by , the coefficient is the Laurent monomial : the orders of distinct toggles contribute the asymmetric factorial at , which divided by is . Repeated toggles vanish. Likewise emptying occupied slots by has coefficient . These formulas prove Laurent integrality. Define the standard partition form by making cube words orthonormal. For an edge and , its two coefficients satisfy , so . This verifies and, by transposition, ; together with diagonal this is the normalized rank-one polarization for the fixed coproduct.
Conclusion. Each fixed-residue orbit is a finite Boolean tensor cube of highest-weight- strings, the actual normalized operators preserve the raw -partition span and induce the survivor rule on its residue classes in either content order, including . Lattice stability precedes transport of these congruences; no equality on standard field vectors is asserted.
Remarks
For , , put , , and . The node formulas give , , and is killed by both and . Thus and . Its residue is zero, exactly as the cancelled signature predicts.
Depends on
- The node order and the signed exponents $N_i^l$ and $N_i^r$
- Semi-infinite wedges are indexed by partitions and the action gives the node formulas
- The crystal basis of a tensor product and the two-case operator rule
- Divided-power commutation and the simple $U_{q_i}(\mathfrak{sl}_2)$ string modules
- The Kashiwara operators $\tilde e_i$ and $\tilde f_i$ of an integrable module
- Crystal lattices, crystal bases and their crystals
- Removable and addable nodes
Used by
- Good and cogood nodes by residue-signature reduction Definition
- The empty partition generates an integrable highest weight submodule of highest weight Λ₀ Proposition
- The basic representation global basis is unitriangular in the partition basis Theorem
- The crystal of the level-one Fock space is the good-node partition graph Theorem
- The Fock space node formulas satisfy the quantum affine relations Theorem
Dependency tree · two levels
29 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)
- Kashiwara-Miwa-Petersen-Yung, Perfect crystals and q-deformed Fock spaces (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)