Chapter 1

Introduction

Since the famous paper ”Fuzzy Sets” was presented in 1965 by Professor L.A. Zadeh [1],
the theory of fuzzy sets has made considerable progress. It has exerted a tremendous
influence on modern science and technology such as mathematics, natural science,
management science, sociology, economics, philosophy, law, psychology, linguistics,
medicine, control theory, signal processing, etc. The purpose of the paper is to im-
prove the dissemination and exchange of the theory and application in the fuzzy realm.
The study of the fuzzy algebraic structures started with the introduction of concepts
of fuzzy subgroups and fuzzy ideals in the pioneering paper of Rosenfeld [11].

Uncertainty is an inherent aspect of life, presenting challenges to human compre-

hension and traditional mathematical frameworks. Fuzzy sets provide a specialized
mathematical tool designed to address this uncertainty, offerin a structured way to
model and navigate imprecision. which is quickly gained traction among researchers
and found applications across a wide range of scientific disciplines. Since then, the
body of literature on fuzzy set theory and its applications has expanded significantly,
with numerous studies spanning fields such as economics, psuchology, artificial intelli-
gence, network analysis and decision -making.

The process of fuzzification of algebraic structures extends classical algebraic con-

cepts to account for uncertainty and imprecision. It involves intergrating degrees of
membership or truth values into tradition algebraic definitions and operators, reflecting
the inherent fuzziness of real-world data.

Building on this, researchers have extended fuzzification to other algebraic struc-

tures, including fuzzy subring. These generalized the concept of rings by permitting
elements to partially satisfy the properties of distributivity and associativity. The in-
troduction of fuzzy subring and fuzzy ideals Liu in 1982 was a major milestone, futher
advanced by researchers such as, who significantly broadened and deepened the study
within this domain.
.
It is clear that many basic properties in ring theory are found to be carried over
to fuzzy rings. Malik [3], Mukererjee and Sen [12] studied rings with chain conditions
with the help of fuzzy ideals and the notions of fuzzy quotient rings were in- troduced

1
by Kumar [2], Kuroaka and Kuroki [7]. In this paper we investigate 87 R. Rasuli rings
with chain conditions on their fuzzy substructures and prove some characterizations of
rings with chain conditions in terms of fuzzy quotient rings and fuzzy ideals.

History of Fuzzy Rings:

concept of fuzzy rings developed from Fuzzy Set Theory and Abstract Algebra. It
combines the ideas of fuzzy sets with algebraic ring structures.

Origin of Fuzzy Sets

The idea of fuzzy sets was introduced by Lotfi A. Zadeh[1] in [Link] published
the famous paper “Fuzzy Sets”, which introduced the concept of membership functions
where elements can belong to a set with degrees between 0 and 1.

Introduction of Fuzzy Algebra

After Zadeh’s work, mathematicians began applying fuzzy concepts to algebraic
structures such as groups, rings, and ideals. In 1971, Azriel Rosenfeld[11] introduced
the concept of fuzzy subgroups, which started the study of fuzzy algebra.

Development of Fuzzy Rings

Later, researchers extended fuzzy ideas to ring theory. In 1987, J. Liu [14]intro-
duced the concept of fuzzy ideals of rings and studied their properties. This work
helped develop the theory of fuzzy rings and fuzzy subrings.

1.1 PRELIMINARIES
In this chapter, we collect some basic definitions and theorems on operations on fuzzy
set which are needed for the subsequent for fuzzy ring theoretic terminology.

