PhyslibSearch

Physlib.QFT.PerturbationTheory.Koszul.KoszulSign

20 declarations

definition

Koszul sign of a list of fields with statistics qq and ordering \le

#koszulSign

Given a type of fields F\mathcal{F}, a function q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} that assigns a statistic to each field (where 11 represents a fermion and 00 a boson), and a decidable ordering relation \le on F\mathcal{F}, the Koszul sign of a list of fields LL is a value in C\mathbb{C}. It is defined recursively such that the sign of an empty list is 11, and for any other list, it provides a factor of 1-1 for every fermion-fermion swap required to sort the list according to \le.

theorem

The Koszul sign of a singleton list [ϕ][\phi] is 11

#koszulSign_singleton

Given a type of fields F\mathcal{F}, a function q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} that assigns a statistic to each field, and a decidable ordering relation \le on F\mathcal{F}, the Koszul sign of a singleton list containing only the field ϕF\phi \in \mathcal{F} is equal to 11.

theorem

koszulSign(q,,L)2=1\text{koszulSign}(q, \le, L)^2 = 1

#koszulSign_mul_self

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} a function assigning statistics to fields, and \le a decidable ordering relation on F\mathcal{F}. For any list of fields LL, the product of the Koszul sign of LL with itself is equal to 1. That is, koszulSign(q,,L)koszulSign(q,,L)=1.\text{koszulSign}(q, \le, L) \cdot \text{koszulSign}(q, \le, L) = 1.

theorem

The Koszul Sign of a Single Field is 1

#koszulSign_freeMonoid_of

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic to each field, and \le be a decidable ordering relation on F\mathcal{F}. For any field ϕF\phi \in \mathcal{F}, the Koszul sign of the list containing only that field (represented as an element of the free monoid) is 1. Mathematically: koszulSign(q,,[ϕ])=1\text{koszulSign}(q, \le, [\phi]) = 1

theorem

Erasing a Boson Preserves the Koszul Insertion Sign

#koszulSignInsert_erase_boson

Let F\mathcal{F} be a type representing fields and q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function that assigns a statistic (either bosonic or fermionic) to each field. Let \le be a decidable relation on F\mathcal{F}. For any field ϕF\phi \in \mathcal{F} and any list of fields ϕs\phi_s, if the field at index nn in ϕs\phi_s is bosonic, then the Koszul insertion sign of ϕ\phi into the list ϕs\phi_s with the nn-th element removed is equal to the Koszul insertion sign of ϕ\phi into the original list ϕs\phi_s. Mathematically, if q(ϕs[n])=bosonicq(\phi_s[n]) = \text{bosonic}, then: koszulSignInsert(q,,ϕ,eraseIdx(ϕs,n))=koszulSignInsert(q,,ϕ,ϕs)\text{koszulSignInsert}(q, \le, \phi, \text{eraseIdx}(\phi_s, n)) = \text{koszulSignInsert}(q, \le, \phi, \phi_s)

theorem

Erasing a Boson Preserves the Koszul Sign of a List

#koszulSign_erase_boson

Let F\mathcal{F} be a type of fields and q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic (bosonic or fermionic) to each field. Let \le be a decidable ordering relation on F\mathcal{F}. For any list of fields ϕs\phi_s and any index nn into that list, if the field at index nn is bosonic (q(ϕs[n])=bosonicq(\phi_s[n]) = \text{bosonic}), then the Koszul sign of the list ϕs\phi_s with the nn-th element removed is equal to the Koszul sign of the original list ϕs\phi_s. Mathematically: koszulSign(q,,eraseIdx(ϕs,n))=koszulSign(q,,ϕs)\text{koszulSign}(q, \le, \text{eraseIdx}(\phi_s, n)) = \text{koszulSign}(q, \le, \phi_s)

theorem

Koszul Sign of a List after Inserting an Element at Index nn

