Preprint
Article

Construction of a Second-Countable Treon Space From a New Metric Structure

Altmetrics

Downloads

79

Views

21

Comments

0

This version is not peer-reviewed

Submitted:

17 July 2024

Posted:

18 July 2024

You are already at the latest version

Alerts
Abstract
Bermejo Algebras, which consist of Algebra B and Treon Algebra, are non-associative and unital algebraic structures that introduce new complex entities. Recently, a Hausdorff space associated with the space where these algebras act was defined. We constructed a second-countable treon space utilizing a novel metric derived from these algebras. We defined topological spaces and established a metric to prove the second-countable property within Bermejo Algebras. Our findings contribute to the construction of manifolds in treon spaces by defining a countable base using the density of rationals in the real numbers.
Keywords: 
Subject: Computer Science and Mathematics  -   Geometry and Topology

Introduction

Bermejo Algebras (Algebra B and Treon Algebra) are two isomorphic, non-associative, and unital algebraic constructions recently described by Alejandro Bermejo [1,2]. From these algebras, Lie and Malcev algebras can be defined. Additionally, Bermejo Algebras give rise to complex structures distinct from C 2 and quaternions [1,2,3].
In the elements of the Treon Algebra, conjugate products can be defined, which allow the establishment of inner products and norms [4] within their real components, without the need to equip the space with an inner product or a norm in the conventional manner. These quantities emerge simply by defining these conjugate products.
The spaces on which Bermejo Algebras are defined are Hausdorff spaces, including a particular quotient space defined with a norm structure as a fundamental element of the equivalence relation [4]. This analysis marked a starting point in the definition of manifolds in treon spaces.
However, for the definition of manifolds, besides being Hausdorff, the space must also be second-countable [5,6]. In this work, we deduce a space that meets this property, thereby contributing an element to the construction of manifolds for Bermejo Algebras.
Our study is based on the Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC) [7,8]. This implies that the definition of the various numerical sets we use is grounded in ZFC. We define topological spaces, bases of topological spaces, and perform deductions to establish a metric that defines a topology, strictly based on well-defined numerical sets. With this, we demonstrate the second-countable property in topological spaces within Bermejo Algebras.

1. Theoretical Framework

1.1. Natural Numbers N

The axioms of ZFC [7,8] enable us to construct a set with a structure that allows us to define the set of natural numbers, N , as follows: N { , { } , { { } } , { { { } } } , } , such that is the empty set, 0 , { } 1 , { { } } 2 , and so on. Consequently, we define the successor mappingS such that S : N N , n { n } .
Let N * N { } , and m n , the predecessor mapping of n, P, is defined as P : N * N , n m . Let n N * , the n-power successor mapping, S n , is defined as S n S S P ( n ) , such that S 1 S and S 0 id N , where id N : N N , n n . Thus, we define addition + in the natural numbers as + : N × N N , ( m , n ) m + n , such that m + n S n ( m ) [9,10]. Note that the identity element of addition + is 0, as n + 0 = S 0 ( n ) = n .

1.2. Integers Z

We define the set of integers Z as a quotient set Z ( N × N ) / , such that the equivalence relation ∼ is defined as ( m , n ) ( p , q ) m + q = n + p . Thus, we do not have N Z , as N cannot be expressed as ( N × N ) / [9,10]. However, we can define a bijective embedding ξ : N Z , n [ ( n , 0 ) ] , which allows incorporating N into Z to some extent. Note that ( n , 0 ) ( n + a , a ) , a N . This also allows us to define an inverse element for each n N : n [ ( 0 , n ) ] Z .
We define addition + in Z , + Z , as + Z : Z × Z Z , [ ( m , n ) ] + Z [ ( p , q ) ] [ ( m + p , n + q ) ] [9,10]. Thus, a sum of the form a + Z ( b ) , such that a , b N , must necessarily be analyzed as [ ( a , 0 ) ] + Z [ ( 0 , b ) ] = [ ( a , b ) ] for it to be well-defined.

1.3. Rational Numbers Q

