• 検索結果がありません。

A Note on Witnesses of Centralizing Monoids (Algebraic system, Logic, Language and Computer Science)

N/A
N/A
Protected

Academic year: 2021

シェア "A Note on Witnesses of Centralizing Monoids (Algebraic system, Logic, Language and Computer Science)"

Copied!
5
0
0

読み込み中.... (全文を見る)

全文

(1)

A Note

on

Witnesses

of

Centralizing

Monoids

Hajime

Machida Ivo

G.

Rosenberg

Tokyo, Japan Montreal,Canada

Abstract

We consider multi‐variable functions definedover afixed finitesetA. Acentralizing

monoid M isasetofunaryfunctionsonA whichcommutewith all membersofsomeset

Fof functionsonA,where Fiscalledawitness of M. We show thateverycentralizing

monoid hasawitness whosearitydoesnotexceed

|A|

. Thenwepresentamethodto

countthe number ofcentralizing monoids which havesets ofsome specific functions

as their witnesses. Finally, some results on the three‐element set E3 are reported

concerningwitnessesconsistingofbinary idempotent functions, majorityfunctions or

ternarysemiprojections.

Keywords: commutation;centralizing monoid; witness

1

Preliminaries

LetA beanon‐emptyset. For

n\geq 11\mathrm{e}\mathrm{t}\mathcal{O}_{A}^{(n)}

denote the set ofn‐variable functions definedon

\mathrm{F}_{0\mathrm{r}n>0\mathrm{a}\mathrm{n}\mathrm{d}1\leq $\iota$\leq n\mathrm{t}\mathrm{h}\mathrm{e}v\mathrm{t}\mathrm{h}(n-\mathrm{v}\mathrm{a}\dot{\mathrm{n}}\mathrm{a}\mathrm{b}1\mathrm{e})\mathrm{n}}A,\mathrm{i}.\mathrm{e}.,\mathcal{O}_{A}^{(n)}=A^{A^{n}\infty}\mathrm{a}\mathrm{n}\mathrm{d}\mathcal{O}_{A}

denotet\mathrm{h}\mathrm{e}\mathrm{s}\mathrm{e}\mathrm{t}\mathrm{o}\mathrm{f}\mathrm{f}\mathrm{i}_{\mathrm{J}}nctionsdefinedo

\displaystyle \mathrm{n}A,\mathrm{i}.\mathrm{e}.,\mathcal{O}_{A}=\bigcup_{n=1}\mathcal{O}_{A}^{(n)}

projection

e \mathrm{i}\mathrm{s}\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{f}unction i

\mathcal{O}_{A}^{(n)}

which

always

takesthe valueof the i‐thvariable. The setof

projections

isdenoted

by

\mathcal{J}_{A}. A clone

overAisasubset C of

\mathcal{O}_{A}

whichisclosed under

(functional)

composition

and includes

\mathcal{J}_{A}.

For m,n\geq 1,

f\in \mathcal{O}_{A}^{(n)}

and

g\in O_{A}^{(m)},

f

commuteswith g, or

f

andg commute, ifthe

equation

f(g(^{t_{C_{1}),\ldots,g(}t_{C_{n}))}}=g

(

f

(r1),

...,

f

(rm))

holdsforeverym\times nmatrixover Awiththe i‐throw

r_{i}(1\leq i\leq m)

andthe

j‐th

column

c_{\mathrm{j}}(1\leq j\leq n)

. Wewrite

f\perp g

when

f

commuteswithg.

In this paper we areconcerned with a

particular

caseofcommutation, that

is,

commu‐

tation ofan n‐variablefunctionwith aunary function. It follows from the definition above

that,

for

f\in \mathcal{O}_{A}^{(n)}

and

g\in \mathcal{O}_{A}^{(1)},

f

and g commuteif

f(g(x_{1}), \ldots, g(x_{n}))=g(f(x_{1}, \ldots, x_{n}))

holdsforallx_{1},...,

x_{n}\in A.

Fora subset F of

O_{A}

theset of functions in

\mathcal{O}_{A}

whichcommutewith all members ofF

isdenoted

by

F^{*},

i.e.,

F^{*}=

