Physlib

Physlib.QFT.PerturbationTheory.FieldSpecification.CrAnSection

46 declarations

definition

Creation and annihilation sections for a list of field operators φs\varphi_s

#CrAnSection

For a given field specification F\mathcal{F} and a list of field operators φs=[ϕ1,ϕ2,,ϕn]List(F.FieldOp)\varphi_s = [\phi_1, \phi_2, \dots, \phi_n] \in \text{List}(\mathcal{F}.\text{FieldOp}), the type CrAnSection(φs)\text{CrAnSection}(\varphi_s) is defined as the set of lists of creation and annihilation operators ψs=[ψ1,ψ2,,ψn]List(F.CrAnFieldOp)\psi_s = [\psi_1, \psi_2, \dots, \psi_n] \in \text{List}(\mathcal{F}.\text{CrAnFieldOp}) such that mapping each ψi\psi_i through the projection function F.crAnFieldOpToFieldOp\mathcal{F}.\text{crAnFieldOpToFieldOp} yields the original list φs\varphi_s. Physically, this represents all possible ways to associate each field operator in a product with either a creation or an annihilation component.

theorem

Length of ψs\psi_s Equals Length of φs\varphi_s

#length_eq

Let F\mathcal{F} be a field specification and φs\varphi_s be a list of field operators. For any creation and annihilation section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), the length of the list of operators in ψs\psi_s is equal to the length of the list φs\varphi_s.

definition

Tail of a creation and annihilation section ψs\psi_s

#tail

Given a list of field operators φs=[ϕ1,ϕ2,,ϕn]\varphi_s = [\phi_1, \phi_2, \dots, \phi_n] and a creation and annihilation section ψs=[ψ1,ψ2,,ψn]CrAnSection(φs)\psi_s = [\psi_1, \psi_2, \dots, \psi_n] \in \text{CrAnSection}(\varphi_s) (where each ψi\psi_i is a creation or annihilation component of the corresponding field operator ϕi\phi_i), this function returns the tail of the section [ψ2,,ψn][\psi_2, \dots, \psi_n]. This resulting list is a valid creation and annihilation section for the tail of the original field operator list, tail(φs)=[ϕ2,,ϕn]\text{tail}(\varphi_s) = [\phi_2, \dots, \phi_n].

theorem

The head of a creation and annihilation section of ϕ::φs\phi :: \varphi_s projects to ϕ\phi

#head_state_eq

Let F\mathcal{F} be a field specification. For any field operator ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp} and any list of field operators φs\varphi_s, let ψsCrAnSection(ϕ::φs)\psi_s \in \text{CrAnSection}(\phi :: \varphi_s) be a creation and annihilation section of the list starting with ϕ\phi. Then, the projection of the first element (the head) of ψs\psi_s to its underlying field operator is equal to ϕ\phi.

theorem

Field statistics of a CrAnSection(φs)\text{CrAnSection}(\varphi_s) equal the statistics of φs\varphi_s

#statistics_eq_state_statistics

For a given field specification F\mathcal{F}, let φs=[ϕ1,ϕ2,,ϕn]\varphi_s = [\phi_1, \phi_2, \dots, \phi_n] be a list of field operators and let ψs=[ψ1,ψ2,,ψn]\psi_s = [\psi_1, \psi_2, \dots, \psi_n] be a section of creation and annihilation operators such that each ψi\psi_i is a component of ϕi\phi_i (that is, ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s)). Then the list of field statistics (identifying each operator as bosonic or fermionic) associated with the creation and annihilation operators ψs\psi_s is equal to the list of field statistics associated with the original field operators φs\varphi_s. In symbols, (Fsψs)=(Fsφs)(\mathcal{F} \triangleright_s \psi_s) = (\mathcal{F} \triangleright_s \varphi_s).

theorem

The field statistics of the first nn elements of a creation and annihilation section ψs\psi_s equal those of the base field operators φs\varphi_s

#take_statistics_eq_take_state_statistics

Given a field specification F\mathcal{F}, let φs\varphi_s be a list of field operators and ψs\psi_s be a creation and annihilation section of φs\varphi_s (that is, a list of creation or annihilation components ψi\psi_i whose underlying field operators are the ϕi\phi_i in φs\varphi_s). For any natural number nn, the sequence of field statistics associated with the first nn elements of ψs\psi_s is identical to the sequence of field statistics associated with the first nn field operators in φs\varphi_s.

definition

Prepending a creation or annihilation label to a section CrAnSection(ϕs)\text{CrAnSection}(\phi_s)

#cons

For a given field specification F\mathcal{F}, let ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp} be a field operator and ϕs\phi_s be a list of field operators. Given a creation or annihilation label ψF.fieldOpToCrAnType(ϕ)\psi \in \mathcal{F}.\text{fieldOpToCrAnType}(\phi) and a section ψsCrAnSection(ϕs)\psi_s \in \text{CrAnSection}(\phi_s), the function constructs a new section for the extended list ϕ::ϕs\phi :: \phi_s by prepending the creation/annihilation operator pair ϕ,ψ\langle \phi, \psi \rangle to the list representing ψs\psi_s.

definition

CrAnSection([])Unit\text{CrAnSection}([]) \simeq \text{Unit}

#nilEquiv

For a given field specification F\mathcal{F}, the type of creation and annihilation sections CrAnSection([])\text{CrAnSection}([]) associated with the empty list of field operators is equivalent to the unit type Unit\text{Unit}. This implies that there is exactly one such section, which corresponds to the empty list of creation and annihilation operators.

