Preprint
Article

This version is not peer-reviewed.

The Third Generalization of the Hausdorff Dimension Theorem for Fuzzy Fractals

Submitted:

07 July 2026

Posted:

08 July 2026

You are already at the latest version

Abstract
In this paper, we present a third partial solution for the inverse problem of cardinality calculation of the set of fractals for its subcategory of the virtual fuzzy ones in $n$-dimensional Euclidean space. Consistent with the results of the previous deterministic and random cases, we utilize Mandelbrot’s fundamental definition to address the inverse problem of realizing a level-indexed fuzzy fractal profile. We prove the existence of aleph-two virtual fuzzy fractals with a Hausdorff dimension of a bivariate function of them and the given Lebesgue measure at the core level. The construction successfully employs both weak admissible distance kernels and decorated membership functions to establish these results for fuzzy fractals. Furthermore, we identify an explicit regularity-cardinality dichotomy where the resulting family size collapses to aleph-one under the strict constraint of upper semicontinuity. The problem remains open for other fractal dimensions, iterated fuzzy set systems, and non-Euclidean abstract fuzzy fractal spaces.
Keywords: 
;  ;  ;  ;  ;  ;  ;  
“More often than not, the classes of objects encountered in the real physical world do not have precisely defined criteria of membership.’’— Lotfi A. Zadeh (1921–2017)

1. Introduction

1.1. Fuzzy Fractals

Fuzzy set theory began with Lotfi A. Zadeh in 1965 [1], who replaced the two-valued indicator of a classical set with a membership function valued in [ 0 , 1 ] , so that a point may belong to a set not absolutely but to an intermediate degree—turning crisp inclusion into a graded notion suited to imprecisely bounded objects. Fractals entered this framework through the iterated function system: building on Hutchinson’s 1981 self-similar attractors [2] , Cabrelli introduced the iterated fuzzy set system in 1992 [3], whose contractive fuzzy Hutchinson–Barnsley operator admits a unique fixed point—an invariant, normal, upper-semicontinuous fuzzy set that they identified as the fuzzy fractal—and they did so precisely to address the inverse problem for fractals. The present work proceeds along a more general route: rather than realizing a fuzzy fractal as the self-similar attractor of such a system, it adopts a Mandelbrot-style criterion [4,5,6] under which a fuzzy set is a fuzzy fractal whenever one of its α -cuts has Hausdorff dimension exceeding its topological dimension, and it builds such sets directly from prescribed fractal cores—through indicators or distance-kernel decorations—without any self-similarity requirement. Since these beginnings the subject has matured, resting on the metric theory of spaces of fuzzy sets [10,11], with results on the existence, uniqueness, and continuity of fuzzy attractors [12], algorithms for rendering them [13], and extensions to hyperfractals and to fuzzy metric spaces [14,15]. Across this body of work the guiding concern has been to construct fuzzy fractals and to understand the attractors so produced; the complementary question—which prescribed quantitative data a fuzzy fractal can be made to realize—belongs to the inverse problem, to which we now turn.

1.2. Inverse Problem

The inverse problem—establishing the existence of fractals carrying a prescribed set of quantitative features—reverses the usual direction of fractal geometry: rather than measuring the dimension and Lebesgue measure of a given set, one fixes those quantities in advance and asks whether a fractal realizing them exists, how many do, and what structure the family of all such fractals possesses [16,17,18,19,20]. Constructive answers of this kind matter well beyond geometry, echoing long-standing questions in the foundations of mathematics about when the existence of an object guarantees a means of building it, and they recur throughout computer science [21,22]. Their urgency for fractals comes from application: fractal models find application across an expansive spectrum of scientific disciplines [23,24,25,26], where the target dimension and size of a structure are often known before any explicit set attaining them is in hand. The fuzzy category extends this program to a setting closer to physical reality. Natural objects seldom carry the sharp boundaries a deterministic fractal presumes; their membership is graded, an imprecision Zadeh placed at the center of mathematical modeling [1]. A fuzzy fractal absorbs this gradation, and its quantitative signature is correspondingly richer—no longer a single dimension–measure pair but the level-indexed fuzzy fractal profile. The inverse problem here thus seeks fuzzy fractals of prescribed profile, a question at once more expressive and more delicate than its deterministic and random forerunners, and the one taken up in this paper.

1.3. Motivation

The inverse problem for fractals in R n ( n 1 ) was first taken up in the mid-2000s for thin deterministic fractals [16], and more recently, in the early 2020s, for generalized deterministic fractals [19] and their random counterparts [20]. No such existence statement is yet available in the fuzzy category, and this case is genuinely more delicate: as we shall see, the prescribed data are no longer a single numerical pair but an entire level-indexed family of pairs, namely the fuzzy fractal profile. Beyond merely filling this gap, we are guided by two questions that the deterministic and random settings bring into view. The first concerns invariance: whether the maximal cardinality of aleph-two, attained by the available families in those settings, persists across the fuzzy category as well, so that this cardinality is independent of whether the prescribed setting is deterministic, random, or fuzzy. The second concerns regularity: the deterministic and random treatments leave implicit the way a regularity condition imposed on the prescribed setting governs the cardinality of the resulting family, and we make this "regularity-cardinality" interplay explicit here in the fuzzy setting.

1.4. Study Outline

