ASSOCIATIVITY OF σ-SETS FOR NON-ANTIELEMENT σ-SET

GROUPS
arXiv:1701.02993v1 [math.LO] 21 Dec 2016

ALFONSO BUSTAMANTE VALENZUELA

Abstract. We study and extend the conditions for asociativity on fusion over
antielement free σ-sets to introduce a group to solve σ-set equations. σ-sets as
a theory of sets and antisets is sumarized and used as a framework to define
the main elements of this work. A theorem on Local Asociativity, conmutative
groups and solution of one variable fusion equation is presented.

1. Introduction
The inverse element play a very important role, together with associativity, on
solving equations form an algebraic structure. But what happend when the inverse
element and associativity together arise unsolvable inconsitencies? Let us pose the
following example. Let A and B two sets differet to empty, with the propietry that
A∪B = ∅. Associativity of a binary operation ∗ is defined as (A∗B)∗C = A∗(B∗C),
which in this context would be (A ∪ B) ∪ C = A ∪ (B ∪ C). Let us say, finally, that
B = C. So we have,
(A ∪ B) ∪ C = ∅ ∪ C,
A ∪ (B ∪ C) = A ∪ B.
As ∅ ∪ C = C, where, if associativity holds under our previous assumptions, we
would conclude that B = ∅, which contradict our first assumption.

That is the case of set theory, where this problem arised after the aparition of the
concept of antisets. Antisets are a relativley new object studied on set theory, var-
ing from elimination propietry under union [Car09], [Ar09], to gaps on a set which
eliminate any element that join with [Bal13]; in this article, however, we will strictly
use the first type of Antisets, particulary the definition developed by Arraus [Ar09].

What we want to present in this work, is the algebraic condition which aloud local
associativity of fussion on σ-sets, this is, extend the Arraus condition of associativity
on antielement free σ-sets and open the possiblity to associate sets and antisets.
Our goal is to to make partition equations of the form
A ∪ X = B,
as where presented on [Bus11], solvabe, for that matter, we will define a special
type of group based on the locally associative σ-set.

Before we present our results, we want to introduce some notation of Arraus

work, which will help us to analize and define some of the concepts needed to proof
our main theorem on associativity on σ-sets.

1
2 ALFONSO BUSTAMANTE VALENZUELA

2. Preeliminars on σ-sets
In [Ar09] it was defined a type of set denoted as σ-set, which was the gathering
of both sets and antisets, where for a set A and a set A∗ on a σ-set, the following
identity holds,
A ∪ A∗ = ∅,
which is exactly replied on their elements, this is, for X = {x} and X ∗ = {x∗ },
{x, x∗ } = ∅.
For X and Y σ-sets, he defined two base operations,
(1) X ∩ˆ Y := {x ∈ X : x∗ ∈ Y }
(2) X > Y := X − X ∩ ˆ Y.
Below, we paraphrase an example appling the above definitions.
Let X = {1, 2} and Y = {1∗ , 2∗ }, where,
(1) X ∩ˆY = X
(2) X > Y = ∅.
From this concepts, the author also defined what he denoted as antielement free
σ-set, to a set X,where for A, B ∈ X, A∩ ˆ B = ∅.
This σ-set was later denoted as,
AF = {x : xis antielement free}.
A variation of union, called fusion, presented by Arraus at the begining of the
article, is redefined as,
X ∪ Y = {x : (x ∈ X > Y ) ∨ (x ∈ Y > X)}
Finaly, a theorem is introduced in order to show why associativity is not possible
in fusion over σ-sets, this is, on not antielement free σ-sets.
Theorem 2.1 (Th.3.52, p.26). Let X be a σ-set. Then
(a): X ∪ ∅ = ∅ ∪ X = X
(b): X ∪ X = X.
It is shown that fusion is conmutative, this is X ∪ Y = Y ∪ X, but when asso-
ciativity is to be shown, the author point out the following case. Let us have the
σ-sets X = {1, 2}, Y = {1∗ , 2∗ } and Z = {1}, where,
(X ∪ Y ) ∪ Z = ∅ ∪ Z = Z
and
X ∪ (Y ∪ Z) = X ∪ Y = ∅,
where, as in the ecample presented in this article, ocurrs the same contradiction
where Z = ∅.
To solve this problem, the author proposed the following theorem,
Theorem 2.2. If X ∈ AF, then the fusion in X is associative, that is
(X ∈ AF )[(A ∪ B) ∪ C = A ∪ (B ∪ C)].
Under this scheme, the σ-sets, to have the propietry of being associative, there
must be antielement free. But what happend when equations like A ∪ X = B has
to be solved? Is there a restriction from which associativity on σ-sets holds? Such
restriction is our main result, a theorem on the condition of associativity on σ-sets,
which we will present in the following section together with some definitions an
lemmas to prove it.
 ASSOCIATIVITY OF σ-SETS FOR NON-ANTIELEMENT σ-SET GROUPS 3

3. Definitions and Main result

3.1. Associative chain of fusion and Localy associative σ-Sets. Before intro-
duce our main result, let us present the following previous definitions and lemmas.
We are going to take the notion of chain of fusion which was defined by Arraus
as, [− →
F = (A ∪ B) ∪ C,
−−−→
which for the prupose of the following definitions, we will denote as ABC, where
ABC represent a fixed order on the expression.
Definition 3.1. Let A, B and C σ-sets on S.An Associativity Evaluation Chain
on S, denoted as ES , is an equation on σ-sets, where,
−−−→ −−−−−→
ES = ABC ∪ C ∗ B ∗ A∗ .
Definition 3.2. An Associative chain of fusion over S is an asociative chain
where, for every A, B and C σ-sets on S,
(A ∪ B) ∪ C = A ∪ (B ∪ C).
Lemma 3.3. Let A, B and C be σ-sets of S. if (A ∪ B) ∪ C = A ∪ (B ∪ C), then
−−−→ −−−→
ABC = CBA.
Proof. Is enough to prove that, by conmutativity, A∪(B ∪C) = (C ∪B)∪A because
X = A and Y = B ∪ C; the same with B ∪ C = C ∪ B, where we have the fusion
−−−→
chain CBA. As we previously assumed that (A ∪ B) ∪ C = A ∪ (B ∪ C), and we
−−−→
know by definition that ABC = (A ∪ B) ∪ C, proving the requested identity. 
−−−→ −−−− −→
Lemma 3.4. If ABC is a σ-set, then A∗ B ∗ C ∗ is it antiset.
−−−−−→
Proof. By definition of antiset and chain of fusion over A∗ B ∗ C ∗ , is enoug to show
−−−→ −− −−− →
that the fusion of ABC and A∗ B ∗ C ∗ is actually the empty set. 
Proposition 3.5. Let A, B and C be σ-sets on S. if ES = ∅, then fusion over S
is associative.

Proof. Let us show by contapositive. Assume that (A ∪ B) ∪ C 6= A ∪ (B ∪ C). We

know that the second expression by the law of conmutativity on fusion, we have
−−−→
fusion chain ABC. If we fusion (A ∪ B) ∪ C, this is, the fusion chain ABC with the
−−−−−→
antielement σ-set C ∗ B ∗ A∗ , we will obtain,
−−−→ −− −−−→
ABC ∪ C ∗ B ∗ A∗ 6= ∅,
−−−→ −−−→
because of ABC 6= CBA by our hypothesis, hence the expression obtained is equiv-
alent, by definition, to the equation ES , so the proof is complete. 
Let us ilustrate the above proposition with the following example.
We have the σ-sets A = {a, b}, B = {a∗ , b∗ } and C = {c, d}. Taking the definition
of fusion, we have that
−−−→
ABC = C
and −− −−−→
C ∗ B ∗ A∗ = C ∗ ,
4 ALFONSO BUSTAMANTE VALENZUELA

where finally, the Associative evaluation chain ES = ∅, so by the proposition, ABC

is an associative chain of fusion.
Now let us take a contrary example to see what happend when the Associative
evaluation chain is not ∅. We have the σ-sets A = {1, 2}, B = {1∗ , 2∗ } and Z = {1∗ }.
Taking the definition of fusion, we have that
−−−→
ABC = Z,

and
−− −−−→
C ∗ B ∗ A∗ = ∅,
where
ES = Z ∪ ∅ = Z,
which is different to ∅, so we can conclude that ABC is not associative.

This results as we can see, is a very useful tool to evaluate associativity over
an ordered configuration of σ-sets; however, we are still not S
able to evaluate on a
wide combinatorial range, this is, over the generalized union {A, B, C}. For thar
reason, we develop the following definitions.

Definition 3.6. Let A, B and C σ-sets. A, B, C are said to be Locally Asso-

ciative over fusion if, for any combination of A, B and C, the fusion chain is
associative.

There exist some σ-sets S such that are associative chain of fusion but are not
locally associative. Let us examine the following σ-set where A = {1, 2}, B =
{1∗ , 2∗ } and C = {1, 2}. As we can see, by definition of associative evaluation
chain, we have that ES = ∅, so is associative; but if we re-arrange the set on the
fusion set as BAC, we will have that the new evaluation chain would be diferent to
empty set, impliyng that the associativity is not defined for every configuration.

Definition 3.7. For the equation system E = {EX , EY , EZ }, where the σ-sets
X, Y, Z are in E, the equations
−−−→ −−−−−−→
EX = XY Z ∪ Z ∗ Y ∗ X ∗ ,

−−−→ −−−−−−→
EY = Y ZX ∪ X ∗ Z ∗ Y ∗ ,

−−−→ −−−−−−→
EZ = ZXY ∪ Y ∗ X ∗ Z ∗ .

Theorem 3.8. For X, Y and Z σ-sets, if E = {∅}, then fusion is locally associative
on σ-sets.

Proof. As E = {∅} we know that the equations EX , EY and EZ are equal to the
empty set, wich implies that XY Z, Y ZX and ZXY are conmutative fusion chains.
Because of lemma 3.3, same ZY X, XZY and Y XZ are. As every configuration is
an associative fusion chain, by definition, is locally associative. 
 ASSOCIATIVITY OF σ-SETS FOR NON-ANTIELEMENT σ-SET GROUPS 5

3.2. Main Theorem on σ-sets Conmutative groups. To start this section, let
us remind what is a group as an algebraic structure. First, we remember that an
algebraic structure [Bo70] is a pair (A, ∗) where A is a set of certain mathematical
objects, and ∗ is an action from A × A to A, this is, the result of the operation of
two elements of A also belong to A.

Algebraic structures posess also composition laws, this is, laws of what happend
when operations do certain combination of special objects of the set or coclatena-
tions like associativity.
A group (G, ∗) is a set G of elements a,b,c such that,
(G1) a ∗ e = a
(G2) a ∗ a−1 = e
(G3) (a ∗ b) ∗ c = (a ∗ b) ∗ c,
if in the group a ∗ b = b ∗ a, it said to be conmutative or abelian. The group we
are going to study, is an abelian one, we will proof that the theorem 3.8. alows the
minumal conditions to define a cancelative group.

Theorem 3.9. Let A, B, C be σ-sets on G. if G is locally associative, then (G, ∪)

is an associative group.

Proof. As G is locally associative, means that E = {∅} so, there is neutral element;
in the other hand, as every EX , EY , EZ in E has in their expression an antiset,
where by definition of evaluation chain and lemma 3.2, the rest of the needed
condition to be a group are acomplished. 

Theorem 3.10. If (S, ∪) is a Locally associative group, then X ∪ A = B is solvable

and the solution is X = B ∪ A∗ .

Proof. the σ-set A, B, C is locally asociative, so, if we left add to both sides of the
equation the term A∗ , the right expresion (X ∪ A) ∪ A∗ , by local associativity and
cancellation with antisets, you will have X, the left term remains without change
so we can conclude that has a solution. 

To have a better understandig of this result, let us ilustrate it with the following
example.
Let us have a σ-set S where A = {α, β}, and B = {a∗ , b∗ , c∗ , α, β}, and X is to
be found in the form A ∪ X = B. First, we separate the expression

{a∗ , b∗ , c∗ , α, β} = {a∗ , b∗ , c∗ } ∪ {α, β}

then, by definition of locally associative σ-set, we know that X is part of an associa-

tive chain of fusion over any permutation. This aloud us to just aplly the theorem
on result for this kind equations, so we have,

X = ({a∗ , b∗ , c∗ } ∪ {α, β}) ∪ {α∗ , β ∗ },

because this is an associative chain, is enough to apply associativity and cancelation

over σ-sets to finaly obtain that X = {a∗ , b∗ , c∗ } which is the solution to obtain the
sigma set B.
6 ALFONSO BUSTAMANTE VALENZUELA

4. Further applications
A possible application of this research is on link algebra, where by the theorem
on locally associative σ-sets over fusion, it is posible to make graph equations over
union, as equations of the form A ∪ X = B, as where presented on [Bus11], solvabe.

There is an other case where this kind of special σ-set space could be appliyed:
graph join equations, where a graph G1 is joined to a graph G2 if al the vertices
of the two graphs are joined by edges. This type of result, could constitute a case
of a join graph equation of one variable, where the inverse graph G∗2 could provide
the graph to obtain the resultant graph, this would be specially useful on Zykov’s
Linear Complexes [Zy49], where graph join was denoted as G1 G2 , in order to solve
problems on graph concentration.

References
[Ar09] I.G.Arraus, “σ-Set theory: introduction to the concepts of σ-Antielement, σ-antiset and
integer space”, arXiv:0906.3120v8, (2009) preprint.
[Bus11] A.Bustamante, “Link Algebra: A new aproach to graph theory”, arXiv: 1103.359v2,
(2011) preprint.
[Bo70] N.Bourbaki, “Elements of mathematics. Algebra I”, Springer, 1970.

[Car09] M.L,Carroll, “Sets and Antisets”, (2009) preprint.

[Bal13] H.Baldo, “Introduction to Antisets,Antigroups and Antirings”, Hal: hal-00853859v1,
(2013) preprint.
[Zy49] A.A.Zykov “Some Propietries on Linear Complexes” Mat.Sb, 24 (1949),163-188;
Amer.Math.Soc.No 79, pp.418-449.

Department of Informatics, Technological University of Chile (INACAP), Apoquindo

7282, Santiago, Chile
E-mail address: alfonso.bustamante02@inacapmail.cl