Introduction

Mathematics is based on exact concepts and there is not vagueness for mathematical concepts. Since in many other fields such as medicine, engineering, economics and sociology, the notions are vague, researchers need to define some new concepts for vagueness. To deal with the these problems in real life, researchers proposed several methods such as fuzzy set theory, rough set theory and soft set theory. Fuzzy set theory [1] proposed by Zadeh in 1965 provides an appropriate framework for representing and processing vague concepts. The basic idea of fuzzy set theory hinges on fuzzy membership function. By fuzzy membership function, we can determine the belonging of an element to set to a degree. Rough set theory [2] which is proposed by Pawlak in 1982 is another mathematical approach to vagueness to catch the granularity induced by vagueness in information systems. It based on equivalence relation. The advantage of rough set method is that it does not need any additional information about data, like membership in fuzzy set theory.

Theory of fuzzy sets and theory of rough sets can be considered as tools for dealing with vagueness but both of these theories have their own difficulties. The reason for these difficulties is, possibly, the inadequacy of the parametrization tool of the theory as mentioned by Molodtsov [3] in 1999. Soft set theory [3] was initiated by Molodtsov as a completely new approach for modeling vagueness and uncertainty. According to Molodtsov [3, 4], the soft set theory has been successfully applied to many fields, such as functions smoothness, game theory, Riemann integration, theory of measurement and so on. He also showed how soft set theory is free from the parametrization inadequacy syndrome of fuzzy set theory, rough set theory, probability theory and game theory. Soft systems provide a very general framework with the involvement of parameters. Research works on soft sets are progressing rapidly in recent years.

Topological structure of soft sets was studied by many authors: Shabir and Naz [5] introduced the soft topological spaces which are defined over an initial universe with a fixed set of parameters. They studied the concepts of soft open set, soft interior point, soft neighbourhood of a point, soft separation axioms and subspace of a soft topological space. As a different approach to soft topology Çağman et al. [6] defined the concepts of soft open set, soft interior, soft closure, soft limit point, soft Hausdorff space. Aygünoğlu and Aygün [7] defined soft continuity of soft mapping, soft product topology and studied properties of soft projection mappings, soft compactness and generalized Tychonoff theorem to the soft topological space. Min [8] gave some results on soft topological spaces. Zorlutuna et al. [9] also investigated soft interior point, soft neighbourhood and soft continuity. They introduced the relationships between soft topology and fuzzy topology. Hussain and Ahmad [10] continued and discussed the properties of soft interior, soft exterior and soft boundary on soft topology. Varol and Aygün [11] defined convergence of sequences in soft topological space, diagonal soft set and studied the properties of soft Hausdorff space.

The main purpose of this paper is to introduce soft filters which are defined over an initial universe with a fixed set of parameters. First, we have given some basic ideas about soft sets, soft topological spaces and the results already studied. Then, we have discussed some basic properties of soft neighbourhoods. We have defined soft filters and studied some basic properties of soft filters. We have set up a soft topology with the help of a soft filter. We have introduced some new concepts in soft filters such as the greatest lower bound and the least upper bound of the family of soft filters, soft filter subbase and soft filter base. Also, we have explored some basic properties of these concepts.

Preliminaries

In this section, we present the basic definitions and results of soft set theory which may be found in earlier studies.

Let X be an initial universe set and E be the set of all possible parameters with respect to X. Parameters are often attributes, characteristics or properties of the objects in X. Let P(X) denote the power set of X. Then, a soft set over X is defined as follows.

Definition 1

[3] A pair (F, A) is called a soft set over X where A E and F : A P X is a set valued mapping. In other words, a soft set over X is a parameterized family of subsets of the universe X. For ε A , F ε may be considered as the set of ε-approximate elements of the soft set (F, A). It is worth noting that F ε may be arbitrary. Some of them may be empty, and some may have nonempty intersection.

Example 1