This work provides a fuzzy counterpart to the existing deterministic and random existence results, constructing fuzzy fractals of prescribed Hausdorff dimension and Lebesgue measure in n-dimensional Euclidean space, and shows that the cardinality of the resulting family is independent of the construction setting. The outline is as follows. Section 2 collects the required preliminaries: the basic definitions and remarks of fractals in the fuzzy setting (Section 2.1), together with the key existence results and their hierarchy in the deterministic and random settings (Section 2.2). Section 3 develops the auxiliary results that bridge these preliminaries to the main theorems. Section 4 then leverages them to establish the existence results for fuzzy fractals (Section 4.1) and for strong fuzzy fractals (Section 4.2). Finally, Section 5 discusses the contributions to fractal geometry across the deterministic, random, and fuzzy settings (Section 5.1), outlines directions for future work (Section 5.2), and concludes the discussion (Section 5.3).

2. Preliminaries

The reader familiar with the theory of fractals [2,5,6,9,19,20] and fuzzy sets [1,8,10,11] will recognize that the present framework simultaneously unifies five foundational dimensions of upcoming analysis: (i) the Mandelbrot criterion of non-integer Hausdorff dimension [4], (ii) the α-cut geometry of fuzzy membership [1,8], (iii) the iterated fuzzy set systems of Cabrelli and Molter [3], (iv) the parallel-body and measure-theoretic foundations of Falconer and Tricot [6,9], and (v) the inductive topological dimension theory of Hurewicz and Wallman [7]. Throughout, the underlying space carries the Euclidean topology induced by the conventional metric d E , unless otherwise stated. We denote the n-dimensional Lebesgue measure, Hausdorff dimension, and small inductive topological dimension by λ n , dim H , and dim i n d , respectively. Throughout the cardinality calculations, we use standard notation from set theory [27]; in particular, under the Continuum Hypothesis, c = 1 , and under the Generalized Continuum Hypothesis, 2 c = 2 .

2.1. Basic Definitions and Remarks

Definition 2.1
(Fuzzy set and α cuts). A fuzzy set on R n is a function u : R n [ 0 , 1 ] . For the level parameter 0 < α 1 , the α cut (crisp set level) of u is [ u ] α = { x R n : u ( x ) α } . The core of u is core ( u ) = [ u ] = { x R n : u ( x ) = 1 } , and the support of u is supp ( u ) : = cl R n { x R n : u ( x ) > 0 } .
Definition 2.2
(Special Fuzzy Sets). A fuzzy set u : R n [ 0 , 1 ] is upper semicontinuous(usc) if, for every 0 < α 1 , the cut [ u ] α is closed. We call u normal if [ u ] 1 .
Remark 2.3.
The geometry of a fuzzy set u : R n [ 0 , 1 ] is naturally encoded in its family of nested α cuts as [ u ] β [ u ] α whenever 0 < α < β 1 .
Definition 2.4
(The fuzzy fractal profile). Let u : R n [ 0 , 1 ] be a fuzzy set and given level parameter α . The fuzzy fractal profile of u at level 0 < α 1 denoted by P r o f i l e u ( α ) is the pair ( D u ( α ) , m u ( α ) ) where D u is the Hausdorff dimension profile defined by D u : ( 0 , 1 ] [ 0 , n ] , D u ( α ) = dim H ( [ u ] α ) ; and, the Lebesgue measure profile defined by m u : ( 0 , 1 ] [ 0 , ] , m u ( α ) = λ n ( [ u ] α ) . The total fuzzy fractal profile of measurable u denoted by P r o f i l e u is the pair ( D , m ) where D = sup α > 0 D u ( α ) ; and, m = 0 1 m u ( α ) d α , respectively.
Remark 2.5.
The fuzzy fractal profile P r o f i l e u ( α ) and its components are non-increasing in terms of the level parameter 0 < α 1 .
Definition 2.6
(Fuzzy Fractal: Mandelbrot Context). Let u : R n [ 0 , 1 ] be a fuzzy set. Then:
(a)
u is a fuzzy fractal if there exists α ( 0 , 1 ] such that [ u ] α and dim H ( [ u ] α ) > dim ind ( [ u ] α ) .
(b)
u is a strong fuzzy fractal if for all α ( 0 , 1 ] , [ u ] α and dim H ( [ u ] α ) > dim ind ( [ u ] α ) .
We denote the set of all fuzzy fractals and strong fuzzy fractals by F 1 ( R n ) and F 2 ( R n ) , respectively( F 2 ( R n ) F 1 ( R n ) ).
Example 2.7
(Indicator Fuzzy Fractals). Let u : R n [ 0 , 1 ] be given by u ( x ) = 1 F ( x ) where F R n is a non-empty deterministic fractal. Then, for all α ( 0 , 1 ] , [ u ] α = F yielding u to be a strong fuzzy fractal. Furthermore, u is upper semicontinuous(usc) if and only if F is closed. In particular, u : R [ 0 , 1 ] , u ( x ) = 1 C ( x ) where C is the middle-third Cantor set is a strong usc fuzzy fractal. We denote the family of all indicator usc fuzzy fractals by I .
Remark 2.8.
C a r d ( I ) = c .
Definition 2.9
(Weak Admissible Distance Kernels). A function g : [ 0 , ) ( 0 , 1 ] is called a weak admissible distance kernel if it is bijective, g ( 0 ) = 1 , and g is continuous at 0. We denote the family of all weak admissible distance kernels by G w .
Remark 2.10.
C a r d ( G w ) = 2 c .
Definition 2.11
(Admissible Distance Kernels). A function g : [ 0 , ) ( 0 , 1 ] is called an admissible distance kernel if it is bijective, g ( 0 ) = 1 , and g is continuous everywhere. We denote the family of all admissible distance kernels by G .
Remark 2.12.
C a r d ( G ) = c .
Example 2.13.
Three examples of the family G are as follow:
(a)
The exponential kernel g 1 ( t , λ ) = e λ t ( λ > 0 ) , t 0 has the inverse g 1 1 ( α , λ ) = λ 1 log ( α ) .
(b)
The Gaussian tail kernel g 2 ( t ) = 2 ( 1 Φ Z ( t ) ) , t 0 has the inverse g 2 1 ( α ) = Φ Z 1 ( 1 α / 2 ) .
(b)
The rational kernel g 3 ( t ) = 1 / ( 1 + t ) , t 0 has the inverse g 3 1 ( α ) = ( 1 α ) / α .
Definition 2.14
(Family of Kernel-generated Fuzzy Extensions). Let F R n be non-empty, and let g G . The g generated fuzzy extension of F is the fuzzy set u F , g ( x ) = g ( d E ( x , F ) ) , x R n , where d E ( x , F ) = inf y F ( d E ( x , y ) ) . We denote the family of all kernel-generated fuzzy extensions via F by K F . The family of all kernel-generated fuzzy extensions is denoted by K .
Remark 2.15.
C a r d ( K F ) = c , F R n .
Remark 2.16.
C a r d ( K ) = 2 c .
Remark 2.17.
The kernel-generated fuzzy extension u F , g is continuous on R n and hence usc.
Remark 2.18.
The kernel-generated fuzzy extension u F , g has the α cut given by [ u F , g ] α = { x R n : d E ( x , F ) g 1 ( α ) } . In particular, [ u F , g ] 1 = F ¯ .

