# Quantum Boolean algebras

N/A
N/A
Protected

Share "Quantum Boolean algebras"

Copied!
38
0
0

Повний текст

(1)

c

Journal “Algebra and Discrete Mathematics”

### Quantum Boolean algebras

Rafael Díaz

Communicated by V. A. Artamonov

A b s t r ac t . We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces.

We study quantum Boolean algebras from the logical and the set theoretical viewpoints.

1. Introduction

After Stone  and Zhegalkin , Boole’s main contribution to science  can be understood as the realization that the mathematics of logical phenomena is controlled — to a large extend — by the field Z2 ={0,1} with two elements; in contrast the mathematics of classical physical phenomena is controlled — to a large extend — by the field R of real numbers. The switch from Z2 to R corresponds with a deep ontological jump from logical to physical phenomena. The switch from R toCcorresponds to the jump from classical to quantum physics.

What makes the logic/physics jump possible is the fact that Z2 may be regarded as an object of two different categories. On the one hand, it is a field (Z2,+, .) with sum and product defined by making 0 the neutral element and 1 the product unit. On the other hand, it is a set of truth values with 0 and 1 representing falsity and truth, respectively. Indeed, (Z2,∨,∧,(·)) is a Boolean algebra: a complemented distributive lattice with minimum 0 and maximum 1. The operations∨,∧, and (·) correspond with the logical connectives OR, AND, and NOT. The two viewpoints are

2010 MSC:06E75, 16S32, 81P10.

Key words and phrases:Boolean algebras, Weyl algebras, quantum logic.

(2)

related by the identities:ab=a+b+ab, ab=ab, a=a+ 1. These identities, together with the inverse relationa+b= (a∧b)∨(a∧b), allow us to switch back and forth from the algebraic to the logical viewpoint.

By and large, the logical and algebraic viewpoints have remained separated. In this work, in order to explore quantum-like phenomena in characteristic 2, we place ourselves at the jump. Our algebraic viewpoint is, in a sense, complementary to the quantum logic approach initiated by Birkhoff and von Neumann  based on the theory of lattices. For example, while the meet in quantum logic is a commutative connective, we propose in this work a quantum analogue for the meet which turns out to be non-commutative. The appearance of non-commutative operations is an essential feature of quantum mechanics [1, 7, 22].

We take as our guide the well-known fact that the quantization of canonical phase space may be identified with the algebra of differential operators on configuration space. In analogy with the real/complex case, we introduce the algebra BDOn of Boolean differential operators onZn2. We provide a couple of presentations by generators and relations of BDOn, giving rise to the Boole-Weyl algebras BAnand the shifted Boole-Weyl algebras SBAn. We call these algebras the quantum Boolean algebras.

We study the structural coefficients of BAn and SBAn in various bases.

Having introduced quantum Boolean algebras, we proceed to study them from the logical and set theoretical viewpoints. For us, the main difference between classical and quantum logic rest on the fact that classical observations, propositions, can be measured without, in principle, modifying the state of the system; quantum observations, in contrast, are quantum operators: the measuring process changes the state of the system.

Indeed, regardless of the actual state of the system, after measurement the system will be an eigenstate of the observable. Quantum observables are operators acting on the states of the system, and thus quite different to classical observables which are descriptions of the state of the system.

This work is organized as follows. In Section 2 we review some stan- dard facts on regular functions on affine spaces overZ2. In Section 3 we introduce BDOn, the algebra of Boolean differential operators on Zn2. In Section 4 we introduce the Boole-Weyl algebra BAn which is a presentation by generators and relations of BDOn. We describe the structural coefficients of BAn in several bases. In Section 5 we introduce the shifted Boole-Weyl algebra SBAn which is another presentation by generators and relations of BDOn, and describe the structural coefficients of SBAnin several bases. In Section 6 we discuss the logical aspects of our constructions: we introduce a quantum operational logic that generalizes

(3)

classical propositional logic, and for which Boolean differential operators play a semantic role akin to that played by truth functions in classical propositional logic. We use the theory of operads and props to describe our results. In Section 7 we adopt a set theoretical viewpoint and show that just as classical propositional logic is intimately related with PP(x), the Boolean algebra of sets of subsets of x, quantum operational logic is intimately related with PP(x⊔x) the quantum Boolean algebra of sets of subsets of two disjoint copies of x. In the final Section 8 we make some closing remarks and mention a few topics for future research.