#koszulSign_insertIdx

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning statistics to these fields, and \le be a total and transitive ordering relation on F\mathcal{F}. For any list of fields ϕs\phi_s, any field ϕF\phi \in \mathcal{F}, and any index nlength(ϕs)n \leq \text{length}(\phi_s), let L=insertIdx(ϕs,n,ϕ)L' = \text{insertIdx}(\phi_s, n, \phi) be the list obtained by inserting ϕ\phi into ϕs\phi_s at position nn. The Koszul sign of the new list LL' is given by: koszulSign(L)=S(q(ϕ),Q(ϕs<n))koszulSign(ϕs)S(q(ϕ),Q(Lsorted<m))\text{koszulSign}(L') = \mathcal{S}(q(\phi), Q(\phi_s|_{<n})) \cdot \text{koszulSign}(\phi_s) \cdot \mathcal{S}(q(\phi), Q(L'_{\text{sorted}}|_{<m})) where: - koszulSign(L)\text{koszulSign}(L) is the sign factor in C\mathbb{C} incurred by sorting list LL according to \le. - S(s1,s2)\mathcal{S}(s_1, s_2) is the sign factor associated with the statistics s1s_1 and s2s_2 (typically (1)s1s2(-1)^{s_1 s_2}). - Q(L)Q(L) is the aggregate statistic of the fields in list LL (calculated via `ofList`). - ϕs<n\phi_s|_{<n} denotes the sublist consisting of the first nn elements of ϕs\phi_s. - LsortedL'_{\text{sorted}} is the list LL' sorted according to the relation \le. - mm is the index of the newly inserted field ϕ\phi in the sorted list LsortedL'_{\text{sorted}}.

theorem

Inserting the nn-th element back at index nn after its erasure recovers the original list

#insertIdx_eraseIdx

For any list rr and any natural number nn such that n<length(r)n < \text{length}(r), let rnr_n denote the element of rr at index nn. If the element at index nn is removed from rr, and then rnr_n is inserted back into the resulting list at index nn, the result is the original list rr. In mathematical notation, this is expressed as insertIdx(eraseIdx(r,n),n,rn)=r\text{insertIdx}(\text{eraseIdx}(r, n), n, r_n) = r.

theorem

Koszul Sign of a List after Erasing the Element at Index nn

#koszulSign_eraseIdx

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning statistics to these fields, and \le be a total and transitive ordering relation on F\mathcal{F}. For any list of fields ϕs\phi_s and any index n<length(ϕs)n < \text{length}(\phi_s), let ϕn\phi_n denote the element at index nn and ϕs{ϕn}\phi_s \setminus \{\phi_n\} be the list obtained by erasing this element. The Koszul sign of the resulting list is given by: koszulSign(ϕs{ϕn})=koszulSign(ϕs)S(q(ϕn),Q(ϕs<n))S(q(ϕn),Q(Lsorted<m))\text{koszulSign}(\phi_s \setminus \{\phi_n\}) = \text{koszulSign}(\phi_s) \cdot \mathcal{S}(q(\phi_n), Q(\phi_s|_{<n})) \cdot \mathcal{S}(q(\phi_n), Q(L_{\text{sorted}}|_{<m})) where: - koszulSign(L)\text{koszulSign}(L) is the sign factor in C\mathbb{C} incurred by sorting list LL according to \le. - S(s1,s2)\mathcal{S}(s_1, s_2) is the sign factor associated with the statistics s1s_1 and s2s_2. - Q(L)Q(L) is the aggregate statistic of the fields in list LL (calculated via `ofList`). - ϕs<n\phi_s|_{<n} is the sublist consisting of the first nn elements of ϕs\phi_s. - LsortedL_{\text{sorted}} is the list ϕs\phi_s sorted according to the relation \le. - mm is the index of the original nn-th element ϕn\phi_n after the list ϕs\phi_s has been sorted.

theorem

Koszul Sign of a List after Erasing its Minimum Element

#koszulSign_eraseIdx_insertionSortMinPos