2.2. Key Established Existence Theorems

Theorem 2.19
(Hausdorff Dimension Theorem). For any real r > 0 , there is aleph-one thin deterministic fractals with Hausdorff dimension r in R n , where r n .
Theorem 2.20
(Generalized Hausdorff Dimension Theorem). For any real r > 0 and l 0 , there are aleph-two deterministic fractals-denoted by the set D n ( r , l ) - with Hausdorff dimension ρ = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) and Lebesgue measure l in R n , where r n .
Remark 2.21.
Under the additional compactness assumption, the cardinality of the associated available set -denoted by D n c o m p ( r , l ) - in the Theorem 2.20 drops to aleph-one.
Theorem 2.22
(Second Generalized Hausdorff Dimension Theorem). For any real r > 0 and l 0 , there are aleph-two random fractals -denoted by the set R n ( r , l ) -with Hausdorff dimension ρ = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) almost surely, and expected Lebesgue measure l in R n , where r n .
Remark 2.23.
An analogous compactness restriction applies to Theorem 2.22: if the random fractals are required to be compact-valued, the cardinality of the available associated set -denoted by R n c o m p ( r , l ) - drops to aleph-one.

3. Auxiliary Results

Proposition 3.1
(The fuzzy fractal profile characterization). Let F R n be a non-empty compact set, g G , and given level parameter α . Then, the fuzzy fractal profile of kernel-generated fuzzy extension P r o f i l e u F , g ( α ) = ( D u F , g ( α ) , m u F , g ( α ) ) has the following features:
(a)
D u F , g ( α ) = n . 1 ( 0 , 1 ) ( α ) + dim H ( F ) . 1 { 1 } ( α ) , for all α ( 0 , 1 ]
(b)
m u F , g ( α ) > 0 , for all α ( 0 , 1 ) .
Proof. 
(a) First, let 0 < α < 1 . Then, g 1 ( α ) > 0 , and [ u F , g ] α = { x R n : d E ( x , F ) g 1 ( α ) } . Choose y F . then, B ¯ ( y , g 1 ( α ) ) [ u F , g ] α . Hence, [ u F , g ] α has nonempty interior, and hence Hausdorff dimension n . Thus, D u F , g ( α ) = dim H ( [ u F , g ] α ) = n . Second, let α = 1 . Then, by Remark 2.18 and closeness of F , [ u F , g ] 1 = F ¯ = F . Thus, D u F , g ( 1 ) = dim H ( [ u F , g ] 1 ) = dim H ( F ) .
(b) This follows from proof in part (a) in which [ u F , g ] α has nonempty interior and hence positive Lebesgue measure. □
Proposition 3.2
(The weak fuzzy fractal profile characterization). Let F R n be a non-empty bounded closed set, g G w , and given level parameter α. Then, the fuzzy fractal profile of the weak kernel-generated fuzzy extension Profile u F , g ( α ) = D u F , g ( α ) , m u F , g ( α ) has the following features:
(a)
D u F , g ( α ) = n · 1 ( 0 , 1 ) ( α ) + dim H ( F ) · 1 { 1 } ( α ) , for all α ( 0 , 1 ] ;
(b)
m u F , g ( α ) > 0 , for all α ( 0 , 1 ) .
Proof. 
(a) First, let 0 < α < 1 . Since g is continuous at 0 and g ( 0 ) = 1 , there exists δ α > 0 such that 0 t < δ α g ( t ) > α . Then { x : d E ( x , F ) < δ α } [ u F , g ] α . Because F , this set contains a nonempty open ball. Hence [ u F , g ] α has nonempty interior, and therefore D u F , g ( α ) = dim H ( [ u F , g ] α ) = n . Second, let α = 1 . Since g is bijective and g ( 0 ) = 1 , the value 1 is attained only at 0, so [ u F , g ] 1 = { x : d E ( x , F ) = 0 } = F ¯ = F by closeness of F. Thus D u F , g ( 1 ) = dim H ( [ u F , g ] 1 ) = dim H ( F ) .
(b) This follows from the proof of part (a) in which [ u F , g ] α has nonempty interior and hence positive Lebesgue measure. □
Proposition 3.3
(The Kernel-generated Fuzzy Fractal). Let F R n be a non-empty compact deterministic fractal and let g G . Then the kernel-generated fuzzy extension
u F , g ( x ) = g ( d E ( x , F ) ) , x R n ,
is a usc fuzzy fractal.
Proof. 
At the core level α = 1 , we have g 1 ( 1 ) = 0 , and hence [ u F , g ] 1 = F . Therefore, dim H ( [ u F , g ] 1 ) = dim H ( F ) > dim ind ( F ) = dim ind ( [ u F , g ] 1 ) , so u F , g is a fuzzy fractal. Finally, the usc property follows from Remark 2.17. □
Remark 3.4
(Dimension Jump). Given a kernel-generated fuzzy fractal u F , g . Then, the Hausdorff dimension profile D u F , g has a sharp jump from its value of dim H ( F ) at the core level α = 1 to its value of n at the lower positive levels 0 < α < 1 . Hence, the Hausdorff dimension profile involves more information than then the single deterministic Hausdorff dimension value.
Remark 3.5
(Fractal Categorization). Given a kernel-generated fuzzy fractal u F , g . Then, u F , g is not strong fuzzy fractal(Indeed, for any 0 < α < 1 , dim H ( [ u F , g ] α ) = n = dim ind ( [ u F , g ] α ) ).
Example 3.6
(Fuzzy middle-third Cantor Fractals). Let C denote the deterministic middle-third Cantor set with dim H ( C ) = log ( 2 ) log ( 3 ) . Then, for g i ( 1 i 3 ) given in Example 2.13, the three distinct kernel-generated fuzzy fractals u C , g i ( 1 i 3 ) have the fuzzy Hausdorff dimension profile given by D u F , g ( α ) = n 1 ( 0 , 1 ) ( α ) + ( log ( 2 ) log ( 3 ) ) 1 { 1 } ( α ) , for all α ( 0 , 1 ] .