[12] Miss Zeynep and Mr. Ahmet are going to marry and they want to hire a wedding room. The soft set (F, E) describes the "capacity of the wedding room". Let X = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 be the wedding rooms under consideration, and E = e 1 = big , e 2 = central , e 3 = cheap , e 4 = quality , e 5 = elegant be the parameter set, F e 1 = u 2 , u 4 , F e 2 = u 1 , u 3 , u 4 , F e 3 = , F e 4 = u 1 , u 3 , u 5 , F e 5 = u 1 , u 6 . The soft set (F,E) is as follows: ( F , E ) = { e 1 = { u 2 , u 4 } , e 2 = u 1 , u 3 , u 4 , e 3 = , e 4 = u 1 , u 3 , u 5 , e 5 = u 1 , u 6 } .

Definition 2

[13] A soft set F A on the universe X is defined by the set of ordered pairs F A = e , f A ( e ) : e E , f A ( e ) P X , where f A : E P X , such that f A ( e ) if e A E and f A ( e ) = if e A . Here, f A is called an approximate function of the soft set F A . The value of f A ( e ) may be arbitrary.

Note that the set of all soft sets over X will be denoted by S ( X , E ) .

Definition 3

[14] Let F A S ( X , E ) . If f A ( e ) = for all e E , then F A is called an empty soft set, denoted by F Φ or Φ . f A ( e ) = means that there is no element in X related to the parameter e E . Therefore, we do not display such elements in the soft sets, as it is meaningless to consider such parameters.

Definition 4

[14] Let F A S ( X , E ) . If f A e = X for all e A , then F A is called an A-universal soft set, denoted by F A = A . If A = E , then the A-universal soft set is called a universal soft set, denoted by F E = E .

Definition 5

[5] Let Y be a nonempty subset of X, then Y denotes the soft set Y E over X for which Y e = Y , for all e E . In particular, X E will be denoted by X .

Definition 6

[14] Let F A , G B S ( X , E ) . Then F A is a soft subset of G B , denoted by F A G B if f A ( e ) g B ( e ) , for all e E .

Definition 7

[14] Let F A , G B S ( X , E ) . Then F A and G B are soft equal, denoted by F A = G B , if and only if f A ( e ) = g B ( e ) for all e E .

Definition 8

[14] Let F A , G B S ( X , E ) . Then, the soft union F A G B , the soft intersection F A G B , and the soft difference F A \ G B of F A and G B are defined by the approximate functions h A B ( e ) = f A ( e ) g B ( e ) , h A B ( e ) = f A ( e ) g B ( e ) , h A \ B ( e ) = f A ( e ) \ g B ( e ) , respectively, and the soft complement F A c of F A is defined by the approximate function f A c ( e ) = f A c ( e ) , where f A c ( e ) is the complement of the set f A ( e ) ; that is, f A c ( e ) = X \ f A ( e ) for all e E .

Definition 9

[9] Let I be an arbitrary index set and { ( F A ) i } i I be a subfamily of S ( X , E ) .

  1. (a)

    The union of these soft sets is the soft set G C , where g C ( e ) = i I ( f A ) i ( e ) for each e E . We write i I ( F A ) i = G C .

  2. (b)

    The intersection of these soft sets is the soft set H D , where h D ( e ) = i I ( f A ) i ( e ) for all e E . We write i I ( F A ) i = H D .

Definition 10

[9] The soft set F A S ( X , E ) is called a soft point in X , denoted by e F , if for the element e A , f A ( e ) and f A ( e ) = for all e A - { e } . The soft point e F is said to be in the soft set G B , denoted by e F G B , if for the element e A and f A ( e ) g B ( e ) .

Proposition 1

[9] Let e F X and G B X . If e F G B then e F G B c .

Definition 11

[5] Let τ S ( X , E ) . A soft topology on X, denoted by τ , is a collection of soft subsets of X having the following properties:

  1. (1)

    Φ, X τ

  2. (2)

    If F A , G B τ , then F A G B τ

  3. (3)

    If ( F A ) λ τ , λ Δ , then λ Δ ( F A ) λ τ

