PhyslibSearch

Physlib.QFT.PerturbationTheory.FieldSpecification.NormalOrder

38 declarations

definition

Normal ordering relation on F.CrAnFieldOp\mathcal{F}.\text{CrAnFieldOp}

#normalOrderRel

Given a field specification F\mathcal{F}, let OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation operators (represented by `𝓕.CrAnFieldOp`). The normal ordering relation NO\le_{NO} is a binary relation on OF\mathcal{O}_{\mathcal{F}} defined such that for any two operators ϕ0,ϕ1OF\phi_0, \phi_1 \in \mathcal{O}_{\mathcal{F}}, ϕ0NOϕ1\phi_0 \le_{NO} \phi_1 holds if ϕ0\phi_0 is a creation operator or ϕ1\phi_1 is an annihilation operator. This relation provides the precedence for normal ordering, effectively treating creation operators as "less than" annihilation operators so that creation operators are positioned to the left in a sorted product.

instance

The normal ordering relation NO\le_{NO} is total

#instTotalCrAnFieldOpNormalOrderRel

Given a field specification F\mathcal{F}, let OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation operators. The normal ordering relation NO\le_{NO} on OF\mathcal{O}_{\mathcal{F}} is total. That is, for any two operators ϕ,ψOF\phi, \psi \in \mathcal{O}_{\mathcal{F}}, it holds that ϕNOψ\phi \le_{NO} \psi or ψNOϕ\psi \le_{NO} \phi.

instance

The normal ordering relation NO\le_{NO} is transitive

#instIsTransCrAnFieldOpNormalOrderRel

Given a field specification F\mathcal{F}, let OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation field operators. The normal ordering relation NO\le_{NO} on OF\mathcal{O}_{\mathcal{F}} is transitive. That is, for any operators ϕ1,ϕ2,ϕ3OF\phi_1, \phi_2, \phi_3 \in \mathcal{O}_{\mathcal{F}}, if ϕ1NOϕ2\phi_1 \le_{NO} \phi_2 and ϕ2NOϕ3\phi_2 \le_{NO} \phi_3, then ϕ1NOϕ3\phi_1 \le_{NO} \phi_3.

instance

Decidability of the normal ordering relation on F.CrAnFieldOp\mathcal{F}.\text{CrAnFieldOp}

#instDecidableNormalOrderRel

For a given field specification F\mathcal{F} and any two field operators ϕ,ϕOF\phi, \phi' \in \mathcal{O}_{\mathcal{F}} (representing creation and annihilation operators), the normal ordering relation ϕNOϕ\phi \le_{NO} \phi' is decidable. This means that for any pair of operators, there is a deterministic algorithm to determine whether ϕ\phi precedes or is equal to ϕ\phi' according to the normal ordering convention.

definition

Normal ordering sign of a list of operators ϕs\phi_s

#normalOrderSign

Given a field specification F\mathcal{F} and a list of creation and annihilation operators ϕs=[ϕ1,ϕ2,,ϕn]\phi_s = [\phi_1, \phi_2, \dots, \phi_n] (where each ϕiOF\phi_i \in \mathcal{O}_{\mathcal{F}}), the function `normalOrderSign` returns the phase factor ηC\eta \in \mathbb{C} (where η=±1\eta = \pm 1) associated with the permutation required to reach a normal-ordered arrangement. This sign is calculated based on the number of transpositions of two fermionic operators performed during an insertion sort according to the normal ordering relation NO\le_{NO}. In this relation, creation operators are ordered before annihilation operators.

theorem

(normalOrderSign(ϕs))2=1(\text{normalOrderSign}(\phi_s))^2 = 1

#normalOrderSign_mul_self

Let F\mathcal{F} be a field specification. For any list of creation and annihilation operators ϕs=[ϕ1,ϕ2,,ϕn]\phi_s = [\phi_1, \phi_2, \dots, \phi_n] where each ϕiOF\phi_i \in \mathcal{O}_{\mathcal{F}}, the normal ordering sign normalOrderSign(ϕs)\text{normalOrderSign}(\phi_s) (the phase factor in C\mathbb{C} associated with the permutation required to reach a normal-ordered arrangement) satisfies: normalOrderSign(ϕs)normalOrderSign(ϕs)=1\text{normalOrderSign}(\phi_s) \cdot \text{normalOrderSign}(\phi_s) = 1

theorem

Inserting a creation operator yields a Koszul sign of 1

#koszulSignInsert_create