2. Regular functions on Boolean affine spaces

Our main goal in this work is to study the Boolean analogue for the Weyl algebras, and to describe those algebras from a logical and a set theoretical viewpoints. Fixing a fieldk, the Weyl algebra Wn over kcan be identified with the k-algebra of algebraic differential operators on the affine space An(k) = kn. By definition [14, 19] the k-algebra k[An] of regular functions on kn is thek-algebra of maps

f:knk

such that there exists a polynomial Fk[x1, . . . , xn] withf(a) =F(a) for allakn. Ifk is a field of characteristic zero, then the k-algebra of regular functions onkncan be identified withk[x1, . . . , xn] the polynomial ring of over k. Let∂1, . . . , ∂n be the derivations ofk[x1, . . . , xn] given by

ixj =δi,j for i, j∈[n] ={1, . . . , n}. The k-algebra DOn of differential operators onkn is the subalgebra of

Endk(k[x1, . . . , xn])

generated byi and the operators of multiplication byxi fori∈[n].

By definition, the Weyl algebra An is thek-algebra defined via gene- rators and relations as

khx1,. . ., xn, y1, . . . , yni/hxixj−xjxi, yiyj−yjyi, yixj−xjyi, yixi−xiyi−1i.

where khx1, . . . , xn, y1, . . . , yniis the free associative k-algebra generated byx1, . . . , xn, y1, . . . , yn, andhxixjxjxi, yiyjyjyi, yixjxjyi, yixixiyi−1i is the ideal generated by the relations xixj =xjxi andyiyj = yjyi for i, j ∈ [n], yixj = xjyi for i 6= j ∈ [n], yixi = xiyi + 1 for i ∈ [n]. The Weyl algebra An comes with a natural representation

(4)

An → Endk(k[x1, . . . , xn]) sending yi to i and xi to the operator of multiplication by xi. This representation induces an isomorphism of algebras An→DOn.

We proceed to study the analogue of the Weyl algebras for the Boolean affine spacesAn(Z2) =Zn2. First, we review some basic facts on regular functions onZn2. Let M(Zn2,Z2) be theZ2-algebra of all maps from Zn2 to Z2 with pointwise addition and multiplication. TheZ2-algebraZ2[An] of regular functions onZn2 is the sub-algebra of M(Zn2,Z2) consisting of the mapsf:Zn2 →Z2 for which there exists a polynomial F ∈Z2[x1, . . . , xn] such that f(a) = F(a) for all a ∈ Zn2. In this case Z2[An] is not a polynomial ring; instead we have the following result.

Lemma 1. There is an exact sequence of Z2-algebras

0→ hx21+x1, . . . ., x2n+xni →Z2[x1, . . . , xn]→Z2[An]→0 wherehx21+x1, . . . ., x2n+xniis the ideal generated by the relationsx2i =xi

for i∈[n].

Therefore the ringZ2[An] of regular functions onZn2 can be identified with the quotient ring

Z2[An] =Z2[x1, . . . , xn]/hx21+x1, . . . ., x2n+xni.

Often we think ofZn2 as a ring, with coordinate-wise sum and product.

We identify Zn2 with P[n], the set of subsets of [n], via characteristic functions:a∈Zn2 is identified with the subset a⊆[n] such that iaif and only if ai = 1. With this identification the productab of elements in Zn2 agrees with the intersection ab of the sets a and b; the sum a+b corresponds with the symmetric differencea+b= (a∪b)\(a∩b);

the elementa+ (1, . . . ,1) is identified with the complementaof a. Note thatab=a+b+ab. We let PP[n] be the set of families of subsets of [n]. For a∈P[n], let ma:Zn2 →Z2 be the characteristic function of the set {a} ⊆ P[n]. Fora∈ P[n] non-empty, let xa ∈ Z2[x1, . . . , xn] be the monomial xa=Qi∈axi. Also set x = 1. The monomial xa defines the characteristic function xa: Zn2 → Z2 of the set {b |ab} ⊆P[n]. For a∈P[n] non-empty, letwa∈Z2[x1, . . . , xn] be given bywa=Qi∈a(xi+1).

Also setw = 1. The monomial wa defines the characteristic function wa:Zn2 →Z2 of the set {b|ba} ⊆P[n].