The pair ( X , τ ) is called a soft topological space. Every member of τ is called a soft open set. A soft set F A is called soft closed in ( X , τ ) if F A c τ .

Definition 12

[9] A soft set G B in a soft topological space ( X , τ ) is called a soft neighbourhood of the soft point e F X if there exists a soft open set H C such that e F H C G B .

Remark 1

A soft set G B in a soft topological space ( X , τ ) is not only a soft neighbourhood of the soft point e F , it is also a soft neighbourhood for all soft points of the soft set H C by Definition 12.

The neighbourhood system of a soft point e F , denoted by N τ ( e F ) , is the family of all its soft neighbourhoods.

Theorem 1

[9] The neighbourhood system N τ ( e F ) at e F in a soft topological space ( X , τ ) has the following properties:

  • V 1 ) If G B N τ ( e F ) , then e F G B ,

  • V 2 ) If G B N τ ( e F ) and G B H C , then H C N τ ( e F ) ,

  • V 3 ) If G B , H C N τ ( e F ) , then G B H C N τ ( e F ) ,

  • V 4 ) If G B N τ ( e F ) , then there is a M D N τ ( e F ) such that G B N τ ( e H ) for each e H M D .

Definition 13

Let ( X , τ ) be a soft topological space and let G τ ( e F ) be a family of some soft neighbourhoods of soft point e F . If, for each soft neighbourhood G B of e F , there exists a H C G τ ( e F ) such that e F H C G B , then we say that G τ ( e F ) is a soft neighbourhood base at e F .

Theorem 2

Let ( X , τ ) be a soft topological space and G B S ( X , E ) . G B is soft open if and only if it is a soft neighbourhood of each of its soft points.

Proof

If G B is a soft open set, then for each soft point e F G B , e F G B G B . Since G B τ , G B is a soft neighbourhood of each of its soft points by Definition 12.

For each soft point e F G B , there exists a soft set ( H C ) e F τ such that e F ( H C ) e F G B . For each e F G B , since e F ( H C ) e F we obtain e F e F G B ( H C ) e F and G B e F G B ( H C ) e F . Conversely, for each e F G B , since ( H C ) e F G B , we obtain e F G B ( H C ) e F G B . Consequently, we get G B = e F G B ( H C ) e F . Hence, G B is a soft open set by Definition 11.

Theorem 3

If for each soft point e F X there corresponds a family N ( e F ) such that the properties V 1 ) , V 2 ) , V 3 ) and V 4 ) in Theorem 1 are satisfied, then there is a unique τ soft topological structure overX such that for each e F X , N ( e F ) is the family of τ -soft neighbourhoods of e F .

Proof

Let τ = { G B S ( X , E ) : e F G B G B N ( e F ) } . It is clear that, τ is a soft topology over X. The family τ certainly satisfies axioms ( 3 ) and ( 2 ) in Definition 11: for ( 3 ) , this follows immediately from V 2 ) in Theorem 1, and for ( 2 ) , from V 3 ) in Theorem 1. The axiom ( 1 ) in Definition 11 is a result of V 2 ) and V 3 ) in Theorem 1. It remains to show that, in the soft topology defined by τ , N ( e F ) is the set of τ -soft neigbourhoods of e F for each e F X . It follows from V 2 ) in Theorem 1 that every τ -soft neighbourhood of e F belongs to N ( e F ) . Conversely, let ( G B ) 1 be a soft set belonging to N ( e F ) , and let ( G B ) 2 be the soft set of soft points e M X such that ( G B ) 1 N ( e M ) . If we can show that e F ( G B ) 2 , ( G B ) 2 ( G B ) 1 and ( G B ) 2 τ , then the proof will be complete. Since for every soft point e M ( G B ) 2 belongs to ( G B ) 1 by reason of V 1 ) in Theorem 1 and the hypothesis ( G B ) 1 N ( e M ) , we obtain ( G B ) 2 ( G B ) 1 . Since ( G B ) 1 N ( e F ) and ( G B ) 2 ( G B ) 1 , we have e F ( G B ) 2 . It remains to show that ( G B ) 2 τ , i.e. that ( G B ) 2 N ( e M ) for each e M ( G B ) 2 . If e M ( G B ) 2 then by V 4 ) in Theorem 1 there is a soft set ( G B ) 3 such that for each e H ( G B ) 3 we have ( G B ) 1 N ( e H ) . Since ( G B ) 1 N ( e H ) means that e H ( G B ) 2 , it follows that ( G B ) 3 ( G B ) 2 and, therefore, by V 2 ) in Theorem 1, that ( G B ) 2 N ( e M ) .