definition

CrAnSection([ϕ])F.fieldOpToCrAnType(ϕ)\text{CrAnSection}([\phi]) \simeq \mathcal{F}.\text{fieldOpToCrAnType}(\phi)

#singletonEquiv

For a given field specification F\mathcal{F} and a field operator ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp}, the type of creation and annihilation sections for the singleton list [ϕ][\phi], denoted as CrAnSection([ϕ])\text{CrAnSection}([\phi]), is equivalent to the type of creation and annihilation labels F.fieldOpToCrAnType(ϕ)\mathcal{F}.\text{fieldOpToCrAnType}(\phi) associated with ϕ\phi. Physically, this means that specifying a section for a single operator ϕ\phi is uniquely determined by choosing its mode (creation or annihilation); if ϕ\phi is an asymptotic state, this choice is unique (singleton), whereas if ϕ\phi is a position-space operator, there are two choices.

definition

Equivalence CrAnSection(ϕ::ϕs)fieldOpToCrAnType(ϕ)×CrAnSection(ϕs)\text{CrAnSection}(\phi :: \phi_s) \simeq \text{fieldOpToCrAnType}(\phi) \times \text{CrAnSection}(\phi_s)

#consEquiv

For a given field specification F\mathcal{F}, a field operator ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp}, and a list of field operators ϕs\phi_s, there is a natural equivalence: CrAnSection(ϕ::ϕs)F.fieldOpToCrAnType(ϕ)×CrAnSection(ϕs)\text{CrAnSection}(\phi :: \phi_s) \simeq \mathcal{F}.\text{fieldOpToCrAnType}(\phi) \times \text{CrAnSection}(\phi_s) This equivalence decomposes a creation and annihilation section of the list ϕ::ϕs\phi :: \phi_s into a pair consisting of the specific mode (creation or annihilation label) of the first operator ϕ\phi and the remaining section for the tail of the list ϕs\phi_s.

instance

CrAnSection(φs)\text{CrAnSection}(\varphi_s) is a finite set

#fintype

For a given field specification F\mathcal{F} and a list of field operators φs=[ϕ1,ϕ2,,ϕn]List(F.FieldOp)\varphi_s = [\phi_1, \phi_2, \dots, \phi_n] \in \text{List}(\mathcal{F}.\text{FieldOp}), the type of creation and annihilation sections CrAnSection(φs)\text{CrAnSection}(\varphi_s) 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 ϕ::φs\phi :: \varphi_s is equivalent to the product of the finite set of modes F.fieldOpToCrAnType(ϕ)\mathcal{F}.\text{fieldOpToCrAnType}(\phi) and the (inductively finite) set CrAnSection(φs)\text{CrAnSection}(\varphi_s).

theorem

CrAnSection([])=1|\text{CrAnSection}([])| = 1

#card_nil_eq

For a given field specification F\mathcal{F}, the cardinality of the set of creation and annihilation sections CrAnSection([])\text{CrAnSection}([]) corresponding to the empty list of field operators is equal to 11, denoted as: CrAnSection([])=1|\text{CrAnSection}([])| = 1 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.

theorem

CrAnSection(ϕ::ϕs)=F.fieldOpToCrAnType(ϕ)CrAnSection(ϕs)|\text{CrAnSection}(\phi :: \phi_s)| = |\mathcal{F}.\text{fieldOpToCrAnType}(\phi)| \cdot |\text{CrAnSection}(\phi_s)|

#card_cons_eq

For a given field specification F\mathcal{F}, let ϕ\phi be a field operator and ϕs\phi_s be a list of field operators. The number of creation and annihilation sections for the list formed by prepending ϕ\phi to ϕs\phi_s is equal to the product of the number of allowed creation or annihilation modes for ϕ\phi and the number of sections for ϕs\phi_s: CrAnSection(ϕ::ϕs)=F.fieldOpToCrAnType(ϕ)×CrAnSection(ϕs)|\text{CrAnSection}(\phi :: \phi_s)| = |\mathcal{F}.\text{fieldOpToCrAnType}(\phi)| \times |\text{CrAnSection}(\phi_s)| Here, F.fieldOpToCrAnType(ϕ)\mathcal{F}.\text{fieldOpToCrAnType}(\phi) represents the finite set of modes (such as {create,annihilate}\{\text{create}, \text{annihilate}\} for position-space operators) associated with the operator ϕ\phi.

theorem

CrAnSection(φs)=2count(position_ops)|\text{CrAnSection}(\varphi_s)| = 2^{\text{count}(\text{position\_ops})}

#card_eq_mul

For a given field specification F\mathcal{F} and a list of field operators φs=[ϕ1,ϕ2,,ϕn]\varphi_s = [\phi_1, \phi_2, \dots, \phi_n], let CrAnSection(φs)\text{CrAnSection}(\varphi_s) be the set of all possible sequences of creation and annihilation components corresponding to φs\varphi_s. The cardinality of this set is given by: CrAnSection(φs)=2k|\text{CrAnSection}(\varphi_s)| = 2^k where kk is the number of position-space field operators in the list φs\varphi_s (determined by the predicate F.statesIsPosition\mathcal{F}.\text{statesIsPosition}). This follows from the fact that position-space operators possess two modes (creation and annihilation), while asymptotic operators possess only one.

theorem

Permutations of φs\varphi_s preserve CrAnSection(φs)|\text{CrAnSection}(\varphi_s)|

#card_perm_eq