Lemma 2 below follows from the definitions above and the M¨obius inversion formula , which can be stated as follows. Given maps

(5)

f, g: P[n]→R, withR a ring of characteristic 2, then f(b) =X

a⊆b

g(a) if and only if g(b) =X

a⊆b

f(a).

Lemma 2. The following identities hold in Z2[An]:

1)ma=xawa. 2) xa=X

a⊆b

mb. 3) ma=X

a⊆b

xb. 4) wb=X

a⊆b

ma. 5)ma=X

a⊆b

wb. 6) wb =X

a⊆b

xa. 7) xb =X

a⊆b

wa. 8) mambabma. 9) xaxb =xa∪b. 10) wawb=wa∪b.

Note that Z2[An] = M(Zn2,Z2), indeed a map f:Zn2 → Z2 can be written as

f = X

f(a)=1

ma= X

f(a)=1

xawa= X

f(a)=1

Y

i∈a

xi

Y

i∈a

(xi+ 1)

= X

f(a)=1,b⊆a

xa∪b= X

f(a)=1,a⊆b

xb.

From Lemma 2 we see that there are several natural bases for the Z2-vector space

Z2[An] =Z2[x1, . . . , xn]/hx21+x1, . . . ., x2n+xni,

namely we can pick{ma|a∈P[n]},{xa|a∈P[n]}, or{wa|a∈P[n]}.

We use the following notation to write the coordinates of f ∈Z2[An] in each one of these bases

f = X

a∈P[n]

f(a)ma= X

a∈P[n]

fx(a)xa= X

a∈P[n]

fw(a)wa.

We obtain three linear maps ff,ffx and ffw fromZ2[An] to M(Zn2,Z2). The coordinates f,fx and fw are connected, via the M¨obius inversion formula, by the relations:

fx(b) =X

a⊆b

f(a), f(b) =X

a⊆b

fx(a), fw(b) =X

a⊆b

f(a),

f(b) =X

a⊆b

fw(a), fx(a) =X

a⊆b

fw(b), fw(a) =X

a⊆b

fx(b).

(6)

The mapsffx andffw fail to be ring morphisms. Instead we have the identities:

(f g)x(c) = X

a∪b=c

fx(a)gx(b) and (f g)w(c) = X

a∪b=c

fw(a)gw(b).

We define a predicateO on finite sets as follows: given a finite seta, then Oa holds if and only if the cardinality of ais an odd number. In other words,O is the map from finite sets to Z2 such thatOa= 1 if and only if the cardinality ofais odd.

Example 3. Let C ∈ PP[n]. An ordered k-covering of a ∈ P[n] by elements of C is a tuple c1, . . . , ckC such thatc1∪ · · · ∪ck = a. Let k-CovC(a) be the set ofk-coverings ofaby elements ofC. Then a∈P[n]

belongs toC if and only if|k-CovC(a)|is odd for everyk>1. Indeed, let f ∈Z2[An] be given by

f =X

c∈C

xc = X

a∈P[n]

1C(a)xa,

where 1C: P[n]→Z2 is the characteristic function ofC. Sincefk=f for everyf ∈Z2[An], we have

X

a∈P[n]

1C(a)xa=f =fk= X

a∈P[n]

X

a1∪···∪ak=a

Yk

i=1

1C(ai)

xa

= X

a∈P[n]

O(k-CovC(a))xa.

We conclude that 1C(a) =O(k-CovC(a)), and thus aC if and only if

|k-CovC(a)|is odd.

3. Differential operators on Boolean affine spaces

Next we consider the algebra of differential operators on affine Boolean spaces. Note that the partial derivativesionZ2[x1, . . . , xn] do not descent to well-defined operators onZ2[An]; indeed if we had such an operator, then 0 = xi +xi = ix2i = ixi = 1. The Boolean partial derivative

if:Zn2 →Z2 of a map f:Zn2 →Z2 is given [6, 17] by

if(x) =f(x+ei) +f(x)

where ei ∈Zn2 is the vector with vanishing entries except at position i.

This definition yields well-defined operators i: Z2[An]→ Z2[An]. The

(7)

operatorsi are skew derivations; indeed they satisfy the twisted Leibnitz identity

i(f g) = (∂if)g+ (sif)(∂ig)