Soft filter

Definition 14

Let F S ( X , E ) , then F is a called a soft filter on X if F satisfies the following properties:

  • f 1 ) Φ F

  • f 2 ) F A , G B F F A G B F

  • f 3 ) F A F and F A G B G B F

Remark 2

F satisfies the following property from f 1 ) and f 2 ) : “The all finite intersections of soft sets of F are not soft empty”.

Remark 3

It is clear that X F by f 3 ) .

Example 2

The family F = { X } is a soft filter over X.

Example 3

Let Φ F A S ( X , E ) . Then, the family F F A = { G B : F A G B S ( X , E ) } is a soft filter over X and it is called atomic soft filter.

Example 4

Let N be the natural numbers and E be a finite set. Consider the family F = { F A : e E N \ f A ( e ) i s f i n i t e } , then F is a soft filter and it is called soft Frechet filter.

Example 5

Let X be an infinite set and E be a finite set. Consider the family F = { F A : e E X \ f A ( e ) i s f i n i t e } , then F is a soft filter and it is called soft cofinite filter.

Example 6

Let X be an uncountable set and E be a countable set. Consider the family F = { F A : e E X \ f A ( e ) i s c o u n t a b l e } , then F is a soft filter and it is called soft cocountable filter.

Proposition 2

Let F be a soft filter over X. Then the collection

F e = { f A ( e ) : F A F }

for each e E , does not define a filter over X.

Proof

If f A ( e ) = for any e E then F e . Hence F e is not a filter over X in general topology.

Example 7

Let X = { x 1 , x 2 , x 3 } , E = { e 1 , e 2 , e 3 } and F = { X , ( F A ) 1 , ( F A ) 2 , ( F A ) 3 , ( F A ) 4 } be a soft filter defined over X where ( F A ) 1 = { ( e 1 , ) , ( e 2 , ) , ( e 3 , { x 1 , x 3 } ) } , ( F A ) 2 = { ( e 1 , ) , ( e 2 , { x 2 , x 3 } ) , ( e 3 , { x 1 , x 3 } ) } , ( F A ) 3 = { ( e 1 , { x 1 , x 2 } ) , ( e 2 , ) , ( e 3 , { x 1 , x 3 } ) } , ( F A ) 4 = { ( e 1 , { x 1 , x 2 } ) , ( e 2 , { x 2 , x 3 } ) , ( e 3 , { x 1 , x 3 } ) } . Since F e 1 , then F e 1 is not a filter over X.

Theorem 4

Let ( X , τ ) be a soft topological space. The neighbourhood system N τ ( e F ) is a soft filter for every e F X . Also, it is called soft neighbourhoods filter of the soft point e F .

Proof

  • f 1 ) By V 1 ) in Theorem 1, since e F G B , we obtain Φ N τ ( e F ) .

  • f 2 ) This is clearly seen by V 3 ) in Theorem 1.

  • f 3 ) This is clearly seen by V 2 ) in Theorem 1.

Now, we set up a soft topology with the help of a soft filter.

Theorem 5

