Physlib

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

abbrev

Count functions of degree nn on dd colors

For natural numbers dd and nn, a count function of degree nn on dd colors is a function α:{0,1,,d1}N\alpha : \{0, 1, \dots, d-1\} \to \mathbb{N} such that the sum of its values over all colors is equal to nn, i.e., c=0d1α(c)=n\sum_{c=0}^{d-1} \alpha(c) = n. In the context of quantum mechanics, this represents the occupation numbers of nn identical bosons distributed among dd states.

definition

CountFun(d,n)Symn(Fin d)\text{CountFun}(d, n) \cong \text{Sym}^n(\text{Fin } d)

For natural numbers dd and nn, there is an equivalence (bijection) between the set of count functions of degree nn on dd colors, denoted CountFun(d,n)\text{CountFun}(d, n), and the symmetric power Symn({0,1,,d1})\text{Sym}^n(\{0, 1, \dots, d-1\}). A count function α\alpha is a mapping from the set of indices {0,1,,d1}\{0, 1, \dots, d-1\} to the natural numbers such that the sum of its values is nn, i.e., i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n. The symmetric power Symn(Fin d)\text{Sym}^n(\text{Fin } d) represents the collection of multisets of size nn whose elements are drawn from the set {0,1,,d1}\{0, 1, \dots, d-1\}. In physical terms, this identifies the occupation-number representations of nn identical bosons in dd states with the possible configurations of those bosons.

instance

CountFun(d,n)\text{CountFun}(d, n) is a finite set

For any natural numbers dd and nn, the set of count functions of degree nn on dd colors, denoted CountFun(d,n)\text{CountFun}(d, n), is finite. Here, a count function α\alpha is defined as a function α:{0,1,,d1}N\alpha : \{0, 1, \dots, d-1\} \to \mathbb{N} such that the sum of its values is nn, i.e., i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n.

theorem

CountFun(d,n)=(d+n1n)|\text{CountFun}(d, n)| = \binom{d + n - 1}{n}

For any natural numbers dd and nn, the number of degree-nn count functions on dd colors is given by the binomial coefficient (d+n1n)\binom{d + n - 1}{n}. A degree-nn count function α\alpha is a mapping from the set of indices {0,1,,d1}\{0, 1, \dots, d-1\} to the natural numbers such that the sum of its values is nn, i.e., i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n. In physics, this corresponds to the number of ways to distribute nn identical bosons into dd energy levels.

theorem

(ai)k(a_i)^k and aca^\dagger_c commute for ici \neq c

Let LL be a ladder system on a vector space VV with dd colors. For any two distinct indices i,c{0,1,,d1}i, c \in \{0, 1, \dots, d-1\} (i.e., ici \neq c), any natural number kk, and any vector yVy \in V, the kk-th power of the annihilation operator aia_i commutes with the creation operator aca^\dagger_c. That is: (ai)k(acy)=ac((ai)ky) (a_i)^k (a^\dagger_c y) = a^\dagger_c ((a_i)^k y) where aia_i denotes the annihilation operator for color ii and aca^\dagger_c denotes the creation operator for color cc.

theorem

(ai)count(v,i)word(v,x)=count(v,i)!word(v{i},x)(a_i)^{\text{count}(v, i)} \text{word}(v, x) = \text{count}(v, i)! \cdot \text{word}(v \setminus \{i\}, x) when aix=0a_i x = 0

Let LL be a ladder system on a vector space VV over a field KK with dd modes. Let aia_i and aia^\dagger_i denote the annihilation and creation operators for mode i{0,,d1}i \in \{0, \dots, d-1\}, respectively. Given a vector xVx \in V that is annihilated by aia_i (i.e., aix=0a_i x = 0) and a list of indices vv, let k=count(v,i)k = \text{count}(v, i) be the number of occurrences of ii in vv. Then, applying the annihilation operator aia_i exactly kk times to the creation-operator word av1avnxa^\dagger_{v_1} \dots a^\dagger_{v_n} x removes all occurrences of aia^\dagger_i and scales the result by k!k!: (ai)k(av1avnx)=k!(aw1awmx) (a_i)^k (a^\dagger_{v_1} \dots a^\dagger_{v_n} x) = k! \cdot (a^\dagger_{w_1} \dots a^\dagger_{w_m} x) where [w1,,wm][w_1, \dots, w_m] is the list vv after filtering out all indices equal to ii.

definition

Joint annihilation monomial ccsacα(c)\prod_{c \in cs} a_c^{\alpha(c)}