Definition 1.1
If X be a universal set and x be any element of X, fuzzy set A, defined onX may
be written as a collection of order pairs A = {(x, µA (x); x ∈ X} where µA (x): X →
[0,1], is called the membership function or grade of membership in X in A is called a
fuzzy set.

Example:
Let the universe of discourse be X = {1, 2, 3, 4, 5} Let A be a fuzzy set representing
the concpt of ”Tall” [Link] fuzzy set A is defined as:

A = {(1, 0.1), (2, 0.3), (3, 0.6), (4, 0.8), (5, 0.1)}

Here, each ordered pair (x, µA (x)) denotes the degree to which X belongs to the fuzzy
set A.

2
 Definition 1.2
Let X be a non-empty set and let A and B be two fuzzy sets in X with membership
functions µA and µB , [Link] A is said to be a fuzzy subset of B, written
as A ⊆ B, if µA (x) ≤ µB (x) for all x ∈ X.

Example:
Let X = {1, 2, 3, 4}.
Define two fuzzy sets A and B as follows:

A = {(1, 0.2), (2, 0.4), (3, 0.6), (4, 0.7)}

B = {(1, 0.3), (2, 0.5), (3, 0.8), (4, 1.0)}.

Since µA (x) ≤ µB (x) for all x ∈ X, we conclude that A ⊆ B.

Definition 1.3
The complement of a fuzzy set µ of a set X is denoted by µc and defined as
µc (x) = 1 -µ (x) for every x ∈ X is called a Fuzzy Complement.

Example:
Let X = {1,2,3,4,5}.
Suppose fuzzy set A given by:A = {(1, 0.1), (2, 0.3), (3, 0.6), (4, 0.8), (5, 1.0)}
Then the fuzzy complement of A is:

Ac = {(1, 0.9), (2, 0.7), (3, 0.4), (4, 0.2), (5, 0.0)}

Definition 1.4
Two fuzzy subsets µ and λ of a set X are said to be disjoint if there exists no x ∈
X such that min{µ(x), λ(x)} = 0 f orallx ∈ X is called a Disjoint Fuzzy Set.

Example:
Let X = {x1 , x2 , x3 }
Define two fuzzy subsets µand λof X as:

µ = {(x1 , 1), (x2 , 0.5), (x3 , 0)}

λ = {(x1 , 0), (x2 , 0), (x3 , 0.7)}

For every X ∈ X, min{µ(x), λ(x)} = 0.
Hence, µ and λ are disjoint fuzzy sets.

Definition 1.5
Let Abe a given fuzzy set defined on a empty set X and µ be a membership fuction.
Then for any α ∈[0,1] the α- cut and strong-α of A denoted by µα and µα+ and
defined by
µα = {x | µA ≥ α, ∀x ∈ X}
µα+ = {x | µA > α, ∀ ∈ X}

3
Example:
Let X = {1, 2, 4, 5, } Define a fuzzy set A as:

A = {(1, 0.2), (2, 0.4), (3, 0.6), (4, 0.8), (5, 1.0)}

For α=0.5, the α - cut of A is:

A0.5 = {x ∈ X | µA (x) ≥ 0.5} = {3, 4, 5}

For α=0.6 the strong α cut of A is:

A+
0.6 = {x ∈ X | µA (x) > 0.6} = {4, 5}

Definition 1.6
Let µ : S →[0,1] be any fuzzy subset of a set S and let t ∈ [0, 1]. The set
{s ∈S | µ(x) ≥ t} is called a level subset of µ at level t and is symbolized by µt .
Clearly µt ⊆ µs whenever t > s.

Example:
Let S = {a, b, c, d} and define a fuzzy subset µ : S → [0, 1] by

µ(a) = 0.9, µ(b) = 0.6, µ(c) = 0.3, µ(d) = 0.1.

The level subset (or α-cut) of µ at level t is defined as µt = {x ∈ S | µ(x) ≥ t}.

For t = 0.5, we have µ0.5 = {a, b}.
For t = 0.3, we have µ0.3 = {a, b, c}.
For t = 0.1, we have µ0.1 = {a, b, c, d}.
Thus, µ0.5 ⊆ µ0.3 ⊆ µ0.1 ,
which illustrates that if t > s, then µt ⊆ µs .

Definition 1.7
Let (S, •) be a set with a binary composition • and let µ and σ be two fuzzy subsets
of S. The product µσ of µ and σ is defined by

 sup min{µ(y), σ(z)}, if x can be expressed as x = y • z for some y, z ∈ S,
(µσ)(x) = x=y•z
0, otherwise

is called a product of Two Fuzzy Subset.

Definition 1.8
A fuzzy subset µ : R →[0,1] of a ring R is called a fuzzy subring of R if for all x,
y ∈ R the following requirements are met

ˆ µ (x – y) ≥ min (µ(x), µ(y)) and

ˆ µ (xy) ≥ min (µ(x), µ(y))

4
Example:
Let R = Z be the ring of integers.
Define a fuzzy subset µ : Z → [0, 1] by
(
1, if x is even,
µ(x) =
0.5, if x is odd.
We verify that µ is a fuzzy subring of Z.
1. For any x, y ∈ Z, if both x and y are even, then x − y is even and
µ(x − y) = 1 = min{µ(x), µ(y)}.
If one of x or y is odd, then x − y is odd and
µ(x − y) = 0.5 = min{µ(x), µ(y)}.
If both x and y are odd, then x − y is even and
µ(x − y) = 1 ≥ min{µ(x), µ(y)}.

2. For any x, y ∈ Z, if at least one of x or y is even, then xy is even and

µ(xy) = 1 ≥ min{µ(x), µ(y)}.
If both x and y are odd, then xy is odd and
µ(xy) = 0.5 = min{µ(x), µ(y)}.

Hence, µ is a fuzzy subring of Z.

Definition 1.9
Let µ be a fuzzy subring (respectively, fuzzy ideal) of a ring R and let 0 ≤ t ≤ µ(0).
The setµt = { x ∈ R | µ(x) ≥ t }is called the level subring (respectively, level ideal )
of µ.

Example:
Let R = Z be the ring of integers.
Define a fuzzy subset µ : Z → [0, 1] by
(
1, if x is even,
µ(x) =
0.6, if x is odd.
Then µ is a fuzzy subring (and also a fuzzy ideal) of Z.
For t = 1, the level subring is µ1 = { x ∈ Z | µ(x) ≥ 1 } = 2Z, which is a subring
(ideal) of Z. For t = 0.6, the level subring is
µ0.6 = { x ∈ Z | µ(x) ≥ 0.6 } = Z.

Definition 1.10
Let R be a ring. A fuzzy subset µ : R → [0, 1] is called a Fuzzy Ideal of R if for
all x, y ∈ R, the following conditions hold:

5
 1. Additive Condition: µ(x − y) ≥ min{µ(x), µ(y)}
2. Left Ideal Property: µ(xy) ≥ µ(y)
3. Right Ideal Property: µ(xy) ≥ µ(x)
If µ satisfies both (2) and (3), it is a Fuzzy Two-Sided Ideal.

Definition 1.11
A non-constant fuzzy ideal µ of a ring R is called fuzzy prime if for any fuzzy
ideals µ1 and µ2 of R the condition µ2 µ2 ⊆ µ implies that either µ2 ⊆ µ orµ2 ⊆ µ.

Example:
Let R = Z and let P = (p) be a prime ideal of Z, where p is a prime number. Define
a fuzzy subset µ : Z → [0, 1] by
(
1, if x ∈ (p),
µ(x) =
0, if x ∈
/ (p).

Then µ is a non-constant fuzzy ideal of Z.

Let µ1 and µ2 be fuzzy ideals of Z such that µ1 µ2 ⊆ µ.
Since (p) is a prime ideal of Z,
we have µ1 ⊆ µ or µ2 ⊆ µ.
Hence µ is a fuzzy prime ideal of Z.

Definition 1.12
A fuzzy ideal µ of a ring R, not necessarily non-constant is called fuzzy prime if for
any fuzzy ideals µ1 and µ2 of R the condition µ1 µ2 ⊆ µ implies that either µ1 ⊆ µ
or µ2 ⊆ µ is also called a fuzzy prime ideal.

Example:
Let R be any ring. Define a fuzzy subset µ : R → [0, 1] by

µ(x) = 1 for all x ∈ R.

Then µ is a fuzzy ideal of R. Let µ1 and µ2 be any fuzzy ideals of R.

For all x ∈ R, we have (µ1 µ2 )(x) ≤ 1 = µ(x), and hence µ1 µ2 ⊆ µ.
Clearly,
µ1 ⊆ µ and µ2 ⊆ µ.
Therefore, µ1 µ2 ⊆ µ ⇒ µ1 ⊆ µ or µ2 ⊆ µ,
and thus µ is a fuzzy prime ideal of R.

Definition 1.13
An ideal I of a ring R is said to be irreducible if I cannot be expressed as I1 ∩ I2
where I1 and I2 are any two ideals of R properly containing I, otherwise I is termed
reducible.

6
 Definition 1.14
A fuzzy ideal µ of a ring R is called fuzzy irreducible if it is not a finite inter-
section of two fuzzy ideals of R properly containing µ: otherwise µ is termed fuzzy
reducible.

Example:
Let R be any ring. Define a fuzzy subset µ : R → [0, 1] by

µ(x) = 0 for all x ∈ R.

Then µ is a fuzzy ideal of R. Suppose that µ = µ1 ∩ µ2 for some fuzzy ideals µ1 and
µ2 of R. Since fuzzy intersection is defined by

(µ1 ∩ µ2 )(x) = min{µ1 (x), µ2 (x)},

and µ(x) = 0 for all x ∈ R, we obtain

min{µ1 (x), µ2 (x)} = 0 for all x ∈ R.

This implies that µ1 = µ or µ2 = µ.

Hence, there do not exist two fuzzy ideals properly containing µ whose intersection is
µ. Therefore, µ is a fuzzy irreducible ideal of R.

Definition 1.15
Let µ be any fuzzy ideal of a ringR and let x ∈ R The fuzzy subset µx ∗ of R defined
by µx ∗(r) = µ(r – x) for all r ∈ R is termed as the fuzzy coset determined by x and
µ.
Example:
Let R = Z. Define a fuzzy ideal µ : Z → [0, 1] by
(
1, if n is even,
µ(n) =
0, if n is odd.

Let x = 1 ∈ Z. The fuzzy coset µ∗1 is defined by

µ∗1 (r) = µ(r − 1) for all r ∈ Z.

Hence, (
1, if r is odd,
µ∗1 (r) =
0, if r is even.
Thus, µ∗1 represents the fuzzy coset corresponding to 1 + 2Z.

Definition 1.16
If µ is any fuzzy ideal of a ring R, then the fuzzy ideal µ’ of Rµ defined by
′
µ (µx ∗) = µ(x) for all x ∈R is called the fuzzy quotient ideal determined by µ.

7
Example:
Let R = Z. Define a fuzzy ideal µ : Z → [0, 1] by
(
1, if n ∈ 2Z,
µ(n) =
0, if n ∈ / 2Z.

For each x ∈ Z, the fuzzy coset µ∗x is defined by

µ∗x (r) = µ(r − x) for all r ∈ Z.

There are exactly two distinct fuzzy cosets, Rµ = {µ0 , µ1 }.

Define the fuzzy quotient ideal µ′ of Rµ by

µ′ (µ∗x ) = µ(x) for all x ∈ Z.

Hence, µ′ (µ∗0 ) = 1 and µ′ (µ∗1 ) = 0.

Thus µ′ is the fuzzy quotient ideal of Rµ determined by µ.

Definition 1.17
A fuzzy ideal µ of a ring R is called fuzzy semiprime if for any fuzzy ideal θ of
R,the condition θm ⊆µ(m ∈Z + ) implies θ ⊂µ

Example:
Let R = Z. Define a fuzzy ideal µ : Z → [0, 1] by
(
1, if n = 0,
µ(n) =
0, if n ̸= 0.

Then µ is a fuzzy ideal of Z.

Let θ be any fuzzy ideal of Z and let m ∈ Z+
such that θ m ⊆ µ.
Since (0) is a semiprime ideal of Z, it follows that θ ⊆ µ.
Hence, µ is a fuzzy semiprime ideal of Z.

Definition 1.18
Let A be a fuzzy subset of a ring R. Define

A∗ = { x ∈ R | A(x) > 0 }

A∗ = { x ∈ R | A(x) = A(0) }.
Example:
Let R = Z. Define a fuzzy subset A : Z → [0, 1] by

1,
 if n = 0,
A(n) = 0.6, if n ∈ 2Z \ {0},

0, if n is odd.


8
The support of A is A∗ = {n ∈ Z | A(n) > 0} = 2Z.
Since A(0) = 1, the core of A is

A∗ = {n ∈ Z | A(n) = A(0)} = {0}.

Thus A ⊆ A.

Definition 1.19
Let A be a fuzzy ideal of a ring R. For each r ∈ R, define the fuzzy left coset
r + A by (r + A)(x) = A(x − r) for all x ∈ [Link] collection of all fuzzy left cosets of
A in R is denoted byR/A = { r + A | r ∈ R }.

Example:
Let R = Z.
Define a fuzzy ideal A : Z → [0, 1] by
(
1, if n ∈ 2Z,
A(n) =
0, if n ∈
/ 2Z.

For each r ∈ Z, the fuzzy left coset r + A is defined by

(r + A)(x) = A(x − r) for all x ∈ Z.

We have (0 + A)(x) = A(x),

which represents the even integers, and
(
1, x is odd,
(1 + A)(x) = A(x − 1) =
0, x is even.

Hence there are exactly two distinct fuzzy left cosets, and

R/A = { 0 + A, 1 + A }.

9
Chapter 2

PROPERTIES

Properties 2.1
We have the following definitions fors two fuzzy sets(A,µA ) and (B, µB ), where
A,B∈X(as a crisp sets):

ˆ Equality:A = B iff µA (x)=µB (x) for all x∈ X

ˆ Inclusion: A ⊆B iff µA (x)≤µB (x) for all x∈ X

Pn
ˆ Cardinality:|A|= 1 µA (xi )

ˆ Empty set: A is a empty iff µA (x)=0 for all x ∈X

ˆ α-cut: Given α∈[0,1], the α-cut of A is defined by Aα = a∈X |µA (x)≥α

Theorem 2.1
Let {Aα | α ∈ Ω} be a family of fuzzy subrings of a ring R. Suppose that the lattice
L has the intersection property. Define
^
A(x) = Aα (x), ∀x ∈ R.
α∈Ω

Then A is a fuzzy subring of R.

Proof:
Let {Aα | α ∈ Ω} be a collection of fuzzy subrings of R.
Define a fuzzy set A on R by
^
A(x) = Aα (x), ∀x ∈ R.
α∈Ω

We show that A is a fuzzy subring of R.

Let x, y ∈ R. Since each Aα is a fuzzy subring of R, we have
Aα (x − y) ≥ Aα (x) ∧ Aα (y) and Aα (xy) ≥ Aα (x) ∧ Aα (y)

10
for all α ∈ Ω. Taking the infimum over all α ∈ Ω and using the intersection property
of the lattice L, we obtain
^
A(x − y) = Aα (x − y)
α∈Ω
^

≥ Aα (x) ∧ Aα (y)
α∈Ω
! !
^ ^
= Aα (x) ∧ Aα (y)
α∈Ω α∈Ω
= A(x) ∧ A(y).

Similarly,
A(xy) ≥ A(x) ∧ A(y).
Hence A satisfies the axioms of a fuzzy subring of R. Therefore,
\
Aα
α∈Ω

is a fuzzy subring of R.
Theorem 2.2
Let A be a fuzzy ideal of a ring R. Define the operations ‘+’ and ‘·’ on R/A by, for
all r, s ∈ R,

(r + A) + (s + A) = (r + s) + A and (r + A) · (s + A) = (rs) + A.

Then R/A is a commutative ring and R/A = R/A∗ .

Proof:
Let A be a fuzzy ideal of R.
Well-definedness:
Suppose r + A = r′ + A and s + A = s′ + A. Then

A(r − r′ ) = A(0) and A(s − s′ ) = A(0).

Since A is a fuzzy ideal of R, we have

A (r + s) − (r′ + s′ ) = A (r − r′ ) + (s − s′ )

≥ inf{A(r − r′ ), A(s − s′ )}
= A(0),

which implies (r + s) + A = (r′ + s′ ) + A.

Similarly,
A(rs − r′ s′ ) = A r(s − s′ ) + (r − r′ )s′

≥ inf{A(s − s′ ), A(r − r′ )}
= A(0),
Hence (rs) + A = (r′ s′ ) + A.
Therefore, the operations are well-defined.

11
Ring axioms:
Closure, associativity, and commutativity of addition in R/A follow directly from
those in R. The additive identity is 0 + A, and the additive inverse of r + A is
(−r) + A. Multiplication in R/A is associative and commutative since multiplication
in R is associative and commutative.
Moreover, multiplication distributes over addition:


(r + A) · (s + A) + (t + A) = (r + A) · (s + t + A)
= r(s + t) + A
= (rs + rt) + A.

Thus, R/A is a commutative ring.

Equality R/A = R/A∗ :

Let
A∗ = {x ∈ R | A(x) = A(0)}.
By definition of fuzzy cosets,

R/A = {r + A | r ∈ R} and R/A∗ = {r + A∗ | r ∈ R}.

Since A is a fuzzy ideal, the induced crisp ideal A∗ generates the same quotient
structure. Hence,
R/A = R/A∗ .
Therefore, R/A is a commutative ring and R/A = R/A∗ .

Properties 2.2 Operations on Fuzzy Sets

Let (A, µA ) and (B,µB ) be a fuzzy sets.

ˆ Complementstion: (∼ A, µ∼A ), where µ∼ A = 1-µA

ˆ Hight: h(A)=maxx∈X µA (A)

ˆ Support: sup(A)={x∈ X| µA >0}

ˆ Core: C(A)={x∈ X|µA (x)=1}

ˆ Intersection: C = A ∩ B, where µc =minx∈X {µA (x), µB (x)}

ˆ Union: C=A ∪ B, where µC ={µA (x), µB (x)}

12
 ˆ Bounded Sum: C = A + B, where µC = minx∈X { 1, µA (x) + µB (x)}

ˆ Bounded Difference;C = A − B, where µc =maxx∈X { 0, µA (x) - µB (x)}

ˆ Exponentiation: C = Aα where µC = (µA )α for α > 0.

ˆ Level Set: C = αA where µC = (αµA ) for α ∈[0,1]

ˆ Concentration: C = Aα where α > 1.

ˆ Dilation:C = Aα where α > 1.

Theorem 2.3
Let {µi }i∈I be any family of fuzzy subrings (resp. fuzzy ideals) of a ring R. Then
the function µ : R → [0, 1],
µ(x) = inf {µi (x)}
i∈I

is a fuzzy subring (resp. fuzzy ideal) of R.

Proof: V
Define µ(x) = inf i∈I {µi (x)} for all x ∈ R, that is, µ = i∈I µi is the pointwise
infimum of the family.
We first show that µ is a fuzzy subring of R. Take any x, y ∈ R. Since each µi is a
fuzzy subring, we have

µi (x − y) ≥ min{µi (x), µi (y)} and µi (xy) ≥ min{µi (x), µi (y)}

for all i ∈ I. Taking infimum over i ∈ I yields

µ(x − y) = inf µi (x − y)
i∈I
≥ inf min{µi (x), µi (y)}
i∈I
n o
= min inf µi (x), inf µi (y)
i∈I i∈I
= min{µ(x), µ(y)},

and similarly
µ(xy) = inf µi (xy)
i∈I
≥ inf min{µi (x), µi (y)}
i∈I
= min{µ(x), µ(y)}.
Thus µ satisfies the defining conditions of a fuzzy subring.
If each µi is actually a fuzzy ideal, then in addition each µi satisfies

µi (xy) ≥ max{µi (x), µi (y)}

13
for all x, y ∈ R, and taking infimum again shows that
µ(xy) = inf µi (xy)
i∈I
≥ inf max{µi (x), µi (y)}
i∈I
n o
= max inf µi (x), inf µi (y)
i∈I i∈I
= max{µ(x), µ(y)},
so µ also satisfies the ideal condition.
In either case, µ is a fuzzy subring (resp. fuzzy ideal) of R, which completes the proof.
Theorem 2.4
If A and B are fuzzy subrings (fuzzy ideals) of a ring R, then
AB(x + y) ≥ inf{AB(x), AB(y)} and AB(x) = AB(−x)
for all x, y ∈ R.
Proof:
Let A and B be fuzzy subrings (fuzzy ideals) of R. Recall that the product of two
fuzzy subsets A and B of R is defined by
AB(x) = sup{inf(A(u), B(v)) | u, v ∈ R, uv = x}.

(i) Additive property:

Let x, y ∈ R. For any u1 , v1 , u2 , v2 ∈ R such that
u1 v1 = x and u2 v2 = y,
we have (u1 + u2 )(v1 + v2 ) = x + y + (u1 v2 + u2 v1 ).
Since A and B are fuzzy subrings (fuzzy ideals), using closure under addition
we obtain
A(u1 + u2 ) ≥ inf(A(u1 ), A(u2 )),
B(v1 + v2 ) ≥ inf(B(v1 ), B(v2 )).
Therefore,
inf(A(u1 + u2 ), B(v1 + v2 )) ≥ inf{A(u1 ), A(u2 ), B(v1 ), B(v2 )}.
Taking supremum over all such representations and using properties of sup and inf, we
get
AB(x + y) ≥ inf{AB(x), AB(y)}.

(ii) Symmetry under additive inverse:

For any x ∈ R, note that if uv = x,
then (−u)v = −x.
Since A is a fuzzy subring, we have A(−u) = A(u).
Hence,
AB(−x) = sup{inf(A(−u), B(v)) | uv = x}
= sup{inf(A(u), B(v)) | uv = x}
= AB(x).

14
Thus,
AB(x + y) ≥ inf{AB(x), AB(y)} and
AB(x) = AB(−x)
for all x, y ∈ R.

Theorem 2.5
A ring R is regular if and only if every fuzzy ideal of R is idempotent.
Proof:
Assume that R is a regular ring. Let µ be any fuzzy ideal of R.
For each x ∈ R, since R is regular, there exists a ∈ R such that

x = xax.

Then,
µ(x) = µ(xax)
≥ min{µ(xa), µ(x)}
≥ min{µ(x), µ(x)}
= µ(x).
Hence,
µ(x) = (µ ◦ µ)(x),
which shows that µ is idempotent. Therefore, every fuzzy ideal of R is idempotent.
Conversely, assume that every fuzzy ideal of R is idempotent. Let I be any ideal
of R and define a fuzzy ideal µI by
(
1, if x ∈ I,
µI (x) =
0, otherwise.

Since µI is idempotent, we have µI = µI ◦ µI .

This implies
I = I 2.
Hence, every ideal of R is idempotent. Therefore, R is a regular ring.

15
Chapter 3

OPERATIONS ON FUZZY RINGS

In this chapter, we discuss about operations on fuzzy rings and we study some theorems
anf interesting results.
Theorem 3.1
Letµ be a fuzzy subring (or fuzzy ideal) of a ring R. If for some x, y ∈ R, µ(x) <
µ(y), then µ(x − y) = µ(x) = µ(y − x).
proof
Given that µ(x) < µ(y)
To prove: µ(x − y) = µ(x) = µ(y − x)
Since µ is a fuzzy subring (or fuzzy ideal) of R, for all a, b ∈ R, it satisfies:

Additive Property: µ(a − b) ≥ min{µ(a), µ(b)} and,

symmetry Property: µ(a) = µ(−a).

Given that µ(x) < µ(y),

we have min{µ(x), µ(y)} = µ(x).
Therefore,
µ(x − y) ≥ min{µ(x), µ(y)} = µ(x) (1)

Now observe that x = (x − y) + y.

Applying the fuzzy subring property again, we get

µ(x) ≥ min{µ(x − y), µ(y)}. (2)

Since µ(y) > µ(x), inequality (2) implies

µ(x) ≥ µ(x − y). (3)

From (1) and (3), we conclude that µ(x − y) = µ(x).

Finally,
µ(y − x) = µ(−(x − y))
= µ(x − y)
= µ(x).

Hence, µ(x − y) = µ(x) = µ(y − x).

16
 Theorem 3.2
A fuzzy subset µ of a ring R is a fuzzy ideal of R if and only if the level subsets
µt = {x ∈ R | µ(x) ≥ t}, t ∈ Im(µ), are ideals of R.
Proof:
Assume that µ is a fuzzy ideal of R. Let t ∈ Im(µ). We show that µt is an ideal of
R. Let x, y ∈ µt . Then µ(x) ≥ t and µ(y) ≥ t.
Since µ is a fuzzy ideal,
µ(x − y) ≥ min{µ(x), µ(y)} ≥ t.
Hence x − y ∈ µt , so µt is closed under subtraction. Now let r ∈ R and x ∈ µt .
Since µ is a fuzzy ideal,
µ(rx) ≥ µ(x) ≥ t and µ(xr) ≥ µ(x) ≥ t.
Thus rx, xr ∈ µt . Therefore, µt is an ideal of R.
Conversely, assume that for every t ∈ Im(µ), the level subset µt is an ideal of R.
Let x, y ∈ R and put
t = min{µ(x), µ(y)}.
Then x, y ∈ µt . Since µt is an ideal, x − y ∈ µt ,
which implies
µ(x − y) ≥ t = min{µ(x), µ(y)}.
Similarly, for any r ∈ R and x ∈ R, let t = µ(x).
Then x ∈ µt , and since µt is an ideal,rx, xr ∈ µt ,so
µ(rx) ≥ µ(x), µ(xr) ≥ µ(x).
Hence, µ satisfies all the conditions of a fuzzy ideal of R.
Therefore, µ is a fuzzy ideal of R.
Theorem 3.3
If µ is a fuzzy ideal of a ring R, then two level ideals µt1 and µt2 with t1 < t2 are
equal if and only if there is no element x ∈ R such that t1 ≤ µ(x) ≤ t2 .
Proof:
Assume that µt1 = µt2 . Suppose, on the contrary, that there exists an element
x ∈ R such that
t1 ≤ µ(x) ≤ t2 .
Then µ(x) ≥ t1 , and hence x ∈ µt1 .
Since µt1 = µt2 , we have x ∈ µt2 . Therefore,
µ(x) ≥ t2 ,
which contradicts the assumption µ(x) ≤ t2 unless µ(x) = t2 .
Thus, no such element x exists.
Conversely, assume that there is no element x ∈ R such that
t1 ≤ µ(x) ≤ t2 .

17
Let x ∈ µt1 . Then µ(x) ≥ t1 .
Since no µ(x) lies between t1 and t2 , it follows that µ(x) > t2 ,
and hence x ∈ µt2 .
Thus,
µt1 ⊆ µt2 .
Since t1 < t2 , we always have µt2 ⊆ µt1 .
Therefore,
µt1 = µt2 .
Hence, the two level ideals µt1 and µt2 are equal.
Theorem 3.4
The level ideals of a fuzzy ideal µ form a chain. That is, if Im µ = {t0 , t1 , . . . , tn } with
t0 > t1 > · · · > tn , then the chain of level ideals of µ is given by

R = µt0 ⊂ µt1 ⊂ µt2 ⊂ · · · ⊂ µtn .

Proof:
Let µ be a fuzzy ideal of a ring R. Suppose

Im µ = {t0 , t1 , . . . , tn } with t0 > t1 > · · · > tn .

For each ti ∈ Im µ, the level ideal of µ is defined by

µti = {x ∈ R | µ(x) ≥ ti }.

Let ti , tj ∈ Im µ such that ti > tj .

Take any x ∈ µti . Then µ(x) ≥ ti . Since ti > tj , it follows that

µ(x) ≥ tj ,

and hencc x ∈ µtj .

Therefore, µti ⊆ µtj . Since this inclusion holds for every pair ti > tj , the level ideals
of µ are linearly ordered by inclusion. Thus, the chain of level ideals of µ is given by

R = µt0 ⊂ µt1 ⊂ µt2 ⊂ · · · ⊂ µtn .

Hence, the level ideals of a fuzzy ideal µ form a chain.

Theorem 3.5
Let µ be a fuzzy ideal of a ring R. Then the level ideal µt , where t = µ(0), is a
prime ideal of the ring R.
Proof:
Let µ be a fuzzy ideal of a ring R and let t = µ(0). Consider the level ideal

µt = {x ∈ R | µ(x) ≥ t}.

Since µ is a fuzzy ideal, µt is an ideal of R. Let a, b ∈ R such that

ab ∈ µt .

18
Then µ(ab) ≥ t = µ(0). Since µ is a fuzzy ideal, we have

µ(ab) ≤ min{µ(a), µ(b)}.

Hence,
min{µ(a), µ(b)} ≥ µ(0).
This implies that either

µ(a) ≥ µ(0) or µ(b) ≥ µ(0).

Therefore,
a ∈ µt or b ∈ µt .
Hence,µt is a prime ideal of the ring R.
Theorem 3.6
Let µ : R → [0, 1] be a constant fuzzy ideal of a ring R, i.e. there is a fixed c ∈ [0, 1]
such that µ(x) = c for all x ∈ R. Then µ is a fuzzy prime ideal of R.
Proof:
Let µ1 and µ2 be fuzzy ideals of R such that µ1 · µ2 ⊆ µ.
By definition of inclusion of fuzzy sets, this means

(µ1 · µ2 )(x) ≤ µ(x) = c for all x ∈ R.

Because µ is constant with value c, any fuzzy ideal ν that is not contained in µ would
produce an element x0 ∈ R with ν(x0 ) > c. If both µ1 and µ2 were not contained in
µ, then there would exist x0 , y0 ∈ R such that

µ1 (x0 ) > c, µ2 (y0 ) > c,

and hence
(µ1 · µ2 )(x0 y0 ) ≥ min{µ1 (x0 ), µ2 (y0 )} > c,
contradicting µ1 · µ2 ⊆ µ. Therefore either µ1 ⊆ µ or µ2 ⊆ µ, showing that µ is fuzzy
prime.

Theorem 3.7[Characterization of Fuzzy Prime Ideals]

Let µ be a non-constant fuzzy ideal of a ring R, and lett = µ(0). Then the following
are equivalent:
(i) µ is a fuzzy prime ideal of R.

(ii) The level ideal µt = {x ∈ R | µ(x) ≥ t} is a prime ideal of R, and the chain of
level ideals of µ consists of only µt ⊂ R.
Proof:
Suppose µ is a non-constant fuzzy ideal of a ring R, and let t = µ(0) ∈ Im µ.
Assume µ is fuzzy prime.
First, from the definition of fuzzy prime ideal and level ideals, it follows that the level
ideal
µt = { x ∈ R | µ(x) ≥ t }

19
is an ideal of R, and further this ideal is prime. Indeed, if ab ∈ µt , then

µ(ab) ≥ t = µ(0),

and fuzzy primeness of µ implies either µ(a) ≥ µ(0) or µ(b) ≥ µ(0), which shows either
a ∈ µt or b ∈ µt .
Hence µt is a prime ideal. Moreover, since µ is non-constant, µ(x) < t for some x ∈ R,
so there are only two level ideals possible: µt and R itself. Thus the chain of level
ideals reduces to
µt ⊂ R.
Conversely, assume µt is a prime ideal of R and the chain of level ideals of µ consists
only of µt ⊂ R.
To show µ is fuzzy prime, let µ1 and µ2 be fuzzy ideals of R such that

µ1 · µ2 ⊆ µ.

If neither µ1 ⊆ µ nor µ2 ⊆ µ, then there exist x1 , x2 ∈ R with µ1 (x1 ) > µ(x1 ),

µ2 (x2 ) > µ(x2 ). Since the only level ideals are µt and R, this forces both x1 , x2 ∈
/ µt ,
and hence µ(x1 ), µ(x2 ) < t = µ(0).
But then

(µ1 · µ2 )(x1 x2 ) ≥ min{µ1 (x1 ), µ2 (x2 )} > max{µ(x1 ), µ(x2 )},

contradicting µ1 · µ2 ⊆ µ.
Therefore either µ1 ⊆ µ or µ2 ⊆ µ, so µ is fuzzy prime.
Theorem 3.8
Any prime ideal of a ring R is irreducible.
Proof:
Let P be a prime ideal of the ring R. Assume, for the sake of contradiction, that

P =I ∩J

for some ideals I and J of R with P ⊊ I and P ⊊ J. Then there exist elements
a ∈ I \ P and b ∈ J \ P . Since a, b ∈/ P and P = I ∩ J, we still have ab ∈ I ∩ J = P
because P is an ideal. However, because P is prime, the condition ab ∈ P implies that
either a ∈ P or b ∈ P by definition of primeness. This is a contradiction, because we
chose a ∈ / P and b ∈ / P . Therefore, P cannot be written as the intersection of two
strictly larger ideals, which means P is irreducible.
Theorem 3.9
In a commutative ring R with unity, any ideal that is both semiprime and irreducible
is a prime ideal.
Proof:
Let I be an ideal in a commutative ring R with unity such that I is both semiprime
and irreducible. We show that I is prime.
Suppose ab ∈ I for some a, b ∈ R. Consider the ideals

J = I + (a) and K = I + (b),

20
 where (a) and (b) denote the principal ideals generated by a and b, respectively.
Since ab ∈ I,
we have I ⊆ J ∩ K.
If I = J, then a ∈ J = I and we are done. Likewise, if I = K, then b ∈ I and we are
done.

Thus, the only remaining case to rule out is I ⊊ J ∩ K with I ⊊ J and I ⊊ K.

However, since I is irreducible, if I = J ∩ K then either I = J or I = K. Hence we

cannot have I ⊊ J and I ⊊ K simultaneously.

Therefore either a ∈ I or b ∈ I.
This shows that whenever ab ∈ I, either a ∈ I or b ∈ I.
Hence I is a prime ideal.
Theorem 3.10
If µ is any fuzzy prime ideal of a ring R, then µ is fuzzy irreducible.
Proof:
let µ be a fuzzy prime ideal of R.
suppose µ = α ∧ β, where α and β are fuzzy ideals of R. ideals of R.
Then for all x ∈ R,
µ(x) = min{α(x), β(X)}
. since µ is fuzzy prime, we must have µ = α or µ = β. Hence, mu cannot be
expressed as the intersection of two strictly larger fuzzy ideals. Therefore, µ is fuzzy
irreducible.
Theorem 3.11
Let µ : R → [0, 1] be a non-constant fuzzy irreducible ideal of a ring R. Then:

i. 1 ∈ Im µ.

ii. There exists α ∈ [0, 1] such that µ(x) = α for all x ∈ R with µ(x) ̸= 1.

iii. The set I = {x ∈ R | µ(x) = 1} is an irreducible (ordinary) ideal of R.

Proof:
Since µ is non-constant, Im µ contains at least two distinct values. If µ(x) < 1 for
all x ∈ R, then we could construct a fuzzy ideal ν with
(
µ(x), if µ(x) ≤ k,
ν(x) =
k, if µ(x) > k,

for some k with max Im µ < k < 1. Clearly µ ⊊ ν, and

µ = µ ∩ ν,

contradicting that µ is irreducible. Hence µ(x) = 1 for some x ∈ R, so 1 ∈ Im µ,

proving (i).

21
 For (ii), suppose Im µ \ {1} contains two distinct values β > γ. Define fuzzy ideals
ν, θ : R → [0, 1] by
( (
1, if µ(x) = 1, 1, if µ(x) = 1,
ν(x) = θ(x) =
β, otherwise, γ, otherwise.

Then ν, θ ⊋ µ and µ = ν ∧ θ, contradicting the irreducibility of µ. Therefore

Im µ \ {1} has a single value, call it α, and part (ii) follows.
Now define
I = {x ∈ R | µ(x) = 1}.
To show I is an ideal, let a, b ∈ I. Then µ(a) = µ(b) = 1, and since µ is a fuzzy ideal,

µ(a − b) ≥ min{µ(a), µ(b)} = 1,

so a − b ∈ I. If r ∈ R and a ∈ I, then µ(ra) ≥ µ(a) = 1, so ra ∈ I. Thus I is an ideal

of R.
Finally, suppose I = I1 ∩ I2 for ideals I1 , I2 ⊋ I. Define fuzzy ideals ν, θ by
( (
1, if x ∈ I1 , 1, if x ∈ I2 ,
ν(x) = θ(x) =
α, otherwise, α, otherwise.

Since I1 , I2 ⊋ I, we have ν, θ ⊋ µ, and

µ = ν ∧ θ,

which contradicts that µ is fuzzy irreducible. Therefore I cannot be expressed as

the intersection of strictly larger ideals, showing I is an irreducible ordinary ideal of
R. This proves (iii) and completes the proof.
Theorem 3.12
Let µ be a fuzzy subring of a ring R and let θ be a fuzzy ideal of R. Then ϕ = µ ∩ θ
is a fuzzy ideal of the subring

S = {x ∈ R | µ(x) = µ(0)}.

Proof:
Define ϕ : R → [0, 1] by

ϕ(x) = min{µ(x), θ(x)} for all x ∈ R,

that is, ϕ = µ ∩ θ is the fuzzy intersection of µ and θ.

First we verify that S = {x ∈ R | µ(x) = µ(0)} is an ordinary subring of R. If x, y ∈ S,
then
µ(x − y) ≥ min{µ(x), µ(y)} = µ(0),
and also µ(x − y) ≤ µ(0) by the basic property of fuzzy subrings, so µ(x − y) = µ(0).
Thus x − y ∈ S. Similarly,

µ(xy) ≥ min{µ(x), µ(y)} = µ(0),

22
and again µ(xy) ≤ µ(0), so µ(xy) = µ(0), showing xy ∈ S. Hence S is a subring of R.
Now take any x, y ∈ S. Since θ is a fuzzy ideal of R, we have

θ(x − y) ≥ min{θ(x), θ(y)}.

Also, because µ is a fuzzy subring and x, y ∈ S, we have

µ(x − y) ≥ min{µ(x), µ(y)} = µ(0),

so µ(x − y) = µ(0). Combining these gives

ϕ(x − y) = min{µ(x − y), θ(x − y)} ≥ min{ϕ(x), ϕ(y)},

which shows ϕ satisfies the additive closure property of a fuzzy ideal on S.

Next let r ∈ S and x ∈ S. Because θ is a fuzzy ideal of R, we have

θ(rx) ≥ max{θ(r), θ(x)},

and since µ is a fuzzy subring and r, x ∈ S, we have

µ(rx) ≥ min{µ(r), µ(x)} = µ(0),

so µ(rx) = µ(0). Therefore

ϕ(rx) = min{µ(rx), θ(rx)} ≥ max{ϕ(r), ϕ(x)},

showing ϕ satisfies the absorption property of a fuzzy ideal on S.

Thus ϕ = µ ∩ θ is a fuzzy ideal of the subring

S = {x ∈ R | µ(x) = µ(0)},

as required.
Theorem 3.13
Let µ be any fuzzy ideal of a ring R. For each x ∈ R let the fuzzy coset µ∗x be
defined by µ∗x (r) = µ(r − x) for all r ∈ R. Then Rµ , the set of all fuzzy cosets of µ in
R, is a ring under the binary operations

µ∗x + µ∗y = µ∗x+y and µ∗x µ∗y = µ∗xy

for all x, y ∈ R.
Proof:
Define the set of fuzzy cosets Rµ = {µ∗x : x ∈ R},
where for each x ∈ R the fuzzy coset µ∗x is given by

µ∗x (r) = µ(r − x) for all r ∈ R.

Closure under addition and multiplication:

For x, y ∈ R, define

µ∗x + µ∗y := µ∗x+y , µ∗x µ∗y := µ∗xy .

23
Since x + y ∈ R and xy ∈ R, both µ∗x+y and µ∗xy are in Rµ . Thus Rµ is closed under
the given operations.
Associativity:
For any x, y, z ∈ R,

(µ∗x + µ∗y ) + µ∗z = µ∗(x+y)+z = µ∗x+(y+z) = µ∗x + (µ∗y + µ∗z ),

and similarly
(µ∗x µ∗y ) µ∗z = µ∗(xy)z = µ∗x(yz) = µ∗x (µ∗y µ∗z ),
using associativity of addition and multiplication in R.

Additive identity:
Let µ∗0 be the fuzzy coset determined by 0 ∈ R, so

µ∗0 (r) = µ(r − 0) = µ(r) for all r ∈ R.

Then for all x ∈ R,

µ∗x + µ∗0 = µ∗x+0 = µ∗x and µ∗0 + µ∗x = µ∗0+x = µ∗x .

Thus µ∗0 is the additive identity in Rµ .

Additive inverses:
For any µ∗x ∈ Rµ , consider µ∗−x . Since

µ∗x + µ∗−x = µ∗x+(−x) = µ∗0 ,

and
µ∗−x + µ∗x = µ∗(−x)+x = µ∗0 ,
each µ∗x has an additive inverse µ∗−x in Rµ .
Distributivity:
Using the ring distributive laws in R, for any x, y, z ∈ R we have

µ∗x (µ∗y + µ∗z ) = µ∗x µ∗y+z = µ∗x(y+z) = µ∗xy+xz = µ∗x µ∗y + µ∗x µ∗z ,

and
(µ∗x + µ∗y ) µ∗z = µ∗x+y µ∗z = µ∗(x+y)z = µ∗xz+yz = µ∗x µ∗z + µ∗y µ∗z .

Since all the ring axioms are satisfied for the operations defined above, Rµ is a ring
under addition and multiplication of fuzzy cosets.
Theorem 3.14
If µ is any fuzzy ideal of a ring R, then the map f : R → Rµ defined by f (x) = µ∗x
for all x ∈ R is a ring homomorphism with kernel µt , where t = µ(0).
Proof:
Let µ be a fuzzy ideal of the ring R. For each x ∈ R define the fuzzy coset

µ∗x (r) = µ(r − x) for all r ∈ R,

24
and let f : R → Rµ be given by f (x) = µ∗x for all x ∈ R.
To show f is a ring homomorphism, take any x, y ∈ R. Then

f (x + y) = µ∗x+y = µ∗x + µ∗y = f (x) + f (y)

and
f (xy) = µ∗xy = µ∗x µ∗y = f (x) f (y),
since addition and multiplication of fuzzy cosets in Rµ are defined by

µ∗x + µ∗y = µ∗x+y , µ∗x µ∗y = µ∗xy .

Thus f preserves both addition and multiplication, so it is a ring homomorphism.

Next we determine ker(f ). By definition,

ker(f ) = {x ∈ R | f (x) = 0Rµ },

where 0Rµ is the additive identity of Rµ , namely µ∗0 . Now f (x) = µ∗x = µ∗0 if and
only if
µ∗x (r) = µ(r − x) = µ(r) = µ∗0 (r) for all r ∈ R,
which holds precisely when x ∈ µt , where t = µ(0). Therefore

ker(f ) = µt ,

as required.
Theorem 3.15
Let µ be any fuzzy subset of a ring R. Then µ(x) = t if and only if x ∈
µt and x ∈/ µs for all s > t.
Proof:
Suppose that µ(x) = t. By definition of the level subset µt ,

µt = {x ∈ R | µ(x) ≥ t},

and hence x ∈ µt .
Let s > t. Then µ(x) = t < s, which implies that x ∈ / µs . Thus, x ∈
/ µs for all
s > t.
Conversely, suppose that x ∈ µt and x ∈ / µs for all s > t. Then µ(x) ≥ t. If
µ(x) > t, choose s = µ(x), so that s > t. This would imply x ∈ µs , which contradicts
the assumption. Therefore, µ(x) = t.
Hence,
µ(x) = t if and only if x ∈ µt and x ∈ / µs for all s > t.
Theorem 3.16
A fuzzy ideal µ of a ring R is fuzzy semiprime if and only if µt is a semiprime ideal
of R for every t ∈ Im µ.
Proof:
Suppose that µ is a fuzzy semiprime ideal of R. Let t ∈ Im µ and let x ∈ R be such
that x2 ∈ µt . Then
µ(x2 ) ≥ t.

25
Since µ is fuzzy semiprime, we have µ(x2 ) = µ(x).
Hence,
µ(x) ≥ t,
which implies x ∈ µt . Therefore, µt is a semiprime ideal of R.
Conversely, suppose that µt is a semiprime ideal of R for every t ∈ Im µ. Let x ∈ R
and set t = µ(x2 ). Then t ∈ Im µ and

x2 ∈ µ t .

Since µt is semiprime, it follows that x ∈ µt ,

and hence µ(x) ≥ t = µ(x2 ). But for any fuzzy ideal, we always have µ(x2 ) ≥ µ(x).
Therefore,
µ(x) = µ(x2 ).
Thus, µ is a fuzzy semiprime ideal of R.
Hence, µ is fuzzy semiprime if and only if µt is a semiprime ideal of R for every t ∈ Im µ.
Theorem 3.17
An ideal A of a ring R is semiprime if and only if ψA is a fuzzy semiprime ideal of
R.
Proof:
Suppose that A is a semiprime ideal of R. Let x ∈ R. If x2 ∈ A, then since A is
semiprime, we have x ∈ A. By the definition of ψA ,

ψA (x2 ) = ψA (x).

Hence, ψA is a fuzzy semiprime ideal of R.

Conversely, suppose that ψA is a fuzzy semiprime ideal of R. Let x ∈ R be such
that x2 ∈ A. Then
ψA (x2 ) = 1.
Since ψA is fuzzy semiprime,
ψA (x2 ) = ψA (x),
which implies ψA (x) = 1.
Therefore, x ∈ A, and hence A is a semiprime ideal of R.
Thus, an ideal A of R is semiprime if and only if ψA is a fuzzy semiprime ideal of R.
Theorem 3.18
If µ is any fuzzy semiprime ideal of a ring R, then Rµ , the ring of fuzzy cosets of µ
in R, is free from non-zero nilpotent elements.
Proof:
Let µ be a fuzzy semiprime ideal of a ring R. Suppose xµ ∈ Rµ is a nilpotent
element. Then there exists a positive integer n such that

(xµ )n = 0µ .

Since multiplication of fuzzy cosets is defined by

(xµ )n = (xn )µ ,

26
we obtain (xn )µ = 0µ .
Hence, µ(xn ) = µ(0).
Because µ is a fuzzy semiprime ideal, we have

µ(xn ) = µ(x).

Therefore µ(x) = µ(0) which implies

xµ = 0µ .

Thus, Rµ has no non-zero nilpotent elements.

Theorem 3.19
Let A be a fuzzy subring (fuzzy ideal) of a ring R. Then A∗ is a subring (ideal) of
R. If L has the finite intersection property, then A∗ is also a subring (ideal) of R.
Proof:
Let A be a fuzzy subring of R. Define

A∗ = {x ∈ R | A(x) = A(0)}.

We first show that A∗ is a subring of R.

(i) Closure under subtraction:
Let x, y ∈ A∗ . Then

A(x) = A(0) and A(y) = A(0).

Since A is a fuzzy subring,

A(x − y) ≥ min{A(x), A(y)} = A(0).

But A(0) is the maximum value of A, hence

A(x − y) = A(0),

which implies x − y ∈ A∗ .
(ii) Closure under multiplication:
Let x, y ∈ A∗ . Since A is a fuzzy subring,

A(xy) ≥ min{A(x), A(y)} = A(0).

Hence,
A(xy) = A(0),
and so xy ∈ A∗ . Thus, A∗ is a subring of R. Now suppose that A is a fuzzy ideal of
R. For any r ∈ R and x ∈ A∗ , we have

A(rx) ≥ A(x) = A(0),

and similarly,
A(xr) ≥ A(x) = A(0).

27
Therefore, rx, xr ∈ A∗ , showing that A∗ is an ideal of R.
Finally, if L has the finite intersection property, then the intersection of all level
subsets of A is nonempty and coincides with A∗ . Since intersections of subrings (ideals)
are again subrings (ideals), it follows that A∗ is a subring (ideal) of R.
Hence the theorem is proved.
Theorem 3.20
Let A and B be fuzzy subrings of a ring R. Suppose that the lattice L has the
finite intersection property. Then
(AB)∗ = A∗ B ∗ .
Proof:
Let A and B be fuzzy subrings of R. Recall that
A∗ = {x ∈ R | A(x) = A(0)}, B ∗ = {x ∈ R | B(x) = B(0)},
and
(AB)∗ = {x ∈ R | AB(x) = AB(0)}.
First, we show that A∗ B ∗ ⊆ (AB)∗ . Let x ∈ A∗ B ∗ .
Then x = uv for some u ∈ A∗ and v ∈ B ∗ . Hence,
A(u) = A(0), B(v) = B(0).
By definition of the product of fuzzy subrings,
AB(x) = AB(uv) ≥ inf{A(u), B(v)} = inf{A(0), B(0)} = AB(0).
Since AB(x) ≤ AB(0) always holds, we obtain AB(x) = AB(0). Thus x ∈ (AB)∗ ,
and hence
A∗ B ∗ ⊆ (AB)∗ .
Next, we show that (AB)∗ ⊆ A∗ B ∗ . Let x ∈ (AB)∗ . Then
AB(x) = AB(0).
By definition,
AB(0) = sup{inf(A(u), B(v)) | uv = 0}.
Since L has the finite intersection property, this supremum is attained. Hence there
exist u, v ∈ R such that uv = x and
AB(x) = inf{A(u), B(v)}.
Because AB(x) = AB(0), we must have
A(u) = A(0) and B(v) = B(0).
Thus u ∈ A∗ and v ∈ B ∗ , which implies
x = uv ∈ A∗ B ∗ .
Therefore,
(AB)∗ ⊆ A∗ B ∗ .
Combining both inclusions, we conclude that
(AB)∗ = A∗ B ∗ .

28
Chapter 4

APPLICATION OF FUZZY RING

4.1 Introduction
A fuzzy ring is a mathematical structure that combines the ideas of ring theory from
abstract algebra with fuzzy set theory. In a fuzzy ring, elements can have degrees of
membership between 0 and 1 instead of belonging completely or not belonging at all.
This helps in modeling systems with uncertainty and imprecise data.

4.2 Applications of Fuzzy Rings

4.2.1 Artificial Intelligence
Fuzzy rings are used in artificial intelligence systems to represent uncertain knowledge
and perform reasoning in expert systems. Fuzzy rings combine the concepts of ring
theory from abstract algebra with fuzzy set theory. In a fuzzy ring, elements are asso-
ciated with membership values between 0 and 1. This allows mathematical operations
to be performed on uncertain or imprecise information.

Example: Medical Diagnosis System

Consider an AI-based medical system that analyzes symptoms of a patient.
Let
a = 0.8 (Fever)b = 0.6 (Cough)
Here a and b represent fuzzy membership values.
Fuzzy Ring Operations:
Addition:
a + b = 0.8 + 0.6
This represents the combined effect of the two symptoms.
Multiplication:
a × b = 0.8 × 0.6 = 0.48
This value can represent the strength of a rule such as: “If fever and cough are
present, the probability of flu increases.”
Thus, fuzzy ring operations help AI systems process uncertain dataand make better
decisions.

29
4.2.2 Decision Making
Fuzzy mathematical models help decision-making systems handle uncertain or partial
information in business, finance, and risk [Link] AI applications such as robotics
or intelligent control systems, fuzzy rings help combine uncertain factors like temper-
ature, distance, or speed to determine the best action.

Example: Washing Machine Control

Modern washing machines use fuzzy logic to determine the optimal washing time
based on uncertain inputs like clothes dirtiness, load size, and water hardness.
Fuzzy Input Values
Each input is assigned a fuzzy membership value between 0 and 1:

a = 0.8 (Clothes Dirtiness)

b = 0.6 (Load Size)
c = 0.7 (Water Hardness)

Fuzzy Ring Operations

Addition (Overall Washing Requirement):

a + b + c = 0.8 + 0.6 + 0.7 = 2.1

This represents the combined washing intensity required.

Multiplication (Combined Influence of Factors):

a × b × c = 0.8 × 0.6 × 0.7 = 0.336

This value indicates the strength of the washing rule.

Decision Making
Based on these fuzzy ring calculations, the washing machine controller adjusts the
washing time and water usage:

ˆ High combined value → Longer wash cycle

ˆ Low combined value → Shorter wash cycle

Conclusion:
Fuzzy rings allow the washing machine to handle uncertain inputs mathematically,
optimizing washing performance and efficiency.

4.2.3 Control Systems

In control engineering, fuzzy algebra helps design controllers for systems such as air
conditioners, washing machines, and temperature control systems where exact mathe-
matical models are difficult.

30
 Eample: Temperature Control Systems
Fuzzy rings are widely used in control systems to handle uncertain inputs. A smart
thermostat uses fuzzy logic to maintain a comfortable room temperature.
Fuzzy Input Values
The system considers three inputs with fuzzy membership values:

a = 0.7 (Current Temperature: somewhat hot)

b = 0.9 (Desired Temperature: high)
c = 0.5 (Rate of Temperature Change: moderate)

Fuzzy Ring Operations

Addition (Overall Heating/Cooling Requirement):

a + b + c = 0.7 + 0.9 + 0.5 = 2.1

This represents the combined measure of the system’s requirement.

Multiplication (Interaction of Factors):

a × b × c = 0.7 × 0.9 × 0.5 = 0.315

This value indicates the strength of the control signal. Control Decision Based
on the fuzzy ring calculations:

ˆ High multiplication value → Strong heating or cooling adjustment

ˆ Low multiplication value → Minimal adjustment

Conclusion:
Fuzzy rings allow the control system to handle uncertain sensor readings and gen-
erate smooth, optimal control actions.

4.2.4 Image Processing

Fuzzy rings help process images that contain noise or incomplete information. They
are used in image enhancement, edge detection, and pattern recognition.
Example: Image Processing
Fuzzy rings are useful in image processing for handling uncertain or noisy pixel
data. They help perform mathematical operations on fuzzy pixel values to improve
image features like edge detection and pattern recognition.
Fuzzy Pixel Values
Consider a pixel P with fuzzy membership values:

a = 0.8 (Brightness)
b = 0.6 (Edge Likelihood)

These values indicate the degree to which the pixel belongs to the sets “bright” and
“edge”.

31
Fuzzy Ring Operations
Addition (Combined Effect):
a + b = 0.8 + 0.6 = 1.4
Represents the combined measure of brightness and edge likelihood.
Multiplication (Interaction of Features):
a × b = 0.8 × 0.6 = 0.48
This highlights strong edges where both brightness and edge likelihood are signifi-
cant.
Decision / Processing
ˆ High multiplication value → Mark pixel as an edge

ˆ Low multiplication value → Mark pixel as non-edge

Conclusion:
Fuzzy rings allow image processing systems to combine uncertain pixel information
mathematically, improving edge detection and noise handling.

4.2.5 Robotics
Robots often rely on sensors that provide uncertain data. Fuzzy rings help process this
information for navigation and intelligent behavior.
Example: Robotics
Fuzzy rings are used in robotics to handle uncertain sensor data and make smooth
navigation decisions. They allow robots to combine multiple fuzzy inputs mathemati-
cally.
Fuzzy Sensor Inputs
A mobile robot measures distances to obstacles with fuzzy membership values:
a = 0.7 (Distance to obstacle in front: moderately close)
b = 0.5 (Distance to obstacle on the left: slightly close)
c = 0.6 (Distance to obstacle on the right: moderately close)
Fuzzy Ring Operations
Addition (Overall Risk of Collision):
a + b + c = 0.7 + 0.5 + 0.6 = 1.8
Represents the total risk level based on sensor readings.
Multiplication (Combined Influence of Obstacles):
a × b × c = 0.7 × 0.5 × 0.6 = 0.21
Indicates the strength of the avoidance action required.
Decision Making
Based on the fuzzy ring calculations:

32
 ˆ High multiplication value → Turn sharply or stop

ˆ Low multiplication value → Move forward or slightly adjust

Conclusion:
Fuzzy rings allow robots to combine uncertain sensor data mathematically and
navigate safely, avoiding obstacles smoothly.

4.3 Conclusion
The study of fuzzy rings extends the classical concepts of algebra by incorporating the
principles of Fuzzy Set Theory into Ring Theory. In this project, the fundamental def-
initions, properties, and structures of fuzzy rings were examined in detail. By allowing
elements to have degrees of membership ranging from 0 to 1, fuzzy rings provide a
flexible framework for representing uncertainty within algebraic systems.
The investigation shows that many classical ring properties can be generalized in the
fuzzy environment while preserving the essential structure of ring operations such as
addition and multiplication. Various characteristics of fuzzy ideals, fuzzy subrings, and
their relationships were also analyzed, demonstrating how fuzzy algebraic structures
extend traditional mathematical concepts.
Overall, fuzzy rings play an important role in bridging pure mathematics with real-
world applications where uncertainty and partial truth are involved. The concepts
explored in this project contribute to the broader development of fuzzy algebra and
open opportunities for further research in areas such as decision-making systems, in-
formation processing, and computational intelligence. Fuzzy rings provide a useful
mathematical framework for dealing with uncertainty. They are widely applied in ar-
tificial intelligence, control systems, robotics, image processing, and decision-making
systems.

33
Bibliography

[1] L. A. Zadeh, Fuzzy sets, Information and Control, Vol. 8, No. 3, pp. 338–353,
1965.
[2] V. N. Dixit, R. Kumar, and N. Ajmal, On fuzzy rings, Fuzzy Sets and Systems,
Vol. 49, No. 2, pp. 205–213, 1992.
[3] D. S. Malik and J. N. Mordeson, Fuzzy homomorphisms of rings, Fuzzy Sets and
Systems, Vol. 46, No. 1, pp. 139–146, 1992.
[4] J. N. Mordeson and D. S. Malik, Fuzzy Commutative Algebra, World Scientific,
Singapore, 1998.
[5] R. Utama and K. Karyati, Fuzzy rings and its properties, Jurnal Sains Dasar,
Vol. 5, No. 1, pp. 23–30, 2016.
[6] [Link] and M.Şahin, Fuzzy normed rings, Symmetry, Vol. 10, No. 10, Arti-
cle 515, 2018.
[7] N. Kuroki, Fuzzy ideals and fuzzy bi-ideals in semigroups, Fuzzy Sets and Systems,
Vol. 1, No. 1, pp. 31–45, 1979.
[8] N. Kuroki, On fuzzy ideals and fuzzy subrings of rings, Fuzzy Sets and Systems,
Vol. 5, No. 2, pp. 203–215, 1981.
[9] Y. Kurooka and N. Kuroki, Fuzzy algebraic systems, Fuzzy Sets and Systems,
Vol. 13, No. 1, pp. 1–12, 1984.
[10] N. Kuroki, Fuzzy congruences in rings, Information Sciences, Vol. 27, No. 1, pp. 1–
8, 1982.
[11] A. Rosenfeld, Fuzzy groups, Journal of Mathematical Analysis and Applications,
Vol. 35, No. 3, pp. 512–517, 1971.
[12] A. Mukherjee and M. Sen, On fuzzy ideals of rings, Fuzzy Sets and Systems, Vol. 9,
No. 1, pp. 75–81, 1983.
[13] A. Mukherjee and M. Sen, Fuzzy congruences on rings, Fuzzy Sets and Systems,
Vol. 13, No. 2, pp. 123–130, 1984.
[14] W. J. Liu, Fuzzy Invariant Subgroups and Fuzzy Ideals, Fuzzy Sets and Systems,
8 (1982), 133–139.

34