If, for every e F X , there exists a soft filter F ( e F ) = N τ ( e F ) which satisfies the following two properties, then there exists an unique soft topology τ such that F ( e F ) consists of the τ -soft neighbourhoods of the soft point e F .

  • V f 1 ) Every soft set in the soft filter F ( e F ) contains the soft point e F ,

  • V f 2 ) For every G B F ( e F ) there exists a H C F ( e F ) such that for every e M H C , G B F ( e M ) .

Proof

Since the axioms f 1 ) , f 2 ) , f 3 ) , V f 1 ) and V f 2 ) are equivalent to the neighbourhood axioms V 1 ) - V 4 ) , by Theorem 3, there exists a soft topology τ such that F ( e F ) consists of the τ -soft neighbourhoods of the soft point e F .

Example 8

Let ( X , τ ) be a soft topological space and e F X . Since G B cannot be an element of G τ ( e F ) for every H C G τ ( e F ) and H C G B , then the soft neighbourhood base G τ ( e F ) is not a soft filter over X.

Definition 15

Let F 1 and F 2 be soft filters over X. If F 1 F 2 , then F 2 is soft finer than F 1 . If F 1 F 2 , then F 2 is soft strictly finer than F 1 . If either F 1 F 2 or F 2 F 1 , then F 1 is comparable with F 2 .

Proposition 3

Let ( F i ) i I be a family of soft filters. Then, the family ( F i ) i I is partially ordered according to”.

Theorem 6

Let ( F i ) i I be a family of soft filters over X. Then F = i I F i is a soft filter over X.

Proof

  • f 1 ) Since Φ F i for each i I , then Φ does not belong to F = i I F i .

  • f 2 ) Let F A , G B F = i I F i . Then, F A , G B F i for each i I . Since F A G B F i for each i I , so we obtain F A G B F = i I F i .

  • f 3 ) Let F A F = i I F i and F A G B . Since F A F i for each i I and F A G B , we get G B F i for each i I . Hence G B F = i I F i .

Remark 4

The soft filter F in Theorem 6 is called the greatest lower bound of the family ( F i ) i I .

Remark 5

The union of soft filters over X is generally not a soft filter over X.

Example 9

Let X = { x 1 , x 2 , x 3 } , E = { e 1 , e 2 } and F 1 = { X , ( F A ) 1 , ( F A ) 2 , ( F A ) 3 } , F 2 = { X , ( G B ) 1 , ( G B ) 2 , ( G B ) 3 } be two soft filters defined over X where ( F A ) 1 = { ( e 1 , { x 1 } ) , ( e 2 , { x 2 , x 3 } ) } , ( F A ) 2 = { ( e 1 , { x 1 , x 2 } ) , ( e 2 , X ) } , ( F A ) 3 = { ( e 1 , { x 1 } ) , ( e 2 , { x 2 } ) } and ( G B ) 1 = { ( e 1 , { x 3 } ) , ( e 2 , { x 1 , x 2 } ) } , ( G B ) 2 = { ( e 1 , { x 1 , x 3 } ) , ( e 2 , X ) } , ( G B ) 3 = { ( e 1 , { x 1 , x 3 } ) , ( e 2 , { x 1 , x 2 } ) } . Now, we define F = F 1 F 2 = { X , ( F A ) 1 , ( F A ) 2 , ( F A ) 3 , ( G B ) 1 , ( G B ) 2 , ( G B ) 3 } . If we take ( F A ) 1 ( G B ) 1 = H C then h C ( e 1 ) = ( f A ) 1 ( e 1 ) ( g B ) 1 ( e 1 ) = { x 1 } { x 3 } = and h C ( e 2 ) = ( f A ) 1 ( e 2 ) ( g B ) 1 ( e 2 ) = { x 2 , x 3 } { x 1 , x 2 } = { x 2 } but H C F . Hence F is not a soft filter over X.

Now, we investigate the least upper bound of the family of soft filters over X.

Proposition 4

Let S S ( X , E ) . Then there exists a soft filter F which contains the soft family S , if S has the following property: "The all finite intersections of soft sets of S are not soft empty”.

Proof

