---
title: 'Neutrosophic Sets: Theory and Applications'
url: https://www.emergentmind.com/topics/neutrosophic-sets
type: topic
---

# Neutrosophic Sets: Theory and Applications

Searching arXiv for the cited neutrosophic-set sources to ground the article and cite them accurately.
Searching for foundational and survey-style neutrosophic set papers.
Neutrosophic sets are set-theoretic structures that assign to each element three values—truth-membership, indeterminacy-membership, and falsity-membership—rather than a single membership degree. In the single-valued formulation commonly used in applications, a set \(A\) on a universe \(X\) is written \(A=\{\langle x,T_A(x),I_A(x),F_A(x)\rangle:x\in X\}\) with \(T_A,I_A,F_A:X\to[0,1]\); the 2026 survey presents the standard single-valued constraint \(0\le T_A(x)+I_A(x)+F_A(x)\le 3\), while the PYNS software framework works with the same component-wise bounds but imposes no separate sum constraint beyond \(0\le \mu,\sigma,\omega\le 1\) [2603.15667][2404.05735]. The central idea is that truth, indeterminacy, and falsity are treated as independent or partially independent components, so neutrosophic sets can represent incomplete information, normalized information, and inconsistent information within one formalism [1911.07333].

## 1. Foundational definition and historical emergence

Neutrosophic sets originate in Florentin Smarandache’s broader program of Neutrosophy, which introduces neutrality or indeterminacy as a fundamental logical value alongside truth and falsity [2603.15667]. In the more general formulations recalled in the symbolic and theoretical literature, the three components may even be taken as subsets of a nonstandard interval such as \(]0^-,1^+[\), reflecting the original philosophical breadth of the theory [1512.00047][1611.08555]. For practical mathematics and applications, however, the dominant formulation is the single-valued one, in which each component is a real number in \([0,1]\) [1611.08555].

In this single-valued setting, a neutrosophic set records, for each element \(x\), a triple \((T_A(x),I_A(x),F_A(x))\), where \(T_A(x)\) is truth-membership, \(I_A(x)\) is indeterminacy-membership, and \(F_A(x)\) is falsity-membership [1911.07333]. The literature repeatedly emphasizes that the decisive departure from intuitionistic fuzzy theory is not merely the presence of three symbols, but the explicit treatment of indeterminacy as a first-class component rather than a residual term [2603.15667]. This permits three canonical informational regimes: \(T+I+F<1\) for incomplete information, \(T+I+F=1\) for normalized or balanced information, and \(T+I+F>1\) for inconsistent or paraconsistent information [2306.01746].

The theory also admits refinement. The 2019 generalization paper defines refined neutrosophic sets with multiple truth, indeterminacy, and falsity subcomponents \(T_A^1,\dots,T_A^p\), \(I_A^1,\dots,I_A^r\), and \(F_A^1,\dots,F_A^s\), with \(p+r+s=n\ge4\), thereby turning the basic triplet into a family of subdegrees [1911.07333]. The symbolic theory develops the same idea at a literal level, allowing symbolic components \(T_j\), \(I_k\), and \(F_\ell\), refined indeterminacies, and algebraic constructions such as neutrosophic quadruple numbers \(a+bT+cI+dF\) [1512.00047].

## 2. Relation to fuzzy-type set theories

Neutrosophic sets are typically presented as a unifying generalization of classical, fuzzy, intuitionistic fuzzy, and several later uncertainty models. The 2026 survey states that it is now “widely recognized” that neutrosophic sets generalize intuitionistic fuzzy sets, inconsistent intuitionistic fuzzy sets including picture fuzzy and ternary fuzzy sets, Pythagorean fuzzy sets, spherical fuzzy sets, and q-rung orthopair fuzzy sets [2603.15667].

| Model | Typical constraint | Relation to neutrosophic sets |
|---|---|---|
| Classical set | \(T\in\{0,1\}, I=0, F=1-T\) | Special case |
| Fuzzy set | \(I=0,\ F=1-T\) | Special case |
| Intuitionistic fuzzy set | \(T+F\le1,\ I=1-T-F\) | Special case with dependent \(I\) |
| IIFS / PFS / TFS | \(T+I+F\le1\) | Special case |
| Pythagorean fuzzy set | \(T^2+F^2\le1\) with derived \(I\) | Special case after squared embedding |
| Spherical fuzzy set | \(T^2+I^2+F^2\le1\) | Special case after squared embedding |
| q-rung orthopair fuzzy set | \(T^q+F^q\le1\) with derived \(I\) | Special case after \(q\)-power embedding |

The basic embeddings are straightforward. Classical sets appear when membership is crisp and indeterminacy is zero. Fuzzy sets are recovered by setting \(I=0\) and \(F=1-T\). Intuitionistic fuzzy sets are recovered when \(T\) and \(F\) satisfy \(T+F\le1\) and indeterminacy is defined by \(I=1-T-F\) [2404.05735][2603.15667]. The difference is that neutrosophic theory does not require \(I\) to be determined by \(T\) and \(F\), and does not require \(T+I+F=1\) [1911.07333].