For a given field specification F\mathcal{F}, let φs\varphi_s and φs\varphi_s' be two lists of field operators. If φs\varphi_s' is a permutation of φs\varphi_s, then the cardinality of the set of creation and annihilation sections for φs\varphi_s is equal to the cardinality of the set of creation and annihilation sections for φs\varphi_s': CrAnSection(φs)=CrAnSection(φs)|\text{CrAnSection}(\varphi_s)| = |\text{CrAnSection}(\varphi_s')|

theorem

Sum over the empty creation and annihilation section CrAnSection([])\text{CrAnSection}([])

#sum_nil

For a given field specification F\mathcal{F} and an additive commutative monoid MM, let CrAnSection([])\text{CrAnSection}([]) be the type of creation and annihilation sections associated with the empty list of field operators. For any function f:CrAnSection([])Mf : \text{CrAnSection}([]) \to M, the sum of ff over all sections sCrAnSection([])s \in \text{CrAnSection}([]) is equal to the value of ff at the unique empty section [],rfl\langle [], \text{rfl} \rangle: sCrAnSection([])f(s)=f([],rfl) \sum_{s \in \text{CrAnSection}([])} f(s) = f(\langle [], \text{rfl} \rangle) where [],rfl\langle [], \text{rfl} \rangle denotes the section containing an empty list of creation/annihilation operators.

theorem

Summation over CrAnSection(ϕ::φs)\text{CrAnSection}(\phi :: \varphi_s) as an iterated sum over modes and sections

#sum_cons