{

g\in \mathcal{O}_{A}|g\perp f

for all

f\in F

}.

When

F=\{f\}

we write

f^{*}

instead ofF^{*}.

Also,

we write F^{**} for

(F^{*})^{*}

. The

following

(2)

Lemma 1.1 For any

F, G\subseteq \mathcal{O}_{A},

F\subseteq G^{*}

if

and

only if

G\subseteq F^{*}.

Asubset C of\mathcal{O}_{A} isacentralizer ifthereisasubsetFofO_{A}

satisfying

C=F^{*}. Forany

subset Fof

O_{A}

, the centralizer F^{*} is

clearly

aclone. A subset M of

\mathcal{O}_{A}^{(1)}

isamonoid ifit

isclosed under composition and contains the

identity.

Sinceanycentralizer F^{*} isa

clone,

theunary partofF^{*}, i.e.,

F^{*}\cap \mathcal{O}_{A}^{(1)}

, isamonoid.

A subset M of

\mathcal{O}_{A}^{(1)}

is a

centralizing

monoid if there exists a subset F of

\mathcal{O}_{A}

which

satisfies

M=F^{*}\cap \mathcal{O}_{A}^{(1)}

. Inother

words,

a

centralizing

monoidistheunarypartofsome

centralizer. The set F inthe definition ofa

centralizing

monoidM iscalledawitnessofM.

The

centralizing

monoidM will be denoted

by

M(F)

if F is a witness ofM. When F is

\{f\}

we

simply

write

M(f)

for

M(\{f\})

.

It iswell‐knownand easy tosee

that,

for asubset M of

\mathcal{O}_{A}^{(1)},

Mis a

centralizing

monoid

if and

only

if Mistheunarypart ofM^{**},

i.e.,

M=M^{**}\cap \mathcal{O}_{A}^{(1)}.

2

Arity

of Witnesses

We shall considerafundamental

problem

onthe

arity

ofwitnesses: How smallcanthe

arity

ofawitness be?

Definition 2.1 Fora

(non‐empty)

finite

subset W

of \mathcal{O}_{A}

, the

arity

of

W is

defined

to be

the maximalarty

of

all

functions

inW.

We establish the

following

theorem.

Theorem2.1

Every centralizing

monoidM onA hasawitnesswhose

arty

isless than or

equal

to

|A|.

Proof follows afteradefinition andalemma.

Definition 2.2 For n>1 let

f\in \mathcal{O}_{A}^{(n)}

be an n‐variable

function

and i,

j\in \mathcal{N}

satisfy

1\leq i<j\leq n

.

Define

(n-1)

‐variable

function

f_{i\equiv j}\in \mathcal{O}_{A}^{(n-1)}

by

f_{i\equiv j} (xl,

...,x_{n-1}

)

=

f

(xl,

...,xi,...,x_{j-1},x_{i},x_{j+1},\ldots, x_{n-1}

)

for

allx_{1},..

.,x_{i},...,x_{j},...,x_{n}\in A. The

function

f_{i\equiv j}

is called

(i, j)

‐minor

of f

. Denote

by

Minor

(f)

theset

of

allminors

of f

, i.e.,

Minor

(f)

=

\{f_{i\equiv j}|1\leq i<j\leq n\}

Lemma2.2 Let

f\in \mathcal{O}_{A}^{(n)}

bean n‐variable

junction.

Ifn>|A|

then

M(f)=M(\mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f))

,

i. e.,

f^{*}\cap \mathcal{O}_{A}^{(1)}=\mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f)^{*}\cap \mathcal{O}_{A}^{(1)}.

Proof

(

\subseteq

)

: Let

s\in \mathcal{O}_{A}^{(1)}

bein

M(f)

. Itfollowsthat

s\perp f

, whichis

equivalent

to

saying

that

s

(

f

(xl,

... x_{n}

))

=

f(s(x_{1}), \ldots, s(x_{n}))

holds for all x_{1},...,

x_{n}\in A

. In

particular,

for anypair

(i, j)

such that

1\leq i<j\leq n

we

have

(3)

for all x_{1},...

,x_{n}\in A

satisfying

x_{i}=x_{\dot{}}. This

implies

s\perp f_{i\equiv j}

. Hence s

belongs

to

M(\mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f))

,whichconcludes

M(f)\subseteq M(\mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f))

.

(

\supseteq

)

: Weprove the

contraposition,

that is, if

s\not\in f^{*}

then

s\not\in \mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f)^{*}

for any

s\in \mathcal{O}_{A}^{(1)}.

Now the condition

s\not\in f^{*} implies

s_{7}\mathrm{L}f

, whichmeansthat

s

(

f

(al,

...,a_{n}

))

\neq

f(s(a_{1}), \ldots, s(a_{n}))

holds for some a_{1},...,

a_{n}\in A

. Since

n>|A|

, there existi,

j\in \mathcal{N}

satisfying 1\leq i<j\leq n

and a_{i}=a_{j}. Fornotational

simplicity,

let i=n-1 and j=n. Thenwe have

s(f_{n-1\equiv n}(a_{1}, \ldots, a_{n-1})) \neq f_{n-1\equiv n}(s(a_{1}), \ldots, s(a_{n-1}))

,

which

implies s_{ $\eta$}Lf_{n-1\equiv n}

. Thus

s\not\in \mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f)^{*}

and, consequently,

M(f)\supseteq M(\mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f))

.

\square

ProofofTheorem2.1 LetW beawitnessofa

centralizing

monoid M. For each

f

in

W,

if

f\in \mathcal{O}_{A}^{(n)}

and

n>|A|

,

replace f

with all minors of

f

. The set

(W\backslash \{f\})\cup \mathrm{M}\mathrm{i}\mathrm{n}\mathrm{o}\mathrm{r}(f)

is

awitness ofM, duetoLemma2.2.

Repeat

this

procedure

untilnofunction inthe witness

has

arity

greaterthan

|A|

. Thenwe getadesired witness forM. \square

3

Strategy

LetHbeasubset of

\mathcal{O}_{A}

.

Suppose

wewant todetermine all

centralizing

monoidsonA which

have subsets ofHastheir

witnesses,

or

simply

thenumberofsuch

centralizing

monoids. If

h isthe number of elements inHthe number of subsets ofH is2^{h},whichtendstobe

huge

and, therefore,

insuchcases, itrequiressometricktoachieve the task above.

Ourstrategytoavoidthis

difficulty

isthe

following.

Instead of

starting

froma function

f

inHand determine

M(f)=f^{*}\cap \mathcal{O}_{A}^{(1)}=\{s\in \mathcal{O}_{A}^{(1)}|f\perp s\}

,we do it inthereverseway.

Namely,

we startfromaunaryfunction

s\in \mathcal{O}_{A}^{(1)}

, and consider the

following

set.

C_{H}(s) = s^{*}\cap H (=\{f\in H|f\perp s\})

Duetothenextproposition,weasserts: Thereexistsa

bijection

between thesetof central‐

izing

monoids

having

subsets ofHastheir witnessesand theset

consisting

of

C_{H}(s1)\cap\cdots\cap

C_{H}(s_{r})

for

1\leq r\leq|A|^{|A|}

ands_{1},...,

s_{r}\in \mathcal{O}_{A}^{(1)}.

Proposition

3.1 Let H be a non\rightarrow empty subset

of

\mathcal{O}_{A} and

C_{H}(s)=s^{*}\cap H

for

every

s\in \mathcal{O}_{A}^{(1)}.

(1)

For anynon‐emptysubsetF

of

H, let G be theset

of functions defined by

G=\cap\{C_{H}(s)|s\in \mathcal{O}_{A}^{(1)}, F\subseteq s^{*}\}.

Then,

M(F)=M(G)

, thatis, the

centralizing

monoid

having

F as its witness is the

same asthe

centralizing

monoid

having

G asits witness.

(A

witness F canbe

replaced

(4)

(2)

Foranys_{1},...

,s_{r},t_{1},...

,

t_{q}\in \mathcal{O}_{A}^{(1)}

, let

G_{1}=\displaystyle \bigcap_{i=1}^{r}C_{H}(s_{i})

and

G_{2}=\displaystyle \bigcap_{j=1}^{q}C_{H}(t_{j})

.

If

M(G_{1})=M(G_{2})

thenG_{1}=G_{2}.

Proof

(1)

Itsufficestoshowthe

following

(i)

and

(ii)

for any

s\in \mathcal{O}_{A}^{(1)}:(\mathrm{i})s\in G^{*}

implies

s\in F^{*} and

(ii)

s\in F^{*}

implies

s\in G^{*}.

(i)

Obvious from F\underline{\subseteq} G.

(ii)

Condition s\in F^{*}

implies

F\subseteq s^{*}

(Due

to Lemma

1.1).

Then, by

thedefinition of G,wehave

G\subseteq C_{H}(s)

,which

implies

G\subseteq s^{*}

and, hence,

s\in G^{*}.

(2)

Proof

by contraposition.

Assume that G_{1} and

G_{2}

are different.

Then,

w.l.0.\mathrm{g}., we

may assumethat thereexists

f

in

G_{2}\backslash G_{1}

. Thenwe have

f\not\simeq s_{i}

for some

i\in\{1, . . . , r\},

which

implies

s_{i}\not\in M(G_{2})

.

However,

since

G_{1}\subseteq C_{H}

(si),

we have

s_{i}\in M(G_{1})

. Hencethe

conclusion,

M(G_{1})\neq M(G_{2})

, follows. \square

Corollary

3.2 The number

of

the

centralizing

monoids

having

subsets

of

H as their wit‐

nessesis

equal

to the number

of

sets

\displaystyle \bigcap_{s\in S}C_{H}(s)

for

all

S\subseteq \mathcal{O}_{A}^{(1)}.

Proofisimmediate from

Proposition

3.1.

In this paper, we are concerned

only

with the numbers of

centralizing

monoids

having

specific

setsastheirwitnesses.

However,

ifwewant,not

only

toobtainthe numbers of such

centralizing monoids,

but also todetermine

explicitly

elements ofeach ofsuch

centralizing

monoids,

the

following

propertyisuseful.

For unaryfunctionss_{1},...,

s_{r}\in \mathcal{O}_{A}^{(1)}

let

S=\{s_{1}, . . . , s_{r}\}

. Then Sissaidto\mathrm{b}\mathrm{e}* ‐mavimal

if

C_{H}(s_{1})\cap\cdots\cap C_{H}(s_{r})\not\leqq C_{H}(t)

forany

t\in \mathcal{O}_{A}^{(1)}\backslash S.

Proposition

3.3 Fors_{1}, ...,

s_{r}\in \mathcal{O}_{A}^{(1)}

,

if

\{s_{1}, . . . , s_{r}\}is*

‐maximal then

\{s_{1}, . . . , s_{r}\}

is a

centralizing

monoid

having

C_{H}(s_{1})\cap\cdots\cap C_{H}(s_{r})

asits witness.

4

Specific

Types

of

Centralizing

Monoids

on

E3

Fromnowon, we deal withthe casewhere the base setAis

E_{3}=\{0

,

1,

2

\}

. Wewrite

\mathcal{O}_{3}^{(n)}

and

\mathcal{O}_{3}

for

\mathcal{O}_{A}^{(n)}

and\mathcal{O}_{A},

respectively.

Inthepast

work,

centralizers onE3 were

discussed,

e.g., in

[Da79].

Due to Theorem 2.1 in Section

2,

every

centralizing

monoidon E3 has a witness whose

arity

isless thanor

equal

to 3.

We haveconsidered witnesses which consist ofsetsof functionsin eachofthe

following

threeclasses:

Binary idempotent functions, majority

functions andternary

semiprojections.

Thereasonbehind the selection of these classes of functionscomesfrom the fact that minimal

functions on E_{3}, except unary

functions,

all

belong

to these

classes,

which is the result of

B.

Csákány

([Cs83])

obtainedin 1983.

For the reader’s

sake,

we reviewthe definition of each of these functions.

(i)

For

f\in \mathcal{O}_{3}^{(2)},

f

isa

binary

idempotent function

if

f(x, x)=x

forall

x\in E_{3}.

(ii)

For

f\in \mathcal{O}_{3}^{(3)},

f

isa

majority

function

if

f(x, x, y)=f(x, y, x)=f(y, x, x)=x

for all

(5)

(iii)

For

f\in \mathcal{O}_{3}^{(3)},

f

isa

semiprojection

ifthereexists

i\in\{1

,2,3

\}

suchthat

f(x_{1}, x_{2}, X3)=

x_{i} whenever

|\{x_{1}, x_{2}, x_{3}\}|<3

for allx_{1}, x_{2},X3\in E_{3}.

Thus,

for the set H in Section 3, we took up the set of

majority

functions,

the set of

ternary

semiprojections

and the set of

binary idempotent functions,

and enumerated all

centralizing

monoids whichhave those setsastheirwitnesses

([GMR15], [MR16]).

Proposition

4.1

(i)

The number

of centralizing

monoids on

E3

which havesets

of

binary

idempotent functions

as theirwitnesses is 67.

(ii)

The number

of centralizing

monoids onE3 which have sets

of

majority

functions

as

their witnesses is15.

(iii)

Thenumber

of centralizing

monoidson

E3

which have sets

of

ternary

semiprojections

as theirwitnesses is 13.

More detailed

description concerning

the statements

(ii)

and

(iii) (respectively, (i))

is

foundin

[GMR15] (respectively, [MR16]).

Note that thenumber of

binary idempotent

functions on

E_{3}

, as well asthe number of

ternarymajorityfunctionson

E_{3}

,is3^{6}=729.

Also,

ifwe mean

by

aternary

semiprojection

only

suchternary

semiprojection

p which takes thevalue of the firstargumentwhenever at least twoof thearguments

coincide, i.e.,

p(x_{1}, x_{2}, X3)=x_{1}

whenever

|\{x_{1}, x_{2}, x_{3}\}|<3

,then

the number of such functions on E3 is

3^{6}=729

. We observe that the numbers

67,

15 and

13aresmallas

compared

with the number729 and

remarkably

smallas

compared

with the

cardinality

of thepower setof each class ofsuch

functions,

whichis2^{729}.

References

[Cs83]

Csákány, B.,

All minimal clones onthe three elementset, Acta

Cybernet.,

6, 1983,

227‐238.

[Da79]

Danil’čenko,

A.

F.,

On

parametrical expressibility

ofthefunctions of k‐valued

logic,

Colloquia

Mathematica Societatis János

Bolyai,

28,Finite

Algebra

and

Multiple‐Valued

Logic,

1979, 147‐159.

[GMR15]

Goldstern, M., Machida,

H. and

Rosenberg,

I.

G.,

Some classes of

centralizing

monoidson athree‐elementset,

Proceedings 45th

International

Symposium

on

Multiple‐

Valued

Logic, IEEE, 2015,

205‐210.

[MR16]

Machida,

H. and

Rosenberg,

I.

G., Centralizing

monoids on a three‐element set

relatedto

binary idempotent functions, Proceedings 46th

International

Symposium

on

参照

関連したドキュメント

Eskandani, “Stability of a mixed additive and cubic functional equation in quasi- Banach spaces,” Journal of Mathematical Analysis and Applications, vol.. Eshaghi Gordji, “Stability

If condition (2) holds then no line intersects all the segments AB, BC, DE, EA (if such line exists then it also intersects the segment CD by condition (2) which is impossible due

(Construction of the strand of in- variants through enlargements (modifications ) of an idealistic filtration, and without using restriction to a hypersurface of maximal contact.) At

This approach is not limited to classical solutions of the characteristic system of ordinary differential equations, but can be extended to more general solution concepts in ODE

(The origin is in the center of each figure.) We see features of quadratic-like mappings in the parameter spaces, but the setting of elliptic functions allows us to prove the

We show that a discrete fixed point theorem of Eilenberg is equivalent to the restriction of the contraction principle to the class of non-Archimedean bounded metric spaces.. We

Thanks to this correspondence, formula (2.4) can be read as a relation between area of bargraphs and the number of palindromic bargraphs. In fact, since the area of a bargraph..

Nonlinear systems of the form 1.1 arise in many applications such as the discrete models of steady-state equations of reaction–diffusion equations see 1–6, the discrete analogue of