Let F\mathcal{F} be a type of fields equipped with a function q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} that assigns a statistic to each field, and let \le be a total and transitive ordering relation on F\mathcal{F}. For any field ϕF\phi \in \mathcal{F} and any list of fields ϕs\phi_s, let LL denote the list formed by prepending ϕ\phi to ϕs\phi_s (i.e., L=ϕ::ϕsL = \phi :: \phi_s). Let ϕmin\phi_{\text{min}} be the minimum element of LL according to the relation \le, and let nminn_{\text{min}} be the index of this element in LL. The Koszul sign of the list obtained by erasing the element at index nminn_{\text{min}} is given by: koszulSign(L{ϕmin})=koszulSign(L)S(q(ϕmin),Q(L<nmin))\text{koszulSign}(L \setminus \{\phi_{\text{min}}\}) = \text{koszulSign}(L) \cdot \mathcal{S}(q(\phi_{\text{min}}), Q(L|_{<n_{\text{min}}})) where: - koszulSign(L)\text{koszulSign}(L) is the sign factor in C\mathbb{C} incurred by sorting the list LL according to \le. - S(s1,s2)\mathcal{S}(s_1, s_2) is the sign factor associated with the statistics s1s_1 and s2s_2. - Q(L)Q(L) is the aggregate statistic of the fields in list LL. - L<nminL|_{<n_{\text{min}}} is the sublist consisting of the first nminn_{\text{min}} elements of LL.

theorem

Swapping Leading Equivalent Fields Preserves the Koszul Sign

#koszulSign_swap_eq_rel_cons

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq : \mathcal{F} \to \text{FieldStatistic} a function that assigns a statistic to each field, and \le a decidable ordering relation on F\mathcal{F}. For any fields ϕ,ψF\phi, \psi \in \mathcal{F} such that ϕψ\phi \le \psi and ψϕ\psi \le \phi, and for any list of fields LL, the Koszul sign of the list formed by prepending ϕ\phi and then ψ\psi to LL is equal to the Koszul sign of the list formed by prepending ψ\psi and then ϕ\phi to LL: koszulSign(q,,ϕ::ψ::L)=koszulSign(q,,ψ::ϕ::L)\text{koszulSign}(q, \le, \phi :: \psi :: L) = \text{koszulSign}(q, \le, \psi :: \phi :: L)

theorem

Swapping Adjacent Equivalent Fields Preserves the Koszul Sign

#koszulSign_swap_eq_rel

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq : \mathcal{F} \to \text{FieldStatistic} be a function that assigns a statistic to each field (where 11 represents a fermion and 00 a boson), and \le be a decidable ordering relation on F\mathcal{F}. For any fields ϕ,ψF\phi, \psi \in \mathcal{F} that are equivalent under the relation (i.e., ϕψ\phi \le \psi and ψϕ\psi \le \phi), and for any lists of fields L1L_1 and L2L_2, the Koszul sign of the list formed by the concatenation of L1L_1, the elements ϕ,ψ\phi, \psi, and L2L_2 is equal to the Koszul sign of the list where the positions of ϕ\phi and ψ\psi are swapped: koszulSign(q,,L1++(ϕ::ψ::L2))=koszulSign(q,,L1++(ψ::ϕ::L2))\text{koszulSign}(q, \le, L_1 \mathbin{+\mkern-10mu+} (\phi :: \psi :: L_2)) = \text{koszulSign}(q, \le, L_1 \mathbin{+\mkern-10mu+} (\psi :: \phi :: L_2))

theorem

koszulSign(ϕ::ψ::L)=koszulSign L\text{koszulSign} (\phi :: \psi :: L) = \text{koszulSign } L for equivalent fields with same statistics

#koszulSign_eq_rel_eq_stat_append

Let F\mathcal{F} be a set of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic to each field (where 11 represents a fermion and 00 a boson), and \le be a transitive ordering relation on F\mathcal{F}. If ϕ,ψF\phi, \psi \in \mathcal{F} are two fields that are equivalent under the relation (i.e., ϕψ\phi \le \psi and ψϕ\psi \le \phi) and have the same statistic q(ϕ)=q(ψ)q(\phi) = q(\psi), then for any list of fields LL, the Koszul sign of the list starting with ϕ\phi and ψ\psi is equal to the Koszul sign of the list LL: koszulSign(q,,ϕ::ψ::L)=koszulSign(q,,L) \text{koszulSign}(q, \le, \phi :: \psi :: L) = \text{koszulSign}(q, \le, L)

theorem