4. Main Results

The inverse problem is considerably more complex in the fuzzy category than in its deterministic and random predecessors. In those two settings one prescribes a single numerical pair ( ρ , l ) : a Hausdorff dimension together with a Lebesgue measure. In the fuzzy setting the prescribed object is an entire fuzzy fractal profile Profile u ( α ) = ( D u ( α ) , m u ( α ) ) , 0 < α 1 , that is, a whole family of dimension–measure pairs indexed by the level parameter; the existence question therefore admits several formulations, according to which part of the profile is fixed. In order to (i) keep our results aligned with the established deterministic and random theorems and (ii) bring those theorems directly to bear on the construction, we restrict attention throughout to profiles whose Hausdorff dimension component D u is a two-valued jump function, prescribed at the core level α = 1 .
This section discuss the existence of fractals with prescribed fuzzy fractal profile. Section 4.1 establishes the result for the case of fuzzy fractals in two routes: (i) the weak admissible kernel method, (ii) the decorated membership method. Section 4.2 establishes the similar result for the strong fuzzy fractals counterparts.

4.1. Existence of Fuzzy Fractals

We begin with a baseline existence result that secures the regularity property of upper semicontinuity at the cost of cardinality. The main theorem of this section will then trade this regularity for a strictly larger family.
Proposition 4.1
(Existence of usc Fuzzy Fractals). For any real r > 0 , l 0 , and n N with r n , put ρ : = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) . Then, there exist aleph-one usc fuzzy fractals with fuzzy profile ( ρ , l ) at the core level α = 1 .
Proof. 
We consider the map Ψ 0 : D n c o m p ( r , l ) × G F 1 ( R n ) given by Ψ 0 ( F , g ) = u F , g . Then, for S 0 = Ψ 0 ( D n c o m p ( r , l ) × G ) we have C a r d ( S 0 ) = c given straightforward two -sided lower bounds inference from Remark 2.21, Proposition 3.1 and Proposition 3.3. □
The aleph-one ceiling above is an artifact of the compactness restriction (Remark 2.21) inherited through the kernel construction. Relaxing upper semicontinuity lifts it: the following theorem produces aleph-two fuzzy fractals with the same profile, which are necessarily non-usc (Remark 4.3).
Theorem 4.2
(Third Generalized Hausdorff Dimension Theorem). For any real r > 0 , l 0 , and n N with r n , put ρ : = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) . Then, there exist aleph-two fuzzy fractals with fuzzy profile ( ρ , l ) at the core level α = 1 .
Proof. 
We prove the claim in two routes as follows:
The First Proof: A Weak Admissible Kernel Route
Step (i): Core and Kernel. By Remark 2.21, choose one nonempty compact deterministic fractal F R n such that ( dim H ( F ) , λ n ( F ) , dim i n d ( F ) ) = ( ρ , l , 0 ) . Then, for each g G w , define u F , g ( x ) = g ( d E ( x , F ) ) .
Step (ii): Fuzzy Fractality. Proposition 3.2 gives dim H ( [ u F , g ] α ) = n · 1 ( 0 , 1 ) ( α ) + dim H ( F ) · 1 { 1 } ( α ) . Since [ u F , g ] 1 = F , each u F , g has the same core F , and the top cut witness fuzzy fractality, i.e., dim H ( [ u F , g ] 1 ) = ρ > 0 = dim i n d ( [ u F , g ] 1 ) .
Step (iii): The Map. For the given bounded nonempty F R n , the distance function h : R n [ 0 , ) given by h ( x ) = d E ( x , F ) is onto. Hence, if g 1 g 2 , then there exists t [ 0 , ) such that g 1 ( t ) g 2 ( t ) , and there exists x R n such that h ( x ) = d E ( x , F ) = t . Therefore, u F , g 1 ( x ) = g 1 ( d E ( x , F ) ) g 2 ( d E ( x , F ) ) = u F , g 2 ( x ) . Accordingly, u F , g 1 u F , g 2 . Thus, the map Ψ 11 : G w F 1 ( R n ) given by Ψ 11 ( g ) = u F , g is injective.
Step (iv): The Count. Finally, from step(iii), setting S 11 = Ψ 11 ( G w ) and Remark 2.10 it follows that 2 c = C a r d ( G w ) = C a r d ( S 11 ) C a r d ( F 1 ( R n ) ) . Hence, C a r d ( F 1 ( R n ) ) = 2 c .
The Second Proof: A Decorated Membership Route
Step (i): Core and Kernel. Again, by Remark 2.21, choose one nonempty compact deterministic fractal F R n such that ( dim H ( F ) , λ n ( F ) , dim i n d ( F ) ) = ( ρ , l , 0 ) . Next, fix one admissible kernel g G , for instance g ( t ) = e x p ( t ) , set c 0 = 1 2 , and put R = g 1 ( c 0 ) = log 2 > 0 .
Step (ii): Decoration Site. Define the far field
M : = { x R n : d E ( x , F ) R + 1 } .
The following observations hold:
1.
Since F is bounded, M contains a Euclidean ball; hence C a r d ( M ) = c .
2.
The far field M lies at distance at least 1 from the closed parallel body [ u F , g ] c 0 = { x R n : d E ( x , F ) R } . By construction, F [ u F , g ] c 0 M c , implying M [ u F , g ] c 0 = .
3.
For x M , we have d E ( x , F ) R + 1 > R , so u F , g ( x ) = g ( d E ( x , F ) ) < g ( R ) = c 0 .
Step (iii): The Family. Let N = { S M : S non - closed in d E } . Then, by step(ii) item (1), C a r d ( N ) = 2 c . For each S N , define the fuzzy set:
u S ( x ) : = max { u F , g ( x ) , c 0 1 S ( x ) } , x R n .
Step (iv): Cuts and Profile. For given S N and every 0 < α 1 by equation (3):
[ u S ] α = [ u F , g ] α S c 0 , α : S c 0 , α = S { x R n : c 0 α } ) .
We investigate the fuzzy profile as follows:
1.
Case α = 1 : Here, by equation (4) S c 0 , α = , and [ u S ] 1 = [ u F , g ] 1 = F ¯ = F . Hence, dim H ( [ u S ] 1 ) = ρ > 0 .
2.
Case 0 < α < 1 : Here, as in proof (part (a)) of Proposition 3.1, dim H ( [ u F , g ] α ) = n . In addition, dim H ( S c 0 , α ) n . Hence, by equation (4) it follows that: dim H ( [ u S ] α ) = max { n , dim H ( S c 0 , α ) } = n .
Accordingly, both cases can be summarized as dim H ( [ u S ] α ) = n · 1 ( 0 , 1 ) ( α ) + dim H ( F ) · 1 { 1 } ( α ) . Finally, it is straightforward to check that m u S ( α ) > 0 , for all α ( 0 , 1 ) .
Step (v): Fuzzy Fractality. For given S N , by step(iv) item(1), we have dim H ( [ u S ] 1 ) = ρ > 0 = dim i n d ( [ u S ] 1 ) where in which [ u S ] 1 = F . Thus, u S is a fuzzy fractal.
Step (vi): The Map . First, for given S N , using step(ii) item(2), we have:
M [ u S ] c 0 = M ( [ u F , g ] c 0 S ) = ( M [ u F , g ] c 0 ) ( M S ) = S = S .
Second, let u S 1 = u S 2 . Then, by equation (5) we have S 1 = S 2 . Thus, the map Ψ 12 : N F 1 ( R n ) given by Ψ 12 ( S ) = u S is injective.
Step (vii): The Count . Finally, from step(vi), setting S 12 = Ψ 12 ( N ) and Step(iii) it follows that 2 c = C a r d ( N ) = C a r d ( S 12 ) C a r d ( F 1 ( R n ) ) . Hence, C a r d ( F 1 ( R n ) ) = 2 c .
Remark 4.3.
The available fuzzy fractals in Theorem 4.2 are indeed non-usc. To see this fact, it is sufficient in the second proof of the Theorem to consider the non-closed set [ u S ] c 0 = [ u F , g ] c 0 S in which its components are separated with positive distance; the first component is closed; and, the second component is non-closed.
Remark 4.4.
The two routes in the proof of Theorem 4.2 have the following similarities: First, both routes provide aleph-two fuzzy fractals. Second, both routes provide similar fuzzy fractal profiles where the Hausdorff dimension profile is a two-valued jump function. Finally, both routes use kernels in their provisions.
Remark 4.5.
The two routes in the proof of Theorem 4.2 have the following differences: First, the weak admissible kernel route uses the full force of cardinality of such kernels while the decorated membership route retains a smooth kernel but utilizes perturbing a single far field set. Second, while the weak admissible route is silent on additional non-usc feature of the provided fuzzy fractals, the decorated membership route proves their existence.

