Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 empty component is the highest weight crystal B(Λ0)

Statement

With the declared use of the Axiom of Choice in the general integrable-module decomposition, the empty connected component of the full partition crystal of The crystal of the level-one Fock space is the good-node partition graph is the canonical highest weight crystal B(Λ0), with exactly the e-regular labels. Its module is M=Uq(g)∣∅⟩ and its lower A0-lattice is M∩F0; it occurs once. More precisely

F=⨁k≥0V(Λ0−kδ)⊕p(k),

a locally weight-finite indexed direct sum in which p(k) is the number of ordinary partitions of k; consequently ch F=ch V(Λ0)∏r≥1(1−e−rδ)−1. A highest crystal label need not be a highest field standard vector, and the ambient canonical basis need not split these summands.

Facts & Assumptions

Given: The full partition crystal with its empty component, the module M=V(Λ0), the decomposition theorem for integrable modules, and the highest weight crystal B(Λ0).

[F1]

The empty component of the Fock crystal consists exactly of the e-regular partitions and contains the vacuum; the full crystal is a graph on all partitions (The crystal of the level-one Fock space is the good-node partition graph).

[F2]

The vacuum generates the simple integrable V(Λ0), whose canonical lower lattice is M∩F0 and whose residue crystal identifies with the empty component and the canonical B(Λ0) (The empty partition generates an integrable highest weight submodule of highest weight Λ0, The canonical crystal B(λ) is a highest weight crystal of highest weight λ).

[F3]

Every chosen integrable weight module with finite-dimensional label spaces and support in a finite union of downward cones admits a module isomorphism to a locally weight-finite direct sum of simple highest weight modules carrying its crystal lattice and basis to the corresponding canonical highest weight lattices and crystals. Its connected crystal components and constituent multiplicities are thereby determined, but the field-module splitting is not asserted to be canonical. The decomposition uses the Axiom of Choice as declared (Uniqueness: crystal bases of integrable modules decompose into highest weight crystals, The Axiom of Choice).

Proof

technique · inspect the highest crystal vertices by cancellation, count their weights, and apply the decomposition theorem with the declared choice
1.1F1F2givenalgebra

The Λ0 isotypic part. The weight Λ0 weight space of F is one-dimensional, spanned by the vacuum; since Λ0 is a maximal weight, the top isotypic submodule is generated by the vacuum and equals the simple module M=V(Λ0) by [F2], whose crystal is the empty component B(Λ0) by [F1].

1.2F1givenalgebra

All highest crystal vertices. In decreasing-content order a block of a equal rows of length L, starting at row r, contributes its addable corner of content L−r+1 followed by its removable corner of content L−r−a+1. These are consecutive in the full boundary list: the next block's addable content is strictly smaller than this removable content. For the top block, its only preceding plus is this addable corner, so its minus can cancel exactly when a≡0(mode). If not, that minus survives: +− reduction cannot pair it with a later plus. If e∣a, the two same-residue signs cancel and can be deleted from the signature; deleting the top block from the diagram shifts all remaining contents by a, preserving their residues. Induction over the blocks proves that all minuses cancel exactly when every positive part multiplicity is divisible by e. Such a shape repeats every row of a unique ordinary partition ρ exactly e times. In each stack of e equal rows, every column has one cell of each residue, so mi=∣ρ∣ for all i. Its weight is Λ0−∣ρ∣δ, and the number of these highest labels at weight Λ0−kδ is p(k).

2.1step 1.1step 1.2F3givenalgebra

The decomposition. The full Fock module has finite label spaces and support in Λ0−Q+, so [F3] applies and identifies the field constituents of the highest crystal labels of step 1.2; combined with step 1.1 this gives F=⨁k≥0V(Λ0−kδ)⊕p(k) as a locally weight-finite indexed sum, and taking characters gives the displayed product formula. The raw standard vectors attached to the non-regular highest labels are not asserted to be field-highest vectors, and the ambient basis is not asserted to be component-compatible.

3.1step 1.1step 1.2step 2.1∎

Conclusion. The empty component is the canonical B(Λ0) with the e-regular labels, its module and lower lattice are M and M∩F0, it occurs once, and the full decomposition has p(k) copies of V(Λ0−kδ), with the Axiom of Choice used only through the declared decomposition [F3].

Remarks

The module isomorphism in [F3] involves choices of summands and lifts. For example, at k=2 its two isomorphic constituents can be mixed by module automorphisms. This does not change their multiplicity or the canonical highest weight crystal assigned to each connected component.

Depends on

Used by

Dependency tree · two levels

23 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