Fuzzy Sets vs. Crisp Sets: Definitions and Fuzzy Set Operations with Examples

Fuzzy Sets vs. Crisp Sets: Definitions and Fuzzy Set Operations with Examples

Verified Sources
Nov 4, 2026

A fuzzy set AA on a universe XX is defined through a membership function μA:X→[0,1]\mu_A:X\to[0,1]. For each x∈Xx\in X, μA(x)\mu_A(x) quantifies how strongly xx belongs to AA—where 11 means full membership and 00 means no membership.

In contrast, a crisp set CC is described by a characteristic function χC:X→{0,1}\chi_C:X\to\{0,1\}. So crisp sets represent “either/or” membership.

Key intuition

  • Crisp logic: membership is binary (0 or 1).
  • Fuzzy logic: membership is graded (any value in [0,1][0,1]).

Note: Because web-search is currently unavailable in this environment, I cannot attach the mandatory external citations here. The definitions and operations below follow standard references from fuzzy set theory.

Fuzzy Sets (intro) — membership functions, union/intersection (conceptual overview)

Example universe

Let the universe be temperatures: X={cold, warm, hot}X=\{\text{cold, warm, hot}\}

Suppose we define the fuzzy set “Warm” as WW with:

  • μW(cold)=0.1\mu_W(\text{cold})=0.1
  • μW(warm)=1.0\mu_W(\text{warm})=1.0
  • μW(hot)=0.4\mu_W(\text{hot})=0.4

A crisp “Warm” set CC would instead force each element to be either in or out:

  • χC(cold)=0\chi_C(\text{cold})=0
  • χC(warm)=1\chi_C(\text{warm})=1
  • χC(hot)=0\chi_C(\text{hot})=0

So the fuzzy set captures degrees (hot is “somewhat warm”), while the crisp set cannot.

Pro Tip: Membership vs. probability

Fuzzy membership μA(x)\mu_A(x) expresses graded belonging (often interpreted as “possibility/compatibility” with a concept), not necessarily a probability—different frameworks use different semantics.

Difference between fuzzy set and crisp set

Formal comparison

Let XX be the universe.

AspectCrisp set CCFuzzy set AA
Membership mappingχC:X→{0,1}\chi_C:X\to\{0,1\}μA:X→[0,1]\mu_A:X\to[0,1]
Logicbinary: in/outgraded: partial in
Boundary behaviorsharp boundarysmooth/graded boundary

Typical conceptual difference

  • If someone is “mostly warm,” fuzzy membership may be 0.80.8, while crisp membership must be either 11 (warm) or 00 (not warm).

Compute fuzzy membership for a given fuzzy set

  1. 1
    Step 1

    Identify all possible elements (e.g., temperature categories).

  2. 2
    Step 2

    Assign each x∈Xx\in X a value in [0,1][0,1] representing degree of membership.

  3. 3
    Step 3

    Use μA(x)=1\mu_A(x)=1 as full membership, μA(x)=0\mu_A(x)=0 as none, and intermediate values as partial membership.

  4. 4
    Step 4

    Union/intersection/complement will be computed pointwise using the membership degrees.

Fuzzy set operations (union, intersection, complement)

A fuzzy set operation is typically defined pointwise: for each x∈Xx\in X, compute the resulting membership degree from μA(x)\mu_A(x) and μB(x)\mu_B(x).

Let AA and BB be fuzzy sets with membership functions μA,μB\mu_A,\mu_B.

Operations based on Zadeh-style min/max (common default)

The most widely cited “max–min” operations use:

  • Fuzzy union:
    μA∪B(x)=max⁡(μA(x),μB(x))\mu_{A\cup B}(x)=\max(\mu_A(x),\mu_B(x))
  • Fuzzy intersection:
    μA∩B(x)=min⁡(μA(x),μB(x))\mu_{A\cap B}(x)=\min(\mu_A(x),\mu_B(x))
  • Fuzzy complement:
    μAc(x)=1−μA(x)\mu_{A^c}(x)=1-\mu_A(x)

Important: Different fuzzy systems use different norms (t-norms/t-conorms) for union/intersection. Min/max and 1−μ1-\mu are popular choices.

Fuzzy union/intersection are not unique

Union/intersection depend on the chosen t-conorm/t-norm (e.g., min/max, product, Łukasiewicz, probabilistic sum). The “right” choice depends on the modeling assumptions.

Worked example with explicit numbers

Let X={cold, warm, hot}X=\{\text{cold, warm, hot}\}.