Given a ladder system LL on a vector space VV over a field KK with dd modes (or "colors"), a list of indices cscs, and a function α:{0,,d1}N\alpha: \{0, \dots, d-1\} \to \mathbb{N} providing exponents, the joint annihilation monomial is the endomorphism of VV defined by the product: ccs(ac)α(c)\prod_{c \in cs} (a_c)^{\alpha(c)} where aca_c denotes the annihilation operator corresponding to the mode cc.

theorem

L.annMono [] α=1L.\text{annMono} \ [] \ \alpha = 1

For a ladder system LL and any exponent function α:{0,,d1}N\alpha: \{0, \dots, d-1\} \to \mathbb{N}, the joint annihilation monomial associated with an empty list of indices, denoted as L.annMono [] αL.\text{annMono} \ [] \ \alpha, is equal to the identity operator 11.

theorem

Joint annihilation monomial of a list starting with cc: annMono(c::cs,α)=acα(c)annMono(cs,α)\text{annMono}(c :: cs, \alpha) = a_c^{\alpha(c)} \text{annMono}(cs, \alpha)

For a ladder system LL with dd modes, let aca_c denote the annihilation operator corresponding to the mode c{0,,d1}c \in \{0, \dots, d-1\}. For any index cc, list of indices cscs, and exponent function α:{0,,d1}N\alpha: \{0, \dots, d-1\} \to \mathbb{N}, the joint annihilation monomial annMono\text{annMono} for the list starting with cc followed by cscs is given by: annMono(c::cs,α)=acα(c)annMono(cs,α)\text{annMono}(c :: cs, \alpha) = a_c^{\alpha(c)} \circ \text{annMono}(cs, \alpha) where the multiplication on the right-hand side represents the composition of endomorphisms.

theorem

Annihilation of matching colors in a creation word produces a product of factorials

Let LL be a ladder system on a vector space VV over a field KK with dd modes. Let xVx \in V be a vector annihilated by all annihilation operators, such that aix=0a_i x = 0 for all i{0,,d1}i \in \{0, \dots, d-1\}. Suppose cscs is a list of distinct color indices, α:{0,,d1}N\alpha : \{0, \dots, d-1\} \to \mathbb{N} is a function providing exponents, and vv is a list of indices representing a creation-operator word. If for every color cc in the list cscs, the number of occurrences of cc in vv is exactly α(c)\alpha(c), then applying the joint annihilation monomial to the word applied to xx yields: (ccsacα(c))(av1av2avnx)=(ccsα(c)!)(aw1aw2awmx)\left( \prod_{c \in cs} a_c^{\alpha(c)} \right) (a^\dagger_{v_1} a^\dagger_{v_2} \dots a^\dagger_{v_n} x) = \left( \prod_{c \in cs} \alpha(c)! \right) \cdot (a^\dagger_{w_1} a^\dagger_{w_2} \dots a^\dagger_{w_m} x) where aca_c and aia^\dagger_i are the annihilation and creation operators of the ladder system, respectively, and the sequence of indices [w1,,wm][w_1, \dots, w_m] is the sublist of vv containing only the elements not present in cscs.

theorem

countWord(d,α)\text{countWord}(d, \alpha) contains only colors from the range [0,d1][0, d-1]

For any natural number dd and any count function α:{0,,d1}N\alpha : \{0, \dots, d-1\} \to \mathbb{N}, the word countWord(d,α)\text{countWord}(d, \alpha) (which repeats each color cc exactly α(c)\alpha(c) times) contains only elements that are valid color indices from the set {0,,d1}\{0, \dots, d-1\}. Consequently, filtering the list countWord(d,α)\text{countWord}(d, \alpha) to retain only those elements not contained in the range of all possible colors (`List.finRange d`) results in an empty list: (countWord(d,α)).filter(λy.y[0,,d1])=[]. (\text{countWord}(d, \alpha)).\text{filter}(\lambda y. y \notin [0, \dots, d-1]) = [].

theorem

Injectivity of Base-bb Positional Encoding for Digits <b< b

For any natural numbers dd and bb where b>0b > 0, and for any functions γ,γ:Fin dN\gamma, \gamma' : \text{Fin } d \to \mathbb{N} representing sequences of digits, if all digits satisfy γ(i)<b\gamma(i) < b and γ(i)<b\gamma'(i) < b for all iFin di \in \text{Fin } d, then the equality of their base-bb positional encodings iFin dγ(i)bi=iFin dγ(i)bi\sum_{i \in \text{Fin } d} \gamma(i) b^i = \sum_{i \in \text{Fin } d} \gamma'(i) b^i implies that the sequences are identical, i.e., γ=γ\gamma = \gamma'.

