Physlib.QFT.PerturbationTheory.FieldSpecification.CrAnSection
46 declarations
Creation and annihilation sections for a list of field operators
#CrAnSectionFor a given field specification and a list of field operators , the type is defined as the set of lists of creation and annihilation operators such that mapping each through the projection function yields the original list . Physically, this represents all possible ways to associate each field operator in a product with either a creation or an annihilation component.
Length of Equals Length of
#length_eqLet be a field specification and be a list of field operators. For any creation and annihilation section , the length of the list of operators in is equal to the length of the list .
Tail of a creation and annihilation section
#tailGiven a list of field operators and a creation and annihilation section (where each is a creation or annihilation component of the corresponding field operator ), this function returns the tail of the section . This resulting list is a valid creation and annihilation section for the tail of the original field operator list, .
The head of a creation and annihilation section of projects to
#head_state_eqLet be a field specification. For any field operator and any list of field operators , let be a creation and annihilation section of the list starting with . Then, the projection of the first element (the head) of to its underlying field operator is equal to .
Field statistics of a equal the statistics of
#statistics_eq_state_statisticsFor a given field specification , let be a list of field operators and let be a section of creation and annihilation operators such that each is a component of (that is, ). Then the list of field statistics (identifying each operator as bosonic or fermionic) associated with the creation and annihilation operators is equal to the list of field statistics associated with the original field operators . In symbols, .
The field statistics of the first elements of a creation and annihilation section equal those of the base field operators
#take_statistics_eq_take_state_statisticsGiven a field specification , let be a list of field operators and be a creation and annihilation section of (that is, a list of creation or annihilation components whose underlying field operators are the in ). For any natural number , the sequence of field statistics associated with the first elements of is identical to the sequence of field statistics associated with the first field operators in .
Mode of the first operator in a
#headGiven a field specification and a list of field operators starting with , denoted as , let be a creation and annihilation section for this list. The function `head` extracts the specific mode (the creation or annihilation label) associated with the first field operator in the section, returning an element of the type .
Prepending a creation or annihilation label to a section
#consFor a given field specification , let be a field operator and be a list of field operators. Given a creation or annihilation label and a section , the function constructs a new section for the extended list by prepending the creation/annihilation operator pair to the list representing .
For a given field specification , the type of creation and annihilation sections associated with the empty list of field operators is equivalent to the unit type . This implies that there is exactly one such section, which corresponds to the empty list of creation and annihilation operators.
For a given field specification and a field operator , the type of creation and annihilation sections for the singleton list , denoted as , is equivalent to the type of creation and annihilation labels associated with . Physically, this means that specifying a section for a single operator is uniquely determined by choosing its mode (creation or annihilation); if is an asymptotic state, this choice is unique (singleton), whereas if is a position-space operator, there are two choices.
Equivalence
#consEquivFor a given field specification , a field operator , and a list of field operators , there is a natural equivalence: This equivalence decomposes a creation and annihilation section of the list into a pair consisting of the specific mode (creation or annihilation label) of the first operator and the remaining section for the tail of the list .
is a finite set
#fintypeFor a given field specification and a list of field operators , the type of creation and annihilation sections is finite. This finiteness is defined recursively: the section for an empty list is equivalent to the finite unit type, and the section for a list is equivalent to the product of the finite set of modes and the (inductively finite) set .
For a given field specification , the cardinality of the set of creation and annihilation sections corresponding to the empty list of field operators is equal to , denoted as: This reflects the fact that the only creation and annihilation section for an empty list of field operators is the empty list of creation and annihilation operators.
For a given field specification , let be a field operator and be a list of field operators. The number of creation and annihilation sections for the list formed by prepending to is equal to the product of the number of allowed creation or annihilation modes for and the number of sections for : Here, represents the finite set of modes (such as for position-space operators) associated with the operator .
For a given field specification and a list of field operators , let be the set of all possible sequences of creation and annihilation components corresponding to . The cardinality of this set is given by: where is the number of position-space field operators in the list (determined by the predicate ). This follows from the fact that position-space operators possess two modes (creation and annihilation), while asymptotic operators possess only one.
Permutations of preserve
#card_perm_eqFor a given field specification , let and be two lists of field operators. If is a permutation of , then the cardinality of the set of creation and annihilation sections for is equal to the cardinality of the set of creation and annihilation sections for :
Sum over the empty creation and annihilation section
#sum_nilFor a given field specification and an additive commutative monoid , let be the type of creation and annihilation sections associated with the empty list of field operators. For any function , the sum of over all sections is equal to the value of at the unique empty section : where denotes the section containing an empty list of creation/annihilation operators.
Summation over as an iterated sum over modes and sections
#sum_consLet be a field specification, be a field operator, and be a list of field operators. For any function mapping into an additive commutative monoid , the sum over all possible creation and annihilation sections of the prepended list is equal to the iterated sum over the possible modes of the first operator and the sections of the remaining list: where denotes the section constructed by prepending the mode label to the section .
Sum over indices of section equals sum over indices of operator list
#sum_over_lengthLet be a field specification and be a list of field operators. For any creation and annihilation section and any function mapping the indices of the list to an additive commutative monoid , the sum over the indices of is equal to the sum over the indices of : where and denote the lengths of the respective lists, and the equality of indices is justified by the property that for any section of .
Equivalence induced by
#congrFor a field specification and two lists of field operators and , an equality induces an equivalence (a bijection) between the sets of creation and annihilation sections and . This equivalence is the identity map when the two lists are equal by definition.
The underlying list of a creation and annihilation section is invariant under bijections ()
#congr_fstLet be a field specification. Given two lists of field operators such that there is an equality , let be the induced equivalence between the types of creation and annihilation sections and . For any section , the underlying list of creation and annihilation operators of the transformed section is equal to the underlying list of operators in .
for creation and annihilation sections
#congr_symmFor a field specification and two lists of field operators and , let be an equality between them. Let be the equivalence (bijection) between the sets of creation and annihilation sections induced by this equality. Then the inverse of this equivalence, , is equal to the equivalence induced by the symmetric equality .
Transitivity of the congruence map for
#congr_trans_applyLet be a field specification. Suppose we have three lists of field operators and two equalities and . Let denote the equivalence between the types of creation and annihilation sections and induced by an equality . For any creation and annihilation section , the composition of these induced maps satisfies: where is the equality obtained by the transitivity of and .
The first elements of a creation and annihilation section
#takeGiven a natural number and a creation-annihilation section corresponding to a list of field operators , this function returns the prefix of the section consisting of its first elements. The resulting list is a valid section for the truncated list of field operators .
commutes with congruence for
#take_congrLet be a field specification and be lists of field operators such that . For any natural number and any creation and annihilation section , taking the first elements of the section cast by the equality is equal to casting the first elements of the original section via the induced equality . Mathematically, this is expressed as: where is the proof of and is the proof of .
Dropping the first elements of a creation and annihilation section
#dropFor a given field specification , let be a list of field operators and be a corresponding section of creation and annihilation operators. For any natural number , the function produces a new section by removing the first elements of the list . This resulting list is a valid creation and annihilation section for the truncated list of field operators obtained by removing the first elements of .
Dropping elements commutes with congruence of creation and annihilation sections
#drop_congrGiven a field specification and two lists of field operators and that are equal (), let be the induced equivalence between the sets of creation and annihilation sections . For any natural number and any section , the operation of dropping the first elements commutes with this congruence. Specifically, removing the first elements from the section is identical to removing the first elements from and then applying the congruence map associated with the equality of the truncated lists . Mathematically, this is expressed as: where is the proof that follows from .
Concatenation of creation and annihilation sections
#appendGiven a field specification and two lists of field operators , let be a creation and annihilation section of and be a creation and annihilation section of . The `append` operation constructs a new section of the concatenated list by concatenating the underlying lists of creation and annihilation operators and .
Associativity of `append` for creation and annihilation sections (`append ψs (append ψs' ψs'') = append (append ψs ψs') ψs''`)
#append_assocFor a field specification and three lists of field operators , let , , and be their respective creation and annihilation sections. The concatenation operation `append` for these sections is associative: where is the equivalence between the types of creation and annihilation sections induced by the proof of the associativity of list concatenation, i.e., .
Associativity of for creation and annihilation sections
#append_assoc'Let be a field specification and be three lists of field operators in . Let , , and be their respective creation and annihilation sections. The concatenation operation for these sections is associative, such that: where is the proof of associativity for list concatenation , and is the equivalence between the types and induced by that equality.
for creation and annihilation sections
#singletonEquiv_append_eq_consFor a given field specification , let be a field operator and be a list of field operators. Let be a creation or annihilation label for , and let be a section of the list . The theorem states that: where is the creation/annihilation section of the singleton list corresponding to the label , is the concatenation of sections, and is the operation of prepending a label to a section.
for creation and annihilation sections
#take_append_dropFor a field specification , let be a list of field operators and be a creation and annihilation section. For any natural number , the concatenation of the first elements of the section, , and the remaining elements, , is equal to the original section after applying the type-level congruence induced by the list identity . That is: where is the equality .
for creation and annihilation sections
#congr_appendFor a field specification , let be lists of field operators such that and . Given creation and annihilation sections and , the concatenation of the sections after applying the type-level congruences induced by these equalities is equal to the type-level congruence applied to the concatenation of the original sections. That is: where is the equivalence between section types induced by an equality of the underlying field operator lists, and is the equality derived from and .
Congruence of the first component of concatenated creation and annihilation sections
#congr_fst_appendFor a field specification , let be lists of field operators such that . Given a creation and annihilation section of and a section of , the concatenation of the section (which is cast to the type ) with is equal to casting the concatenated section using the equality induced by . In terms of the projection to the underlying lists of creation and annihilation operators, this states that: where is the equality between concatenated lists of field operators.
Right-side congruence commutes with the concatenation of creation and annihilation sections
#congr_snd_appendFor a field specification , let , and be lists of field operators, and let be an equality between the second and third lists. Given a creation and annihilation section of and a section of , the result of concatenating with the section (adjusted to via the equality ) is equal to the concatenated section adjusted to by the induced equality . Here, denotes the equivalence between section types induced by an equality of their underlying field operator lists.
for Creation-Annihilation Sections
#take_leftLet be a field specification. For any two lists of field operators , let and be their respective creation and annihilation sections. Then, taking the first elements of the concatenated section , where , is equal to the original section . This equality holds under the type-casting equivalence induced by the list identity .
For a given field specification , let and be lists of field operators. Let and be their corresponding sections of creation and annihilation operators. Then, dropping the first elements of the concatenated section , where is the length of the list , is equal to the section . This equality is defined via the equivalence induced by the list identity .
Given a field specification and two lists of field operators , there exists an equivalence (bijection) between the type of creation and annihilation sections of the concatenated list, , and the Cartesian product of the types of sections for the individual lists, . Specifically, the equivalence is defined by: - The forward map (splitting): A section of the concatenated list is decomposed into a pair of sections by taking the first elements and dropping the first elements of , respectively, where is the length of the list . - The inverse map (joining): A pair of sections is mapped to their concatenation .
Mapping commutes with index erasure in lists
#map_eraseIdxLet and be types, be a function, be a list of elements in , and be a natural number representing an index. The operation of mapping the function over the list after removing the element at index is equivalent to removing the element at index from the list after mapping over . That is, where is the list obtained by applying to each element of , and is the list with the element at position removed.
Erasure of the -th element from a creation and annihilation section
#eraseIdxGiven a natural number and a creation and annihilation section associated with a list of field operators , this function removes the -th element from the underlying list of . The resulting list is a valid section of the list of field operators , which represents the original list with the element at index removed.
For a field specification and a list of field operators , let be a natural number such that . There exists an equivalence (bijection) between the type of creation and annihilation sections of the full list, , and the Cartesian product of: 1. The type of creation and annihilation labels associated with the -th field operator in the list, . 2. The type of sections for the list obtained by removing the -th operator, . This equivalence allows for the extraction of the creation/annihilation mode of a specific operator at index from a complete section of a product of field operators.
The second component of equals
#eraseIdxEquiv_apply_sndFor a field specification , a list of field operators , and a natural number , let be a creation and annihilation section in . The second component of the image of under the equivalence (which decomposes a section into the -th mode and the remaining section) is equal to the section obtained by directly removing the -th element from , denoted .
Reconstruction of a creation and annihilation section by index insertion
#eraseIdxEquiv_symm_eq_take_cons_dropFor a field specification , let be a list of field operators and be a natural number such that . Let be a creation or annihilation label for the -th field operator, and let be a section for the list of field operators where the -th element has been removed. The inverse of the equivalence , which reconstructs a full section from a specific label and a truncated section, satisfies: where: - consists of the first creation/annihilation operators in . - consists of the remaining operators in after the first . - prepends the label to the dropped part of the section. - concatenates the two sections. - is the equivalence between the constructed section type and induced by the equality of the underlying lists of field operators.
The -th element of the section reconstructed by `eraseIdxEquiv.symm` is
#eraseIdxEquiv_symm_getElemLet be a field specification and be a list of field operators. Let be a natural number such that . Given a creation or annihilation label and a section for the list of field operators with the -th element removed, consider the reconstructed section obtained via the inverse equivalence: Then the -th element of the underlying list of creation and annihilation operators of is exactly the pair .
Erasure of the -th element from a reconstructed creation and annihilation section
#eraseIdxEquiv_symm_eraseIdxFor a field specification , let be a list of field operators and be a natural number such that . Let be a creation or annihilation label for the -th field operator, and let be a section for the list of field operators with the -th element removed. If we reconstruct a complete section for by inserting into using the inverse of the equivalence , then removing the -th element from the underlying list of this reconstructed section yields the underlying list of .
Decomposition of Sums over by Index
#sum_eraseIdxEquivFor a field specification and a list of field operators , let be a natural number such that . Let be a function into an additive commutative monoid . The sum of over all creation and annihilation sections of can be decomposed as: where denotes the inverse of the bijection that maps a section of the full list to a pair consisting of the mode at index and a section of the list with the -th element removed.