koszulSign(L1++[ϕ,ψ]++L2)=koszulSign(L1++L2)\text{koszulSign}(L_1 \mathbin{+\mkern-10mu+} [\phi, \psi] \mathbin{+\mkern-10mu+} L_2) = \text{koszulSign}(L_1 \mathbin{+\mkern-10mu+} L_2) for equivalent fields ϕ,ψ\phi, \psi with same statistics

#koszulSign_eq_rel_eq_stat

Let F\mathcal{F} be a set of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic to each field (where 11 represents a fermion and 00 a boson), and \le be a transitive ordering relation on F\mathcal{F}. If ϕ,ψF\phi, \psi \in \mathcal{F} are two fields that are equivalent under the relation (i.e., ϕψ\phi \le \psi and ψϕ\psi \le \phi) and have the same statistic q(ϕ)=q(ψ)q(\phi) = q(\psi), then for any prefix list L1L_1 and suffix list L2L_2, the Koszul sign of the list formed by inserting ϕ\phi and ψ\psi between L1L_1 and L2L_2 is equal to the Koszul sign of the concatenation L1++L2L_1 \mathbin{+\mkern-10mu+} L_2: koszulSign(q,,L1++(ϕ::ψ::L2))=koszulSign(q,,L1++L2)\text{koszulSign}(q, \le, L_1 \mathbin{+\mkern-10mu+} (\phi :: \psi :: L_2)) = \text{koszulSign}(q, \le, L_1 \mathbin{+\mkern-10mu+} L_2)

theorem

The Koszul sign of a sorted list is 11

#koszulSign_of_sorted

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic (fermion or boson) to each field, and \le be an ordering relation on F\mathcal{F}. For any list of fields ϕs=[ϕ1,ϕ2,,ϕn]\phi_s = [\phi_1, \phi_2, \dots, \phi_n], if ϕs\phi_s is sorted according to the relation \le (i.e., the relation \le holds pairwise for all elements in their occurring order), then the Koszul sign of the list is 11.

theorem

The Koszul sign of an insertion-sorted list is 11

#koszulSign_of_insertionSort

Let F\mathcal{F} be a type of fields and q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function that assigns a statistic to each field. Let \le be an ordering relation on F\mathcal{F} that is both total and transitive. For any list of fields ϕs\phi_s, the Koszul sign of the list resulting from the insertion sort of ϕs\phi_s with respect to \le is equal to 11.

theorem

koszulSign(ϕs+ ⁣+ϕs)=koszulSign(sort(ϕs)+ ⁣+ϕs)koszulSign(ϕs)\text{koszulSign}(\phi_s \mathbin{+\!+} \phi_s') = \text{koszulSign}(\text{sort}(\phi_s) \mathbin{+\!+} \phi_s') \cdot \text{koszulSign}(\phi_s)

#koszulSign_of_append_eq_insertionSort_left

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic to each field, and \le be a total and transitive ordering relation on F\mathcal{F}. For any two lists of fields ϕs\phi_s and ϕs\phi_s', the Koszul sign of their concatenation ϕs+ ⁣+ϕs\phi_s \mathbin{+\!+} \phi_s' is given by: koszulSign(ϕs+ ⁣+ϕs)=koszulSign(sort(ϕs)+ ⁣+ϕs)koszulSign(ϕs)\text{koszulSign}(\phi_s \mathbin{+\!+} \phi_s') = \text{koszulSign}(\text{sort}(\phi_s) \mathbin{+\!+} \phi_s') \cdot \text{koszulSign}(\phi_s) where: - koszulSign(L)\text{koszulSign}(L) is the sign factor in C\mathbb{C} incurred by sorting list LL according to \le. - sort(ϕs)\text{sort}(\phi_s) is the list ϕs\phi_s sorted according to the relation \le. - ϕs+ ⁣+ϕs\phi_s \mathbin{+\!+} \phi_s' denotes the concatenation of the two lists.

theorem

