DEPARTMENT OF MATHEMATICS

SESSION: 2021-2022

PROJECT REPORT ON FILTER ON ALGEBRAIC STRUCTURE

GUIDED BY: SUBMITTED BY:

Dr. JAYANTA SEN NAME: ANISH MUKHERJEE
ASSOCIATE PROFESSOR, B.Sc. 6TH SEMESTER
MATHEMATICS DEPT, GGDC, SINGUR
GGDC, SINGUR. ROLL NO: 190342000004
REG NO: 201901056801
OF 2019-20
 certificate

This is to certify that ANISH MUKHERJEE , a student if semester vi

of year 3rd, department of mathematics, GOVERNMENT GENERAL
DEGREE COLLEGE, SINGUR, has successfully completed the
project work on filter on algebraic structure during the year
2022 under the guidance of Dr. Jayanta Sen.

SIGNATURE OF THE SIGNATURE OF THE GUIDE

EXTERNAL EXAMINER Dr. Jayanta Sen

ASSOCIATE PROFFESOR
DEPARTMENT OF MATHEMATICS
GGDC SINGUR
 DECLARATION

I hereby declare that the project report entitled “Filters on algebraic

structure” submitted by me to Government General Degree College,
Singur in partial fulfillment of the requirement for the award of the
degree of B.Sc. honours in Mathematics is a record of bonafide project
work carried out by me under the guidance of Dr. Jayanta Sen,
Associate professor , Government General Degree College, Singur. I
further declare that the work reported in this project has not been
submitted here before by any student.

SIGNATURE OF THE STUDENT

Anish Mukherjee
Semester: 6th
Roll no: 190342000004
 aCKNOWLEDGEMENT

I would like to express my sincere thanks to Mr. Satyajit

Chowdhury ,HOD, Department of Mathematics, Government General
Degree College, Singur for his encouragement and suggestions.
I feel to acknowledge my in debtness and deep sense of gratitude to
my guide Dr. Jayanta Sen whose valuable guidance and kind
supervision given to me throughout the project which shaped the
present work as its show.

SIGNATURE OF THE STUDENT

Anish Mukherjee
Semester: 6th
Roll no: 190342000004
 ABSTRACT

The aim of this project work is to study filters originated in algebraic

structures like Poset , distributed lattice etc. with application. In the
section “Recalling”, some basic definitions have been introduced.
Principal, non-principal, maximal and prime filter with some basic
properties are studied and we have studied the relation between
quantifiers and filters as well as model theory and filters. Frechet
(Cofinite) filter is introduced as well. We have studied the ultrafilter in
additive measure also.
 Recalling

Topological space: A topological space is an ordered pair

where is a set and is a collection of subsets of satisfying the
following conditions:
1.
2. Any arbitrary (finite or infinite) unions of numbers of belongs to
.
3. The intersection of any finite numbers of members of belongs to

Then is called a topology.

Partial Order Relation: A partial order relation is a homogeneous
relation which is transitive and anti-symmetric i.e. a relation
defined on a set is a partial order relation if:
1.
2. If ,
POSET: A set with a partial order relation is said to be a poset.
IDEAL OF A SET: A subset of a partially ordered set is said to
be an ideal if the following conditions are satisfied,
i) I is non empty
ii) For all and ,
iii) For all such that and .
LATTICE: An algebra is said to be a lattice if is non empty
set, are binary operations on which are idempotent,
associative, commutative and they satisfy the absorption theory.
DISTRIBUTIVE LATTICE: An algebra is called a bounded
lattice if , it satisfies the following properties,
i)
ii)
iii) ,
iv) ,
v)
vi)
ANNIHILATOR OF AN ELEMENT: For any element of a distributive
lattice , the annihilator of is defined as the set
 FILTER
DEFINITION: let be any set. A filter on the set is a subset of
, the power set of with the following properties,
i) and
ii) If then
iii) If and then