We define the set of rational numbers, Q , as follows: Q ( Z × Z * ) / , where Z * Z { } , and the equivalence relation ∼ is given by ( a , b ) ( c , d ) a · Z d = b · Z c [9,10].
Thus, we can define fractions a / b [ ( a , b ) ] . The product · Z is defined as · Z : Z × Z Z , ( a , b ) · Z ( c , d ) ( a · c + b · d , a · d + b · c ) [9,10], where · is the product in N and is trivially defined from addition in N as a recursion m + m = S m ( m ) , that is, if we have 3 · m = ( m + m ) + m = S m ( m ) + m = S m ( S m ( m ) ) = ( S m S m ) ( m ) , for 4 · m = ( ( m + m ) + m ) + m = ( S m ( m ) + m ) + m = S m ( S m ( m ) ) + m = S m ( S m ( S m ( m ) ) ) = ( S m S m S m ) ( m ) , and for n · m = ( S m ) ( n 1 ) ( m ) .
To include Z within Q , we similarly need a bijective embedding, which we define as ζ : Z Q , z [ ( z , 1 ) ] .
The sum operation + Q is defined as + Q : Q × Q Q , [ ( a , b ) ] + Q [ ( c , d ) ] [ ( a · Z d + Z b · Z c , b · Z d ) ] , and the multiplication · Q : Q × Q R , [ ( a , b ) ] · Q [ ( c , d ) ] [ ( a · Z d , b · Z d ) ] [9,10].

1.4. Real Numbers R

Consider a sequence ( a , b ) n N ( p n ) n N Q , defined through the mapping π : N Q , n p n . If ϵ > 0 N N n , m N : | p n p m | < ϵ , we say that the sequence is a Cauchy sequence. This sequence will be convergent if p 0 Q ϵ > 0 N N n N : | p n p 0 | < ϵ . In this case, p 0 is the limit of the sequence ( p n ) n N , and we say that the sequence converges to p 0 , ( p n ) n N p 0 [11,12,13].
We define the real numbers, R , as a field ( R , + , · ) equipped with a total order relation ≥, considering that: (1) R is constructed with the abelian groups ( R , + ) and ( R { 0 } , · ) , (2) The order relation ≥ is compatible with the operations + and ·, and with the Archimedean property ((1) and (2) are properties of Q ), and (3) Every Cauchy sequence is convergent, such that each element in R is uniquely determined by a limit point of a Cauchy sequence of rational elements [11,12,13]. This means we have a mapping δ : Q R .
We want each element r R to be uniquely determined by a Cauchy sequence, but there are different Cauchy sequences that converge to the same limit. For example, using traditional numerical notation, the Cauchy sequences a n = 1 + 1 n and b n = 1 1 n 2 converge to 1 as n . Therefore, we do not have a one-to-one correspondence for the real element 1. This is solved with equivalence relations.
Let ( ( p n ) n N ) i be Cauchy sequences, which we denote as p n n N i C . We define the set R { ( p n ) n N Q : n N : p n Q ( p n ) n N p n n N i C } . Denoting by superscripts a , b , c , the Cauchy sequences that are distinct from each other, for two arbitrary elements ( p n a ) n N , ( p n b ) n N R we define: ( p n a ) n N ( p n b ) n N ( p n a p n b ) n N 0 . Understanding by 0 the rational equivalence class [ ( 0 , 1 ) ] . With this, we define the equivalence class [ ( p n ) n N ] { ( p n a ) n N : ( p n a ) n N ( p n a ) n N } , which determines a bijective correspondence [ ( p n ) n N ] r R . Therefore, we say that R is defined as R R / = { [ ( p n ) n N ] : ( p n ) n N R } , where the operations and the order relation are well-defined in the sense that [ ( p n a ) n N ] + [ ( p n b ) n N ] [ ( p n a + p n b ) n N ] , [ ( p n a ) n N ] · [ ( p n b ) n N ] [ ( p n a · p n b ) n N ] , and [ ( p n a ) n N ] < [ ( p n b ) n N ] δ > 0 N N n N : p n b p n a > δ [11,12,13].

1.4.1. Completeness of R