4.2. Existence of Strong Fuzzy Fractals

We now turn to the strong counterpart, where fractality is required at every level 0 < α 1 . The kernel-generated construction of Section 4.1 is unavailable here, since it is never strong (Remark 3.5); we instead employ the indicator fuzzy fractals of Example 2.7. As before, we first record a usc baseline at the cost of cardinality, and then relax upper semicontinuity to reach the maximal family.
Proposition 4.6
(Existence of usc Strong Fuzzy Fractals). For any real r > 0 , l 0 , and n N with r n , put ρ : = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) . Then, there exist aleph-one usc strong fuzzy fractals with fuzzy profile ( ρ , l ) at the core level α = 1 .
Proof. 
We consider the map Ψ 21 : D n comp ( r , l ) F 2 ( R n ) given by Ψ 21 ( F ) = 1 F . By Example 2.7, each 1 F is a usc strong fuzzy fractal whose profile equals ( ρ , l ) at every level 0 < α 1 , in particular at the core level α = 1 ; and the map is injective, since F = [ 1 F ] 1 . Then, for S 21 = Ψ 21 ( D n comp ( r , l ) ) we have Card ( S 21 ) = c by Remark 2.21. □
Remark 4.7
(The indicator is inessential). The map Ψ 21 ( F ) = 1 F is deliberately minimal, but the usc baseline of Proposition 4.6 does not depend on it. To see this feature, given a compact fractal core F, choose pairwise disjoint closed balls B ¯ ( p n , ρ n ) , n 2 , in its complement F c , and place in each ball a compact, totally disconnected fractal F n of positive Hausdorff dimension via a similarity transformation, with F 1 : = F . Then { F n } n = 1 is a sequence of pairwise disjoint closed fractals with F 1 = F . Set u F ( x ) : = n = 1 a n 1 F n ( x ) where { a n } n = 1 is strictly decreasing sequence in ( 0 , 1 ] . Disjointness makes u F well-defined with cuts [ u F ] α = n a n 1 ( α ) F n and core [ u F ] 1 = F ; each cut is a finite union of totally disconnected fractals, so dim ind ( [ u F ] α ) = 0 < dim H ( [ u F ] α ) and u F is a usc strong fuzzy fractal. Next, the assignment Ψ 21 * : F u F is again injective and reproduces the cardinality 1 . Thus, the result is carried again by genuinely multi-valued fuzzy fractals and not by the indicator alone; what the indicator route fixes is the dimension profile, held here at the two-valued jump.
The aleph-one ceiling above is again an artifact of the compactness restriction (Remark 2.21), here entering through the closedness of the core required for upper semicontinuity. Dropping closedness admits the full available set D n ( r , l ) of cores and lifts the family to aleph-two, as the following theorem shows; the resulting strong fuzzy fractals are necessarily non-usc.
Theorem 4.8
(Third Generalized Hausdorff Dimension Theorem: Strong). For any real r > 0 , l 0 , and n N with r n , put ρ : = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) . Then, there exist aleph-two strong fuzzy fractals with fuzzy profile ( ρ , l ) at the core level α = 1 .
Proof. 
Step (i). We consider the injective map Ψ 22 : D n ( r , l ) F 2 ( R n ) given by Ψ 22 ( F ) = 1 F .  Step(ii). We define S 22 = Ψ 22 ( D n ( r , l ) ) . Then, from step (i) and Theorem 2.20, it follows that 2 c = C a r d ( D n ( r , l ) ) = C a r d ( S 22 ) C a r d ( F 2 ( R n ) ) . Hence, C a r d ( F 2 ( R n ) ) = 2 c .
Remark 4.9.
The available strong fuzzy fractals in Theorem 4.8 are indeed generally non-usc; to see this, it is sufficient to note that the aleph-two cardinality of D n ( r , l ) is carried by non-closed cores F, for which the indicator 1 F has the non-closed cut [ 1 F ] 1 = F (Example 2.7).
Remark 4.10.
Theorem 4.8 realizes the strong family through the canonical embedding of deterministic fractals into the fuzzy category via indicator membership functions. This strong case should therefore be read as a sharp crisp-core counterpart to Theorem 4.2. Moreover, the genuinely multi-valued enrichment of Remark 4.7 applies verbatim whenever F ¯ R n , since it places its auxiliary fractals in the nonempty interior of F c and leaves F in place; the dense case F ¯ = R n , which carries the aleph-two cardinality, admits no such complementary room and is left to future work.