Let us see an example of a filter. Consider a topological space .

Suppose . A subset of is called a neighbourhood of if
such that . Then the set consisting all the
neighbourhoods of forms a filter on . Clearly and . Let
be given and ⁄ ⁄ in .
Then . also a neighbourhood for such that
implies that . Therefore it is clear that forms a
filter on it is called the neighbourhood filter.
Now we see some special forms of filters, like
i) Principal filter
ii) Cofinite set filter
iii) Ultrafilter
iv) Free filter.

The principal filter applying on a point of a given

set is denoted by and defined by .
 Let be a set given. A subset is called
cofinite if i.e. is finite. A family of such sets forms a filter
generally called the cofinite filter.
Ex: Let . Then
forms a cofinite set filter.

A filter defined on a set is said to be an ultrafilter if

for all either or .
For example, let us define the principal filter applying on of a given
set , be . Therefore the filter is an ultrafilter. Let and
. Then if , then . But if , then and then
. Hence it is clear that is an ultrafilter.

A filter applying on a set is a free filter if for all

⋂ .
For example, the cofinite filter is a
free filter.

A cofinite filter can

be defined on both, finite sets and infinite sets.

Case1: Let , an infinite set. We have shown that the family

is a cofinite filter. Now let
, the set of all even natural numbers.
Also let . Neither the set nor the set is finite.
But . Therefore we have but .
Therefore is not an ultrafilter.

Case 2: Let be a finite set. Then the cofinite filter on

. We can easily show that is an ultrafilter.
1. Let . Then but .
2. Let . Then .
3. Let . Since is finite therefore is also finite. So .
Hence from points 1,2,3 we can conclude that is an ultrafilter.

Hence from Case 1 and Case 2, we can say that if a cofinite filter is
defined on a set , then it forms an ultrafilter if is finite. But if
is infinite, it may not form an ultrafilter.

a non empty family of subsets of a

given set is said to have finite intersection property if the
intersection over any finite subcollection of is non empty.
Let be a non empty family of subsets of a set , such that has the
finite intersection property. Then the closure of under taking finite
intersection and supersets
〈 〉 forms a
filter on . Now is non empty and .
Therefore 〈 〉. Again . Then 〈 〉.
Let 〈 〉 and . Then
Then
Then 〈 〉
Now every filter containing must contain every intersection of
finitely many members of , and thus also every set containing such
an intersection .
This is the smallest filter containing , generally called the filter
generated by .

Now we look forward to see some basic properties of filter basis and
free ultrafilter with definition which would help us to characterize the
measure theory in ultrafilter point of view.

let Then is a filter basis on if

i)
ii)
iii) .
Now let us consider the family .
Now, . So . Now .
Let us take . Then we have for and which implies
. Therefore .
Let and . Then such that
.
Hence we see that forms a filter on . We can conclude that for
every filter basis on , there exists a filter on such that
.

We have seen ultrafilters and free filters. Now a

filter defined on a set with the following properties is called a free
ultrafilter.
i) either or
ii)⋂ .
Let us restrict the set as the set of all natural numbers. Let is a free
filter on . Let u consider the family

Now , therefore . Let us partially order the set by set

inclusion , so that either or .

Let ⋃ .
1. If then for some . But being a free filter i.e. a filter,
for all . Therefore .
2. Let . Then such that and . Then
.

3. Let and .
Then for some . But being a free filter i.e. a filter and
with , then and hence .
From 1, 2, 3 we can deduce that forms a filter on . We can easily
show that is an ultrafilter.
Let ⋂
Then . Now ⋃ .
This shows that such that ⋂ …………(A)
But is a free filter. So ⋂ This contradicts (A). therefore
⋂ and hence is a free ultrafilter.

Hence we can say that, every free filter on can be extended to a

free ultrafilter on

A field on a set is a non empty collection of subsets of

closed under complement and countable unions as well as
intersections.

Let be a set and be a field. A function

