Physlib.QFT.PerturbationTheory.FieldOpFreeAlgebra.TimeOrder
23 declarations
Time-ordering linear map on the field operator free algebra
#timeOrderFFor a given field specification , the function (denoted as ) is the -linear map from the free algebra to itself defined by its action on the basis of operator products. For a basis element representing a product of creation and annihilation operators associated with a list , the map is defined as: In other words, the operator rearranges the field operators into chronological order (where operators with later time coordinates appear first) and multiplies the result by the sign factor , where is the number of exchanges between fermionic operators required to perform the reordering.
Time-ordering notation
#term𝓣ᶠ(_)The notation represents the time-ordering operator applied to an expression within the free algebra of field operators . It is defined as the application of the linear map to the element , where is a -linear map that orders field operators according to their time coordinates.
Action of the time-ordering map on a product of creation and annihilation operators
#timeOrderF_ofCrAnListFFor a given field specification , let be a list of creation and annihilation operator components in . Let denote the product of these operators in the free algebra . The action of the time-ordering linear map on this product is given by: where (formally `crAnTimeOrderList`) is the chronologically ordered permutation of the operators in (arranged such that operators with later time coordinates appear first), and (formally `crAnTimeOrderSign`) is the sign factor associated with the number of exchanges between fermionic operators required to reach that chronological order.
Let be a field specification and let be the time-ordering linear map on the free algebra of creation and annihilation operators . For any elements in this algebra, the time-ordering of their product is invariant under time-ordering the middle factor:
Let be a field specification and let be the time-ordering linear map on the free algebra of creation and annihilation operators . For any elements and in this algebra, the time-ordering of their product is invariant under time-ordering the right factor:
Let be a field specification and let be the time-ordering linear map on the free algebra of creation and annihilation operators . For any elements in this algebra, the time-ordering of their product is invariant under time-ordering the left factor:
For a given field specification and a list of field operators , the time-ordering map acting on the product of these operators in the free algebra is equal to the product of the operators reordered chronologically, multiplied by the corresponding time-ordering sign: where denotes the algebraic product , is the permutation of the operators sorted such that those with later time coordinates (or outgoing asymptotic states) appear first, and is the sign factor determined by the number of exchanges of fermionic operators required to achieve this chronological order.
For a given field specification , let be the time-ordering linear map on the free algebra of field operators. The time-ordering map applied to the identity element of the algebra (represented as the algebraic product of an empty list of field operators) is equal to . Mathematically:
for a single field operator
#timeOrderF_ofFieldOpListF_singletonFor a given field specification and a field operator , the time-ordering map acting on the representation of the operator in the free algebra is equal to the operator itself:
for chronologically ordered
#timeOrderF_ofFieldOpF_ofFieldOpF_orderedLet be a field specification. For any two field operators , if is chronologically later than or equal to (i.e., the relation holds), then the time-ordering map applied to their product in the field operator free algebra is simply the product itself: where denotes the product of the representations of the field operators in the algebra .
For a given field specification and two field operators , if is not chronologically later than or equal to (i.e., the relation does not hold), then the action of the time-ordering linear map on the product of their representations in the free algebra is given by: where is the representation of the field operator in the algebra (the sum of its creation and annihilation components), denotes the field statistic (bosonic or fermionic) of the operator, and is the sign factor determined by the statistics of and according to the Koszul convention.
for chronologically unordered operators
#timeOrderF_ofFieldOpF_ofFieldOpF_not_ordered_eq_timeOrderFFor a given field specification and two field operators , if is not chronologically later than or equal to (i.e., the relation does not hold), then the action of the time-ordering linear map on their product in the free algebra satisfies: where is the representation of the field operator in the free algebra, denotes the field statistic (bosonic or fermionic) of the operator, and is the sign factor determined by the statistics of and according to the Koszul convention.
for chronologically unordered operators
#timeOrderF_superCommuteF_ofCrAnOpF_ofCrAnOpF_not_crAnTimeOrderRelFor a given field specification , let be creation and annihilation field operators. If is not chronologically later than or equal to (meaning the relation does not hold), then the action of the time-ordering linear map on the super-commutator in the free algebra is zero: where denotes the map from an operator component to its generator in the algebra.
for chronologically unordered
#timeOrderF_superCommuteF_ofCrAnOpF_ofCrAnOpF_not_crAnTimeOrderRel_rightFor a given field specification , let be creation and annihilation field operators, and let be an arbitrary element of the free algebra. If is not chronologically later than or equal to (meaning the relation does not hold), then the time-ordering linear map applied to the product of and the super-commutator is zero: where denotes the mapping of an operator component to its corresponding generator in the algebra.
for chronologically unordered operators
#timeOrderF_superCommuteF_ofCrAnOpF_ofCrAnOpF_not_crAnTimeOrderRel_leftFor a given field specification , let be creation and annihilation field operators, and let be an arbitrary element of the free algebra. If is not chronologically later than or equal to (meaning the relation does not hold), then the action of the time-ordering linear map on the product of their super-commutator and the element is zero: where denotes the map from an operator component to its generator in the algebra.
for chronologically unordered
#timeOrderF_superCommuteF_ofCrAnOpF_ofCrAnOpF_not_crAnTimeOrderRel_midLet be a field specification. For any creation and annihilation field operators and any elements in the free algebra , if is not chronologically later than or equal to (i.e., the relation does not hold), then the time-ordering of the product is zero: where denotes the map from an operator component to its generator in the free algebra, is the super-commutator, and is the time-ordering linear map.
for chronologically unordered
#timeOrderF_superCommuteF_superCommuteF_ofCrAnOpF_not_crAnTimeOrderRelLet be a field specification and be the free associative algebra over generated by the set of creation and annihilation operators . Let denote the generator in corresponding to an operator , and let denote the super-commutator. For any two creation and annihilation operators and any element , if is not chronologically later than or equal to (i.e., the relation does not hold), then the time-ordering linear map applied to the nested super-commutator of with is zero:
when is not chronologically later than and
#timeOrderF_superCommuteF_ofCrAnOpF_superCommuteF_not_crAnTimeOrderRelLet be a field specification. For any creation and annihilation field operators , let denote the corresponding generator in the free algebra , let denote the super-commutator, and let be the time-ordering linear map. If is not chronologically later than or equal to and is not chronologically later than or equal to (i.e., and ), then the time-ordering of the nested super-commutator is zero:
for chronologically latest
#timeOrderF_superCommuteF_ofCrAnOpF_superCommuteF_not_crAnTimeOrderRel'Let be a field specification and be the free associative algebra over generated by the set of creation and annihilation operators . Let denote the generator in corresponding to an operator , and let denote the super-commutator. Let denote the time-ordering linear map. For any three creation and annihilation operators , if is chronologically later than both and (specifically, if the relations and do not hold), then the time-ordering map applied to the nested super-commutator of with is zero:
for non-simultaneous operators
#timeOrderF_superCommuteF_ofCrAnOpF_superCommuteF_all_not_crAnTimeOrderRelLet be a field specification. For any creation and annihilation field operators , let denote the corresponding generator in the free algebra , denote the super-commutator, and denote the time-ordering linear map. If it is not the case that and are all mutually simultaneous (meaning the conjunction of the time-ordering relations for all is false), then the time-ordering of the nested super-commutator is zero:
for simultaneous operators
#timeOrderF_superCommuteF_ofCrAnOpF_ofCrAnOpF_eq_timeFor a given field specification and creation or annihilation operators , if and are simultaneous (meaning both and hold), then the action of the time-ordering map on their super-commutator is equal to the super-commutator itself: where and denote the generators of the operators in the free algebra .
Recursive decomposition of time-ordering via the chronologically latest operator
#timeOrderF_eq_maxTimeField_mulFor a given field specification , let be a sequence of field operators (where is the head and is the tail). Let be the chronologically latest operator in according to the relation , and let be the sub-sequence of operators appearing in before the first occurrence of . The time-ordering linear map acting on the algebraic product of these operators satisfies: where is the exchange sign factor () determined by the statistics (bosonic or fermionic) of and the preceding sub-sequence , and the product on the right-hand side is the time-ordering of the operators remaining after the first occurrence of is removed.
expressed via finite sets
#timeOrderF_eq_maxTimeField_mul_finsetFor a given field specification , let be a sequence of field operators in . Let be the chronologically latest operator in according to the relation (choosing the leftmost if there are ties), and let be the sequence with its first occurrence removed. The time-ordering linear map acting on the algebraic product of these operators satisfies: where: - is the exchange sign factor (). - is the statistic of the maximal operator. - is the collective statistic of the subset of operators that appeared before in the original list , calculated using finite sets.