koszulSign(ϕs+ ⁣+ϕs+ ⁣+ϕs)=koszulSign(ϕs+ ⁣+sort(ϕs)+ ⁣+ϕs)koszulSign(ϕs)\text{koszulSign}(\phi_s'' \mathbin{+\!+} \phi_s \mathbin{+\!+} \phi_s') = \text{koszulSign}(\phi_s'' \mathbin{+\!+} \text{sort}(\phi_s) \mathbin{+\!+} \phi_s') \cdot \text{koszulSign}(\phi_s)

#koszulSign_of_append_eq_insertionSort

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} be a function assigning a statistic to each field, and \le be a total and transitive ordering relation on F\mathcal{F}. For any three lists of fields ϕs\phi_s'', ϕs\phi_s, and ϕs\phi_s', the Koszul sign of their concatenation ϕs+ ⁣+ϕs+ ⁣+ϕs\phi_s'' \mathbin{+\!+} \phi_s \mathbin{+\!+} \phi_s' is given by: koszulSign(ϕs+ ⁣+ϕs+ ⁣+ϕs)=koszulSign(ϕs+ ⁣+sort(ϕs)+ ⁣+ϕs)koszulSign(ϕs)\text{koszulSign}(\phi_s'' \mathbin{+\!+} \phi_s \mathbin{+\!+} \phi_s') = \text{koszulSign}(\phi_s'' \mathbin{+\!+} \text{sort}(\phi_s) \mathbin{+\!+} \phi_s') \cdot \text{koszulSign}(\phi_s) where: - koszulSign(L)\text{koszulSign}(L) is the sign factor in C\mathbb{C} incurred by sorting list LL according to \le. - sort(ϕs)\text{sort}(\phi_s) is the list ϕs\phi_s sorted according to the relation \le. - + ⁣+\mathbin{+\!+} denotes the concatenation of lists.

theorem

Permuting a prefix of equivalent fields preserves the Koszul sign

#koszulSign_perm_eq_append

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} a function assigning a statistic to each field, and \le a transitive ordering relation on F\mathcal{F}. Let ϕF\phi \in \mathcal{F} be a field, and let ϕs\phi s and ϕs\phi s' be lists of fields such that ϕs\phi s' is a permutation of ϕs\phi s. If every field ϕϕs\phi' \in \phi s is equivalent to ϕ\phi under the ordering (i.e., ϕϕ\phi \le \phi' and ϕϕ\phi' \le \phi), then for any list ϕs2\phi s_2, the Koszul sign of the concatenation of ϕs\phi s and ϕs2\phi s_2 is equal to the Koszul sign of the concatenation of ϕs\phi s' and ϕs2\phi s_2: koszulSign(q,,ϕs+ ⁣+ϕs2)=koszulSign(q,,ϕs+ ⁣+ϕs2)\text{koszulSign}(q, \le, \phi s \mathbin{+\!+} \phi s_2) = \text{koszulSign}(q, \le, \phi s' \mathbin{+\!+} \phi s_2)

theorem

Permuting a Sublist of Equivalent Fields Preserves the Koszul Sign

#koszulSign_perm_eq

Let F\mathcal{F} be a type of fields, q:FFieldStatisticq: \mathcal{F} \to \text{FieldStatistic} a function assigning a statistic to each field, and \le a transitive ordering relation on F\mathcal{F}. Let ϕF\phi \in \mathcal{F} be a field, and let ϕs,ϕs,ϕs1,ϕs2\phi s, \phi s', \phi s_1, \phi s_2 be lists of fields. If ϕs\phi s' is a permutation of ϕs\phi s and every field ϕϕs\phi' \in \phi s is equivalent to ϕ\phi under the ordering (i.e., ϕϕ\phi \le \phi' and ϕϕ\phi' \le \phi), then the Koszul sign is invariant under the permutation of this sublist: koszulSign(q,,ϕs1+ ⁣+ϕs+ ⁣+ϕs2)=koszulSign(q,,ϕs1+ ⁣+ϕs+ ⁣+ϕs2)\text{koszulSign}(q, \le, \phi s_1 \mathbin{+\!+} \phi s \mathbin{+\!+} \phi s_2) = \text{koszulSign}(q, \le, \phi s_1 \mathbin{+\!+} \phi s' \mathbin{+\!+} \phi s_2)

Kernel SciencePhyslibSearch · powered by Physlib & Gemini embeddings