is called a measure if the following conditions are
satisfied.
i)
ii) =
iii) ⋃ =∑
Let denote a fixed, finitely additive measure on such that
i)
ii)
Now we will see some interesting properties of this additive measure.
being a finitely additive measure,

Now, let be fixed. Let and . Then,

=
= + [As ]
= , which contradicts the fact
that
Therefore must be .
i) For , either or i.e. but
not both.
Let .
Then [ ]
[ ] [ ]
But [ ] [ ] [ ]
Then , [ ]

ii) For all with , .

Let such that . Also let .
Let . Then ( )

( ) as and
, which raises a contradiction.
Therefore .
iii) For such that and , .
From the properties (i),(ii),(iii), we can see that there is a similarity
between additive measure and filter. It’s not just a similarity, the
measure is actually forming a filter on .

We wish to think of a filter applying on a set

as measuring largeness. We will call the sets in as -large. With
this interpretation, the axioms of filters take the form as,
i) is not -large and itself is -large.
ii) The intersection of two -large sets is again -large.
iii) If a set has an -large subset, then the set itself is -large.
Let us consider the family .
As , so . Therefore .
Let and . Then . Now as .
Now being a filter,
For , .
[By the properties of filter]
And as well as .
This shows that is an ideal, generally called the dual ideal.
Now each ideal gives a sense, we will call the “smalness”. We would
call sets in , “ -small”.
Comparing this property with filter largeness, we can see that a set
is -large if and only if is -small.

Definition: -Stationary: Let a filter is applying on a set . Then a

set is called -Stationary if .
A filter is an ultrafilter if and only if every -Stationaryset is -
large.
It is often the case that we want to know whether the set of elements
with a given property is ,or is not, a member of some filter. For this
type of case, we would define filter quantifiers.
Def: An atomic proposition is simply a subset of .
For each tuple , we say that holds
if . The set of propositions is the smallest set such
that
i) Every atomic proposition is a proposition.
ii) If is proposition then is also a proposition which holds if and
only if does not hold.
iii) If and are propositions , then
is a proposition that holds if and only if both and hold.
iv) If and are propositions, then
is a proposition that holds if at least one of or hold.
Def: the semantics of filter quantifiers are given by;
i) holds, for fixed if and only if the
set is -large.
ii) holds if and only if )( )
does not hold.
For example let be a non empty set, let be the principal filter 〈 〉
and let . Then the usual quantification

That says all elements of are in is equivalent to . The

usual existential quantification

That says at least one element of is equivalent to .

Filter On Distributive Lattice: Let be the set of all dense elements

of a distributive lattice. Then forms a filter. Now a filter on a
distributive lattice is called a -filter if . The set of all dense
elements of the distributive lattice is the smallest -filter.
Let be an arbitrary filter defined on a distributive lattice . A filter
of is called a -filter of if contains .
For any subset of a distributive lattice , let us define 〈 〉 ,
where is the smallest filter containing . Clearly 〈 〉 is an -filter
of and, in fact the smallest one to contain . For , we denote
simply 〈 〉 for 〈 〉 . Then clearly 〈 〉 = and 〈 〉 . Moreover ,
for any ,〈 〉 is the smallest -filter containing
which is known as the principal -filter generated by .

Filter:Topological point of view: We have studied the

neighbourhood filter. Filters usually are used in topology to define
convergence in a manner similar to the role of sequence in metric
spaces. As we know that a sequence in is by definition a map from
. The original notion of convergence in a topological space was
that of a sequence converging to a given point in a metric space.
But filters generalize sequence convergence in a different way by
considering only the values of a sequence. For example, consider the
sequence in a metric space . By definition is a
function whose values at is denoted by . Then
But this set is not enough to characterize the convergence
of the sequence. Let us introduce the tails of as

……
Now these sets completely determine this sequence’s convergence or
non convergence to a certain point by checking its neighbourhoods.