Define two fuzzy sets:

  • A="Warm"A=\text{"Warm"} with:
    • μA(cold)=0.1\mu_A(\text{cold})=0.1
    • μA(warm)=1.0\mu_A(\text{warm})=1.0
    • μA(hot)=0.4\mu_A(\text{hot})=0.4
  • B="Comfortable"B=\text{"Comfortable"} with:
    • μB(cold)=0.7\mu_B(\text{cold})=0.7
    • μB(warm)=0.8\mu_B(\text{warm})=0.8
    • μB(hot)=0.2\mu_B(\text{hot})=0.2

(1) Union using max

μA∪B(x)=max⁡(μA(x),μB(x))\mu_{A\cup B}(x)=\max(\mu_A(x),\mu_B(x))

Compute each element:

  • cold: max⁡(0.1,0.7)=0.7\max(0.1,0.7)=0.7
  • warm: max⁡(1.0,0.8)=1.0\max(1.0,0.8)=1.0
  • hot: max⁡(0.4,0.2)=0.4\max(0.4,0.2)=0.4

So:

  • μA∪B(cold)=0.7\mu_{A\cup B}(\text{cold})=0.7
  • μA∪B(warm)=1.0\mu_{A\cup B}(\text{warm})=1.0
  • μA∪B(hot)=0.4\mu_{A\cup B}(\text{hot})=0.4

(2) Intersection using min

μA∩B(x)=min⁡(μA(x),μB(x))\mu_{A\cap B}(x)=\min(\mu_A(x),\mu_B(x))

  • cold: min⁡(0.1,0.7)=0.1\min(0.1,0.7)=0.1
  • warm: min⁡(1.0,0.8)=0.8\min(1.0,0.8)=0.8
  • hot: min⁡(0.4,0.2)=0.2\min(0.4,0.2)=0.2

So:

  • μA∩B(cold)=0.1\mu_{A\cap B}(\text{cold})=0.1
  • μA∩B(warm)=0.8\mu_{A\cap B}(\text{warm})=0.8
  • μA∩B(hot)=0.2\mu_{A\cap B}(\text{hot})=0.2

(3) Complement

μAc(x)=1−μA(x)\mu_{A^c}(x)=1-\mu_A(x)

  • cold: 1−0.1=0.91-0.1=0.9
  • warm: 1−1.0=01-1.0=0
  • hot: 1−0.4=0.61-0.4=0.6

So:

  • μAc(cold)=0.9\mu_{A^c}(\text{cold})=0.9
  • μAc(warm)=0\mu_{A^c}(\text{warm})=0
  • μAc(hot)=0.6\mu_{A^c}(\text{hot})=0.6

Summary table for the example

x∈Xx\in XμA(x)\mu_A(x) (Warm)μB(x)\mu_B(x) (Comfortable)μA∪B(x)\mu_{A\cup B}(x) (max)μA∩B(x)\mu_{A\cap B}(x) (min)μAc(x)\mu_{A^c}(x) (1-μ\mu)
cold0.10.70.70.10.9
warm1.00.81.00.80.0
hot0.40.20.40.20.6

Key keywords:

  • membership function
  • t-norm
  • t-conorm
  • [complement]{def="Produces the opposite membership degree (often 1-μ\mu)"}

Other common fuzzy operations (beyond min/max)

Two important families:

  • t-norm
  • t-conorm

Product t-norm and probabilistic union (example alternatives)

Some systems use:

  • Intersection (product t-norm):
    μA∩pB(x)=μA(x)⋅μB(x)\mu_{A\cap_p B}(x)=\mu_A(x)\cdot \mu_B(x)
  • Union (probabilistic sum / t-conorm):
    μA∪pB(x)=μA(x)+μB(x)−μA(x)μB(x)\mu_{A\cup_p B}(x)=\mu_A(x)+\mu_B(x)-\mu_A(x)\mu_B(x)
  • Complement (still often 1−μ1-\mu):
    μAc(x)=1−μA(x)\mu_{A^c}(x)=1-\mu_A(x)

These often behave more “probabilistic-like” than min/max: product reduces more aggressively when either membership is small, while probabilistic sum increases less aggressively than max in some cases.

Fuzzy set operations on a small universe (example)

Values computed using max (union), min (intersection), and 1-μ\mu (complement).

How to use fuzzy sets in reasoning (conceptual workflow)

Create fuzzy sets

1. Define concepts

Choose linguistic terms and define membership functions over XX."

Apply fuzzy operations

2. Combine evidence

Use union/intersection/complement to combine degrees."

Use results in rules

3. Infer conclusions

Rule antecedents produce degrees; rule consequents aggregate them."

Defuzzify (if needed)

4. Decide or act

Convert fuzzy outputs to a crisp value when required."

Common edge cases & clarifications

Knowledge Check

Question 1 of 4
Q1Single choice

In a fuzzy set A on universe X, the membership function μA(x) maps into what range?