PhyslibAlpha.Mathematics.LadderSystem.OccupationBasis
The occupation-number basis
i. Overview
The occupation-number states `word (countWord d α) Ω`, indexed by degree-`n` count functions `α : CountFun d n`, form a basis of `vacuumSpan L Ω n`. For linear independence, each state is viewed as a nonzero eigenvector of the diagonal operator `M := ∑ᵢ (n+1)^i • Nᵢ`, at the pairwise-distinct eigenvalue `countEncode n α` (a positional encoding of `α`), so Mathlib's general "eigenvectors at distinct eigenvalues are independent" fact applies. It follows that `vacuumSpan` is finite-dimensional and has dimension `(d+n-1).choose n`, the degeneracy of the `n`-th level of a `d`-dimensional bosonic oscillator.
ii. Key results
Definitions: - `CountFun d n` : a degree-`n` count function on `d` colors. - `LadderSystem.vacuumBasis` : the occupation-number basis of `vacuumSpan L Ω n`.
Theorems: - `LadderSystem.linearIndependent_word_countFun` : the occupation-number states are linearly independent. - `LadderSystem.finrank_vacuumSpan_eq_choose` : `vacuumSpan L Ω n` has dimension `(d+n-1).choose n`.
iii. Table of contents
- A. Count functions - B. Exact annihilation - C. The occupation-number basis - C.1. A positional encoding of count functions - C.2. Linear independence - C.3. The basis and its dimension
iv. References
A. Count functions
B. Exact annihilation
C. The occupation-number basis
C.1. A positional encoding of count functions
C.2. Linear independence
C.3. The basis and its dimension
23 declarations
Count functions of degree on colors
For natural numbers and , a count function of degree on colors is a function such that the sum of its values over all colors is equal to , i.e., . In the context of quantum mechanics, this represents the occupation numbers of identical bosons distributed among states.
For natural numbers and , there is an equivalence (bijection) between the set of count functions of degree on colors, denoted , and the symmetric power . A count function is a mapping from the set of indices to the natural numbers such that the sum of its values is , i.e., . The symmetric power represents the collection of multisets of size whose elements are drawn from the set . In physical terms, this identifies the occupation-number representations of identical bosons in states with the possible configurations of those bosons.
is a finite set
For any natural numbers and , the set of count functions of degree on colors, denoted , is finite. Here, a count function is defined as a function such that the sum of its values is , i.e., .
For any natural numbers and , the number of degree- count functions on colors is given by the binomial coefficient . A degree- count function is a mapping from the set of indices to the natural numbers such that the sum of its values is , i.e., . In physics, this corresponds to the number of ways to distribute identical bosons into energy levels.
and commute for
Let be a ladder system on a vector space with colors. For any two distinct indices (i.e., ), any natural number , and any vector , the -th power of the annihilation operator commutes with the creation operator . That is: where denotes the annihilation operator for color and denotes the creation operator for color .
when
Let be a ladder system on a vector space over a field with modes. Let and denote the annihilation and creation operators for mode , respectively. Given a vector that is annihilated by (i.e., ) and a list of indices , let be the number of occurrences of in . Then, applying the annihilation operator exactly times to the creation-operator word removes all occurrences of and scales the result by : where is the list after filtering out all indices equal to .
Joint annihilation monomial
Given a ladder system on a vector space over a field with modes (or "colors"), a list of indices , and a function providing exponents, the joint annihilation monomial is the endomorphism of defined by the product: where denotes the annihilation operator corresponding to the mode .
For a ladder system and any exponent function , the joint annihilation monomial associated with an empty list of indices, denoted as , is equal to the identity operator .
Joint annihilation monomial of a list starting with :
For a ladder system with modes, let denote the annihilation operator corresponding to the mode . For any index , list of indices , and exponent function , the joint annihilation monomial for the list starting with followed by is given by: where the multiplication on the right-hand side represents the composition of endomorphisms.
Annihilation of matching colors in a creation word produces a product of factorials
Let be a ladder system on a vector space over a field with modes. Let be a vector annihilated by all annihilation operators, such that for all . Suppose is a list of distinct color indices, is a function providing exponents, and is a list of indices representing a creation-operator word. If for every color in the list , the number of occurrences of in is exactly , then applying the joint annihilation monomial to the word applied to yields: where and are the annihilation and creation operators of the ladder system, respectively, and the sequence of indices is the sublist of containing only the elements not present in .
contains only colors from the range
For any natural number and any count function , the word (which repeats each color exactly times) contains only elements that are valid color indices from the set . Consequently, filtering the list to retain only those elements not contained in the range of all possible colors (`List.finRange d`) results in an empty list:
Injectivity of Base- Positional Encoding for Digits
For any natural numbers and where , and for any functions representing sequences of digits, if all digits satisfy and for all , then the equality of their base- positional encodings implies that the sequences are identical, i.e., .
Base- positional encoding of a count function
For a natural number and a count function , the function calculates the base- positional encoding of , defined by the formula: where ranges over the indices of the modes (or "colors") and represents the occupation number of the -th mode. Because the total number of particles is (i.e., ), each is strictly less than the base , ensuring the encoding is injective.
Injectivity of the Base- Positional Encoding for Degree- Count Functions
For any natural numbers and , and any two count functions , if the sum of the values of each function is equal to (i.e., and ), then the equality of their base- positional encodings implies that the functions themselves are identical, .
Occupation-number states are non-zero
Let be a ladder system with vacuum state . For any count function that assigns an occupation number to each of the colors, the corresponding occupation-number state is non-zero, where the sequence of indices is the canonical word associated with (containing each color exactly times).
Occupation-number states are eigenvectors of the encoding operator
Let be a ladder system on a -vector space with modes, and let be a vacuum state. For any total particle number and any count function of degree (representing occupation numbers such that ), the occupation-number state (constructed by applying the creation operators according to the canonical word of ) is an eigenvector of the operator where is the number operator for the -th mode. The corresponding eigenvalue is the base- positional encoding of , given by evaluated in the field .
Linear Independence of Occupation-Number States of Degree
Let be a ladder system over a field and a vector space . Suppose is a vacuum state. For any total particle number , the set of occupation-number states indexed by count functions such that , is linearly independent over . Here, represents the creation operator associated with the -th mode of the ladder system.
The occupation-number states span the -th excitation sector
Let be a ladder system over a field with modes and a vacuum state . For any natural number , the -th excitation-number sector is equal to the -linear span of the occupation-number states indexed by count functions of degree : where satisfies , and denotes the creation operator for the -th mode.
Occupation-number basis for
For a -mode ladder system over a field and a vacuum state in a vector space , the occupation-number basis of the -th excitation-number sector is the basis indexed by count functions . Each basis vector is formed by the application of creation operators to the vacuum state: where is the number of excitations in the -th mode and the total number of excitations is .
The -th occupation-number basis vector is
Let be a -mode ladder system over a field acting on a vector space , and let be a vacuum state. For any and any count function , the basis vector in the occupation-number basis indexed by is equal to the vector obtained by applying the corresponding creation operators to the vacuum state: where denotes the creation operator for the -th mode and is the number of excitations in that mode.
The dimension of is
Let be a -mode ladder system over a field acting on a vector space , and let be a vacuum state for . For any , the dimension of the -th excitation-number sector —defined as the subspace spanned by applying creation operators to —is given by the binomial coefficient This value represents the degeneracy of the -th energy level of a -dimensional bosonic oscillator.
The -th excitation-number sector is finite-dimensional
Let be a ladder system with modes acting on a -vector space . For any vacuum state and any excitation number , the -th excitation-number sector is a finite-dimensional subspace of over . Here, is defined as the -linear submodule spanned by all vectors of the form where each .
The -th excitation-number sector is non-zero for
Let be a ladder system with modes on a vector space over a field , and let be a vacuum state (satisfying the property `HasVacuum`). If the number of modes is strictly positive (), then for any natural number , the -th excitation-number sector is not the trivial subspace .