A recurrent misconception is that neutrosophic sets collapse to intuitionistic fuzzy sets whenever \(T+I+F=1\). The 2019 paper explicitly rejects that conclusion: even when the underlying triples satisfy the intuitionistic-fuzzy normalization, neutrosophic operators and intuitionistic fuzzy operators can still yield different outputs because intuitionistic fuzzy operations do not manipulate indeterminacy explicitly, whereas neutrosophic operations do [1911.07333]. This difference is central to the claim that neutrosophic sets are not merely a renaming of intuitionistic fuzzy sets.

## 3. Order, operators, and mappings

The order structure of single-valued neutrosophic sets is componentwise but asymmetric across the three coordinates. In the PYNS framework and the neutrosophic-topology extension, for \(A=(U,\mu_A,\theta_A,\omega_A)\) and \(B=(U,\mu_B,\theta_B,\omega_B)\), one writes \(A\subseteq_N B\) when \(\mu_A(u)\le\mu_B(u)\), \(\theta_A(u)\le\theta_B(u)\), and \(\omega_A(u)\ge\omega_B(u)\) for all \(u\in U\); equality is mutual inclusion. The same sources define the neutrosophic empty set \(\emptyset_U=(U,0,0,1)\), the neutrosophic absolute set \(\tilde U=(U,1,1,0)\), complement by \(A^c=(U,\omega_A,1-\theta_A,\mu_A)\), and induced mappings \(f(A)\) and \(f^{-1}(B)\), with images computed over fibres by \(\sup\) on truth and indeterminacy and \(\inf\) on falsity, and with the default triple \((1,1,0)\) on empty fibres in the PYNS implementation [2404.05735][2412.00047].

Operator conventions, however, are not uniform across the literature. The 2026 survey explicitly notes that different authors use slightly different conventions for union, intersection, and complement [2603.15667]. One common family of definitions, used in the 2019 generalization paper and treated by the survey as standard, sets
\[
A\cup B=(\max T,\min I,\min F),\qquad
A\cap B=(\min T,\max I,\max F),\qquad
A^c=(F,1-I,T),
\]
so indeterminacy behaves dually to truth under union and intersection [1911.07333]. By contrast, the PYNS framework implements
\[
A\cup B=(\max \mu,\max \sigma,\min \omega),\qquad
A\cap B=(\min \mu,\min \sigma,\max \omega),
\]
so indeterminacy is aggregated in the same direction as truth [2404.05735]. The existence of both conventions is an established feature of the field rather than an accidental inconsistency.

This lack of complete standardization also has structural consequences. In the theory of single-valued neutrosophic filters, for example, one generally has \(A\cap A^c\neq \varnothing_U\) and \(A\cup A^c\neq \widetilde{U}\), unlike the crisp case, and this failure is precisely why the usual complement-based characterization of ultrafilters does not fully carry over to the neutrosophic setting [2005.13313]. A neutral reading is that neutrosophic set theory retains the algebraic vocabulary of set theory while weakening several Boolean identities.

## 4. Variants and derived mathematical structures

A large part of the literature consists of systematic variants of the basic triplet model. The 2026 survey treats single-valued neutrosophic sets as the canonical \(3\)-component case inside a wider hierarchy that includes interval-valued neutrosophic sets, refined neutrosophic sets, quadripartitioned and pentapartitioned neutrosophic sets, and plithogenic sets with arbitrary appurtenance dimension \(s\) and contradiction functions [2603.15667]. The interval-valued soft-set literature makes this concrete: an interval-valued neutrosophic soft set maps each parameter to an interval-valued neutrosophic set, so every parameter-object pair carries three intervals rather than three scalars [1402.3130].

Soft-set and matrix-based extensions form another strand. Neutrosophic soft sets map each parameter to a neutrosophic set on the universe, and neutrosophic soft matrices store these parameterized triplets in matrix form for computation; complement, union, intersection, AND-products, and OR-products are then defined componentwise on matrix entries [1404.0673]. This line of work is aimed at decision procedures and storage structures rather than foundational set theory alone.

Refinement can also occur along relational or bipolar dimensions. Neutrosophic multi sets assign sequences \(T_A^1,\dots,T_A^P\), \(I_A^1,\dots,I_A^P\), and \(F_A^1,\dots,F_A^P\) to each element, and neutrosophic multi relations are defined as neutrosophic multi subsets of Cartesian products; their composition uses max–min on truth and min–max on indeterminacy and falsity [1506.04025]. Bipolar neutrosophic sets instead split each evaluation into positive and negative triples \((T^+,I^+,F^+)\) and \((T^-,I^-,F^-)\), thereby representing both a property and its counter-property [1504.02773]. Interval Valued Bipolar Fuzzy Weighted Neutrosophic Sets further combine interval valuation, bipolarity, neutrosophic triples, and a fuzzy weight index \(p(x)\in[0,1]\) [1601.01266].