We say that a number a is an upper bound of a set U if a is greater than or equal to any element of U[14]. On the other hand, a supremum of a set U is the smallest upper bound [15]. A field F is ordered if it satisfies three properties a , b , c F : (1) Trichotomy: a > b a = b a > b (⊻ denotes the exclusive-or operator), (2) Compatibility with addition: a b a + c b + c , and (3) Compatibility with multiplication: a b c 0 a · c b · c [16]. Now, an ordered field is complete if any non-empty subset that is bounded above (has an upper bound) has a supremum in the field [16].
The real numbers are a complete ordered field, therefore, if we have any subset of real numbers that is bounded above, then that subset has a supremum in the real numbers. The rational numbers Q , on the other hand, are not complete because there are subsets of Q that have upper bounds but do not have a supremum in Q . For example, the set U = { y Q : y 2 < 2 } has an upper bound, can be any element of Q greater than or equal to all elements of U. In our example, two upper bounds can be 1.7 and 2, as their squares are greater than 2. However, the supremum of U is a real number, in this case is 2 , since 2 is the smallest real number greater than or equal to all elements of U. But, 2 Q . Thus, although U is bounded above in Q , it does not have a supremum in Q .
The lack of a supremum in Q for certain bounded above sets means that Q is not complete. In contrast, in R , any non-empty subset bounded above has a supremum that is also in R .

2. Theoretical Development

2.1. Base of the Treon Topological Space ( Λ , T Λ )

Bermejo defined the set Λ of r-treonspheres [4] as:
Λ { p i Preim · 2 X : Re p 2 i = r i r i > 0 }
where Re p 2 i is the real component of the operation p 2 p p * ( i , j ) , where ⊙ is the product in algebra B, and * ( i , j ) is the double complex conjugation of a treon [4]. Preim · 2 denotes the preimage of the composition mapping H = h · 2 , such that [4]:
H : Preim · 2 R 3 ,
p p ,
which takes treon p preimages of the operation · 2 , and assigns them elements of the vector space R 3 .
The mapping h that composes it is defined as [4]:
h : N R 3 ,
p 2 p ,
such that N X , with X being the total treon set. N is defined as [4]:
N { p X : p = p 2 } .
On the other hand, the mapping · 2 is defined as [4]:
· 2 : Λ X N X ,
p p 2 .
Let T Λ be a topology associated with Λ , we will have an arbitrary treon topological space ( Λ , T Λ ) [4]. Then, we assert that the collection of open subsets B T Λ constitutes a basis for T Λ if [17,18]:
U T Λ ( β i ) i I : β i B i I β i = U ,
where the index i belongs to an arbitrary set I.

2.2. Treon Topology Induced by the Bermejian Metric

In algebra B, the Bermejian inner product is defined from the product p i p j * ( i , j ) [2,4], denoted p i , p j :
p i , p j = ( p i p j , p i 1 p j 2 + p i 2 p j 1 p i 3 p j 2 , p i 1 p j 3 + p i 3 p j 1 p i 3 p j 2 ) ,
where p i p j p i 1 p j 1 + p i 2 p j 2 + p i 3 p j 3 . We should not confuse the subscript notation i , j with the superscript * ( i , j ) , which involves the double conjugate of the treon.
For the case p i , p i p 2 , this product yields:
p i 2 = ( p i 2 , 2 p i 1 p i 2 + p i 2 p i 3 , 2 p i 1 p i 3 + p i 3 p i 2 ) ,
where p i 2 p i 1 2 + p i 2 2 + p i 3 2 .
If for all p i = ( p i 1 , p i 2 , p i 3 ) and p j = ( p j 1 , p j 2 , p j 3 ) , we define a difference between treons as:
d i j p i p j = ( p i 1 , p i 2 , p i 3 ) ( p j 1 , p j 2 , p j 3 ) ,
we will have as a result:
d i j = ( p i 1 p j 1 , p i 2 p j 2 , p i 3 p j 3 ) .
Executing the Bermejian inner product d i j 2 :
d i j 2 = ( d i j 2 , 2 d i j 1 d i j 2 + d i j 2 d i j 3 , 2 d i j 1 d i j 3 + d i j 3 d i j 2 ) .
Therefore, we can define a mapping g i j g ( p i , p j ) as:
g i j : Λ × Λ R ,
g i j Re d i j 2 .
This mapping has the following properties for all p i , p j , p k Λ :
1. g i j 0 ,
2. g i j = 0 i = j ,
3. g i j = g j i ,
4. g i j g i k + g k j .
These properties define the mapping g i j as a metric, which we denote as the Bermejian metric.