Let F\mathcal{F} be a field specification and ϕ\phi be a field operator in F\mathcal{F} that is a creation operator. For any list of field operators ϕs\phi_s, the Koszul sign koszulSignInsert(σ,NO,ϕ,ϕs)\text{koszulSignInsert}(\sigma, \le_{NO}, \phi, \phi_s)—which accounts for the statistics σ\sigma and the normal ordering relation NO\le_{NO} when inserting ϕ\phi into the list—is equal to 11.

theorem

normalOrderSign(ϕ::ϕs)=normalOrderSign(ϕs)\text{normalOrderSign}(\phi :: \phi_s) = \text{normalOrderSign}(\phi_s) for creation operators ϕ\phi

#normalOrderSign_cons_create

Let F\mathcal{F} be a field specification. Suppose ϕ\phi is a field operator in F\mathcal{F} that is a creation operator, and ϕs\phi_s is a list of creation and annihilation operators. The normal ordering sign of the list formed by prepending ϕ\phi to ϕs\phi_s is equal to the normal ordering sign of ϕs\phi_s, i.e., normalOrderSign(ϕ::ϕs)=normalOrderSign(ϕs)\text{normalOrderSign}(\phi :: \phi_s) = \text{normalOrderSign}(\phi_s).

theorem

normalOrderSign([ϕ])=1\text{normalOrderSign}([\phi]) = 1

#normalOrderSign_singleton

Let F\mathcal{F} be a field specification, and let OF\mathcal{O}_{\mathcal{F}} denote the set of its creation and annihilation field operators. For any field operator ϕOF\phi \in \mathcal{O}_{\mathcal{F}}, the normal ordering sign of the singleton list [ϕ][\phi] is equal to 11. That is, normalOrderSign([ϕ])=1\text{normalOrderSign}([\phi]) = 1

theorem

normalOrderSign([])=1\text{normalOrderSign}([]) = 1

#normalOrderSign_nil

Let F\mathcal{F} be a field specification. The normal ordering sign associated with an empty list of creation and annihilation operators is 11. That is, normalOrderSign([])=1\text{normalOrderSign}([]) = 1 where [][] denotes the empty list.

theorem

koszulSignInsert(ϕ,Φs ++ [ϕ])=koszulSignInsert(ϕ,Φs)\text{koszulSignInsert}(\phi', \Phi_s \text{ ++ } [\phi]) = \text{koszulSignInsert}(\phi', \Phi_s) for annihilation operator ϕ\phi

#koszulSignInsert_append_annihilate