5. Discussion

5.1. Summary of Contributions

This work established an existence theorem for fuzzy fractals of a prescribed fuzzy fractal profile with the highest possible cardinal number of aleph-two (Theorem 4.2). In doing so, it extended to the fuzzy setting the former existence theorems of the deterministic (Theorem 2.20) and random (Theorem 2.22) settings, completing the third stage of the inverse Hausdorff-dimension program in the fuzzy category.
The distinctive feature of the fuzzy setting is that the single Hausdorff dimension of the deterministic and random predecessors is replaced by the fuzzy fractal profile Profile u ( α ) = ( D u ( α ) , m u ( α ) ) . The kernel-generated construction exhibits a sharp dimension jump (Remark 3.4): the deterministic value dim H ( F ) is retained at the core level α = 1 , while the full ambient dimension n is attained at every lower level 0 < α < 1 . The profile therefore carries strictly more information than the single dimension value.
The provision of the aleph-two family is governed by a regularity–cardinality dichotomy that parallels the deterministic and random cases. Imposing upper semicontinuity restricts the family to aleph-one (Proposition 4.1), whereas relaxing it recovers the maximal aleph-two (Theorem 4.2); this is exactly the mechanism by which the compactness (Remark 2.21) and compact-valued (Remark 2.23) restrictions collapse the deterministic and random families to aleph-one.
The key contributions to the fractal geometry literature align with those of the deterministic and random cases. First, the work highlights the advantage of Cantor-type cores over other classical fractals in securing the existence of fuzzy fractals. Second, the existence proof is constructive. Third, it furnishes a further example of a family of sets with cardinal number aleph-two. Fourth, it demonstrates that regardless of settings, the regularity has inverse relationship with cardinality. Finally, the cardinality of the available fractals is independent of the construction setting—deterministic, random, or fuzzy—and equals aleph-two.
Table 1 summarizes the inverse problem program across the former published literature and the present paper.