2.3. Countable Base for the Treon Space ( Λ , T Λ )

Let the pair ( Λ , T Λ ) be our treon topological space, let W Λ not necessarily W T Λ , and let any U T Λ be an open set in T Λ :
We say that p is an accumulation point of W[17,18], p acc , if:
U T , p U : U { p } W .
Thus, W is the derived set of W if:
W = { p Λ : p = p acc } ,
and thus, we say that W ¯ is the closure of W if:
W ¯ = W W .
Let ( Λ , T Λ ) , with W Λ . We say that W is dense in Λ if and only if W ¯ = Λ [19,20]. Additionally, we say that W is countable if | W | | N | [20], so there exists a bijective function f : N W . We say that W is uncountable simply if it is not countable. Considering this: R is uncountable, and Q is countable and dense in R .
Consequently, we can define a countable basis for a topology using the Bermejian metric as follows:
Let ( Λ , T Λ ) be a topological space induced by the Bermejian metric, denoted ( Λ , g i j ) . We define the basis B of T Λ g i j as the collection of balls with radius ϵ centered at a point p 0 = ( p 01 , p 02 , p 03 ) :
B = { B ϵ ( p 0 ) : p 0 Λ , ϵ R , ϵ > 0 } ,
where the radius ϵ corresponds to metrics fixed at points p 0 to p i , such that ϵ g 0 i = r 0 i .
Understanding that Q is countable and dense in R , we can define:
B = { B ϵ ( p 0 ) : p 0 Λ Q 3 , ϵ Q , ϵ > 0 } ,
such that B is a countable base of T Λ .
Thus, we say that our treon topological space ( Λ , T Λ ) is second-countable, since there exists a countable base B of T Λ . Henceforth, understand ( Λ , T Λ ) ( Λ Q 3 , T Λ Q 3 ) ( Λ Q 3 , g i j ) .
To ensure that ( Λ , T Λ ) is second-countable implied ensuring that there exists a countable base B, which in turn implied verifying that Λ Q 3 is indeed countably infinite.

2.3.1. Proof of the Countability of Λ Q 3

Proof that Λ Is Infinitely Uncountable

Λ is an infinitely uncountable set because a set of treons p = ( p 1 , p 2 , p 3 ) has components p i R . We demonstrate this through a proof by contradiction.
Proof by contradiction: We start by assuming Λ is countable and will arrive at a contradiction.
If Λ is countable, then ( p i , 0 , 0 ) W Λ , such that p i ( 0 , 1 ) R , implies that W is countable. We have denoted the open interval as ( 0 , 1 ) .
If W is countable, then there exists a bijective function f:
f : N W ,
1 p 1 = 0 . p 11 p 12 p 1 m ,
2 p 2 = 0 . p 21 p 22 p 2 m ,
n p n = 0 . p n m .
Thus, p n ( 0 , 1 ) R n N : n p n .
We can construct a p ^ α ( 0 , 1 ) such that p n m n = m . Therefore, p ^ α is different from any p n . Hence, p ^ α ( 0 , 1 ) ¬ n N : n p n . This generates a contradiction.
We conclude that ( 0 , 1 ) R is infinitely uncountable; by extension, R is infinitely uncountable, ( p i , 0 , 0 ) is infinitely uncountable, and any ( p i , p j , p k ) Λ , such that p i , p j , p k R , implies that Λ is infinitely uncountable.
We need the components of a treon to be elements of a countable set. In this sense, we chose the set Q , which is a countably infinite set, as the set from which we will take the components of the treon space.

Construction of a Countably Infinite Set Λ Q 3