Let F\mathcal{F} be a field specification, ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp} be a field operator, and φs\varphi_s be a list of field operators. For any function f:CrAnSection(ϕ::φs)Mf: \text{CrAnSection}(\phi :: \varphi_s) \to M mapping into an additive commutative monoid MM, the sum over all possible creation and annihilation sections ss of the prepended list ϕ::φs\phi :: \varphi_s is equal to the iterated sum over the possible modes aF.fieldOpToCrAnType(ϕ)a \in \mathcal{F}.\text{fieldOpToCrAnType}(\phi) of the first operator and the sections sCrAnSection(φs)s' \in \text{CrAnSection}(\varphi_s) of the remaining list: sCrAnSection(ϕ::φs)f(s)=aF.fieldOpToCrAnType(ϕ)sCrAnSection(φs)f(cons(a,s))\sum_{s \in \text{CrAnSection}(\phi :: \varphi_s)} f(s) = \sum_{a \in \mathcal{F}.\text{fieldOpToCrAnType}(\phi)} \sum_{s' \in \text{CrAnSection}(\varphi_s)} f(\text{cons}(a, s')) where cons(a,s)\text{cons}(a, s') denotes the section constructed by prepending the mode label aa to the section ss'.

theorem

Sum over indices of section ss equals sum over indices of operator list φs\varphi_s

#sum_over_length

Let F\mathcal{F} be a field specification and φs\varphi_s be a list of field operators. For any creation and annihilation section sCrAnSection(φs)s \in \text{CrAnSection}(\varphi_s) and any function ff mapping the indices of the list ss to an additive commutative monoid MM, the sum over the indices of ss is equal to the sum over the indices of φs\varphi_s: nFin(s)f(n)=nFin(φs)f(n) \sum_{n \in \text{Fin}(|s|)} f(n) = \sum_{n \in \text{Fin}(|\varphi_s|)} f(n) where s|s| and φs|\varphi_s| denote the lengths of the respective lists, and the equality of indices is justified by the property that s=φs|s| = |\varphi_s| for any section ss of φs\varphi_s.

definition

Equivalence CrAnSection(φs)CrAnSection(φs)\text{CrAnSection}(\varphi_s) \simeq \text{CrAnSection}(\varphi_s') induced by φs=φs\varphi_s = \varphi_s'

#congr

For a field specification F\mathcal{F} and two lists of field operators φs\varphi_s and φs\varphi_s', an equality φs=φs\varphi_s = \varphi_s' induces an equivalence (a bijection) between the sets of creation and annihilation sections CrAnSection(φs)\text{CrAnSection}(\varphi_s) and CrAnSection(φs)\text{CrAnSection}(\varphi_s'). This equivalence is the identity map when the two lists are equal by definition.

theorem

The underlying list of a creation and annihilation section is invariant under congr\text{congr} bijections (congr(h,ψs).1=ψs.1\text{congr}(h, \psi_s).1 = \psi_s.1)

#congr_fst

Let F\mathcal{F} be a field specification. Given two lists of field operators φs,φsList(F.FieldOp)\varphi_s, \varphi_s' \in \text{List}(\mathcal{F}.\text{FieldOp}) such that there is an equality h:φs=φsh: \varphi_s = \varphi_s', let congr(h)\text{congr}(h) be the induced equivalence between the types of creation and annihilation sections CrAnSection(φs)\text{CrAnSection}(\varphi_s) and CrAnSection(φs)\text{CrAnSection}(\varphi_s'). For any section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), the underlying list of creation and annihilation operators of the transformed section congr(h,ψs)\text{congr}(h, \psi_s) is equal to the underlying list of operators in ψs\psi_s.

theorem

(congr h)1=congr (h1)(\text{congr } h)^{-1} = \text{congr } (h^{-1}) for creation and annihilation sections

#congr_symm

For a field specification F\mathcal{F} and two lists of field operators φs\varphi_s and φs\varphi_s', let h:φs=φsh : \varphi_s = \varphi_s' be an equality between them. Let congr(h):CrAnSection(φs)CrAnSection(φs)\text{congr}(h) : \text{CrAnSection}(\varphi_s) \simeq \text{CrAnSection}(\varphi_s') be the equivalence (bijection) between the sets of creation and annihilation sections induced by this equality. Then the inverse of this equivalence, (congr(h))1(\text{congr}(h))^{-1}, is equal to the equivalence congr(h1)\text{congr}(h^{-1}) induced by the symmetric equality h1:φs=φsh^{-1} : \varphi_s' = \varphi_s.

theorem

Transitivity of the congruence map for CrAnSection\text{CrAnSection}

#congr_trans_apply

Let F\mathcal{F} be a field specification. Suppose we have three lists of field operators φs,φs,φsList(F.FieldOp)\varphi_s, \varphi_s', \varphi_s'' \in \text{List}(\mathcal{F}.\text{FieldOp}) and two equalities h1:φs=φsh_1 : \varphi_s = \varphi_s' and h2:φs=φsh_2 : \varphi_s' = \varphi_s''. Let congr(h,)\text{congr}(h, \cdot) denote the equivalence between the types of creation and annihilation sections CrAnSection(source)\text{CrAnSection}(\text{source}) and CrAnSection(target)\text{CrAnSection}(\text{target}) induced by an equality hh. For any creation and annihilation section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), the composition of these induced maps satisfies: congr(h2,congr(h1,ψs))=congr(h,ψs) \text{congr}(h_2, \text{congr}(h_1, \psi_s)) = \text{congr}(h, \psi_s) where h:φs=φsh: \varphi_s = \varphi_s'' is the equality obtained by the transitivity of h1h_1 and h2h_2.

definition

The first nn elements of a creation and annihilation section ψs\psi_s

#take

Given a natural number nn and a creation-annihilation section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) corresponding to a list of field operators φs=[ϕ1,ϕ2,,ϕm]\varphi_s = [\phi_1, \phi_2, \dots, \phi_m], this function returns the prefix of the section consisting of its first nn elements. The resulting list is a valid section for the truncated list of field operators φsn=[ϕ1,,ϕmin(n,m)]\varphi_s|_{n} = [\phi_1, \dots, \phi_{\min(n, m)}].

theorem

taken\text{take}_n commutes with congruence for CrAnSection\text{CrAnSection}

#take_congr

Let F\mathcal{F} be a field specification and φs,φs\varphi_s, \varphi_s' be lists of field operators such that φs=φs\varphi_s = \varphi_s'. For any natural number nn and any creation and annihilation section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), taking the first nn elements of the section cast by the equality φs=φs\varphi_s = \varphi_s' is equal to casting the first nn elements of the original section ψs\psi_s via the induced equality φs.take(n)=φs.take(n)\varphi_s.\text{take}(n) = \varphi_s'.\text{take}(n). Mathematically, this is expressed as: taken(congr(h,ψs))=congr(h,takenψs)\text{take}_n (\text{congr}(h, \psi_s)) = \text{congr}(h', \text{take}_n \psi_s) where hh is the proof of φs=φs\varphi_s = \varphi_s' and hh' is the proof of φs.take(n)=φs.take(n)\varphi_s.\text{take}(n) = \varphi_s'.\text{take}(n).

definition

Dropping the first nn elements of a creation and annihilation section ψs\psi_s

#drop

For a given field specification F\mathcal{F}, let φs\varphi_s be a list of field operators and ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) be a corresponding section of creation and annihilation operators. For any natural number nn, the function drop\text{drop} produces a new section by removing the first nn elements of the list ψs\psi_s. This resulting list is a valid creation and annihilation section for the truncated list of field operators obtained by removing the first nn elements of φs\varphi_s.

theorem

Dropping elements commutes with congruence of creation and annihilation sections

#drop_congr

Given a field specification F\mathcal{F} and two lists of field operators φs\varphi_s and φs\varphi_s' that are equal (h:φs=φsh: \varphi_s = \varphi_s'), let congrh\text{congr}_h be the induced equivalence between the sets of creation and annihilation sections CrAnSection(φs)CrAnSection(φs)\text{CrAnSection}(\varphi_s) \simeq \text{CrAnSection}(\varphi_s'). For any natural number nn and any section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), the operation of dropping the first nn elements commutes with this congruence. Specifically, removing the first nn elements from the section congrh(ψs)\text{congr}_h(\psi_s) is identical to removing the first nn elements from ψs\psi_s and then applying the congruence map associated with the equality of the truncated lists φs.drop(n)=φs.drop(n)\varphi_s.\text{drop}(n) = \varphi_s'.\text{drop}(n). Mathematically, this is expressed as: drop(n,congr(h,ψs))=congr(h,drop(n,ψs))\text{drop}(n, \text{congr}(h, \psi_s)) = \text{congr}(h', \text{drop}(n, \psi_s)) where hh' is the proof that φs.drop(n)=φs.drop(n)\varphi_s.\text{drop}(n) = \varphi_s'.\text{drop}(n) follows from hh.

definition

Concatenation of creation and annihilation sections

#append

Given a field specification F\mathcal{F} and two lists of field operators φs,φsList(F.FieldOp)\varphi_s, \varphi_s' \in \text{List}(\mathcal{F}.\text{FieldOp}), let ψs\psi_s be a creation and annihilation section of φs\varphi_s and ψs\psi_s' be a creation and annihilation section of φs\varphi_s'. The `append` operation constructs a new section of the concatenated list φs ++ φs\varphi_s \text{ ++ } \varphi_s' by concatenating the underlying lists of creation and annihilation operators ψs\psi_s and ψs\psi_s'.

theorem

Associativity of `append` for creation and annihilation sections (`append ψs (append ψs' ψs'') = append (append ψs ψs') ψs''`)

#append_assoc

For a field specification F\mathcal{F} and three lists of field operators φs,φs,φsList(F.FieldOp)\varphi_s, \varphi_s', \varphi_s'' \in \text{List}(\mathcal{F}.\text{FieldOp}), let ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), ψsCrAnSection(φs)\psi_s' \in \text{CrAnSection}(\varphi_s'), and ψsCrAnSection(φs)\psi_s'' \in \text{CrAnSection}(\varphi_s'') be their respective creation and annihilation sections. The concatenation operation `append` for these sections is associative: append(ψs,append(ψs,ψs))=congr(h,append(append(ψs,ψs),ψs))\text{append}(\psi_s, \text{append}(\psi_s', \psi_s'')) = \text{congr}(h, \text{append}(\text{append}(\psi_s, \psi_s'), \psi_s'')) where congr(h)\text{congr}(h) is the equivalence between the types of creation and annihilation sections induced by the proof hh of the associativity of list concatenation, i.e., φs ++ (φs ++ φs)=(φs ++ φs) ++ φs\varphi_s \text{ ++ } (\varphi_s' \text{ ++ } \varphi_s'') = (\varphi_s \text{ ++ } \varphi_s') \text{ ++ } \varphi_s''.

theorem

Associativity of appendappend for creation and annihilation sections

#append_assoc'

Let F\mathcal{F} be a field specification and φs,φs,φs\varphi_s, \varphi_s', \varphi_s'' be three lists of field operators in F.FieldOp\mathcal{F}.\text{FieldOp}. Let ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s), ψsCrAnSection(φs)\psi_s' \in \text{CrAnSection}(\varphi_s'), and ψsCrAnSection(φs)\psi_s'' \in \text{CrAnSection}(\varphi_s'') be their respective creation and annihilation sections. The concatenation operation appendappend for these sections is associative, such that: append(append(ψs,ψs),ψs)=congr(h,append(ψs,append(ψs,ψs)))append(append(\psi_s, \psi_s'), \psi_s'') = \text{congr}(h, append(\psi_s, append(\psi_s', \psi_s''))) where hh is the proof of associativity for list concatenation (φs ++ φs) ++ φs=φs ++ (φs ++ φs)(\varphi_s \text{ ++ } \varphi_s') \text{ ++ } \varphi_s'' = \varphi_s \text{ ++ } (\varphi_s' \text{ ++ } \varphi_s''), and congr(h,)\text{congr}(h, \cdot) is the equivalence between the types CrAnSection((φs ++ φs) ++ φs)\text{CrAnSection}((\varphi_s \text{ ++ } \varphi_s') \text{ ++ } \varphi_s'') and CrAnSection(φs ++ (φs ++ φs))\text{CrAnSection}(\varphi_s \text{ ++ } (\varphi_s' \text{ ++ } \varphi_s'')) induced by that equality.

theorem

append(singleton(ψ),ψs)=cons(ψ,ψs)\text{append}(\text{singleton}(\psi), \psi_s) = \text{cons}(\psi, \psi_s) for creation and annihilation sections

#singletonEquiv_append_eq_cons

For a given field specification F\mathcal{F}, let ϕF.FieldOp\phi \in \mathcal{F}.\text{FieldOp} be a field operator and φs\varphi_s be a list of field operators. Let ψF.fieldOpToCrAnType(ϕ)\psi \in \mathcal{F}.\text{fieldOpToCrAnType}(\phi) be a creation or annihilation label for ϕ\phi, and let ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) be a section of the list φs\varphi_s. The theorem states that: append(singletonEquiv1(ψ),ψs)=cons(ψ,ψs)\text{append}(\text{singletonEquiv}^{-1}(\psi), \psi_s) = \text{cons}(\psi, \psi_s) where singletonEquiv1(ψ)\text{singletonEquiv}^{-1}(\psi) is the creation/annihilation section of the singleton list [ϕ][\phi] corresponding to the label ψ\psi, append\text{append} is the concatenation of sections, and cons\text{cons} is the operation of prepending a label to a section.

theorem

append(take nψs,drop nψs)=congr ψs\text{append}(\text{take } n \psi_s, \text{drop } n \psi_s) = \text{congr } \psi_s for creation and annihilation sections

#take_append_drop

For a field specification F\mathcal{F}, let φs\varphi_s be a list of field operators and ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) be a creation and annihilation section. For any natural number nn, the concatenation of the first nn elements of the section, take(n,ψs)\text{take}(n, \psi_s), and the remaining elements, drop(n,ψs)\text{drop}(n, \psi_s), is equal to the original section ψs\psi_s after applying the type-level congruence induced by the list identity φs=take(n,φs) ++ drop(n,φs)\varphi_s = \text{take}(n, \varphi_s) \text{ ++ } \text{drop}(n, \varphi_s). That is: append(take(n,ψs),drop(n,ψs))=congr(h,ψs)\text{append}(\text{take}(n, \psi_s), \text{drop}(n, \psi_s)) = \text{congr}(h, \psi_s) where hh is the equality φs=take(n,φs) ++ drop(n,φs)\varphi_s = \text{take}(n, \varphi_s) \text{ ++ } \text{drop}(n, \varphi_s).

theorem

append(congr ψs1,congr ψs2)=congr(append ψs1ψs2)\text{append}(\text{congr } \psi_{s1}, \text{congr } \psi_{s2}) = \text{congr}(\text{append } \psi_{s1} \psi_{s2}) for creation and annihilation sections

#congr_append

For a field specification F\mathcal{F}, let φs1,φs1,φs2,φs2\varphi_{s1}, \varphi_{s1}', \varphi_{s2}, \varphi_{s2}' be lists of field operators such that φs1=φs1\varphi_{s1} = \varphi_{s1}' and φs2=φs2\varphi_{s2} = \varphi_{s2}'. Given creation and annihilation sections ψs1CrAnSection(φs1)\psi_{s1} \in \text{CrAnSection}(\varphi_{s1}) and ψs2CrAnSection(φs2)\psi_{s2} \in \text{CrAnSection}(\varphi_{s2}), 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: append(congr(h1,ψs1),congr(h2,ψs2))=congr(h,append(ψs1,ψs2))\text{append}(\text{congr}(h_1, \psi_{s1}), \text{congr}(h_2, \psi_{s2})) = \text{congr}(h, \text{append}(\psi_{s1}, \psi_{s2})) where congr\text{congr} is the equivalence between section types induced by an equality of the underlying field operator lists, and hh is the equality φs1 ++ φs2=φs1 ++ φs2\varphi_{s1} \text{ ++ } \varphi_{s2} = \varphi_{s1}' \text{ ++ } \varphi_{s2}' derived from h1h_1 and h2h_2.

theorem

Congruence of the first component of concatenated creation and annihilation sections

#congr_fst_append

For a field specification F\mathcal{F}, let φs1,φs1,φs2List(F.FieldOp)\varphi_{s1}, \varphi_{s1'}, \varphi_{s2} \in \text{List}(\mathcal{F}.\text{FieldOp}) be lists of field operators such that h1:φs1=φs1h_1 : \varphi_{s1} = \varphi_{s1'}. Given a creation and annihilation section ψs1\psi_{s1} of φs1\varphi_{s1} and a section ψs2\psi_{s2} of φs2\varphi_{s2}, the concatenation of the section congr(h1,ψs1)\text{congr}(h_1, \psi_{s1}) (which is ψs1\psi_{s1} cast to the type CrAnSection(φs1)\text{CrAnSection}(\varphi_{s1'})) with ψs2\psi_{s2} is equal to casting the concatenated section append(ψs1,ψs2)\text{append}(\psi_{s1}, \psi_{s2}) using the equality φs1 ++ φs2=φs1 ++ φs2\varphi_{s1} \text{ ++ } \varphi_{s2} = \varphi_{s1'} \text{ ++ } \varphi_{s2} induced by h1h_1. In terms of the projection to the underlying lists of creation and annihilation operators, this states that: append(congr(h1,ψs1),ψs2)=congr(h1,append(ψs1,ψs2))\text{append}(\text{congr}(h_1, \psi_{s1}), \psi_{s2}) = \text{congr}(h_1', \text{append}(\psi_{s1}, \psi_{s2})) where h1h_1' is the equality between concatenated lists of field operators.

theorem

Right-side congruence commutes with the concatenation of creation and annihilation sections

#congr_snd_append

For a field specification F\mathcal{F}, let φs1,φs2\varphi_{s1}, \varphi_{s2}, and φs2\varphi_{s2}' be lists of field operators, and let h2:φs2=φs2h_2 : \varphi_{s2} = \varphi_{s2}' be an equality between the second and third lists. Given a creation and annihilation section ψs1\psi_{s1} of φs1\varphi_{s1} and a section ψs2\psi_{s2} of φs2\varphi_{s2}, the result of concatenating ψs1\psi_{s1} with the section ψs2\psi_{s2} (adjusted to CrAnSection(φs2)\text{CrAnSection}(\varphi_{s2}') via the equality h2h_2) is equal to the concatenated section append(ψs1,ψs2)\text{append}(\psi_{s1}, \psi_{s2}) adjusted to CrAnSection(φs1 ++ φs2)\text{CrAnSection}(\varphi_{s1} \text{ ++ } \varphi_{s2}') by the induced equality φs1 ++ φs2=φs1 ++ φs2\varphi_{s1} \text{ ++ } \varphi_{s2} = \varphi_{s1} \text{ ++ } \varphi_{s2}'. Here, congr\text{congr} denotes the equivalence between section types induced by an equality of their underlying field operator lists.

theorem

take φs(ψs+ ⁣+ψs)=ψs\text{take } |\varphi_s| (\psi_s \mathbin{+\!+} \psi_s') = \psi_s for Creation-Annihilation Sections

#take_left

Let F\mathcal{F} be a field specification. For any two lists of field operators φs,φsList(F.FieldOp)\varphi_s, \varphi_s' \in \text{List}(\mathcal{F}.\text{FieldOp}), let ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) and ψsCrAnSection(φs)\psi_s' \in \text{CrAnSection}(\varphi_s') be their respective creation and annihilation sections. Then, taking the first nn elements of the concatenated section append(ψs,ψs)\text{append}(\psi_s, \psi_s'), where n=length(φs)n = \text{length}(\varphi_s), is equal to the original section ψs\psi_s. This equality holds under the type-casting equivalence congr\text{congr} induced by the list identity take(φs,φs+ ⁣+φs)=φs\text{take}(|\varphi_s|, \varphi_s \mathbin{+\!+} \varphi_s') = \varphi_s.

theorem

drop(length(φs),append(ψs,ψs))=ψs\text{drop}(\text{length}(\varphi_s), \text{append}(\psi_s, \psi_s')) = \psi_s'

#drop_left

For a given field specification F\mathcal{F}, let φs\varphi_s and φs\varphi_s' be lists of field operators. Let ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) and ψsCrAnSection(φs)\psi_s' \in \text{CrAnSection}(\varphi_s') be their corresponding sections of creation and annihilation operators. Then, dropping the first nn elements of the concatenated section append(ψs,ψs)\text{append}(\psi_s, \psi_s'), where nn is the length of the list φs\varphi_s, is equal to the section ψs\psi_s'. This equality is defined via the equivalence congr\text{congr} induced by the list identity (φs+ ⁣+φs).drop(length(φs))=φs(\varphi_s \mathbin{+\!+} \varphi_s').\text{drop}(\text{length}(\varphi_s)) = \varphi_s'.

definition

CrAnSection(φs+ ⁣+φs)CrAnSection(φs)×CrAnSection(φs)\text{CrAnSection}(\varphi_s \mathbin{+\!+} \varphi_s') \simeq \text{CrAnSection}(\varphi_s) \times \text{CrAnSection}(\varphi_s')

#appendEquiv

Given a field specification F\mathcal{F} and two lists of field operators φs,φsList(F.FieldOp)\varphi_s, \varphi_s' \in \text{List}(\mathcal{F}.\text{FieldOp}), there exists an equivalence (bijection) between the type of creation and annihilation sections of the concatenated list, CrAnSection(φs+ ⁣+φs)\text{CrAnSection}(\varphi_s \mathbin{+\!+} \varphi_s'), and the Cartesian product of the types of sections for the individual lists, CrAnSection(φs)×CrAnSection(φs)\text{CrAnSection}(\varphi_s) \times \text{CrAnSection}(\varphi_s'). Specifically, the equivalence is defined by: - The forward map (splitting): A section of the concatenated list ψCrAnSection(φs+ ⁣+φs)\psi \in \text{CrAnSection}(\varphi_s \mathbin{+\!+} \varphi_s') is decomposed into a pair of sections (ψ1,ψ2)(\psi_1, \psi_2) by taking the first nn elements and dropping the first nn elements of ψ\psi, respectively, where nn is the length of the list φs\varphi_s. - The inverse map (joining): A pair of sections (ψs,ψs)CrAnSection(φs)×CrAnSection(φs)(\psi_s, \psi_s') \in \text{CrAnSection}(\varphi_s) \times \text{CrAnSection}(\varphi_s') is mapped to their concatenation ψs+ ⁣+ψs\psi_s \mathbin{+\!+} \psi_s'.

theorem

Mapping commutes with index erasure in lists

#map_eraseIdx

Let α\alpha and β\beta be types, f:αβf: \alpha \to \beta be a function, ll be a list of elements in α\alpha, and nn be a natural number representing an index. The operation of mapping the function ff over the list ll after removing the element at index nn is equivalent to removing the element at index nn from the list after mapping ff over ll. That is, map(f,eraseIdx(l,n))=eraseIdx(map(f,l),n)\text{map}(f, \text{eraseIdx}(l, n)) = \text{eraseIdx}(\text{map}(f, l), n) where map(f,l)\text{map}(f, l) is the list obtained by applying ff to each element of ll, and eraseIdx(l,n)\text{eraseIdx}(l, n) is the list ll with the element at position nn removed.

definition

Erasure of the nn-th element from a creation and annihilation section ψs\psi_s

#eraseIdx

Given a natural number nn and a creation and annihilation section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) associated with a list of field operators φs\varphi_s, this function removes the nn-th element from the underlying list of ψs\psi_s. The resulting list is a valid section of the list of field operators eraseIdx(φs,n)\text{eraseIdx}(\varphi_s, n), which represents the original list φs\varphi_s with the element at index nn removed.

definition

CrAnSection(φs)F.fieldOpToCrAnType(φs[n])×CrAnSection(φs.eraseIdx n)\text{CrAnSection}(\varphi_s) \simeq \mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n]) \times \text{CrAnSection}(\varphi_s.\text{eraseIdx } n)

#eraseIdxEquiv

For a field specification F\mathcal{F} and a list of field operators φsList(F.FieldOp)\varphi_s \in \text{List}(\mathcal{F}.\text{FieldOp}), let nn be a natural number such that n<length(φs)n < \text{length}(\varphi_s). There exists an equivalence (bijection) between the type of creation and annihilation sections of the full list, CrAnSection(φs)\text{CrAnSection}(\varphi_s), and the Cartesian product of: 1. The type of creation and annihilation labels associated with the nn-th field operator in the list, F.fieldOpToCrAnType(φs[n])\mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n]). 2. The type of sections for the list obtained by removing the nn-th operator, CrAnSection(φs.eraseIdx n)\text{CrAnSection}(\varphi_s.\text{eraseIdx } n). This equivalence allows for the extraction of the creation/annihilation mode of a specific operator at index nn from a complete section of a product of field operators.

theorem

The second component of eraseIdxEquiv\text{eraseIdxEquiv} equals eraseIdx\text{eraseIdx}

#eraseIdxEquiv_apply_snd

For a field specification F\mathcal{F}, a list of field operators φs\varphi_s, and a natural number n<length(φs)n < \text{length}(\varphi_s), let ψs\psi_s be a creation and annihilation section in CrAnSection(φs)\text{CrAnSection}(\varphi_s). The second component of the image of ψs\psi_s under the equivalence eraseIdxEquiv\text{eraseIdxEquiv} (which decomposes a section into the nn-th mode and the remaining section) is equal to the section obtained by directly removing the nn-th element from ψs\psi_s, denoted eraseIdx(n,ψs)\text{eraseIdx}(n, \psi_s).

theorem

Reconstruction of a creation and annihilation section by index insertion

#eraseIdxEquiv_symm_eq_take_cons_drop

For a field specification F\mathcal{F}, let φs\varphi_s be a list of field operators and nn be a natural number such that n<length(φs)n < \text{length}(\varphi_s). Let aF.fieldOpToCrAnType(φs[n])a \in \mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n]) be a creation or annihilation label for the nn-th field operator, and let sCrAnSection(φs.eraseIdx n)s \in \text{CrAnSection}(\varphi_s.\text{eraseIdx } n) be a section for the list of field operators where the nn-th element has been removed. The inverse of the equivalence eraseIdxEquiv\text{eraseIdxEquiv}, which reconstructs a full section from a specific label and a truncated section, satisfies: (eraseIdxEquiv(n,φs,hn))1a,s=congr(h,append(take(n,s),cons(a,drop(n,s))))(\text{eraseIdxEquiv}(n, \varphi_s, h_n))^{-1} \langle a, s \rangle = \text{congr}\left(h, \text{append}(\text{take}(n, s), \text{cons}(a, \text{drop}(n, s)))\right) where: - take(n,s)\text{take}(n, s) consists of the first nn creation/annihilation operators in ss. - drop(n,s)\text{drop}(n, s) consists of the remaining operators in ss after the first nn. - cons(a,)\text{cons}(a, \dots) prepends the label aa to the dropped part of the section. - append()\text{append}(\dots) concatenates the two sections. - congr(h,)\text{congr}(h, \cdot) is the equivalence between the constructed section type and CrAnSection(φs)\text{CrAnSection}(\varphi_s) induced by the equality of the underlying lists of field operators.

theorem

The nn-th element of the section reconstructed by `eraseIdxEquiv.symm` is φs[n],a\langle \varphi_s[n], a \rangle

#eraseIdxEquiv_symm_getElem

Let F\mathcal{F} be a field specification and φs\varphi_s be a list of field operators. Let nn be a natural number such that n<length(φs)n < \text{length}(\varphi_s). Given a creation or annihilation label aF.fieldOpToCrAnType(φs[n])a \in \mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n]) and a section sCrAnSection(φs.eraseIdx n)s \in \text{CrAnSection}(\varphi_s.\text{eraseIdx } n) for the list of field operators with the nn-th element removed, consider the reconstructed section ψsCrAnSection(φs)\psi_s \in \text{CrAnSection}(\varphi_s) obtained via the inverse equivalence: ψs=(eraseIdxEquiv(n,φs,hn))1a,s\psi_s = (\text{eraseIdxEquiv}(n, \varphi_s, h_n))^{-1} \langle a, s \rangle Then the nn-th element of the underlying list of creation and annihilation operators of ψs\psi_s is exactly the pair φs[n],a\langle \varphi_s[n], a \rangle.

theorem

Erasure of the nn-th element from a reconstructed creation and annihilation section

#eraseIdxEquiv_symm_eraseIdx

For a field specification F\mathcal{F}, let φs\varphi_s be a list of field operators and nn be a natural number such that n<length(φs)n < \text{length}(\varphi_s). Let aF.fieldOpToCrAnType(φs[n])a \in \mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n]) be a creation or annihilation label for the nn-th field operator, and let sCrAnSection(φs.eraseIdx n)s \in \text{CrAnSection}(\varphi_s.\text{eraseIdx } n) be a section for the list of field operators with the nn-th element removed. If we reconstruct a complete section for φs\varphi_s by inserting aa into ss using the inverse of the equivalence eraseIdxEquiv\text{eraseIdxEquiv}, then removing the nn-th element from the underlying list of this reconstructed section yields the underlying list of ss.

theorem

Decomposition of Sums over CrAnSection(φs)\text{CrAnSection}(\varphi_s) by Index nn

#sum_eraseIdxEquiv

For a field specification F\mathcal{F} and a list of field operators φs\varphi_s, let nn be a natural number such that n<length(φs)n < \text{length}(\varphi_s). Let f:CrAnSection(φs)Mf: \text{CrAnSection}(\varphi_s) \to M be a function into an additive commutative monoid MM. The sum of ff over all creation and annihilation sections of φs\varphi_s can be decomposed as: sCrAnSection(φs)f(s)=aF.fieldOpToCrAnType(φs[n])sCrAnSection(φs.eraseIdx n)f(eraseIdxEquiv(n,φs,hn)1(a,s))\sum_{s \in \text{CrAnSection}(\varphi_s)} f(s) = \sum_{a \in \mathcal{F}.\text{fieldOpToCrAnType}(\varphi_s[n])} \sum_{s' \in \text{CrAnSection}(\varphi_s.\text{eraseIdx } n)} f(\text{eraseIdxEquiv}(n, \varphi_s, h_n)^{-1}(a, s')) where eraseIdxEquiv(n,φs,hn)1\text{eraseIdxEquiv}(n, \varphi_s, h_n)^{-1} denotes the inverse of the bijection that maps a section of the full list to a pair consisting of the mode aa at index nn and a section ss' of the list with the nn-th element removed.