Physlib.QFT.PerturbationTheory.FieldSpecification.NormalOrder
38 declarations
Normal ordering relation on
#normalOrderRelGiven a field specification , let denote the set of creation and annihilation operators (represented by `𝓕.CrAnFieldOp`). The normal ordering relation is a binary relation on defined such that for any two operators , holds if is a creation operator or 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.
The normal ordering relation is total
#instTotalCrAnFieldOpNormalOrderRelGiven a field specification , let denote the set of creation and annihilation operators. The normal ordering relation on is total. That is, for any two operators , it holds that or .
The normal ordering relation is transitive
#instIsTransCrAnFieldOpNormalOrderRelGiven a field specification , let denote the set of creation and annihilation field operators. The normal ordering relation on is transitive. That is, for any operators , if and , then .
Decidability of the normal ordering relation on
#instDecidableNormalOrderRelFor a given field specification and any two field operators (representing creation and annihilation operators), the normal ordering relation is decidable. This means that for any pair of operators, there is a deterministic algorithm to determine whether precedes or is equal to according to the normal ordering convention.
Normal ordering sign of a list of operators
#normalOrderSignGiven a field specification and a list of creation and annihilation operators (where each ), the function `normalOrderSign` returns the phase factor (where ) 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 . In this relation, creation operators are ordered before annihilation operators.
Let be a field specification. For any list of creation and annihilation operators where each , the normal ordering sign (the phase factor in associated with the permutation required to reach a normal-ordered arrangement) satisfies:
Inserting a creation operator yields a Koszul sign of 1
#koszulSignInsert_createLet be a field specification and be a field operator in that is a creation operator. For any list of field operators , the Koszul sign —which accounts for the statistics and the normal ordering relation when inserting into the list—is equal to .
for creation operators
#normalOrderSign_cons_createLet be a field specification. Suppose is a field operator in that is a creation operator, and is a list of creation and annihilation operators. The normal ordering sign of the list formed by prepending to is equal to the normal ordering sign of , i.e., .
Let be a field specification, and let denote the set of its creation and annihilation field operators. For any field operator , the normal ordering sign of the singleton list is equal to . That is,
Let be a field specification. The normal ordering sign associated with an empty list of creation and annihilation operators is . That is, where denotes the empty list.
for annihilation operator
#koszulSignInsert_append_annihilateLet be a field specification, and let denote the set of its creation and annihilation field operators. Let be two field operators and be a list of field operators. If is an annihilation operator, then the Koszul sign incurred by inserting into the list formed by appending to the end of (with respect to the normal ordering relation ) is equal to the Koszul sign of inserting into . That is,
for annihilation operator
#normalOrderSign_append_annihilateLet be a field specification and be the set of its creation and annihilation field operators. For any list of operators in and any operator , if is an annihilation operator, then the normal ordering sign of the list formed by appending to the end of is equal to the normal ordering sign of . That is,
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_createGiven a field specification , let be a creation operator and be an annihilation operator. For any list of field operators , the Koszul sign associated with inserting into the list (the list starting with followed by ) according to the normal ordering relation is equal to the exchange sign multiplied by the Koszul sign associated with inserting into the list .
Let be a field specification. Given a creation operator , an annihilation operator , and a list of field operators , the normal ordering sign of the list formed by prepending and is related to the list with their positions swapped by the exchange sign: where is the exchange sign (determined by the statistics of and ) and denotes prepending an element to a list.
Invariance of `koszulSignInsert` under swapping list elements
#koszulSignInsert_swapFor a given field specification , let be the set of creation and annihilation operators, be the field statistics, and be the normal ordering relation. For any operators and lists of operators , the Koszul sign associated with inserting into the list is equal to the Koszul sign associated with inserting into the list .
Let be a field specification and denote the set of creation and annihilation operators. For any creation operator , any annihilation operator , and any lists of field operators and , the normal ordering sign of the list formed by the concatenation is equal to the exchange sign multiplied by the normal ordering sign of the list with and swapped: where is the exchange sign determined by the statistics of the operators and .
Swapping the first two creation operators preserves the
#normalOrderSign_swap_create_create_fstLet be a field specification. For any two field operators that are creation operators, and for any list of field operators , the normal ordering sign of the list beginning with and is equal to the normal ordering sign of the list where their positions are swapped:
Swapping adjacent creation operators preserves the
#normalOrderSign_swap_create_createLet be a field specification. For any two field operators that are both creation operators, and for any lists of field operators and , swapping the adjacent operators and within the concatenated list preserves the normal ordering sign: where denotes the concatenation of lists.
Swapping the first two annihilation operators preserves the
#normalOrderSign_swap_annihilate_annihilate_fstLet be a field specification. For any two field operators that are annihilation operators, and for any list of field operators , the normal ordering sign of the list beginning with and is equal to the normal ordering sign of the list where their positions are swapped:
Swapping adjacent annihilation operators preserves the
#normalOrderSign_swap_annihilate_annihilateLet be a field specification. For any two field operators that are both annihilation operators, and for any lists of field operators and , swapping the adjacent operators and within the concatenated list preserves the normal ordering sign: where denotes the concatenation of lists.
Normal ordering of a list of operators
#normalOrderListGiven a field specification and a list of creation and annihilation operators (elements of ), the function returns a list where the operators are rearranged according to the normal ordering relation 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 would be reordered as .
For a given field specification , the normal ordering of an empty list of creation and annihilation operators is the empty list itself: .
Normal ordering preserves operator statistics
#normalOrderList_statisticsFor a given field specification and any list of creation and annihilation operators , the total statistics of the list after applying the normal ordering procedure is equal to the total statistics of the original list. That is, where denotes the statistics associated with the list of operators in the field specification .
Ordered insertion of a creation operator results in
#orderedInsert_createGiven a field specification , let be a creation and annihilation field operator such that is a creation operator (i.e., ). For any list of field operators , the ordered insertion of into with respect to the normal ordering relation results in being prepended to the list, represented as .
Normal Ordering Commutes with Prepending a Creation Operator
#normalOrderList_cons_createLet be a field specification and be the set of creation and annihilation operators. If is a creation operator (i.e., ), then for any list of operators , the normal ordering of the list formed by prepending to is equivalent to prepending to the normal ordering of : where denotes the prepending of an element to a list.
Ordered Insertion Commutes with Appending an Annihilation Operator
#orderedInsert_append_annihilateLet be a field specification and be the set of creation and annihilation operators. Let denote the normal ordering relation on , where holds if is a creation operator or is an annihilation operator. If is an annihilation operator, then for any operator and any list of operators , the ordered insertion of into the list with appended at the end is equivalent to performing the ordered insertion of into first and then appending :
Normal Ordering Commutes with Appending an Annihilation Operator
#normalOrderList_append_annihilateLet be a field specification and be the set of its creation and annihilation operators. Let be the function that sorts a list of operators such that all creation operators precede all annihilation operators. If is an annihilation operator, then for any list of operators , it holds that: where denotes list concatenation and is the list containing only .
Normal Ordering is Invariant under Swapping Leading Creation and Annihilation Operators
#normalOrder_swap_create_annihilate_fstLet be a field specification and be the set of its creation and annihilation operators. Let be a creation operator (i.e., ) and be an annihilation operator (i.e., ). For any list of operators , the normal ordering of the list formed by prepending then to is equal to the normal ordering of the list formed by prepending then to : where denotes the operation of prepending an element to a list.
Normal Ordering is Invariant under Swapping Adjacent Creation and Annihilation Operators within a List
#normalOrderList_swap_create_annihilateLet be a field specification and be the set of its creation and annihilation operators. Let be a creation operator and be an annihilation operator. For any lists of field operators and , the normal ordering of the list formed by concatenating , the pair , and is equal to the normal ordering of the list formed by concatenating , the swapped pair , and : where is the function that rearranges a list of operators into normal order (where all creation operators precede all annihilation operators), and denotes list concatenation.
Index equivalence for normal ordering of
#normalOrderEquivGiven a list of field operators of length , let be the list of operators rearranged according to the normal ordering relation (where creation operators precede annihilation operators) using the insertion sort algorithm. This definition provides an equivalence (bijection) that maps the original index of an operator in to its new index in the normal-ordered list.
Summation Invariance under Normal Ordering Index Reindexing
#sum_normalOrderList_lengthLet be a field specification and be a list of creation and annihilation operators of length . Let be the list rearranged into normal order, and let be the index equivalence () that maps an index in the original list to its corresponding position in the normal-ordered list. For any function mapping indices to an additive commutative monoid , the sum of over the indices of the normal-ordered list is equal to the sum over the original indices composed with the bijection :
For a list of field operators , let be the list rearranged into normal order (where creation operators precede annihilation operators). Let be the index equivalence (`normalOrderEquiv`) that maps each index of the original list to its corresponding index in the rearranged list. For any index , the operator at position in the normal-ordered list is equal to the operator at position in the original list:
Let be a field specification and be a list of creation and annihilation operators. For any index , let (represented by `normalOrderEquiv n`) be the index of the operator originally at position after the list has been rearranged into normal order. Then, removing the element at index from the normal-ordered list is equal to the normal-ordered list of after the element at index has been removed: where denotes the operation of removing the element at index from a list.
Normal Order Sign of a List with an Erased Operator
#normalOrderSign_eraseIdxLet be a field specification and be a list of creation and annihilation operators. For any index , the normal ordering sign of the list obtained by removing the -th operator (denoted ) is equal to the product of: 1. The normal ordering sign of the original list, . 2. The sign factor needed to "extract" the -th operator by moving it past all preceding operators in the original list. 3. The sign factor needed to "re-insert" the operator into its correct position in the normal-ordered list, where consists of the operators that precede in . Mathematically, this is expressed as: where denotes the phase factor resulting from the transpositions of with the fermionic operators in the list .
Ordered insertion of an annihilation operator past
#orderedInsert_createFilter_append_annihilateLet be a field specification and be the set of its creation and annihilation operators. Let be an annihilation operator. For any lists of field operators and , the ordered insertion of into the concatenation of the creation operators in (denoted ) and the list with respect to the normal ordering relation satisfies: 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.
Inserting an operator into a list of annihilation operators prepends it
#orderedInsert_annihilateFilterLet be a field specification and denote the set of creation and annihilation operators (represented by `𝓕.CrAnFieldOp`). Let be the normal ordering relation on these operators, defined such that holds if is a creation operator or is an annihilation operator. For any operator and any list of operators , the ordered insertion of into the sublist of annihilation operators (denoted ) according to the relation results in being prepended to that sublist: This holds because any operator satisfies the relation whenever is an annihilation operator.
Ordered insertion of an annihilation operator into a partitioned list of field operators
#orderedInsert_createFilter_append_annihilateFilter_annihilateLet be a field specification and denote the set of creation and annihilation operators. Let be the normal ordering relation on . For any annihilation operator and any list of field operators , let be the sublist of creation operators and be the sublist of annihilation operators. The ordered insertion of into the concatenation of these two filtered lists satisfies: where denotes list concatenation and denotes prepending an element to a list.
Let be a field specification and be the set of creation and annihilation operators. For any list of operators where , the normal ordering of the list is equal to the concatenation of the sublist of creation operators and the sublist of annihilation operators: where consists of all such that is a creation operator, and consists of all such that is an annihilation operator, with both filters preserving the original relative order of the operators in .