Let S = { ( F A ) i : i J ( J i s f i n i t e ) , i J ( F A ) i Φ } .

Then we give the family which consists of finite intersections of elements of S ; β = { G B : i J ( J i s f i n i t e ) , ( F A ) i S a n d G B = i J ( F A ) i } .

Then, the family F ( S ) = { H C : G B β a n d G B H C } is a soft filter over X.

  • f 1 ) Since Φ β , for every H C F ( S ) , H C Φ and so Φ F ( S ) .

  • f 2 ) Let ( H C ) 1 , ( H C ) 2 F ( S ) . There exist soft sets ( G B ) 1 , ( G B ) 2 β such that ( G B ) 1 ( H C ) 1 and ( G B ) 2 ( H C ) 2 . From the definition of β , Φ ( G B ) 1 ( G B ) 2 β . Since ( G B ) 1 ( G B ) 2 ( H C ) 1 ( H C ) 2 , we obtain ( H C ) 1 ( H C ) 2 F ( S ) .

  • f 3 ) Let ( H C ) 1 F ( S ) and ( H C ) 1 ( H C ) 2 . Then, there exists a soft set G B β such that G B ( H C ) 1 . Since ( H C ) 1 ( H C ) 2 , we obtain ( H C ) 2 F ( S ) .

Remark 6

The soft filter F ( S ) in Proposition 4 is said to be generated by S and S is said to be soft filter subbase of F ( S ) . It is clear that, S F ( S ) .

Proposition 5

The soft filter F ( S ) which is generated by S is the coarsest soft filter which contains S .

Proof

Suppose that S F 1 . By Proposition 4, S β F 1 . By Remark 6, for every H C F ( S ) , there exists a G B β such that G B H C . Since β F 1 then G B F 1 . Since F 1 is a soft filter, H C F 1 by f 3 ) in Definition 14. Hence we obtain F ( S ) F 1 .

Theorem 7

The family ( F i ) i I of soft filters over X has a least upper bound if and only if for all finite subfamilies ( F i ) 1 i n of ( F i ) i I and all ( G B ) i F i ( 1 i n ) , the intersection ( G B ) 1 . . . ( G B ) n is not soft empty.

Proof

If there exists a least upper bound of the family ( F i ) i I , by f 1 ) and f 2 ) in Definition 14, for all finite subfamilies ( F i ) 1 i n of ( F i ) i I and all ( G B ) i F i ( 1 i n ) , the intersection ( G B ) 1 . . . ( G B ) n Φ .

Let ( G B ) 1 . . . ( G B ) n Φ for all finite subfamilies ( F i ) 1 i n of ( F i ) i I and all ( G B ) i F i ( 1 i n ) . Then, the soft filter F ( S ) generated by

S = i I F i = { F A : ( i I ) F A F i }

is the least upper bound of the family ( F i ) i I by Proposition 5.

Definition 16

Let β S ( X , E ) , then β is said to be a soft filter base on X if

  • b 1 ) β Φ and Φ β ,

  • b 2 ) F A , G B β , H C β H C F A G B .

Remark 7

β which is in Proposition 4 is a soft filter base.

Remark 8

It is clear that, every soft filter is a soft filter base.

Example 10

Let Φ F A S ( X , E ) . Then, the family β = { F A } is a soft filter base over X.

Example 11

Let ( X , τ ) be a soft topological space and e F X . The soft neighbourhood base G τ ( e F ) is a soft filter base over X.

  • b 1 ) Clearly, G τ ( e F ) . For every H C G τ ( e F ) , e F H C . Then, H C Φ . Hence, we obtain Φ G τ ( e F ) .

  • b 2 ) Let G B , H C G τ ( e F ) . Since G B , H C N τ ( e F ) , we get G B H C N τ ( e F ) . By Definition 13, there exists a K D G τ ( e F ) such that K D G B H C . Hence we get G τ ( e F ) is a soft filter base of soft neighbourhoods filter N τ ( e F ) by Definition 16.

Author contribution

All authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.