where the shift operators si:Z2[An] → Z2[An] are given by sif(x) = f(x+ei). Indeed:

i(f g)(x) =f(x+ei)g(x+ei) +f(x)g(x)

= [f(x+ei) +f(x)]g(x) +f(x+ei)[g(x+ei) +g(x)]

=if(x)g(x) +sif(x)∂ig(x).

The operators i are nilpotent:

i2f(x) =if(x+ei) +if(x) =f(x) +f(x+ei) +f(x+ei) +f(x) = 0.

Definition 4. TheZ2-algebra BDOn of Boolean differential operators on Zn2 is the Z2-subalgebra of EndZ2(Z2[An]) generated by i and the operators of multiplication by xi fori∈[n].

Theorem 5. The following identities hold for xi, ∂i, si ∈ BDOn and i∈[n]:

1. x2i =xi; 2. ∂i2 = 0; 3. s2i = 1; 4. ∂i=si+ 1;

5. ∂isi =sii=i; 6. si=i+ 1; 7. sixi =xisi+si= (xi+ 1)si; 8. ∂ixi =xii+si=xii+i+ 1.

Proof. We have already shown that x2i = xi and i2 = 0. For the other identities we have

s2if(x) =sif(x+ei) =f(x+ei+ei) =f(x);

if(x) =f(x+ei) +f(x) =sif(x) +f(x) = (si+ 1)f(x);

siif(x) =if(x+ei) =f(x+ei+ei) +f(x+ei) =f(x) +f(x+ei) =

if(x);

isif(x) =sif(x+ei) +sif(x) = f(x+ei+ei) +f(x+ei) =f(x) + f(x+ei) =if(x);

sixif(x) = (xi+1)f(x+ei) =xif(x+ei)+f(x+ei) =xisif(x)+sif(x) = (xisi+si)f(x);

sif(x) = f(x+ei) = f(x +ei) + f(x) + f(x) = if(x) + f(x) = (∂i+ 1)f(x);

i(xif)(x) =xif(x+ei) +f(x+ei) +xif(x) =xi(f(x+ei) +f(x)) + f(x+ei), thus

i(xif) =xiif +f(x+ei) = (xii+si)f = (xii+i+ 1)f.

(8)

The operator i acts on the basesma,xaand wa as follows:

ima=ma+ei+ma,

ixa=