We can define a set of elements p n Q , n N such that we have an arbitrary treon of the form ( p n , 0 , 0 ) Y Λ Q 3 . Thus:
p n = { [ ( m , n ) ] Q : ( m Z n Z * ) [ ( m , n ) ] ( Z × Z * ) / } ,
where ∼ is defined as ( a , b ) ( c , d ) a · Z d = b · Z c .
Accordingly, we redefine the component p n as:
p n = { [ ( m , n ) ] Q : ( m Z n N * Z * ) } ,
where we necessarily consider in N * Z * the bijective embedding mapping ξ :
ξ : N Z ,
n [ ( n , 0 ) ] ,
which allows us to have the elements of N well-defined as elements within Z .
To avoid confusion between the equivalence relation that defines Z ( N × N ) / with the equivalence relation that defines Q ( Z × Z * ) / , we denote:
Z ( N × N ) / Z ,
Q ( Z × Z * ) / Q .
Thus:
p n = { [ ( m , [ ( n , 0 ) ] Z ) ] Q Q : ( m Z n N * [ ( n , 0 ) ] Z N * Z * ) } .
Therefore:
p 1 = m , ( 1 , 0 ) Z Q Q : m Z 1 ( 1 , 0 ) N * Z * = , 1 , ( 1 , 0 ) Z Q , 0 , ( 1 , 0 ) Z Q , 1 , ( 1 , 0 ) Z Q , ,
p 2 = m , ( 2 , 0 ) Z Q Q : m Z 2 ( 2 , 0 ) N * Z * = , 1 , ( 2 , 0 ) Z Q , 0 , ( 2 , 0 ) Z Q , 1 , ( 2 , 0 ) Z Q , ,
and so on, such that:
Q = i = 1 n p i .
Note that Q ( Z × Z * ) / is equivalent to Q ( Z × N * ) / considering the mapping ξ ; this is because there exists a bijective functional correspondence π :
π : ( Z × Z * ) / ( Z × N * ) / ,
[ ( a , b ) ] [ ( a , b ) ] ,
[ ( c , d ) ] [ ( c , d ) ] .
Considering that Z is a countably infinite set, because we can perform a correspondence f : N Z , 1 0 , 2 1 , 3 1 , 4 2 , 5 2 , , we assert that each set p n = [ ( m , [ ( n , 0 ) ] Z ) ] Q , for n N * and m Z , is countable: Since a countable union of countable sets remains countable, the union set of all p n is also countable [17,18,19,20].
Thus, ( p n , 0 , 0 ) is countable and, by extension: ( p n 1 , p n 2 , p n 3 ) Λ Q 3 , such that p n i Q , implies that Λ Q 3 is a countably infinite set.

2.3.2. Proof that Λ Q 3 is Dense in Λ

The fact that Q is dense in R implies that Λ Q 3 is dense in Λ , since for any pair of different treons ( p a , 0 , 0 ) , ( p b , 0 , 0 ) Λ , with p a , p b R , there exists a ( p k , 0 , 0 ) Λ Q 3 , with p k Q such that p a < p k < p b . This procedure can be applied to each component of a treon, or collectively to all components. It is crucial to note that we do not assume an order relation for treons in Λ , as such an assumption would be inconsistent in a three-dimensional space of complex entities. We assert that, since treons are defined by their components, the density of these components induces a corresponding "density" in the treon.

Proof