5.2. Future Work

Future work may extend and assess the present results in several directions.
First, the existence theorems established here concern fuzzy fractal profiles whose first component is a two-valued jump function, with the top slice at the core level α = 1 carrying the existence properties inherited from the deterministic setting. A natural next step is to generalize them to profiles whose first component is simultaneously multi-valued and fractal at every level, so that fractality is distributed across all cuts rather than concentrated at the core. Naturally, since the prescribed parameters differ from those of the deterministic and random settings, the resulting existence results need not align with those two former settings.
Second, an alternative direction concerns the regularity–cardinality dichotomy left open by the present work: to determine the maximal cardinality of the existence families under the upper-semicontinuity condition, for both fuzzy fractals and strong fuzzy fractals.
Third, only the Hausdorff fractal dimension is treated here. It is plausible to evaluate the counterpart results for other fractal dimensions, such as the box-counting, packing, or Assouad dimensions.
Fourth, the present setting is Euclidean throughout. It is plausible to establish and assess analogous results in more abstract, non-Euclidean fuzzy fractal settings.
Finally, it is plausible to investigate whether the fuzzy fractal profiles and existence results obtained here also arise as attractors of contractive iterated fuzzy systems.

5.3. Conclusion

This work has provided a further partial solution to the inverse existence problem—constructing families of fractals with a prescribed fractal dimension and Lebesgue measure—now in the fuzzy category. It secured the fuzzy case at cardinality aleph-two and extended the earlier deterministic and random results across both setting and regularity, exhibiting a single regularity–cardinality dichotomy. In doing so, it opened the way toward realizing non-constant profiles that are fractal at every level, and toward the maximal-cardinality question under upper semicontinuity.
AI Use StatementThe author used Claude AI (Opus4.8) only as an assistive tool for language polishing, source file-coding support, literature summarization, and reference formatting, in accordance with the spirit of the 2026 Leiden Declaration on Artificial Intelligence and Mathematics [28]. All mathematical content, citations, computations, and AI-assisted outputs were independently reviewed and verified by the author, who takes full responsibility for the final manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Zadeh, L. A. Fuzzy sets. Inf. Control 1965, 8(3), 338–353. [Google Scholar] [CrossRef]
  2. Hutchinson, J. E. Fractals and self-similarity. Ind. Univ. Math. J. 1981, 30(5), 713–747. [Google Scholar]
  3. Cabrelli, C. A.; Forte, B.; Molter, U. M.; Vrscay, E. R. Iterated fuzzy set systems: A new approach to the inverse problem for fractals and other sets. J. Math. Anal. Appl. 1992, 171(1), 79–100. [Google Scholar] [CrossRef]
  4. Mandelbrot, B. B. The fractal geometry of nature; W. H. Freeman: New York, 1982. [Google Scholar]
  5. Edgar, G. Measure, topology, and fractal geometry, 2nd ed.; Springer: New York, NY, 2008. [Google Scholar]
  6. Falconer, K. Fractal geometry: Mathematical foundations and applications, 3rd ed.; John Wiley & Sons: Chichester, UK, 2014. [Google Scholar]
  7. Hurewicz, W.; Wallman, H. Dimension Theory; Princeton University Press, 1941. [Google Scholar]
  8. Dubois, D.; Prade, H. Fuzzy Sets and Systems: Theory and Applications; Academic Press, 1980. [Google Scholar]
  9. Tricot, C. Two definitions of fractional dimension. Math. Proc. Camb. Philos. Soc. 1982, 91(1), 57–74. [Google Scholar] [CrossRef]
  10. Negoita, C. V.; Ralescu, D. A. Applications of fuzzy sets to systems analysis; Birkhäuser: Basel, 1975. [Google Scholar]
  11. Diamond, P.; Kloeden, P. Metric spaces of fuzzy sets: Theory and applications; World Scientific: Singapore, 1994. [Google Scholar]
  12. Forte, B.; Lo Schiavo, M.; Vrscay, E. R. Continuity properties of attractors for iterated fuzzy set systems. J. Aust. Math. Soc. Ser. B 1994, 36(2), 175–193. [Google Scholar] [CrossRef]
  13. da Cunha, R.; Oliveira, E.; Strobin, F. A multiresolution algorithm to generate images of generalized fuzzy fractal attractors. Numer. Algorithms 2021, 86(1), 223–256. [Google Scholar]
  14. Andres, J.; Rypka, M. Fuzzy fractals and hyperfractals. Fuzzy Sets Syst. 300 2016, 40–56. [Google Scholar] [CrossRef]
  15. Easwaramoorthy, D.; Uthayakumar, R. Analysis on fractals in fuzzy metric spaces. Fractals 2011, 19(3), 379–386. [Google Scholar] [CrossRef]
  16. Soltanifar, M. On a sequence of Cantor fractals. Rose-Hulman Undergrad. Math. J. 2006, 7(1), 1–9. [Google Scholar]
  17. Squillace, J. Estimating the fractal dimension of sets determined by nonergodic parameters. Discret. Contin. Dyn. Syst. – A 2017, 37(11), 5843–5859. [Google Scholar] [CrossRef]
  18. Gryszka, K. Hausdorff dimension is onto. Pr. Koła Mat. Uniw. Pedagog. W Krakowie 5 2019, 13–22. [Google Scholar]
  19. Soltanifar, M. A generalization of the Hausdorff dimension theorem for deterministic fractals. Mathematics 2021, 9(13), 1546. [Google Scholar] [CrossRef]
  20. Soltanifar, M. The second generalization of the Hausdorff dimension theorem for random fractals. Mathematics 2022, 10(5), 706. [Google Scholar] [CrossRef]
  21. Dowek, G. Constructive proofs and algorithms. In Computation, proof, machine: Mathematics enters a new age; Guillot, P.; Roman, M., Translators; Cambridge University Press: Cambridge, UK, 2015; pp. 119–137. [Google Scholar]
  22. Mainzer, K.; Schuster, P.; Schwichtenberg, H. Proof and computation: An introduction. In Proof and computation: Digitalization in mathematics, computer science, and philosophy; Mainzer, K., Schuster, P., Schwichtenberg, H., Eds.; World Scientific, 2018; pp. 1–46. [Google Scholar]
  23. Xiao, X.; Chen, H.; Bogdan, P. Deciphering the generating rules and functionalities of complex networks. Sci. Rep. 11 2021, 22964. [Google Scholar]
  24. Li, H. Fractal analysis of side channels for breakdown structures in XLPE cable insulation. J. Mater. Sci. Mater. Electron. 2013, 24(5), 1640–1643. [Google Scholar]
  25. França, L. G. S.; Vivas Miranda, J. G.; Leite, M.; Sharma, N. K.; Walker, M. C.; Lemieux, L.; Wang, Y. Fractal and multifractal properties of electrographic recordings of human brain activity: Toward its use as a signal feature for machine learning in clinical applications. Front. Physiol. 9 2018, 1767. [Google Scholar] [CrossRef]
  26. Hu, S.; Cheng, Q.; Wang, L.; Xie, S. Multifractal characterization of urban residential land price in space and time. Appl. Geogr. 34 2012, 161–170. [Google Scholar] [CrossRef]
  27. Jech, T. Set theory, 3rd millennium ed., revised and expanded; Springer: Berlin, 2003. [Google Scholar]
  28. Alper, J.; Barany, M.; Chavarri Villarello, A.; Dahmen, S.; Dean, W.; Ganapathy, K.; Harris, M.; Holmes, D.; Jamnik, M.; Kelk, S.; Kra, B.; Martin, U.; Naskręcki, B.; Ochigame, R.; Portegies, J.; Schmitt, J. Leiden Declaration on Artificial Intelligence and Mathematics; Zenodo, 2026. [Google Scholar] [CrossRef]