(xa\i ifia

0 otherwise and iwa=

(wa\i ifia 0 otherwise.

From these expressions we obtain that:

if(a) = 1 if and only iff(a)6=f(a+ei), that is,

if = X

a∈P[n],f(a)6=f(a+ei)

ma.

•(∂if)x(a) =fx(a∪i) if i /a, and (∂if)x(a) = 0 if ia, that is,

if = X

i∈a∈P[n]

fx(a)xa−i.

•(∂if)w(a) =fw(a∪i) if i /a, and (∂if)w(a) = 0 if ia, that is,

if = X

i∈a∈P[n]

fw(a)wa−i.

More generally one can show by induction, fora, b∈P[n], that:

bma=X

c⊆b

ma+c,

bxa=

(xa\b ifba

0 otherwise, and bwa=

(wa\b ifba 0 otherwise.

By definition BDOn⊆EndZ2(Z2[An]) acts naturally onZ2[An], so we get a map

BDOnZ2Z2[An]→Z2[An].

Proposition 6. Consider maps D: P[n]×P[n]→Z2 and f: P[n]→Z2. 1. Let D= P

a,b∈P[n]

D(a, b)mab ∈BDOn, f = P

c∈P[n]

f(c)mc ∈ Z2[An], and Df = P

a∈P[n]

Df(a)ma. Then we have Df(a) =X

e⊆b

D(a, b)f(a+e).

(9)

2. Let D= P

a,b∈P[n]

Dx(a, b)xab ∈BDOn, f = P

c∈P[n]

fx(c)xc ∈Z2[An], andDf = P

e∈P[n]

Dfx(e)xe. Then Dfx(e) = X

a,b⊆c

a∪(c\b)=e

Dx(a, b)fx(c).

Proof.

1. Df = X

a,b,c∈P[n]

D(a, b)f(c)mabmc = X

a,e⊆b,c

D(a, b)f(c)mamc+e

= X

a,e⊆b

D(a, b)f(a+e)ma= X

a∈P[n]

X

e⊆b

D(a, b)f(a+e)

ma.

2. Df = X

a,b,c∈P[n]

Dx(a, b)fx(c)xabxc = X

a,b⊆c

Dx(a, b)fx(c)xa∪c\b

= X

e∈P[n]

X

a,b⊆c

a∪(c\b)=e

Dx(a, b)fx(c)

xe.

Theorem 7. For n>1 we have BDOn= EndZ2(Z2[An]).

Proof. Note that dim

EndZ2(Z2[An])

= dim(Z2[An])dim(Z2[An]) = 2n2n= 22n. The set {xab |a, b ∈ P[n]} has 22n elements and generates BDOn as a vector space over Z2; thus it is enough to show that it is a linearly independent set. Suppose that

X

a,b∈P[n]

f(a, b)xab = X

b∈P[n]

X

a∈P[n]

f(a, b)xa

b = 0.

Pick a minimal setc∈P[n] such that P

a∈P[n]

f(a, c)xa6= 0. We have X

a,b∈P[n]

f(a, b)xab

(xc) = X

b∈P[n]

X

a∈P[n]

f(a, b)xa

b(xc)

= X

a∈P[n]

f(a, c)xa= 0.

(10)

Therefore, since{xa|a∈P[n]} is a basis forZ2[An], we havef(a, c) = 0 in contradiction with the factPa∈P[n]f(a, c)xa 6= 0. We conclude that dim BDOn= 22n yielding the desired result.

Putting together Proposition 6 and Theorem 7 we get a couple of explicit ways of identifying BDOn with M2n(Z2), the algebra of square matrices of size 2n with coefficients in Z2. Note that M2n(Z2) may be identified with M(P[n]×P[n],Z2). Moreover, we can identify M(P[n]× P[n],Z2) with the set of directed graphs with vertex set P[n] and without multiple edges as follows: given a matrixM ∈M2n(Z2) its associated graph has an edge frombtoaif and only ifMa,b= 1. Let R : BDOn→M2n(Z2) be theZ2-linear map constructed as follows. Consider the bases

{mab |a, b∈P[n]} for BDOn and {ma|a∈P[n]} forZ2[An].

For a, b ∈ P[n], let R(mab) be the matrix of mab on the basis ma. The action of mab on mc is given by mabmc = maPe⊆bmc+e = P

e⊆bmamc+e=maifc+aband zero otherwise. Therefore, the matrix R(mab) is given forc, d∈P[n] by the rule

R(mab)c,d=

(1 ifc=aand d+ab, 0 otherwise.

Example 8. The graph of R(m{1,2}{2,3}) is show in Figure 1.

F i g u r e 1 . Graph of the matrix R(m{1,2}{2,3}).

For a second representation consider theZ2-linear map S : BDOn→ M2n(Z2) constructed as follows. Consider the bases

{xab |a, b∈P[n]} for BDOn and {xa|a∈P[n]} forZ2[An].

For a, b∈ P[n] let S(xab) be the matrix of xab on the basisxa. The action ofxab on xc is given by

xabxc =

(xa∪c\b ifbc, 0 otherwise.

(11)

Therefore, the matrix S(xab) is given forc, d∈P[n] by the rule S(xab)c,d=

(1 ifc=ad\b and bd, 0 otherwise.

Example 9. The graph associated to the matrix S(m{1}{3}) is shown in Figure 2.

F i g u r e 2 . Graph of the matrix S(m{1}{3}).

4. Boole-Weyl Algebras

First we motivate, from the viewpoint of canonical quantization, our definition of Boole-Weyl algebras. Canonical phase space for a field k of characteristic zero can be identified with the affine space kn×kn. The Poisson bracket on k[x1, . . . , xn, y1, . . . , yn] in canonical coordinates x1, . . . , xn, y1, . . . , yn on kn×kn is given by

{xi, xj}= 0, {yi, yj}= 0, {xi, yj}=δi,j.

Equivalently, the Poisson bracket is given forf, gk[x1, . . . , xn, y1, . . . , yn] by

{f, g}= Xn

i=1

∂f

∂xi

∂g

∂yi

∂f

∂yi

∂f

∂xi

.

Canonical quantization may be formulated as the problem of promoting the commutative variables xi and yj into non-commutative operators xbi

and ybj satisfying the commutation relations:

[xbi,xbj] = 0, [ybi,ybj] = 0, [ybi,xbj] =δi,j.

Note that the free algebra generated byxbi andybj subject to the above relations is precisely what is called the Weyl algebra and its usually denoted by An. Now let k = Z2 and consider the affine phase spaces

(12)

Zn2 ×Zn2. Let x1, . . . , xn, y1, . . . , yn be canonical coordinates on Zn2 ×Zn2. The analogue of the Poisson bracket

{,}:Z2[A2n]⊗Z2[A2n]→Z2[A2n] can be expressed forf, g∈Z2[A2n] as

{f, g}= Xn

i=1

∂f

∂xi

∂g

∂yi

+ ∂f

∂yi

∂f

∂xi

, where ∂x

i and∂y

i are the Boolean partial derivatives along the coordinates xi and yi. Clearly, the full set of axioms for a Poisson bracket will not longer hold, e.g. Boolean derivatives are skew derivations. Nevertheless, the bracket is still determined by its values on the canonical coordinates:

{xi, xj}= 0,{yi, yj}= 0,{xi, yj}=δi,j. Canonical quantization consists in promoting the commutative variablesxi andyj to non-commutative operatorsxbi and ybj satisfying the commutation relations:

[xbi,xbj] = 0, [ybi,ybj] = 0, [ybi,xbj] = 0 fori6=j, and [ybi,xbi]si = 1.

Note that in the last relation we use the twisted commutator [f, g]si =f g+ (sif)g;

this choice is expected since the operatorsybi are skew derivations instead of usual derivations. The relation [ybi,xbi]si = 1 can be equivalently written using commutators as [ybi,xbi] =ybi+ 1.

Definition 10. The Boole-Weyl algebra BAnis the quotient ofZ2hx1, . . . , xn, y1, . . . , yni, the free associative Z2-algebra generated by x1, . . . , xn, y1, . . . , yn, by the ideal

hx2i +xi, xixj+xjxi, yiyj+yjyi, y2i, yixj+xjyi, yixi+xiyi+yi+ 1i.

Theorem 11. The mapZ2hx1, . . . , xn, y1, . . . , yni →EndZ2(Z2[An])sen- ding xi to the operator of multiplication by xi, and yi to i, descends to an isomorphism BAn→EndZ2(Z2[An]) of Z2-algebras.

Proof. By Theorem 5 the given map descends. By definition it is a surjective map BAn→ BDOn= EndZ2(Z2[An]). Moreover, this map is an isomorphisms since dim BAn

= dim EndZ2(Z2[An]). Indeed using the commutation relations it is easy to check that the natural map

Z2[x1, . . . , xn]/hx2i +xii ⊗Z2[y1, . . . , yn]/hy2ii →BAn

(13)

is surjective. If P

a,b∈P[n]

f(a, b)xayb is in the kernel of the latter map, then the Boolean differential operator P

a,b∈P[n]

f(a, b)xab would vanish, and therefore the coefficients f(a, b) must vanish as well. Thus

dim(BAn) = dim(Z2[x1, . . . , xn]/hx2i +xii)dim(Z2[y1, . . . , yn]/hyi2i)

= 2n2n= dim(Z2[An])dim(Z2[An]) = dim(EndZ2(Z2[An])).

Theorem 12. The mapZ2hx1, . . . , xn, y1, . . . , yni →EndZ2(Z2[An]) sen- ding xi to the operator of multiplication by wi = xi + 1, and yi to the operatori, descends to an isomorphism BAn →EndZ2(Z2[An]) of Z2-algebras.

Proof. Follows from the fact that wi and j satisfy exactly the same relation asxi and j.

Corollary 13. Any identity in BAninvolvingxiandj has an associated identity involving wi and j obtained by replacingxi by wi.

Lemma 14. Fora, b, c, d∈P[n]the following identities hold in BWn: 1. ybmc = P

b1⊆b2⊆b

mc+b2yb1. 2. maybmcyd= P

d⊆e

e\d⊆a+c⊆b

maye. 3. ybxc = P

k1⊆k2⊆b∩c

xc\k2yb\k1. 4. xaybxcyd = P

a⊆e,d⊆f

c(a, b, c, d, e, f)xeyf, where c(a, b, c, d, e, f) = O{k1k2bc|a∪(c\k2) =e, b\k1 =f \d}.

Proof. 1. By Theorem 11 it is enough to show that the differential opera- tors associated with both sides of the equation are equal. Consider the operator of multiplication by f: Zn2 → Z2 and let g:Zn2 → Z2 be any other map. The twisted Leibnitz rule i(f g) = (∂if)g+ (sif)∂igcan be extended, sincesi and i commute, to the identity:

b(f g) = X

b1⊔b2=b

(sb2b1f)∂b2g, thus the following identity holds in BAn:

ybf = X

b1⊔b2=b

sb2(∂b1f)yb2 forf ∈Z2[x1, . . . , xn].

(14)

In particular we obtain that ybmc= X

b1⊔b2⊆b

sb2sb1(mc)yb2 = X

b1⊔b2⊆b

mc+b1+b2yb2 = X

b1⊆b2⊆b

mc+b2yb1.

2. We have

maybmcyd= X

b1⊆b2⊆b

mamc+b2yb1yd= X

b1⊆b2⊆b

δa,c+b2mayb1⊔d

= X

b1⊆a+c⊆b

mayb1⊔d= X

d⊆e

e\d⊆a+c⊆b

maye.

where the last identity follows from the fact thatb2=a+cande=b1d.

3. From the relationsyixj =xjyi for i6= j and yixi =xiyi+yi+ 1 we can argue as follows. If a letteryi is placed just to the left of axj we can move it to the right, since these letters commute. If instead we have a productyixi, then three options arises:

a) yi moves to the right ofxi; b) yi absorbsxi;

c) xi and yi annihilate each other leaving an 1.

Callk1 the set of indices for which c) occurs, and k2 the set of indices for which either b) or c) occur. Thenk1k2bcand the set for which option a) occurs isbc\k2. Thus the desired identity is obtained. 4. We have