definition

Base-(n+1)(n+1) positional encoding of a count function γ\gamma

For a natural number nn and a count function γ:{0,,d1}N\gamma : \{0, \dots, d-1\} \to \mathbb{N}, the function calculates the base-(n+1)(n+1) positional encoding of γ\gamma, defined by the formula: countEncode(n,γ)=i=0d1γ(i)(n+1)i \text{countEncode}(n, \gamma) = \sum_{i=0}^{d-1} \gamma(i) (n + 1)^i where ii ranges over the indices of the modes (or "colors") and γ(i)\gamma(i) represents the occupation number of the ii-th mode. Because the total number of particles is nn (i.e., γ(i)=n\sum \gamma(i) = n), each γ(i)\gamma(i) is strictly less than the base n+1n+1, ensuring the encoding is injective.

theorem

Injectivity of the Base-(n+1)(n+1) Positional Encoding for Degree-nn Count Functions

For any natural numbers dd and nn, and any two count functions γ,γ:{0,,d1}N\gamma, \gamma' : \{0, \dots, d-1\} \to \mathbb{N}, if the sum of the values of each function is equal to nn (i.e., i=0d1γ(i)=n\sum_{i=0}^{d-1} \gamma(i) = n and i=0d1γ(i)=n\sum_{i=0}^{d-1} \gamma'(i) = n), then the equality of their base-(n+1)(n+1) positional encodings i=0d1γ(i)(n+1)i=i=0d1γ(i)(n+1)i \sum_{i=0}^{d-1} \gamma(i) (n + 1)^i = \sum_{i=0}^{d-1} \gamma'(i) (n + 1)^i implies that the functions themselves are identical, γ=γ\gamma = \gamma'.

theorem

Occupation-number states are non-zero

Let LL be a ladder system with vacuum state Ω\Omega. For any count function α:{0,,d1}N\alpha : \{0, \dots, d-1\} \to \mathbb{N} that assigns an occupation number to each of the dd colors, the corresponding occupation-number state ai1ai2ainΩ a^\dagger_{i_1} a^\dagger_{i_2} \dots a^\dagger_{i_n} \Omega is non-zero, where the sequence of indices i1,i2,,ini_1, i_2, \dots, i_n is the canonical word associated with α\alpha (containing each color cc exactly α(c)\alpha(c) times).

theorem

Occupation-number states are eigenvectors of the encoding operator M=i(n+1)iNiM = \sum_i (n+1)^i N_i

Let LL be a ladder system on a KK-vector space VV with dd modes, and let ΩV\Omega \in V be a vacuum state. For any total particle number nNn \in \mathbb{N} and any count function α\alpha of degree nn (representing occupation numbers α(i)\alpha(i) such that i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n), the occupation-number state ψα=ai1ai2ainΩ \psi_\alpha = a^\dagger_{i_1} a^\dagger_{i_2} \dots a^\dagger_{i_n} \Omega (constructed by applying the creation operators according to the canonical word of α\alpha) is an eigenvector of the operator M=i=0d1(n+1)iNi M = \sum_{i=0}^{d-1} (n+1)^i N_i where NiN_i is the number operator for the ii-th mode. The corresponding eigenvalue is the base-(n+1)(n+1) positional encoding of α\alpha, given by i=0d1α(i)(n+1)i \sum_{i=0}^{d-1} \alpha(i) (n+1)^i evaluated in the field KK.

theorem

Linear Independence of Occupation-Number States of Degree nn

Let LL be a ladder system over a field KK and a vector space VV. Suppose ΩV\Omega \in V is a vacuum state. For any total particle number nNn \in \mathbb{N}, the set of occupation-number states {(a0)α(0)(a1)α(1)(ad1)α(d1)Ω}αCountFun(d,n) \left\{ (a^\dagger_0)^{\alpha(0)} (a^\dagger_1)^{\alpha(1)} \dots (a^\dagger_{d-1})^{\alpha(d-1)} \Omega \right\}_{\alpha \in \text{CountFun}(d, n)} indexed by count functions α:{0,,d1}N\alpha : \{0, \dots, d-1\} \to \mathbb{N} such that i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n, is linearly independent over KK. Here, aia^\dagger_i represents the creation operator associated with the ii-th mode of the ladder system.

theorem

The occupation-number states span the nn-th excitation sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n)