Let F\mathcal{F} be a field specification, and let OF\mathcal{O}_{\mathcal{F}} denote the set of its creation and annihilation field operators. Let ϕ,ϕOF\phi, \phi' \in \mathcal{O}_{\mathcal{F}} be two field operators and Φs\Phi_s be a list of field operators. If ϕ\phi is an annihilation operator, then the Koszul sign incurred by inserting ϕ\phi' into the list formed by appending ϕ\phi to the end of Φs\Phi_s (with respect to the normal ordering relation NO\le_{NO}) is equal to the Koszul sign of inserting ϕ\phi' into Φs\Phi_s. That is, koszulSignInsert(ϕ,Φs ++ [ϕ])=koszulSignInsert(ϕ,Φs) \text{koszulSignInsert}(\phi', \Phi_s \text{ ++ } [\phi]) = \text{koszulSignInsert}(\phi', \Phi_s)

theorem

normalOrderSign(Φs ++ [ϕ])=normalOrderSign(Φs)\text{normalOrderSign}(\Phi_s \text{ ++ } [\phi]) = \text{normalOrderSign}(\Phi_s) for annihilation operator ϕ\phi

#normalOrderSign_append_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of its creation and annihilation field operators. For any list of operators Φs\Phi_s in OF\mathcal{O}_{\mathcal{F}} and any operator ϕOF\phi \in \mathcal{O}_{\mathcal{F}}, if ϕ\phi is an annihilation operator, then the normal ordering sign of the list formed by appending ϕ\phi to the end of Φs\Phi_s is equal to the normal ordering sign of Φs\Phi_s. That is, normalOrderSign(Φs ++ [ϕ])=normalOrderSign(Φs) \text{normalOrderSign}(\Phi_s \text{ ++ } [\phi]) = \text{normalOrderSign}(\Phi_s)

theorem

Koszul sign of inserting an annihilation operator into a list starting with a creation operator equals the exchange sign times the insertion sign into the tail

#koszulSignInsert_annihilate_cons_create

Given a field specification F\mathcal{F}, let ϕc\phi_c be a creation operator and ϕa\phi_a be an annihilation operator. For any list of field operators ϕs\phi_s, the Koszul sign associated with inserting ϕa\phi_a into the list ϕc::ϕs\phi_c :: \phi_s (the list starting with ϕc\phi_c followed by ϕs\phi_s) according to the normal ordering relation NO\le_{NO} is equal to the exchange sign ϵ(ϕc,ϕa)\epsilon(\phi_c, \phi_a) multiplied by the Koszul sign associated with inserting ϕa\phi_a into the list ϕs\phi_s.

theorem

normalOrderSign(ϕc::ϕa::Φs)=ϵ(ϕc,ϕa)normalOrderSign(ϕa::ϕc::Φs)\text{normalOrderSign}(\phi_c :: \phi_a :: \Phi_s) = \epsilon(\phi_c, \phi_a) \cdot \text{normalOrderSign}(\phi_a :: \phi_c :: \Phi_s)

#normalOrderSign_swap_create_annihilate_fst

Let F\mathcal{F} be a field specification. Given a creation operator ϕc\phi_c, an annihilation operator ϕa\phi_a, and a list of field operators Φs\Phi_s, the normal ordering sign of the list formed by prepending ϕc\phi_c and ϕa\phi_a is related to the list with their positions swapped by the exchange sign: normalOrderSign(ϕc::ϕa::Φs)=ϵ(ϕc,ϕa)normalOrderSign(ϕa::ϕc::Φs)\text{normalOrderSign}(\phi_c :: \phi_a :: \Phi_s) = \epsilon(\phi_c, \phi_a) \cdot \text{normalOrderSign}(\phi_a :: \phi_c :: \Phi_s) where ϵ(ϕc,ϕa)\epsilon(\phi_c, \phi_a) is the exchange sign (determined by the statistics of ϕc\phi_c and ϕa\phi_a) and :::: denotes prepending an element to a list.

theorem

Invariance of `koszulSignInsert` under swapping list elements

#koszulSignInsert_swap

For a given field specification F\mathcal{F}, let OF\mathcal{O}_{\mathcal{F}} be the set of creation and annihilation operators, σ\sigma be the field statistics, and NO\le_{NO} be the normal ordering relation. For any operators ϕ,ϕc,ϕaOF\phi, \phi_c, \phi_a \in \mathcal{O}_{\mathcal{F}} and lists of operators Φs,Φs\Phi_s, \Phi_s', the Koszul sign associated with inserting ϕ\phi into the list Φs\concat[ϕa,ϕc]\concatΦs\Phi_s \concat [\phi_a, \phi_c] \concat \Phi_s' is equal to the Koszul sign associated with inserting ϕ\phi into the list Φs\concat[ϕc,ϕa]\concatΦs\Phi_s \concat [\phi_c, \phi_a] \concat \Phi_s'.

theorem

normalOrderSign(Φs\concat[ϕc,ϕa]\concatΦs)=ϵ(ϕc,ϕa)normalOrderSign(Φs\concat[ϕa,ϕc]\concatΦs)\text{normalOrderSign}(\Phi_s \concat [\phi_c, \phi_a] \concat \Phi_s') = \epsilon(\phi_c, \phi_a) \cdot \text{normalOrderSign}(\Phi_s \concat [\phi_a, \phi_c] \concat \Phi_s')

#normalOrderSign_swap_create_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation operators. For any creation operator ϕcOF\phi_c \in \mathcal{O}_{\mathcal{F}}, any annihilation operator ϕaOF\phi_a \in \mathcal{O}_{\mathcal{F}}, and any lists of field operators Φs\Phi_s and Φs\Phi_s', the normal ordering sign of the list formed by the concatenation Φs\concat[ϕc,ϕa]\concatΦs\Phi_s \concat [\phi_c, \phi_a] \concat \Phi_s' is equal to the exchange sign ϵ(ϕc,ϕa)\epsilon(\phi_c, \phi_a) multiplied by the normal ordering sign of the list with ϕc\phi_c and ϕa\phi_a swapped: normalOrderSign(Φs\concat[ϕc,ϕa]\concatΦs)=ϵ(ϕc,ϕa)normalOrderSign(Φs\concat[ϕa,ϕc]\concatΦs)\text{normalOrderSign}(\Phi_s \concat [\phi_c, \phi_a] \concat \Phi_{s'}) = \epsilon(\phi_c, \phi_a) \cdot \text{normalOrderSign}(\Phi_s \concat [\phi_a, \phi_c] \concat \Phi_{s'}) where ϵ(ϕc,ϕa)\epsilon(\phi_c, \phi_a) is the exchange sign determined by the statistics of the operators ϕc\phi_c and ϕa\phi_a.

theorem

Swapping the first two creation operators preserves the normalOrderSign\text{normalOrderSign}

#normalOrderSign_swap_create_create_fst

Let F\mathcal{F} be a field specification. For any two field operators ϕc,ϕcF.CrAnFieldOp\phi_c, \phi_{c'} \in \mathcal{F}.\text{CrAnFieldOp} that are creation operators, and for any list of field operators ϕs\phi_s, the normal ordering sign of the list beginning with ϕc\phi_c and ϕc\phi_{c'} is equal to the normal ordering sign of the list where their positions are swapped: normalOrderSign(ϕc::ϕc::ϕs)=normalOrderSign(ϕc::ϕc::ϕs)\text{normalOrderSign}(\phi_c :: \phi_{c'} :: \phi_s) = \text{normalOrderSign}(\phi_{c'} :: \phi_c :: \phi_s)

theorem

Swapping adjacent creation operators preserves the normalOrderSign\text{normalOrderSign}

#normalOrderSign_swap_create_create

Let F\mathcal{F} be a field specification. For any two field operators ϕc,ϕcF.CrAnFieldOp\phi_c, \phi_{c'} \in \mathcal{F}.\text{CrAnFieldOp} that are both creation operators, and for any lists of field operators ϕs\phi_s and ϕs\phi_{s'}, swapping the adjacent operators ϕc\phi_c and ϕc\phi_{c'} within the concatenated list preserves the normal ordering sign: normalOrderSign(ϕs++[ϕc,ϕc]++ϕs)=normalOrderSign(ϕs++[ϕc,ϕc]++ϕs)\text{normalOrderSign}(\phi_s \mathbin{+\mkern-10mu+} [\phi_c, \phi_{c'}] \mathbin{+\mkern-10mu+} \phi_{s'}) = \text{normalOrderSign}(\phi_s \mathbin{+\mkern-10mu+} [\phi_{c'}, \phi_c] \mathbin{+\mkern-10mu+} \phi_{s'}) where ++\mathbin{+\mkern-10mu+} denotes the concatenation of lists.

theorem

Swapping the first two annihilation operators preserves the normalOrderSign\text{normalOrderSign}

#normalOrderSign_swap_annihilate_annihilate_fst

Let F\mathcal{F} be a field specification. For any two field operators ϕa,ϕaF.CrAnFieldOp\phi_a, \phi_{a'} \in \mathcal{F}.\text{CrAnFieldOp} that are annihilation operators, and for any list of field operators ϕs\phi_s, the normal ordering sign of the list beginning with ϕa\phi_a and ϕa\phi_{a'} is equal to the normal ordering sign of the list where their positions are swapped: normalOrderSign(ϕa::ϕa::ϕs)=normalOrderSign(ϕa::ϕa::ϕs)\text{normalOrderSign}(\phi_a :: \phi_{a'} :: \phi_s) = \text{normalOrderSign}(\phi_{a'} :: \phi_a :: \phi_s)

theorem

Swapping adjacent annihilation operators preserves the normalOrderSign\text{normalOrderSign}

#normalOrderSign_swap_annihilate_annihilate

Let F\mathcal{F} be a field specification. For any two field operators ϕa,ϕaF.CrAnFieldOp\phi_a, \phi_{a'} \in \mathcal{F}.\text{CrAnFieldOp} that are both annihilation operators, and for any lists of field operators ϕs\phi_s and ϕs\phi_{s'}, swapping the adjacent operators ϕa\phi_a and ϕa\phi_{a'} within the concatenated list preserves the normal ordering sign: normalOrderSign(ϕs++[ϕa,ϕa]++ϕs)=normalOrderSign(ϕs++[ϕa,ϕa]++ϕs)\text{normalOrderSign}(\phi_s \mathbin{+\mkern-10mu+} [\phi_a, \phi_{a'}] \mathbin{+\mkern-10mu+} \phi_{s'}) = \text{normalOrderSign}(\phi_s \mathbin{+\mkern-10mu+} [\phi_{a'}, \phi_a] \mathbin{+\mkern-10mu+} \phi_{s'}) where ++\mathbin{+\mkern-10mu+} denotes the concatenation of lists.

definition

Normal ordering of a list of operators ϕs\phi_s

#normalOrderList

Given a field specification F\mathcal{F} and a list ϕs\phi_s of creation and annihilation operators (elements of F.CrAnFieldOp\mathcal{F}.\text{CrAnFieldOp}), the function F.normalOrderList(ϕs)\mathcal{F}.\text{normalOrderList}(\phi_s) returns a list where the operators are rearranged according to the normal ordering relation NO\le_{NO} using the insertion sort algorithm. The resulting list is ordered such that all creation operators are positioned to the left of all annihilation operators. For instance, a list of operators [ϕ1,c,ϕ1,a,ϕ2,c,ϕ2,a][\phi_{1,c}, \phi_{1,a}, \phi_{2,c}, \phi_{2,a}] would be reordered as [ϕ1,c,ϕ2,c,ϕ1,a,ϕ2,a][\phi_{1,c}, \phi_{2,c}, \phi_{1,a}, \phi_{2,a}].

theorem

normalOrderList([])=[]\text{normalOrderList}([]) = []

#normalOrderList_nil

For a given field specification F\mathcal{F}, the normal ordering of an empty list of creation and annihilation operators is the empty list itself: normalOrderList([])=[]\text{normalOrderList}([]) = [].

theorem

Normal ordering preserves operator statistics

#normalOrderList_statistics

For a given field specification F\mathcal{F} and any list of creation and annihilation operators ϕs\phi_s, the total statistics of the list after applying the normal ordering procedure is equal to the total statistics of the original list. That is, Fs(normalOrderList(ϕs))=Fsϕs\mathcal{F} \rhd_s (\text{normalOrderList}(\phi_s)) = \mathcal{F} \rhd_s \phi_s where s\rhd_s denotes the statistics associated with the list of operators in the field specification F\mathcal{F}.

theorem

Ordered insertion of a creation operator results in ϕ::ϕs\phi :: \phi_s

#orderedInsert_create

Given a field specification F\mathcal{F}, let ϕ\phi be a creation and annihilation field operator such that ϕ\phi is a creation operator (i.e., F>cϕ=create\mathcal{F}|>^c \phi = \text{create}). For any list of field operators ϕs\phi_s, the ordered insertion of ϕ\phi into ϕs\phi_s with respect to the normal ordering relation NO\le_{NO} results in ϕ\phi being prepended to the list, represented as ϕ::ϕs\phi :: \phi_s.

theorem

Normal Ordering Commutes with Prepending a Creation Operator

#normalOrderList_cons_create

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of creation and annihilation operators. If ϕOF\phi \in \mathcal{O}_{\mathcal{F}} is a creation operator (i.e., F>cϕ=create\mathcal{F}|>^c \phi = \text{create}), then for any list of operators Φ\Phi, the normal ordering of the list formed by prepending ϕ\phi to Φ\Phi is equivalent to prepending ϕ\phi to the normal ordering of Φ\Phi: normalOrderList(ϕ::Φ)=ϕ::normalOrderList(Φ) \text{normalOrderList}(\phi :: \Phi) = \phi :: \text{normalOrderList}(\Phi) where :::: denotes the prepending of an element to a list.

theorem

Ordered Insertion Commutes with Appending an Annihilation Operator

#orderedInsert_append_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of creation and annihilation operators. Let NO\le_{NO} denote the normal ordering relation on OF\mathcal{O}_{\mathcal{F}}, where ϕ1NOϕ2\phi_1 \le_{NO} \phi_2 holds if ϕ1\phi_1 is a creation operator or ϕ2\phi_2 is an annihilation operator. If ϕOF\phi \in \mathcal{O}_{\mathcal{F}} is an annihilation operator, then for any operator ϕOF\phi' \in \mathcal{O}_{\mathcal{F}} and any list of operators Φ\Phi, the ordered insertion of ϕ\phi' into the list Φ\Phi with ϕ\phi appended at the end is equivalent to performing the ordered insertion of ϕ\phi' into Φ\Phi first and then appending ϕ\phi: orderedInsertNO(ϕ,Φ ++ [ϕ])=orderedInsertNO(ϕ,Φ) ++ [ϕ] \text{orderedInsert}_{\le_{NO}}(\phi', \Phi \text{ ++ } [\phi]) = \text{orderedInsert}_{\le_{NO}}(\phi', \Phi) \text{ ++ } [\phi]

theorem

Normal Ordering Commutes with Appending an Annihilation Operator

#normalOrderList_append_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of its creation and annihilation operators. Let normalOrderList(Φ)\text{normalOrderList}(\Phi) be the function that sorts a list of operators Φ\Phi such that all creation operators precede all annihilation operators. If ϕOF\phi \in \mathcal{O}_{\mathcal{F}} is an annihilation operator, then for any list of operators Φ\Phi, it holds that: normalOrderList(Φ ++ [ϕ])=normalOrderList(Φ) ++ [ϕ]\text{normalOrderList}(\Phi \text{ ++ } [\phi]) = \text{normalOrderList}(\Phi) \text{ ++ } [\phi] where ++\text{++} denotes list concatenation and [ϕ][\phi] is the list containing only ϕ\phi.

theorem

Normal Ordering is Invariant under Swapping Leading Creation and Annihilation Operators

#normalOrder_swap_create_annihilate_fst

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of its creation and annihilation operators. Let ϕcOF\phi_c \in \mathcal{O}_{\mathcal{F}} be a creation operator (i.e., F>cϕc=create\mathcal{F}|>^c \phi_c = \text{create}) and ϕaOF\phi_a \in \mathcal{O}_{\mathcal{F}} be an annihilation operator (i.e., F>cϕa=annihilate\mathcal{F}|>^c \phi_a = \text{annihilate}). For any list of operators Φ\Phi, the normal ordering of the list formed by prepending ϕc\phi_c then ϕa\phi_a to Φ\Phi is equal to the normal ordering of the list formed by prepending ϕa\phi_a then ϕc\phi_c to Φ\Phi: normalOrderList(ϕc::ϕa::Φ)=normalOrderList(ϕa::ϕc::Φ)\text{normalOrderList}(\phi_c :: \phi_a :: \Phi) = \text{normalOrderList}(\phi_a :: \phi_c :: \Phi) where :::: denotes the operation of prepending an element to a list.

theorem

Normal Ordering is Invariant under Swapping Adjacent Creation and Annihilation Operators within a List

#normalOrderList_swap_create_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of its creation and annihilation operators. Let ϕcOF\phi_c \in \mathcal{O}_{\mathcal{F}} be a creation operator and ϕaOF\phi_a \in \mathcal{O}_{\mathcal{F}} be an annihilation operator. For any lists of field operators Φ\Phi and Φ\Phi', the normal ordering of the list formed by concatenating Φ\Phi, the pair [ϕc,ϕa][\phi_c, \phi_a], and Φ\Phi' is equal to the normal ordering of the list formed by concatenating Φ\Phi, the swapped pair [ϕa,ϕc][\phi_a, \phi_c], and Φ\Phi': normalOrderList(Φ ++ [ϕc,ϕa] ++ Φ)=normalOrderList(Φ ++ [ϕa,ϕc] ++ Φ)\text{normalOrderList}(\Phi \text{ ++ } [\phi_c, \phi_a] \text{ ++ } \Phi') = \text{normalOrderList}(\Phi \text{ ++ } [\phi_a, \phi_c] \text{ ++ } \Phi') where normalOrderList\text{normalOrderList} is the function that rearranges a list of operators into normal order (where all creation operators precede all annihilation operators), and ++\text{++} denotes list concatenation.

definition

Index equivalence for normal ordering of ϕs\phi_s

#normalOrderEquiv

Given a list of field operators ϕs=[ϕ0,ϕ1,,ϕn1]\phi_s = [\phi_0, \phi_1, \dots, \phi_{n-1}] of length nn, let normalOrderList(ϕs)\text{normalOrderList}(\phi_s) be the list of operators rearranged according to the normal ordering relation NO\le_{NO} (where creation operators precede annihilation operators) using the insertion sort algorithm. This definition provides an equivalence (bijection) σ:{0,,n1}{0,,n1}\sigma: \{0, \dots, n-1\} \simeq \{0, \dots, n-1\} that maps the original index ii of an operator in ϕs\phi_s to its new index σ(i)\sigma(i) in the normal-ordered list.

theorem

Summation Invariance under Normal Ordering Index Reindexing

#sum_normalOrderList_length

Let F\mathcal{F} be a field specification and ϕs\phi_s be a list of creation and annihilation operators of length nn. Let normalOrderList(ϕs)\text{normalOrderList}(\phi_s) be the list rearranged into normal order, and let σ:{0,,n1}{0,,n1}\sigma: \{0, \dots, n-1\} \simeq \{0, \dots, n-1\} be the index equivalence (normalOrderEquiv\text{normalOrderEquiv}) that maps an index ii in the original list to its corresponding position σ(i)\sigma(i) in the normal-ordered list. For any function ff mapping indices to an additive commutative monoid MM, the sum of ff over the indices of the normal-ordered list is equal to the sum over the original indices composed with the bijection σ\sigma: i=0n1f(i)=i=0n1f(σ(i))\sum_{i=0}^{n-1} f(i) = \sum_{i=0}^{n-1} f(\sigma(i))

theorem

normalOrderList(ϕs)[σ(n)]=ϕs[n]\text{normalOrderList}(\phi_s)[\sigma(n)] = \phi_s[n]

#normalOrderList_get_normalOrderEquiv

For a list of field operators ϕs\phi_s, let normalOrderList(ϕs)\text{normalOrderList}(\phi_s) be the list rearranged into normal order (where creation operators precede annihilation operators). Let σ\sigma be the index equivalence (`normalOrderEquiv`) that maps each index nn of the original list to its corresponding index in the rearranged list. For any index nn, the operator at position σ(n)\sigma(n) in the normal-ordered list is equal to the operator at position nn in the original list: (normalOrderList(ϕs))σ(n)=(ϕs)n(\text{normalOrderList}(\phi_s))_{\sigma(n)} = (\phi_s)_n

theorem

normalOrderList(ϕs.eraseIdx(n))=(normalOrderList(ϕs)).eraseIdx(σ(n))\text{normalOrderList}(\phi_s.\text{eraseIdx}(n)) = (\text{normalOrderList}(\phi_s)).\text{eraseIdx}(\sigma(n))

#normalOrderList_eraseIdx_normalOrderEquiv

Let F\mathcal{F} be a field specification and ϕs\phi_s be a list of creation and annihilation operators. For any index n{0,,length(ϕs)1}n \in \{0, \dots, \text{length}(\phi_s) - 1\}, let σ(n)\sigma(n) (represented by `normalOrderEquiv n`) be the index of the operator originally at position nn after the list ϕs\phi_s has been rearranged into normal order. Then, removing the element at index σ(n)\sigma(n) from the normal-ordered list normalOrderList(ϕs)\text{normalOrderList}(\phi_s) is equal to the normal-ordered list of ϕs\phi_s after the element at index nn has been removed: (normalOrderList(ϕs)).eraseIdx(σ(n))=normalOrderList(ϕs.eraseIdx(n))(\text{normalOrderList}(\phi_s)).\text{eraseIdx}(\sigma(n)) = \text{normalOrderList}(\phi_s.\text{eraseIdx}(n)) where eraseIdx(i)\text{eraseIdx}(i) denotes the operation of removing the element at index ii from a list.

theorem

Normal Order Sign of a List with an Erased Operator

#normalOrderSign_eraseIdx

Let F\mathcal{F} be a field specification and ϕs=[ϕ0,ϕ1,,ϕn1]\phi_s = [\phi_0, \phi_1, \dots, \phi_{n-1}] be a list of creation and annihilation operators. For any index i{0,,n1}i \in \{0, \dots, n-1\}, the normal ordering sign of the list obtained by removing the ii-th operator (denoted ϕs{i}\phi_s \setminus \{i\}) is equal to the product of: 1. The normal ordering sign of the original list, normalOrderSign(ϕs)\text{normalOrderSign}(\phi_s). 2. The sign factor S(ϕi,prefixorig)\mathcal{S}(\phi_i, \text{prefix}_{orig}) needed to "extract" the ii-th operator by moving it past all preceding operators prefixorig=[ϕ0,,ϕi1]\text{prefix}_{orig} = [\phi_0, \dots, \phi_{i-1}] in the original list. 3. The sign factor S(ϕi,prefixnorm)\mathcal{S}(\phi_i, \text{prefix}_{norm}) needed to "re-insert" the operator ϕi\phi_i into its correct position in the normal-ordered list, where prefixnorm\text{prefix}_{norm} consists of the operators that precede ϕi\phi_i in normalOrderList(ϕs)\text{normalOrderList}(\phi_s). Mathematically, this is expressed as: normalOrderSign(ϕs{i})=normalOrderSign(ϕs)S(ϕi,prefixorig)S(ϕi,prefixnorm)\text{normalOrderSign}(\phi_s \setminus \{i\}) = \text{normalOrderSign}(\phi_s) \cdot \mathcal{S}(\phi_i, \text{prefix}_{orig}) \cdot \mathcal{S}(\phi_i, \text{prefix}_{norm}) where S(ϕ,L)\mathcal{S}(\phi, L) denotes the phase factor (±1)(\pm 1) resulting from the transpositions of ϕ\phi with the fermionic operators in the list LL.

theorem

Ordered insertion of an annihilation operator ϕ\phi past createFilter(Φ)\text{createFilter}(\Phi)

#orderedInsert_createFilter_append_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of its creation and annihilation operators. Let ϕOF\phi \in \mathcal{O}_{\mathcal{F}} be an annihilation operator. For any lists of field operators Φ\Phi and Φ\Phi', the ordered insertion of ϕ\phi into the concatenation of the creation operators in Φ\Phi (denoted createFilter(Φ)\text{createFilter}(\Phi)) and the list Φ\Phi' with respect to the normal ordering relation NO\le_{NO} satisfies: orderedInsert(NO,ϕ,createFilter(Φ)++Φ)=createFilter(Φ)++orderedInsert(NO,ϕ,Φ)\text{orderedInsert}(\le_{NO}, \phi, \text{createFilter}(\Phi) ++ \Phi') = \text{createFilter}(\Phi) ++ \text{orderedInsert}(\le_{NO}, \phi, \Phi') where ++++ denotes list concatenation. This theorem reflects that since annihilation operators succeed creation operators in normal order, an annihilation operator is inserted after any existing creation operators.

theorem

Inserting an operator into a list of annihilation operators prepends it

#orderedInsert_annihilateFilter

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation operators (represented by `𝓕.CrAnFieldOp`). Let NO\le_{NO} be the normal ordering relation on these operators, defined such that ϕ1NOϕ2\phi_1 \le_{NO} \phi_2 holds if ϕ1\phi_1 is a creation operator or ϕ2\phi_2 is an annihilation operator. For any operator ϕOF\phi \in \mathcal{O}_{\mathcal{F}} and any list of operators ϕs\phi_s, the ordered insertion of ϕ\phi into the sublist of annihilation operators (denoted annihilateFilter(ϕs)\text{annihilateFilter}(\phi_s)) according to the relation NO\le_{NO} results in ϕ\phi being prepended to that sublist: orderedInsert(NO,ϕ,annihilateFilter(ϕs))=ϕ::annihilateFilter(ϕs) \text{orderedInsert}(\le_{NO}, \phi, \text{annihilateFilter}(\phi_s)) = \phi :: \text{annihilateFilter}(\phi_s) This holds because any operator ϕ\phi satisfies the relation ϕNOψ\phi \le_{NO} \psi whenever ψ\psi is an annihilation operator.

theorem

Ordered insertion of an annihilation operator into a partitioned list of field operators

#orderedInsert_createFilter_append_annihilateFilter_annihilate

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} denote the set of creation and annihilation operators. Let NO\le_{NO} be the normal ordering relation on OF\mathcal{O}_{\mathcal{F}}. For any annihilation operator ϕOF\phi \in \mathcal{O}_{\mathcal{F}} and any list of field operators Φ\Phi, let createFilter(Φ)\text{createFilter}(\Phi) be the sublist of creation operators and annihilateFilter(Φ)\text{annihilateFilter}(\Phi) be the sublist of annihilation operators. The ordered insertion of ϕ\phi into the concatenation of these two filtered lists satisfies: orderedInsert(NO,ϕ,createFilter(Φ)++annihilateFilter(Φ))=createFilter(Φ)++(ϕ::annihilateFilter(Φ))\text{orderedInsert}(\le_{NO}, \phi, \text{createFilter}(\Phi) ++ \text{annihilateFilter}(\Phi)) = \text{createFilter}(\Phi) ++ (\phi :: \text{annihilateFilter}(\Phi)) where ++++ denotes list concatenation and :::: denotes prepending an element to a list.

theorem

normalOrderList(Φ)=createFilter(Φ)++annihilateFilter(Φ)\text{normalOrderList}(\Phi) = \text{createFilter}(\Phi) ++ \text{annihilateFilter}(\Phi)

#normalOrderList_eq_createFilter_append_annihilateFilter

Let F\mathcal{F} be a field specification and OF\mathcal{O}_{\mathcal{F}} be the set of creation and annihilation operators. For any list of operators Φ=[ϕ1,ϕ2,,ϕn]\Phi = [\phi_1, \phi_2, \dots, \phi_n] where ϕiOF\phi_i \in \mathcal{O}_{\mathcal{F}}, the normal ordering of the list is equal to the concatenation of the sublist of creation operators and the sublist of annihilation operators: normalOrderList(Φ)=createFilter(Φ)++annihilateFilter(Φ)\text{normalOrderList}(\Phi) = \text{createFilter}(\Phi) ++ \text{annihilateFilter}(\Phi) where createFilter(Φ)\text{createFilter}(\Phi) consists of all ϕiΦ\phi_i \in \Phi such that ϕi\phi_i is a creation operator, and annihilateFilter(Φ)\text{annihilateFilter}(\Phi) consists of all ϕiΦ\phi_i \in \Phi such that ϕi\phi_i is an annihilation operator, with both filters preserving the original relative order of the operators in Φ\Phi.

Kernel SciencePhyslibSearch · powered by Physlib & Gemini embeddings