xaybxcyd= X

k1⊆k2⊆b∩c

xa∪c\k2y(b\k1)⊔d= X

a⊆e,d⊆f

c(a, b, c, d, e, f)xeyf, wherec(a, b, c, d, e, f) =O{k1k2b∩c|a∪(c\k2) =e, b\k1=f\d}.

Example 15. y{1}m{1} =m{1}+m+m{∅}y{1}; m{1}y{1}m{1}y{1} = m{1}y{1}; y{1}m{1,2} =m{1,2}+m{2}+m{2}y{1}; m{2}y{1}m{1,2}y{1} = m{2}y{1};y{1,2}m{1,2,3}=m{1,2,3}+m{2,3}+m{1,3}+m{1}+m{2,3}y{1}+ m{3}y{1}+m{1,3}y{2}+m{3}y{2}+m{3}y{1,2};m{3}y{1,2}m{1,2,3}y{1} = m{3}y{1,2}.

Example 16. For i∈[k] assume given Ai ∈PP[n] and fi =Pa∈Aiya. Then

f1· · ·fk= X

b∈P[n]

O{(a1, . . . , ak)∈A1×. . .×Ak |a1⊔ · · · ⊔ak =b}yb.

(15)

In particular, for A∈PP[n] andf =Pa∈Aya, we get that fk= X

b∈P[n]

O{a1, . . . , akA|a1⊔ · · · ⊔ak=b}yb. For example, ifA= P[n] then fork>2 we have

fk= X

b∈P[n]

O{a1, . . . , ak∈P[n]|a1⊔· · ·⊔ak=b}yb = X

b∈P[n]

(k|b| mod 2)yb, thusfk=f ifkis odd and fk = 1 ifk is even.

From Lemma 2 we see that there are several natural basis for BAn, namely:

{mayb|a, b∈P[n]}, {xayb |a, b∈P[n]}, {wayb |a, b∈P[n]}.

We write the coordinates of f ∈BAn in these bases as:

f = X

a,b∈P[n]

fm(a, b)mayb = X

a,b∈P[n]

fx(a, b)xayb = X

a,b∈P[n]

fw(a, b)wayb. These coordinates systems are connected by the relations:

fx(b, c) =X

a⊆b

fm(a, c), fm(b, c) =X

a⊆b

fx(a, c), fw(b, c) =X

a⊆b

fm(a, c), fm(b, c) =X

a⊆b

fw(a, c), fx(a, c) =X

a⊆b

fw(b, c), fw(a) =X

a⊆b

fx(b, c).

Theorem 17.Forf, g∈BAnthe following identities hold fora, e, h∈P[n]:

1) (f g)m(a, e) = P

b,c,d⊆e

e\d⊆a+c⊆b

fm(a, b)gm(c, d).

2) (f g)x(e, h) = P

a⊆e,b,c,d⊆h

c(a, b, c, d, e, h)fx(a, b)gx(c, d),where

c(a, b, c, d, e, h) =Onk1k2bc|a∪(c\k2) =e, b\k1 =h\do. Proof. 1. Let f = Pa,b∈P[n]fm(a, b)mayb, g = Pc,d∈P[n]gm(c, d)mcyd, then

f g= X

a,b,c,d∈P[n]

fm(a, b)gm(c, d)maybmcyd

= X

a,b,c,d,e∈P[n]

fm(a, b)gm(c, d) X

d⊆e

e\d⊆a+c⊆b

maye

= X

d⊆e,e\d⊆a+c⊆b

fm(a, b)gm(c, d)maye.

Посилання

СУПУТНІ ДОКУМЕНТИ

The basic concepts and results related to the Boolean Groebner bases and their application for computing the algebraic immunity of vectorial Boolean functions are considered..

Some aspects of stabilized autodyne application Above-considered peculiarities of characteristic formation and respectively the output signals of the autodynes, which reveal

Recent research in English and Japanese sug- gests a more textured view of vocabulary structure, in which arbitrariness is complemented by iconicity (aspects of form resemble

Many problems associated with the technical and technological process aspects of the manufacturing printed production have been solved. Automatic layouting items

enterprise as a system of interrelated and interdependent business pro- cesses. To implement these processes it is necessary to make deci- sions and carry out certain actions. As

Analyzing technology changing towards elimination human factor in decision making we can predict that in the future success will be achieved by those companies who will meet

Our approach consists from two aspects of the prob- lem: extracting security related information from open source (blogs, security bulletins, exploits) and linking and mapping

Further we list some data on the Stark shifts excitons in a GaAs semiconductor quantum dot (table 2). The corresponding accuracy.. is of the order of 1%, however, is should be

. We considered the stages of this procedure in question 2.3, so we will not dwell on them... The formal procedure is regulated by Art. In general, agencies usually adopt

Given the above properties of the compounds that are part of the essential oils of leaves and flowers of Cra- taegus monogyna L., they can be used in the future as components

aspects of the manifestation of complexity, we also designed various measures of complexity that specifically respond to critical and crisis phenomena [1-4].. In this paper, we

Blondo19, who has experience as a top manager in retail, distinguishes seven types of innovation:  radical innovations for example, delivery of products by drones; 

Some aspects of its functioning are investigated in this work, in particular, the preconditions for the differentiation of administrative proceedings in Ukraine, the problem

Control in a hierarchical active system on the basis of entropy paradigm of subjective analysis.. Transactions of the institute

Current research is devoted to the analysis of independent foreign inclusions (FI) used in typo ORJLFDOO\GL൵HUHQWODQJXDJHVLQRUGHUWRLGHQWLI\WKH most frequently applied

Many exactly solvable models in classical and quantum mechanics admit an alternative description in terms of a corresponding quasi-linear algebra.. There are many open questions

Key words: quantum deformations; quantum groups; Hopf module algebras; covariant quantum spaces; crossed product algebra; twist quantization, quantum Weyl algebra, κ-

2, we prove that the problem (3) has a unique solution and generates the dissipative dynamical system possessing a compact global attractor.. The proof is split into several

All future aspects of new project activities and possible problems are analyzed in the business plan. The relevance of business plan depends on projects features. The business plan

The systematization of the main factors: which determine the quality of service; related to the purchase of drugs that cause dissatisfaction; which determine the dissatisfaction of

The problem of Intentional Destructive Electromagnetic Impacts (IDEI) on power systems has become recently more and more actual in connection with two modern trends: the extension

The Ontologies are developed and can be used in solving various problems, including joint use of people or software agents to possible accumulation and reuse of knowledge in

Key words: English for special purposes (ESP), extract information, lexical content, specialized vocabulary, grammar constructions, comprehension, situation of