Table 1. The inverse problem program across the deterministic, random, and fuzzy settings. Each generalization reaches 2 when unrestricted and collapses to 1 under a regularity condition (compact / compact-valued / upper-semicontinuous).
Table 1. The inverse problem program across the deterministic, random, and fuzzy settings. Each generalization reaches 2 when unrestricted and collapses to 1 under a regularity condition (compact / compact-valued / upper-semicontinuous).
Paper # Hierarchy Result Setting Prescribed data Regularity Cardinality.
1 0 Theorem 2.19 (HDT) deterministic dimension r (thin) none (thin) 1
2 1 Theorem 2.20 (1st Gen.) deterministic ( ρ , l ) none 2
2 Remark 2.21 deterministic ( ρ , l ) compact 1
3 1 Theorem 2.22 (2nd Gen.) random ( ρ , l ) : ρ a.s., E [ λ n ] = l none 2
2 Remark 2.23 random ( ρ , l ) : ρ a.s., E [ λ n ] = l compact-valued 1
4 1 Theorem 4.2 (3rd Gen.) fuzzy profile ( ρ , l ) at core none (non-usc) 2
2 Proposition 4.1 fuzzy profile ( ρ , l ) at core usc 1
Note. Throughout, ρ = r 1 { 0 } ( l ) + n 1 ( 0 , ) ( l ) with r n . Under the (generalized) continuum hypothesis assumed in the paper, c = 1 and 2 c = 2 . Rows 6–7 are the contribution of this paper; the fuzzy pair reproduces, in the fuzzy category, the unrestricted- 2 /restricted- 1 pattern of the deterministic and random rows.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings