Full Soft Sets: Theory and Applications Sunil Jacob John Ebook All Chapters
Full Soft Sets: Theory and Applications Sunil Jacob John Ebook All Chapters
Full Soft Sets: Theory and Applications Sunil Jacob John Ebook All Chapters
com
https://textbookfull.com/product/soft-sets-
theory-and-applications-sunil-jacob-john/
textbookfull
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
https://textbookfull.com/product/fuzzy-graph-theory-1st-edition-
sunil-mathew/
https://textbookfull.com/product/toward-humanoid-robots-the-role-
of-fuzzy-sets-a-handbook-on-theory-and-applications-1st-edition-
cengiz-kahraman/
https://textbookfull.com/product/linear-canonical-transforms-
theory-and-applications-1st-edition-john-j-healy/
https://textbookfull.com/product/uncertainty-management-with-
fuzzy-and-rough-sets-recent-advances-and-applications-rafael-
bello/
Soft Computing Applications Proceedings of the 8th
International Workshop Soft Computing Applications SOFA
2018 Vol I Valentina Emilia Balas
https://textbookfull.com/product/soft-computing-applications-
proceedings-of-the-8th-international-workshop-soft-computing-
applications-sofa-2018-vol-i-valentina-emilia-balas/
https://textbookfull.com/product/soft-computing-applications-
proceedings-of-the-8th-international-workshop-soft-computing-
applications-sofa-2018-vol-ii-valentina-emilia-balas/
https://textbookfull.com/product/system-and-architecture-sunil-
kumar-muttoo/
Studies in Fuzziness and Soft Computing
400th Volume of STUDFUZZ · 400th Volume of STUDFUZZ · 400th Volume of STUDFUZZ · 400th Volume of STUDFUZZ
Soft Sets
Theory and Applications
Studies in Fuzziness and Soft Computing
Volume 400
Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland
The series “Studies in Fuzziness and Soft Computing” contains publications on
various topics in the area of soft computing, which include fuzzy sets, rough sets,
neural networks, evolutionary computation, probabilistic and evidential reasoning,
multi-valued logic, and related fields. The publications within “Studies in Fuzziness
and Soft Computing” are primarily monographs and edited volumes. They cover
significant recent developments in the field, both of a foundational and applicable
character. An important feature of the series is its short publication time and
world-wide distribution. This permits a rapid and broad dissemination of research
results.
Indexed by ISI, DBLP and Ulrichs, SCOPUS, Zentralblatt Math, GeoRef, Current
Mathematical Publications, IngentaConnect, MetaPress and Springerlink. The books
of the series are submitted for indexing to Web of Science.
Soft Sets
Theory and Applications
123
Sunil Jacob John
Department of Mathematics
National Institute of Technology Calicut
Calicut, Kerala, India
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Dedicated to
My beloved father Late Mr. Jacob John
&
My respected Guru Prof. T. Thrivikraman.
Foreword
G. J. Klir has stated that among the various paradigmatic changes in science and
mathematics in the twentieth century, one such change concerned the concept of
uncertainty. In science, this change has been manifested by a gradual transition
from the traditional view, which states that uncertainty is undesirable in science and
should be avoided by all possible means, to an alternative which is tolerant of
uncertainty and insists that science cannot avoid it. Uncertainty is essential to
science and has great utility. An important point in the evolution of the modern
concept of uncertainty was a publication of a seminal paper by Lotfi Zadeh.
Soft set theory was proposed by Molodtsov in 1999 to deal with uncertainty in a
parametric manner. A soft set is a parameterized family of sets, intuitively soft
because the boundary of the set depends on the parameters. One notion of a set is
the concept of vagueness. This vagueness or the representation of imperfect
knowledge has been a problem for a long time for philosophers, logicians, and
mathematicians. Recently, it became a crucial issue for computer scientists par-
ticularly in the area of artificial intelligence. To handle situations like this, many
tools have been suggested. They include fuzzy sets, multisets, rough sets, soft sets,
and many more.
Molodtsov proposed soft set as a completely generic mathematical tool for
modeling uncertainties. There is no limited condition to the description of objects.
Thus researchers can choose the form of parameters they need. This simplifies the
decision-making process and makes the process more efficient in the absence of
partial information.
A soft set can be considered as an approximate description of an object precisely
consisting of two parts, namely, predicate and approximate value set. Exact solu-
tions to the mathematical models are needed in classical mathematics. If the model
is so complicated that we cannot get an exact solution, we can derive an approx-
imate solution and there are many methods for this. On the other hand, in soft set
theory as the initial description of object itself is of an approximate nature, we need
not have to introduce the concept of an exact solution.
vii
viii Foreword
Soft set theory has rich potential for application in many directions, some of
which are reported by Molodtsov in his work. He successfully applied soft set
theory in areas such as the smoothness of functions, game theory, operation
research, Riemann integration, and elsewhere. Later he presented some definitions
on soft sets as a subset, the complement of a soft set and discussed in detail the
application of soft theory in decision-making problems. Applications have been
made to decision-making, business competitive capacity information systems,
classification of natural textures, optimization problems, data analysis, similarity
measures, algebraic structures of soft sets, soft matrix theory, parameter reduction
in soft set theory, classification of natural textures, and soft sets and their relation to
rough and fuzzy sets.
The book, Soft Sets: Theory and Applications, by Prof. S. J. John is a strong
contribution to the development of soft set theory. It examines the algebraic and
topological structure of soft sets. It also considers some hybrid structures of soft
sets. The book contains interesting applications to decision-making, medical and
financial diagnosis problems. It is my hope that researchers will apply the concepts
of soft set theory to the existential problem of climate change and related problems
such as world hunger, coronavirus, modern slavery, and human trafficking.
ix
x Preface
involving algebraic, topological and lattice theoretic concepts together with pos-
sible hybridization of the novel concept with already existing well established
techniques are also most relevant. This book is a humble attempt towards consol-
idating all these in the context of soft sets. For this, this monograph relies heavily
on many published works of the author, doctoral thesis of author’s students and
works of many other colleagues and researchers in this newly emerging area.
As such, this book contains 6 chapters covering various aspects of soft sets from
theoretical to application problems. Apart from that, a brief historic development of
soft sets and related structures together with some future directions in the devel-
opment of soft set theory and applications is also provided.
Chapter 1 introduces the basic definitions and notions of soft structure. Tabular
representation, operations and many results including analogue of DeMorgan laws
and results involving Cartesian product, relations and functions are provided. The
notions of distance, similarity and entropy also form a part of this chapter. Chapter
concludes with the representation of fuzzy sets, rough sets and topological spaces as
particular types of soft set, justifying the fact that soft set is a generalized tool.
With the intention of enriching the theoretical studies, the algebraic structures of
soft sets are studied in Chap. 2. They include soft groups, normalistic soft groups,
soft BCK/BCI algebras, soft rings and modules and soft lattices.
Topology is a major branch of mathematics with many applications in the fields
of physical and computer sciences. Topological structures on soft sets are more
generalized methods and they can be useful for measuring the similarities and
dissimilarities between the objects in a universe which are soft sets. Chapter 3
discusses two different approaches to soft topology. The basic difference in these
approaches is that one of them considers a subcollection of a set of all soft sets in an
initial universe with a fixed set of parameters and the other one considers a sub-
collection from the set of all soft subsets of a given soft set in a universe. In this
chapter, both approaches are considered with respect to some standard typical
topological notions.
Category theory brings together various branches of mathematics into a united
whole and paves the way to describe and compare objects with similar and different
properties. Chapter 4 is an attempt to accommodate categorical concepts in the
context of soft sets and soft graphs. Further, the relationship between soft sets and
classical information systems is also explored.
A usual practice in applications of uncertainty modelling problems is the
hybridization of existing structures with the intention that the evolving hybrid
structure will have advantages of the constituent ones. Soft sets are also not an
exception and there are many hybrid structures involving soft sets which yielded
better results. Chapter 5 gives a panoramic view of these structures. They include
hybridization including fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets,
rough sets, etc.
In order to justify the relevance and importance of the introduced concepts in
various application scenarios and to show the relationships of soft sets with other
related fields, Chap. 6 discusses various applications of soft sets in many real
Preface xi
problems like decision making, parameter reduction, game theory and studies
involving incomplete data.
The book is primarily designed for scientists, researchers and students working
in the field of soft sets and other related areas like rough sets, fuzzy sets, graph
structures and hybrid models involving them. I sincerely hope that this book will
certainly be an important source for graduate and postgraduate students, teachers
and researchers in colleges/universities in various fields of engineering as well as
mathematics/physics. I believe that with the help of the global reputed nature of the
publisher, the cutting edge ideas consolidated in this book will find ways to create a
stimulating atmosphere for further active development of soft computing techniques
round the globe.
xiii
Contents
xv
xvi Contents
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
Acronyms
xix
xx Acronyms
SL ðEÞ Family of all soft lattices over a lattice L with parameter set E
s(R) Symmetric kernel of R
SðUÞE Family of all soft sets over U with parameter set E
soc(M) Socle of module
Vec Category of vector spaces
Part I
Historical Perspective of Soft Sets
Introduction of fuzzy set theory by Zadeh [161] in 1965 by giving room for partial
membership for better handling practical situations made a paradigm shift in math-
ematics. The rationale behind this idea was the need of modelling imprecise human
knowledge. The diffusion of this concept to various applied sciences and industry
was rapid and Zadeh himself contributed much for this. This was followed by many
successful generalizations of fuzzy sets and literature is abundant on these. These
generalizations include L-fuzzy sets by Goguen [47], intuitionistic fuzzy sets by
Atanassov [11], type two fuzzy sets [163], bipolar fuzzy sets [166], hesitant fuzzy
sets by Torra [144], pythagorean fuzzy sets [159], picture fuzzy sets [35], spherical
fuzzy sets [71], fermatean fuzzy sets [123] and many more. Apart from these another
set of generalized structures useful for approximate reasoning was also developed
parallel mostly in a complementary manner to fuzzy set theory. They include rough
sets by Pawlak [98], multisets by Yager [158], genuine sets by Demirci et al. [37],
neutrosophic and plithogenic logic by Smarandache [121], multiple sets by Shijina
et al. [128, 129] etc.
Molodtsov developed soft set theory in a fundamentally different perspective.
The application of this theory can be used for meaningfully interpreting real life
problems in pure and applied sciences involving imprecise data. Current studies
shows that ambiguities in data mining problems can also be solved using soft set
theory techniques. The soft set theory could be used to interrogate and extend the
idea of probability, fuzzy set, rough set and intuitionistic fuzzy set further. The
disadvantage of lack of parameterization tool related to the concepts mentioned
above gave a higher realm to soft set theory. In short, unlimited nature of approximate
description is the greatest advantage of soft set theory.
While pondering over difficulties related to modelling uncertainties, eighteenth
century mathematicians identified probability theory as a solution, which addressed
uncertainty via randomness. The prominence of this was unchallenged till mid-
twentieth century. In 1965, Zadeh [161] introduced fuzzy sets for addressing impreci-
sion comprehensively. He expressed fuzziness via partial membership of an element
in a set. Basically a fuzzy set can be identified with a class fitted with an ordering
for elements which expresses the more or less belongingness of them in to that class
under consideration.
2 Historical Perspective of Soft Sets
The aim of introducing a soft structure over a set is to make a certain discretization
of such fundamental mathematical concepts with effectively continuous nature and
thus providing new tools for the use of the technology of mathematical analysis in
real applications involving uncertainty or imperfect data. This is achieved through
a certain parameterization of a given set. As usual, this new perspective of ideas
draw attention of both pure and applied mathematicians and researchers in many
related areas as well. Specifically, the specialists found the concept of a soft set
well coordinated with many other modern mathematical concepts such as fuzzy sets,
rough sets and many more. Further, this resulted in a series of works where soft
versions of mathematical concepts were realized.
© The Editor(s) (if applicable) and The Author(s), under exclusive license 3
to Springer Nature Switzerland AG 2021
S. J. John, Soft Sets, Studies in Fuzziness and Soft Computing 400,
https://doi.org/10.1007/978-3-030-57654-7_1
4 1 Soft Sets
information. There are many techniques available for modeling real world complex
systems, such as the classical probability theory, fuzzy set theory introduced by Zadeh
[160], interval mathematics [61, 96, 135] etc. Major drawback of all these techniques
is the lack of parameterization of the tools and hence they could not be applied
successfully in tackling problems especially in areas like economics, environmental
and social sciences. Soft set theory is relatively free from the difficulties associated
with above mentioned techniques and has a wider scope for many applications in a
multidimensional way.
In this section basic definitions, an example and a tabular representation as intro-
duced by Molodtsov [88], Maji et al. [80], and Babitha and Sunil [15] are mentioned.
Definition 1.1 Let U be an initial universe set and E be a set of parameters. Let
P(U ) denotes the power set of U and A ⊂ E. A pair (F, A) is called a soft set over
U , where F is a mapping given by F : A → P(U ).
In other words, a soft set over U is a parameterized family of subsets of the universe
U . For ∈ A, F() may be considered as the set of -approximate elements of the
soft set (F, A).
For the purpose of storing a soft sets in computers, one may need the representation
in the form of a matrix or a table. The (i, j)th entry in table
of a soft set
1 if xi ∈ F(e j )
ti, j =
0 otherwise
With reference to Example 1 given above, the tabular representation of the soft set
is given Table 1.1.
1.2 Operations of Soft Sets 5
Definition 1.4 The complement of a soft set (F, A) is denoted by (F, A)c and is
defined by (F, A)c = (F c , ¬A) where F c : ¬A → P(U ) is a mapping given by
F c (¬α) = U − F(α), ∀¬α ∈ ¬A.
We call F c to be the soft complement function of F. Clearly (F c )c is the same as
F and ((F, A)c )c = (F, A). It is also known as neg-complement as F c is defined on
the NOT set of the parameter set.
Definition 1.5 Let U be an initial universe set, E be the set of parameters, and
A ⊂ E.
(i) (F, A) is said to be a relative null soft set (with respect to the parameter set A),
denoted by A , if ∀ ∈ A, F() = φ, (null-set).
6 1 Soft Sets
(ii) (F, A) is said to be a relative whole soft set (with respect to the parameter set
A), denoted by UA , if ∀ ∈ A, F() = U .
E is called the null soft set
The relative null soft set with respect to E denoted by
over U .
E is called the absolute
The relative whole soft set with respect to E denoted by U
soft set over U .
Definition 1.6 The relative complement of a soft set (F, A) is denoted by (F, A)r
or (F, A) and is defined by (F, A)r = (F r , A) where F r : A → P(U ) is a mapping
given by F r (α) = U − F(α), ∀α ∈ A.
Clearly, we have the following propositions.
Proposition 1.1 If A and B are two sets of parameters then we have the following:
(i) ¬(¬A) = A
(ii) ¬(A ∪ B) = (¬A) ∪ (¬B)
(iii) ¬(A ∩ B) = (¬A) ∩ (¬B)
Proposition 1.2 Let U be a universe, E a set of parameters, A, B, C ⊂ E. If (F, A),
(G, B) and (H, C) are soft sets over U , Then
U
(i) (F, A)⊆ A .
(ii) A ⊆(F, A).
(F, A).
(iii) (F, A)⊆
(iv) (F, A)⊆(G, B), (G, B)⊆ (H, C) implies (F, A)⊆ (H, C).
(v) (F, A) = (G, B) and (G, B) = (H, C) implies (F, A) = (H, C).
Definition 1.7 The union of two soft sets (F, A) and (G, B) over the common
U is a soft set (H, C), where C = A ∪ B and for each e ∈ C,
universe ⎧
⎪
⎨ F(e), if e ∈ A − B
H (e) = G(e), if e ∈ B − A .
⎪
⎩
F(e) ∪ G(e), if e ∈ A ∩ B
We write (F, A)
∪(G, B) = (H, C),
Definition 1.8 The intersection of two soft sets (F, A) and (G, B) over the common
universe U is a soft set (H, C), where C = A ∩ B, and H (e) = F(e) ∩ G(e), ∀e ∈ C.
We write (F, A)
∩(G, B) = (H, C).
Definition 1.9 Let (F, A) and (G, B) be soft sets over a common universe U
such that A ∩ B = φ. Then the restricted union of (F, A) and (G, B) denoted by
(F, A) ∪ R (G, B) and is defined as (F, A) ∪ R (G, B) = (H, C) where C = A ∩ B
and for all c ∈ C, H (c) = F(c) ∪ G(c).
Definition 1.10 Extended intersection of two soft sets (F, A) and (G, B) over the
⎧ A) ∩ E (G, B) and is the soft set (H, C), where
common universe U , denoted by (F,
⎪
⎨ F(e), if e ∈ A − B
C = A ∪ B, and ∀e ∈ C, H (e) = G(e), if e ∈ B − A .
⎪
⎩
F(e) ∩ G(e), if e ∈ A ∩ B
1.2 Operations of Soft Sets 7
Definition 1.11 Let (F, A) and (G, B) be soft sets over a common universe U such
that A ∩ B = φ. Then the restricted difference of (F, A) and (G, B) denoted by
(F, A) R̃ (G, B) and is defined as (F, A) R̃ (G, B) = (H, C) where C = A ∩ B and
∀c ∈ C, H (c) = F(c) − G(c), the difference of the sets F(c) and H (c).
Definition 1.12 If (F, A) and (G, B) are soft sets over a common universe U , then
(F, A)AN D(G, B) denoted by (F, A) ∧ (G, B) is defined as (F, A) ∧ (G, B) =
(H, A × B) where H (a, b) = F(a) ∩ G(b) for every (a, b) ∈ A × B.
Definition 1.13 If (F, A) and (G, B) are soft sets over a common universe U ,
then (F, A)O R(G, B) denoted by (F, A) ∨ (G, B) is defined as (F, A) ∨ (G, B) =
(K , A × B) where K (a, b) = F(a) ∪ G(b) for every (a, b) ∈ A × B.
For soft sets (F, A), (G, B) and (H, C) over the same universe U with A, B, C
subsets of the parameter set E, the following theorems hold:
Theorem 1.1 Properties of union operation
(a) (F, A)∪((G, B)∪(H, C)) = ((F, A) ∪(G, B))∪(H, C)
(b) (F, A)∪UA = U
A , (F, A) E = U
∪U E , (F, A) A = (F, A)
∪
(c) (F, A) need not be a soft subset of (F, A) (G, B), then
∪(G, B). But if (F, A)⊂
(F, A)
(F, A)⊂ ∪(G, B), moreover (F, A) = (F, A) ∪(G, B)
(d) (F, A)∪(G, A) = A and (G, A) =
A if and only if (F, A) = A
(e) (F, A)∪((G, B)∩(H, C)) = ((F, A) ∪(G, B))∩((F, A)
∪(H, C))
(f) ((F, A)
∩(G, B))∪(H, C) = ((F, A) ∪(H, C))∩((G, B)∪(H, C))
Proof Proof of (a), (b), (e) and (f) are straight forward and follows easily from
definitions.
⎧ A)
(c) Let (F, ∪(G, B) = (H, C) where C = A ∪ B and
⎨ F(e) if e ∈ A − B
H (e) = G(e) if e ∈ B − A .
⎩
F(e) ∪ G(e) if e ∈ A ∩ B
It is obvious that if e ∈ A ∩ B, then H (e) = F(e) ∪ G(e), thus F(e) and H (e)
need not be the same approximations. Thus (F, A) need not be a soft subset of
(F, A) ∪(G, B).
Now let (F, A)⊂ (G, B). Then, it is clear that A ⊂ A ∪ B = A. We need to show
that F(e) and H (e) are the same approximations for all e ∈ A. Let e ∈ A, then
e ∈ A ∩ B = A, since A ⊂ B implies A − B = φ. Thus, H (e) = F(e) ∪ G(e) =
F(e) ∪ F(e) = F(e), as G(e) and F(e) are the same approximations for all e ∈ A.
This follows that H and F are the same set-valued mapping for all e ∈ A, as required.
(d) Suppose that (F, A) ∪(G, A) = (H, A), where H (x) = F(x) ∪ G(x) for all
x ∈ A. Since (H, A) = A from the assumption, H (x) = F(x) ∪ G(x) = φ ⇔
F(x) = φ and G(x) = φ ⇔ (F, A) = A and (G, A) = A for all x ∈ A. Now
assume that (F, A) = A and (G, A) = A and (F, A)∪(G, A) = (H, A). Since
F(x) = φ and G(x) = φ for all x ∈ A, H (x) = F(x) ∪ G(x) = φ for all x ∈ A.
Therefore, (F, A) ∪(G, A) = A.
Proof (a) First, we investigate the left-hand side of the equality. Suppose that
(G, B) ∪ R (H, C) = (T, B ∩ C), where T (x) = G(x) ∪ H (x) for all x ∈ B ∩ C =
φ. And assume (F, A) ∪R (T, B ∩ C) = (W, A ∩ (B ∩ C)), where W (x) = F(x) ∪
T (x) = F(x) ∪ (G(x) ∪ H (x)) for all x ∈ A ∩ (B ∩ C) = φ.
Now consider the right-hand side of the equality. Suppose that (F, A) ∪R
(G, B) = (M, A ∩ B), where M(x) = F(x) ∪ G(x) for all x ∈ A ∩ B = φ · And
let (M, A ∩ B) ∪R (H, C) = (N , (A ∩ B) ∩ C), where N (x) = M(x) ∪ H (x) =
(F(x) ∪ G(x)) ∪ H (x) for all x ∈ (A ∩ B) ∩ C = φ. Since W and N are the same
mapping for all x ∈ A ∩ (B ∩ C) = (A ∩ B) ∩ C, the proof is completed.
(b) Proof of (b) follows directly from the definitions.
(c) Since A A ∩ B without any extra condition being given, (F, A) (F, A)
∪R (G, B) in general. Now assume that (F, A) is a soft subset of (G, B) and
(F, A) ∪R (G, B) = (H, A ∩ B = C), where H (x) = F(x) ∪ G(x) for all x ∈ C.
Then,
(F, A)⊂ (G, B) ⇔ A ⊂ A ∩ B = A and F(e) and G(e) are the same approxima-
tions for all e ∈ A ⇔ H (e) = F(e) ∪ G(e) = F(e) ∪ F(e) = F(e) for all e ∈ A.
Thus, F and H are the same set-valued mapping for all e ∈ A, so the proof is com-
pleted.
(d) Proof follows from the fact that (F, A) ∪R (G, A) = (F, A) ∪ (G, A)) and
Theorem 1.1(d).
(e) First, we handle the left-hand side of the equality. Suppose that (G, B) ∩
(H, C) = (T, B ∩ C), where T (x) = G(x) ∩ H (x) for all x ∈ B ∩ C. Let (F, A)
∪R (T, B ∩ C) = (W, A ∩ (B ∩ C)), where W (x) = F(x) ∪ T (x) = F(x)
∪ (G(x) ∩ H (x)) for all x ∈ (A ∩ B) ∩ C.
Now consider the right-hand side of the equality. Assume that (F, A) ∪R (G, B) =
(M, A ∩ B), where M(x) = F(x) ∪ G(x) for all x ∈ A ∩ B = φ. And let (F, A) ∪R
(H, C) = (N , A ∩ C), where N (x) = F(x) ∪ H (x) for all x ∈ A ∩ C = φ. Sup-
pose that (M, A ∩ B) ∩(N , B ∩ C) = (K , (A ∩ B) ∩ (A ∩ C)) = (K , (A ∩ B)
∩ C), where K (x) = M(x) ∩ N (x) = (F(x) ∪ G(x)) ∩ (F(x) ∪ H (x)) = F(x)
∪(G(x) ∩ H (x)) for all x ∈ (A ∩ B) ∩ C. Since W and K are the same set-valued
mapping, the proof is completed.
(f) By similar techniques used to prove (e), (f) can be illustrated, and is therefore
omitted.
(g) Suppose that (G, B) ∩ E (H, C) = (T, B ∪ C), where
1.2 Operations of Soft Sets 9
⎧
⎨ G(e) if e ∈ B − C
T (e) = H (e) if e ∈ C − B
⎩
G(e) ∩ H (e) if e ∈ B ∩ C
Assume that (F, A) ∪ R (T, B ∪ C) = (M, A ∩ (B ∪ C)), where M(x) = F(x) ∪
T (x) for all x ∈ A ∩ (B ∪ C). By taking into account the properties of operations in
set theory and the definitions of M along with T and considering that T is a piecewise
function, we⎧can write the below equalities for M:
⎨ F(e) ∪ G(e) if e ∈ A ∩ (B − C) = (A ∩ B) − (A ∩ C)
M(e) = F(e) ∪ H (e) if e ∈ A ∩ (C − B) = (A ∩ C) − (A ∩ B)
⎩
F(e) ∪ (G(e) ∩ H (e)) if e ∈ A ∩ (B ∩ C)
for all e ∈ A ∩ (B ∪ C).
Now consider the right-hand side of the equality. Suppose that (F, A) ∪R
(G, B) = (Q, A ∩ B), where Q(x) = F(x) ∪ G(x) for all x ∈ A ∩ B = φ. Assume
(F, A) ∪R (H, C) = (W, A ∩ C), where W (x) = F(x) ∪ H (x) for all x ∈ A ∩
C = φ. Let⎧ (Q, A ∩ B) ∩ E (W, A ∩ C) = (N , (A ∩ B) ∪ (A ∩ C)), where
⎨ Q(e) if e ∈ (A ∩ B) − (A ∩ C)
N (e) = W (e) if e ∈ (A ∩ C) − (A ∩ B)
⎩
Q(e) ∩ W (e) if e ∈ (A ∩ B) ∩ (A ∩ C) = A ∩ (B ∩ C)
for all x ∈ (A ∩ B) ∪ (A ∩ C). By taking into account the definitions of Q and W,
⎧ N as below:
we can rewrite
⎨ F(e) ∪ G(e) if e ∈ (A ∩ B) − (A ∩ C)
N (e) = F(e) ∪ H (e) if e ∈ (A ∩ C) − (A ∩ B)
⎩
(F(e) ∪ G(e)) ∩ (F(e) ∪ H (e)) if e ∈ A ∩ (B ∩ C)
This follows that N and M are the same set-valued mapping when considering the
properties of operations on set theory, which completes the proof.
(h) By similar techniques used to prove (g), (h) can be illustrated, and is therefore
omitted.
Similar theorems follow for extended intersection and intersection also. Proofs are
in similar lines and hence omitted.
Theorem 1.3 Properties of extended intersection operation
(a) (F, A) ∩ E ((G, B) ∩ E (H, C)) = ((F, A) ∩ E (G, B)) ∩ E (H, C)
A = (F, A), (F, A) ∩ E
(b) (F, A) ∩ E U A = A
(G, B), then (F, A) ∩ E
(c) (F, A) ∩ E (G, B)(G, B), in general. But if (F, A)⊂
(G, B)⊂(G, B), moreover (F, A) ∩ E (G, B) = (G, B)
(d) (F, A) ∩ E ((G, B) ∪R (H, C)) = ((F, A) ∩ E (G, B)) ∪R ((F, A) ∩ E (H, C))
(e) ((F, A) ∪R (G, B)) ∩ E (H, C) = ((F, A) ∩ E (H, C)) ∪R ((G, B)
∩ E (H, C))
Theorem 1.4 Properties of intersection operation
(a) (F, A)
∩((G, B)
∩(H, C)) =((F, A) ∩(G, B))∩(H, C)
(b) (F, A)∩U A = (F, A), (F, A)∩U E = (F, A), (F, A)
A =
∩ A , (F, A) ∩
E
= A
(c) (F, A)
∩(G, B)(F, A), in general. But if (F, A)⊂ (G, B), then (F, A)
∩(G, B)⊂(F, A) moreover (F, A)
∩(G, B) = (F, A).
10 1 Soft Sets
In this sub section, we show that the following De Morgan’s type of results hold in
soft set theory for different types of union, intersection, complements, AND and OR
operations. Results given in this section are taken from Ali et al. [7] , Maji et al. [80]
and Sezgin et al. [123].
Let (F, A) and (G, B) be two soft sets over a common universe U . Then we have
the following:
Theorem 1.5 (De Morgan laws with respect to relative complement, restricted union
and intersection)
(a) [(F, A) ∪ R (G, B)]r = (F, A)r
∩(G, B)r
(b) [(F, A)∩(G, B)] = (F, A) ∪ R (G, B)r
r r
Proof (a) Let (F, A)∪ R (G, B) = (H, C) where H (c) = F(c) ∪ G(c) for all c ∈
C = A ∩ B = ∅. Since ((F, A) ∪ R (G, B))r = (H, C)r , by definition H r (c) = U −
[F(c) ∪ G(c)] = [U − F(c)] ∩ [U − G(c)] for all c ∈ C.
Now (F, A)r ∩(G, B)r = (F r , A)
∩(G r , B) = (K , C) where C = A ∩ B. So by
definition, we have,
Theorem 1.6 (De Morgan laws with respect to extended intersection, union and
neg-complement)
(a) [(F, A) ∩ E (G, B)]C = (F, A)C
∪(G, B)C
(b) [(F, A)
∪(G, B)] = (F, A) ∩ E (G, B)C
C C
⎪
⎨ F (e), i f e ∈A−B
c
Theorem 1.7 (De Morgan laws with respect to AND, OR, and neg complement)
Theorem 1.8 (De Morgan laws with respect to AND, OR, and relative complement)
12 1 Soft Sets
In most of the studies related to algebraic and topological structures, we often need
to handle indexed family of entities. Feng et al. [41] gives various union, intersection
and/or operations for indexed families of soft sets.
Definition 1.14 Let (Fi , Ai )i∈l be a nonempty family of soft sets over a common uni-
verse U. The union of these soft sets is defined to be the soft set (G, B) such that B =
i∈I Ai and, for all x ∈ B, G(x) = i∈I (x) Fi (x), where I (x) = {i ∈ I |x ∈ Ai }. In
this case, we write i∈I (Fi , Ai ) = (G, B).
Definition 1.15 Let (Fi , Ai )i∈I be a nonempty family of soft sets over a common
universe set U . The AN D- soft set
∧i∈I (Fi , Ai ) of these soft sets is defined to be the
soft set (H, B) such that B = i∈I Ai and H (x) = i∈I Fi (xi ) for all x = (xi )i∈I ∈
B.
Definition 1.16 Let (Fi , Ai )i∈I be a nonempty family of soft sets over a common
universe set U . The O R- soft set
∨i∈I (Fi , Ai ) of these soft sets is defined to be the soft
set (H, B) such that B = i∈I Ai and H (x) = i∈I Fi (xi ) for all x = (xi )i∈I ∈ B.
Definition 1.17 The restricted union of a nonempty family of soft sets (Fi , Ai )i∈I
over a common universe set U is defined as the soft set (H, B) = Ri∈I (Fi , Ai )
where B = i∈I Ai = ∅ and H (x) = i∈I Fi (x) for all x ∈ B.
Definition 1.19 Let (Fi , Ai )i∈l be a nonempty family of soft sets over a common
universe U. The intersection of these soft sets is defined to be the soft set (G, B)
such that B = i∈I Ai = ∅ and, for all x ∈ B, G(x) = i∈I Fi (x). In this case, we
write i∈I (Fi , Ai ) = (G, B).
Another random document with
no related content on Scribd:
In besieging a fortress, the object is to erect batteries on particular points as near as
possible to the place, and to render the communications to and between them safe.
For these purposes, a ditch is commenced at a distance from the fortress, and is
carried on in a slanting direction towards it, the laborers being protected by the earth
thrown up on the side next the place. When these approaches have been carried as
near as requisite, another ditch called a parallel is dug in front or even around the
fortress, batteries being constructed on its line where necessary. Sometimes another
parallel is made within the outer one. Along these ditches the cannon, ammunition,
troops, &c. are conveyed in comparative safety to the different batteries.
All things being ready, at three o'clock on the morning of the 14th of
June, the first brigade of the first division under General Berthezéne,
consisting of six thousand men, with eight pieces of artillery were on
their way to the shore, in boats towed by three steamers. They were
soon perceived by the Algerines, who commenced a fire on them
from their batteries; it however produced little or no effect, and was
soon silenced by the heavier shot from the steamers and brigs in the
eastern bay. At four the whole brigade was safely landed, and drawn
up on the south side of the peninsula near the shore battery, which
was instantly seized. In a few minutes more, the white flag of France
floated over the Torreta Chica; a guard was however placed at the
door of the Marabout, in order to show from the commencement, that
the religion of the inhabitants would be respected by the invaders.
By six o'clock the whole of the first and second divisions were landed
together with all the field artillery, and the Commander-in-chief of the
expedition was established in his head quarters near the Marabout,
from which he could overlook the scene of operations. General
Valazé had already traced a line of works across the neck of the
peninsula, and the men were laboring at the entrenchments; they
were however occasionally annoyed by shots from the batteries, and
it was determined immediately to commence the offensive. General
Poret de Morvan accordingly advanced from the peninsula at the
head of the first brigade, and having without difficulty turned the left
of the batteries, their defenders were driven from them at the point of
the bayonet; they were then pursued towards the encampment,
which was also after a short struggle abandoned, the whole African
force retreating in disorder towards the city.
This success cost the French about sixty men in killed and wounded;
two or three of their soldiers had been taken prisoners, but they were
found headless and horribly mutilated near the field of battle. The
loss of the Algerines is unknown, as those who fell were according to
the custom of the Arab warfare carried off. Nine pieces of artillery
and two small howitzers by which the batteries were defended, being
merely fixed on frames without wheels, remained in the hands of the
invaders.
While the first brigade was thus employed, the disembarkation of the
troops was prosecuted with increased activity, and as no farther
interruption was offered, the whole army and a considerable portion
of the artillery, ammunition and provisions were conveyed on shore
before night. It was not however the intention of the commanding
general immediately to advance upon Algiers; his object was to take
the city, and he was not disposed to lose the advantage of the
extraordinary preparations, which had been made in order to insure
its accomplishment. The third division of the fleet containing the
horses and heavy artillery had not arrived; unprotected by cavalry his
men would have been on their march exposed at each moment to
the sudden and impetuous attacks of the Arabs, and it would have
been needless to present himself before the fortresses which
surround the city, while unprovided with the means of reducing them.
He therefore determined to await the arrival of the vessels from
Palma, and in the mean time to devote all his efforts to the
fortification of the peninsula, so that it might serve as the depository
of his materiel during the advance of the army, and as a place of
retreat in case of unforeseen disaster. The first and second divisions
under Berthezéne and Loverdo were accordingly stationed on the
heights in front of the neck of the peninsula, from which the
Algerines had been expelled in the morning; in this position they
were secured by temporary batteries and by chevaux de frise of a
peculiar construction, capable of being easily transported and
speedily arranged for use. The third division under the Duke
D'Escars remained as a corps of reserve at Sidi Ferruch, where the
engineers, the general staff and the greater part of the non-
combatants of the expedition were also established. Some difficulties
were at first experienced from the limited supply of water, but they
were soon removed as it was found in abundance at the depth of a
few feet below the surface.
On the 15th, it was perceived that the Algerines had established their
camp about three miles in front of the advanced positions of the
French, at a place designated by the guides of the expedition as Sidi
Khalef; between the two armies lay an uninhabited tract, crossed by
small ravines, and overgrown with bushes, under cover of which the
Africans were enabled to approach the outposts of the invaders, and
thus to annoy them by desultory attacks. Each Arab horseman
brought behind him a foot soldier, armed with a long gun, in the use
of which those troops had been rendered very dexterous by constant
exercise; when they came near to the French lines, the sharp
shooter jumped from the horse and stationed himself behind some
bush, where he quietly awaited the opportunity of exercising his skill
upon the first unfortunate sentinel or straggler who should appear
within reach of his shot. In this manner a number of the French were
wounded, often mortally by their unseen foes; those who left the
lines in search of water or from other motives were frequently found
by their companions, without their heads and shockingly mangled.
As the Arabs were well acquainted with the paths, pursuit would
have been vain as well as dangerous, and the only effectual means
of checking their audacity was by a liberal employment of the
artillery.
On the 17th and 18th, some of the vessels arrived from Palma
bringing a few horses and pieces of heavy artillery, but not enough to
warrant an advance of the army. On the 18th, four Arab Scheicks
appeared at the outposts, and having been conducted to the
commander of the expedition, they informed him that the Algerines
had received large reinforcements, and were about to attack him on
the succeeding day. Bourmont however paid no attention to their
declarations, and gave no orders in consequence of them, although
it was evident from the increase in the number of their tents that a
considerable addition had been made to the force of his enemies.
On the day after the French had effected their landing, all the
Algerine troops except those which were necessary to guard the city
and the fortifications in its vicinity, were collected under the Aga's
immediate command, at his camp of Sidi Khalef; on the morning of
the 18th, the contingent of Oran also arrived, accompanied by a
number of Arabs who had joined them on the way. Thus
strengthened, and encouraged by the inactivity of the French, which
he attributed probably to want of resolution, Ibrahim determined to
make a desperate attack upon their lines, calculating that if he could
succeed in throwing them into confusion, it would afterwards be easy
to destroy them in detail. For this purpose he divided his army into
two columns, which are supposed to have consisted of about twenty
thousand men each; the right column under Achmet Bey of
Constantina was destined to attack Loverdo's division, which
occupied the left or northern side of the French position; the other
column was to be led by Ibrahim in person, with Abderrahman Bey of
Tittery as his lieutenant, against the right division of the invaders,
under Berthezéne.
The results of this action were highly important to the French, and
indeed it rendered their success certain. The Arabs began to
disappear, and the Turkish and Moorish soldiers retreated to the city,
from which it was not easy to bring them again to the field;
symptoms of insurrection among the populace also manifested
themselves. In this situation, it has been considered possible that
had Bourmont advanced immediately upon Algiers, the Dey would
have found it necessary to capitulate; there was however no reason
to believe that the disaffection would extend to the garrisons of the
fortresses, and the city could not have been reduced while they held
out.
On the 23d the vessels from Palma began to come in; the horses
were immediately landed, and two small corps of cavalry were added
to the troops encamped at Sidi Khalef. The fortifications of the
peninsula were also by this time completed, a line of works fifteen
hundred yards in length, having been drawn across the neck, and
armed with twenty-four pieces of cannon; by this means the whole of
the land forces were rendered disposable, as two thousand men
principally taken from the equipage de ligne3 of the fleet, were
considered sufficient for the security of the place. The provisions, &c.
were all landed, and placed within the lines, in temporary buildings
which had been brought in detached pieces from France;
comfortable hospitals were likewise established there, together with
bakeries, butcheries, and even a printing office, from which the
Estafette d' Alger, a semi-official newspaper, was regularly issued.
The communications between Sidi Ferruch and the camp, were
facilitated by the construction of a military road, defended by
redoubts and blockhouses placed at short intervals on the way.
3 A certain number of young men are annually chosen by lot in France, for the supply
of the army and navy, in which they are required to serve eight years. Those intended
for the navy, are sent to the dockyards, where they are drilled as soldiers, and
instructed in marine exercises for some time before they are sent to sea. The crew of
each public vessel must contain a certain proportion of those soldier sailors, who are
termed the equipage de ligne.
While this combat was going on, the remainder of the vessels from
Palma, nearly three hundred in number, entered the bay of Sidi
Ferruch. Their arrival determined Bourmont not to retire to his camp
at Sidi Khalef, but to establish his first and second divisions five
miles in advance of that spot, in the valley of Backshé-dere, so that
the road might be completed, and the heavy artillery be brought as
soon as landed to the immediate vicinity of the position on which it
was to be employed. The third division was distributed between the
main body and Sidi Ferruch, in order to protect the communications.
This advantage was however dearly purchased; for during the four
days passed in this situation, the French suffered greatly from the
Algerine sharp-shooters, posted above them on the heights, and
from two batteries which had been established on a point
commanding the camp. In this way Bourmont acknowledges that
seven hundred of his men were rendered unfit for duty within that
period; he does not say how many were killed.
The necessary arrangements having been completed, and several
battering pieces brought up to the rear of the French camp,
Bourmont put his forces in motion before day on the 29th of June.
Two brigades of d'Escar's division which had hitherto been little
employed, were ordered to advance to the left and turn the positions
of the Algerines on that side; on the right the same duty was to be
performed by a part of Berthezéne's division, while Loverdo was to
attack the enemy in the centre. They proceeded in silence, and
having gained the summits of the first eminences unperceived,
directed a terrible fire of artillery upon the Algerines, who having only
small arms to oppose to it were soon thrown into confusion and put
to flight. The Moors and Turks took refuge in the city and the
surrounding fortifications, while the Arabs and Kabyles escaped
along the seashore on the southeast, towards the interior of the
country.
The French had now only to choose their positions from investing
Algiers, which with all its defences lay before them. Besides the
Casauba and batteries of the city, they had to encounter four
fortresses. On the southeastern side near the sea, half a mile from
the walls was Fort Babazon, westward of which, and one mile
southward from the Casauba, was the Emperor's castle, presenting
the most formidable impediment to the approach of the invaders.
This castle was a mass of irregular brick buildings, disposed nearly
in a square, the circumference of which was about five hundred
yards. From the unevenness of the ground on which it was built, its
walls were in some places sixty feet high, in others not more than
twenty; they were six feet in thickness, and flanked by towers at the
angles, but unprotected by a ditch or any outworks, except a few
batteries which had been hastily thrown up on the side next the
enemy. In the centre rose a large round tower of great height and
strength, forming the keep or citadel, under which were the vaults
containing the powder. On its ramparts were mounted one hundred
and twenty large cannon, besides mortars and howitzers, and it was
defended by fifteen hundred Turks well acquainted with the use of
artillery, under the command of the Hasnagee or Treasurer who had
promised to die rather than surrender. As it overlooked the Casauba
and the whole city, it was clear that an enemy in possession of this
spot and provided with artillery, could soon reduce the place to dust;
but it was itself commanded in a like manner, by several heights
within the distance of a thousand yards, which were in the hands of
the French. The next fortress was the Sittit Akoleit or Fort of twenty-
four hours, half a mile north of the city; and lastly a work called the
English fort was erected on the seashore near Point Pescada, a
headland about one-third of the way between Algiers and Cape
Caxine. The object of the French was to reduce the Emperor's castle
as soon as possible, and in the mean time to confine the Algerines
within their walls as well as to prevent them from receiving succors.
For the latter purposes, it was necessary to extend their lines much
more than would have been compatible with safety, in presence of a
foe well acquainted with military science; trusting however to the
ignorance and fears of his enemies, Bourmont did not hesitate to
spread out his forces, even at the risk of having one of his wings cut
off by a sudden sortie. Loverdo in consequence established his
division on a height within five hundred yards of the Emperor's
castle; Berthezéne changed his position from the right to the centre,
occupying the sides of mount Boujereah the heights immediately
west of the city; while d'Escars on the extreme left, overlooked the
Sittit Akoleit, and the English fort. These positions were all taken
before two o'clock in the day.
The night of the 29th passed without any attack on the lines of the
French. Before morning the engineers under Valazé had opened a
trench within five hundred yards of the Emperor's castle, and various
country houses situated in the vicinity of that fortress, were armed
with heavy pieces and converted into batteries. As soon as this was
perceived from the castle, a fire was opened upon the laborers; but
they were already too well protected by the works which had been
thrown up, and few of the balls took effect. A sortie was next made
by the garrison, and for a moment they succeeded in occupying the
house of the Swedish Consul, in which a French corps had been
stationed; they were however immediately driven out, and forced to
retire to their own walls.
The high character for courage and skill which Admiral Duperré has
acquired by his long and distinguished services, precludes the
possibility of imagining that there could have been any want of either
of those qualities on his part in this affair. Indeed he would have
been most blameable had he exposed his ships and men to the fire
of the fortresses which extend in front of Algiers, at a period when
the success of the expedition was certain. The "moral effect" of
which the Admiral speaks in his despatch, might have been
produced to an equal or greater extent, by the mere display of the
forces in the bay; the only physical result of the cannonade, was the
abandonment of some batteries, on Point Pescada, which were in
consequence occupied by d'Escar's forces. The whole attack if it
may be so termed, was probably only intended to repress any
feelings of jealousy which may have arisen in the minds of the naval
officers and men, by thus affording them at least an ostensible right
to share with the army the glory of reducing Algiers.
BAI.
Bai was the Egyptian term for the branch of the Palm-tree. Homer
says that one of Diomede's horses, Phœnix, was of a palm-color,
which is a bright red. It is therefore not improbable that our word bay
as applied to the color of horses, may boast as remote an origin as
the Egyptian Bai.
THE CLASSICS.