Let LL be a ladder system over a field KK with dd modes and a vacuum state ΩV\Omega \in V. For any natural number nn, the nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is equal to the KK-linear span of the occupation-number states indexed by count functions of degree nn: vacuumSpan(L,Ω,n)=spanK{(a0)α(0)(a1)α(1)(ad1)α(d1)ΩαCountFun(d,n)} \text{vacuumSpan}(L, \Omega, n) = \text{span}_K \left\{ (a^\dagger_0)^{\alpha(0)} (a^\dagger_1)^{\alpha(1)} \dots (a^\dagger_{d-1})^{\alpha(d-1)} \Omega \mid \alpha \in \text{CountFun}(d, n) \right\} where α:{0,,d1}N\alpha: \{0, \dots, d-1\} \to \mathbb{N} satisfies c=0d1α(c)=n\sum_{c=0}^{d-1} \alpha(c) = n, and aia^\dagger_i denotes the creation operator for the ii-th mode.

definition

Occupation-number basis for vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n)

For a dd-mode ladder system LL over a field KK and a vacuum state Ω\Omega in a vector space VV, the occupation-number basis of the nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is the basis indexed by count functions αCountFun(d,n)\alpha \in \text{CountFun}(d, n). Each basis vector is formed by the application of creation operators to the vacuum state: (a0)α(0)(a1)α(1)(ad1)α(d1)Ω \left( a^\dagger_0 \right)^{\alpha(0)} \left( a^\dagger_1 \right)^{\alpha(1)} \dots \left( a^\dagger_{d-1} \right)^{\alpha(d-1)} \Omega where α(i)\alpha(i) is the number of excitations in the ii-th mode and the total number of excitations is i=0d1α(i)=n\sum_{i=0}^{d-1} \alpha(i) = n.

theorem

The α\alpha-th occupation-number basis vector is (a0)α(0)(ad1)α(d1)Ω(a^\dagger_0)^{\alpha(0)} \dots (a^\dagger_{d-1})^{\alpha(d-1)} \Omega

Let LL be a dd-mode ladder system over a field KK acting on a vector space VV, and let ΩV\Omega \in V be a vacuum state. For any nNn \in \mathbb{N} and any count function αCountFun(d,n)\alpha \in \text{CountFun}(d, n), the basis vector in the occupation-number basis vacuumBasis(L,Ω,n)\text{vacuumBasis}(L, \Omega, n) indexed by α\alpha is equal to the vector obtained by applying the corresponding creation operators to the vacuum state: vacuumBasis(L,Ω,n)α=(a0)α(0)(a1)α(1)(ad1)α(d1)Ω, \text{vacuumBasis}(L, \Omega, n)_\alpha = (a^\dagger_0)^{\alpha(0)} (a^\dagger_1)^{\alpha(1)} \dots (a^\dagger_{d-1})^{\alpha(d-1)} \Omega, where aia^\dagger_i denotes the creation operator for the ii-th mode and α(i)\alpha(i) is the number of excitations in that mode.

theorem

The dimension of vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is (d+n1n)\binom{d+n-1}{n}

Let LL be a dd-mode ladder system over a field KK acting on a vector space VV, and let ΩV\Omega \in V be a vacuum state for LL. For any nNn \in \mathbb{N}, the dimension of the nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n)—defined as the subspace spanned by applying nn creation operators to Ω\Omega—is given by the binomial coefficient dimK(vacuumSpan(L,Ω,n))=(d+n1n).\dim_K(\text{vacuumSpan}(L, \Omega, n)) = \binom{d + n - 1}{n}. This value represents the degeneracy of the nn-th energy level of a dd-dimensional bosonic oscillator.

theorem

The nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is finite-dimensional

Let LL be a ladder system with dd modes acting on a KK-vector space VV. For any vacuum state ΩV\Omega \in V and any excitation number nNn \in \mathbb{N}, the nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is a finite-dimensional subspace of VV over KK. Here, vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is defined as the KK-linear submodule spanned by all vectors of the form ai1ai2ainΩ a^\dagger_{i_1} a^\dagger_{i_2} \dots a^\dagger_{i_n} \Omega where each ij{0,1,,d1}i_j \in \{0, 1, \dots, d-1\}.

theorem

The nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is non-zero for d>0d > 0

Let LL be a ladder system with dd modes on a vector space VV over a field KK, and let ΩV\Omega \in V be a vacuum state (satisfying the property `HasVacuum`). If the number of modes dd is strictly positive (d>0d > 0), then for any natural number nn, the nn-th excitation-number sector vacuumSpan(L,Ω,n)\text{vacuumSpan}(L, \Omega, n) is not the trivial subspace {0}\{0\}.