Topological and order-theoretic developments show that neutrosophic sets support derived structures beyond isolated membership assignments. The PYNS topology extension defines neutrosophic topologies as families of neutrosophic sets containing \(\emptyset_U\) and \(\tilde U\), closed under arbitrary neutrosophic unions and finite neutrosophic intersections, and introduces basis and sub-basis generation algorithms [2412.00047]. The filter literature develops single-valued neutrosophic filter bases, filters, ultrafilters, filter completion, and images of filters under induced mappings, explicitly to prepare for neutrosophic topology and convergence theory [2005.13313].

## 5. Computational frameworks and algorithmic use

Executable support for neutrosophic sets has become more systematic. The PYNS framework is organized around three classes: `NSuniverse` for finite ordered universes, `NSset` for single-valued neutrosophic sets, and `NSmapping` for mappings between universes together with neutrosophic image and inverse image operators [2404.05735]. Universes are represented as finite ordered lists of strings, neutrosophic sets as dictionaries \(u\mapsto[\mu,\sigma,\omega]\), and the framework exposes both compact angle-bracket notation and tabular display. It also overloads operators so that `+`, `&`, `~`, `-`, `<=`, `>=`, `==` implement neutrosophic union, intersection, complement, difference, subset, superset, and equality [2404.05735].

The same line of work extends from individual sets to families. The 2024 topology enhancement adds an `NSfamily` class to represent finite families of neutrosophic sets over a common universe and to automate basis construction, sub-basis generation, topology generation, and closure tests under union and intersection [2412.00047]. This is significant because it turns previously abstract definitions—such as “the topology generated by a family” or “the basis of finite intersections of a sub-basis”—into programmable objects.

Computational neutrosophics is not limited to symbolic set manipulation. In decision making, tabular representations of soft sets have been replaced by neutrosophic triplets \((T,I,F)\) in order to encode not only how strongly an attribute applies, but also the decision maker’s doubt about that assessment [2306.01746]. In clustering, a neutrosophic-domain method defines a density-based indeterminacy value \(I(i)\), assigns lower indeterminacy to dense regions and higher indeterminacy to sparse regions, introduces a noise cluster, and then optimizes memberships so that outliers go to the noise cluster while boundary points receive similar memberships to main clusters [1812.11034]. These works show that neutrosophic sets now function both as abstract models and as computational primitives.

## 6. Applications, misconceptions, and open issues

The application range claimed in the literature is broad. The PYNS framework paper cites pure mathematics and topology, graph theory, decision making, medicine, statistics, image analysis, and machine learning as domains in which neutrosophic sets arise [2404.05735]. The 2016 “New Trends” volume adds data mining, e-learning, engineering, medical diagnosis, probability theory, topology, and social science, and emphasizes the rapid appearance of hybrid models such as rough neutrosophic sets, bipolar neutrosophic sets, and single-valued neutrosophic hesitant fuzzy sets [1611.08555]. The 2026 survey correspondingly catalogues neutrosophic relations, graphs, matrices, linear algebra, topology, probability, optimization, decision making, clustering, and neutrosophic numbers, positioning neutrosophic sets as one of the four main “core” uncertainty frameworks alongside fuzzy, intuitionistic fuzzy, and plithogenic sets [2603.15667].

Decision-making papers illustrate what the explicit indeterminacy coordinate contributes. In the soft-set-based soccer-player example, binary entries and even grey or triangular fuzzy values are replaced by neutrosophic triplets so that truth, indeterminacy, and falsity can be averaged separately; the method then ranks candidates by high truth, low falsity, and lower indeterminacy as lower risk [2306.01746]. In clustering, the neutrosophic treatment of indeterminacy is explicitly tied to local density, so dense regions receive low indeterminacy, while boundary and outlier points receive higher indeterminacy and are handled differently by the optimization procedure [1812.11034].

Several misconceptions recur. One is that neutrosophic sets are only useful for contradiction; the standard formulation explicitly covers incomplete, normalized, and inconsistent information, so contradiction is only one regime among several [2603.15667]. Another is that the theory is purely philosophical; the existence of software frameworks, decision procedures, clustering algorithms, and matrix formalisms suggests otherwise [2404.05735]. A third is that a single canonical calculus exists; in fact, the survey states that operational rules are not unique, and the literature contains multiple legitimate operator families [2603.15667].

The open issues are therefore largely methodological. The 2026 survey identifies expressive power versus complexity, parameter selection, standardization of operations, and redundancy among closely related models as persistent questions [2603.15667]. The 2016 volume similarly notes increased model complexity, many alternative operator definitions, and a lack of consensus on the “best” operators in some domains [1611.08555]. A plausible implication is that neutrosophic sets are best understood not as a single fixed calculus, but as a flexible three-component paradigm whose precise algebra depends on the intended semantics of indeterminacy.

Source: https://www.emergentmind.com/topics/neutrosophic-sets