For all ( p a , 0 , 0 ) , ( p b , 0 , 0 ) Λ , such that p a , p b R , p a < p b 0 < p b p a .
For all a Z > 0 , we have an arbitrary element of Q [ ( a , p b p a ) ] Q > 0 .
The Archimedean property [21] states that for any field F, with b F :
b > 0 n N : b < n ,
and this allows us to ensure that [ ( a , p b p a ) ] Q < [ ( n , [ ( 1 , 0 ) ] Z ) ] Q .
From now on, understanding the axiomatic foundation of the base, we can simplify the notation of the set N , such that [ ( 1 , 0 ) ] N 1 , therefore:
[ ( a , p b p a ) ] Q < [ ( n , [ ( 1 , 0 ) ] Z ) ] Q [ ( a , p b p a ) ] Q < [ ( n , 1 ) ] Q .
Then:
[ ( a , 1 ) ] Q < [ ( n · ( p b p a ) , 1 ) ] Q ,
[ ( a + n · p a , 1 ) ] Q < [ ( n · p b , 1 ) ] Q .
Recognizing this, we can further simplify the notation without compromising the rigor of the proof:
[ ( a + n · p a , 1 ) ] Q < [ ( n · p b , 1 ) ] Q a + n · p a < n · p b .
Let p Z Z be the integer part of a number n · p , such that p R and n N . It always holds that p Z n · p < p Z + a , for a Z > 1 .
Taking p Z n · p a , we have p Z + a n · p a + a .
Therefore:
p Z n · p a < p Z + a n · p a + a < n · p b .
Hence:
n · p a < p Z + a < n · p b .
Since ( p Z + a ) Z ; we denote p k p Z + a , . Consequently, we have:
n · p a < p k < n · p b .
Now, resuming our notation:
[ ( n · p a , 1 ) ] Q < [ ( p k , 1 ) ] Q < [ ( n · p b , 1 ) ] Q .
Multiplying by [ ( 1 , n ) ] Q , we obtain:
[ ( n · p a , n ) ] Q < [ ( p k , n ) ] Q < [ ( n · p b , n ) ] Q ,
[ ( p a , 1 ) ] Q < [ ( p k , n ) ] Q < [ ( p b , 1 ) ] Q .
Since p a , p b R , the equivalence classes [ ( p a , 1 ) ] Q and [ ( p b , 1 ) ] Q will be real. And since [ ( p k , n ) ] Q Q , this implies that between any pair of elements of the set R we can always find an element of the set Q .
Using our logical notation, consider the direction of one of the components of a treon between an arbitrary pair of treons ( p a , 0 , 0 ) and ( p b , 0 , 0 ) Λ , denoted as ( [ ( p a , 1 ) ] Q R , 0 , 0 ) and ( [ ( p b , 1 ) ] Q R , 0 , 0 ) , respectively, there always exists a ( p k , 0 , 0 ) Λ Q 3 , denoted as ( [ ( p k , 1 ) ] Q Q , 0 , 0 ) .
Extending this analysis to the topological analysis, we have: Let an arbitrary element [ ( p 0 , 1 ) ] Q R and let [ ( r , 1 ) ] Q R , such that r > 0 :
[ ( p 0 , 1 ) ] Q [ ( r , 1 ) ] Q < [ ( p 0 , 1 ) ] Q .
Therefore, as for each pair [ ( p a , 1 ) ] Q , [ ( p b , 1 ) ] Q R , with [ ( p a , 1 ) ] Q < [ ( p b , 1 ) ] Q , there exists a [ ( p k , n ) ] Q such that [ ( p a , 1 ) ] Q < [ ( p k , n ) ] Q < [ ( p b , 1 ) ] Q , we have:
[ ( p 0 , 1 ) ] Q R [ ( p k , n ) ] Q : [ ( p 0 , 1 ) ] Q [ ( r , 1 ) ] Q < [ ( p k , n ) ] Q < [ ( p 0 , 1 ) ] Q .
This implies that:
[ ( p k , n ) ] Q ( ( [ ( p 0 , 1 ) ] Q [ ( r , 1 ) ] Q , [ ( p 0 , 1 ) ] Q + [ ( r , 1 ) ] Q ) { [ ( p 0 , 1 ) ] Q } ) Q ,
where ( [ ( p 0 , 1 ) ] Q [ ( r , 1 ) ] Q , [ ( p 0 , 1 ) ] Q + [ ( r , 1 ) ] Q ) denotes an open interval.
Therefore:
( ( [ ( p 0 , 1 ) ] Q [ ( r , 1 ) ] Q , [ ( p 0 , 1 ) ] Q + [ ( r , 1 ) ] Q ) { [ ( p 0 , 1 ) ] Q } ) Q .
Hence, [ ( p 0 , 1 ) ] Q is an accumulation point of Q .
Since we had chosen an arbitrary element [ ( p 0 , 1 ) ] Q R , this implies that all [ ( p 0 , 1 ) ] Q reals are accumulation points of Q . Then: Q = R , and therefore, as Q ¯ = Q Q , we can conclude that Q ¯ = Q R = R .

Conclusions

We have constructed a metric space within the context of the treon space without the need to explicitly define a traditional metric. Instead, we derived the metric from the Bermejian product, where it is implicitly defined. This approach enabled us to obtain a metric space, which facilitated the definition of epsilon-balls centered at an arbitrary treon. Using these balls, we were able to construct a basis for the topology induced by the Bermejian metric.
We defined a countable basis by leveraging the density and countability of rational numbers within the real numbers.
The theoretical development we presented confirmed that the treon topological space was indeed second-countable, as there existed a countable basis.
The construction of a countable basis will provide a powerful tool for the topological and geometric analysis of spaces defined by Bermejian Algebras, opening new possibilities for the definition and study of manifolds in these spaces. Second-countability will be a fundamental property that ensures our topological structures are manageable from an analytical and geometric perspective, facilitating the construction of more complex structures such as differentiable manifolds.

References

  1. Bermejo Valdes, A.J. First Exploration of a Novel Generalization of Lie and Malcev Algebras Leading to the Emergence of Complex Structures 2024. [CrossRef]
  2. Bermejo Valdes, A.J. Analysis of Complex Entities in Algebra B 2024. [CrossRef]
  3. Bermejo Valdes, A.J. Cauchy-Riemann Equations for Treons 2024. [CrossRef]
  4. Bermejo Valdes, A.J. Hausdorff Spaces in Bermejo Algebras: The Birth of Treonic Manifold Construction 2024. [CrossRef]
  5. Munkres, J.R. Analysis on manifolds; CRC Press, 2018.
  6. Lang, S. Differential manifolds; Vol. 2, Springer, 1972.
  7. Rathjen, M. Constructive Zermelo-Fraenkel set theory, power set, and the calculus of constructions. In Epistemology versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf; Springer, 2012; pp. 313–349.
  8. Jech, T.J. About the axiom of choice. In Studies in Logic and the Foundations of Mathematics; Elsevier, 1977; Vol. 90, pp. 345–370.
  9. Kanamori, A. Zermelo and set theory. Bulletin of Symbolic Logic 2004, 10, 487–553. [Google Scholar]
  10. Kossak, R. Set Theory. In Mathematical Logic: On Numbers, Sets, Structures, and Symmetry; Springer, 2024; pp. 73–81.
  11. Toth, G.; Toth, G. Real Numbers. Elements of Mathematics: A Problem-Centered Approach to History and Foundations 2021, pp. 73–133.
  12. Sohrab, H.H.; Sohrab, H.H. Sequences and Series of Real Numbers. Basic Real Analysis 2003, pp. 37–84.
  13. Maier, E.; Maier, D. A construction of the real numbers. The Two-Year College Mathematics Journal 1973, 4, 31–35. [Google Scholar]
  14. Bloom, T.F.; Maynard, J. A new upper bound for sets with no square differences. Compositio Mathematica 2022, 158, 1777–1798. [Google Scholar]
  15. Białas, J. Infimum and supremum of the set of real numbers. Measure theory. Def 1991, 2, I1. [Google Scholar]
  16. Banaschewski, B. On proving the existence of complete ordered fields. The American mathematical monthly 1998, 105, 548–551. [Google Scholar]
  17. Kelley, J.L. General topology; Courier Dover Publications, 2017.
  18. Kuratowski, K. Topology: Volume I; Vol. 1, Elsevier, 2014.
  19. Moore, G.H. The emergence of open sets, closed sets, and limit points in analysis and topology. Historia Mathematica 2008, 35, 220–241. [Google Scholar]
  20. Møller, J.M. General topology. Matematisk Institut, Universitetsparken 2007, 5.
  21. Ledda, A.; Paoli, F.; Tsinakis, C. The Archimedean property: new horizons and perspectives. Algebra universalis 2018, 79, 1–30. [Google Scholar]
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

© 2024 MDPI (Basel, Switzerland) unless otherwise stated