Next Article in Journal
Market Demand Optimization Model Based on Information Perception Control
Next Article in Special Issue
A Novel Method for Generating the M-Tri-Basis of an Ordered Γ-Semigroup
Previous Article in Journal
Simulating the Effects of Gate Machines on Crowd Traffic Based on the Modified Social Force Model
Previous Article in Special Issue
Hopf Differential Graded Galois Extensions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Characteristic, C-Characteristic and Positive Cones in Hyperfields

by
Dawid Edmund Kędzierski
1,
Alessandro Linzi
2,* and
Hanna Stojałowska
1
1
Institute of Mathematics, University of Szczecin, Wielkopolska 15, 70-451 Szczecin, Poland
2
Center for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(3), 779; https://doi.org/10.3390/math11030779
Submission received: 27 December 2022 / Revised: 20 January 2023 / Accepted: 30 January 2023 / Published: 3 February 2023
(This article belongs to the Special Issue Algebraic Structures and Graph Theory)

Abstract

:
We study the notions of the positive cone, characteristic and C-characteristic in (Krasner) hyperfields. We demonstrate how these interact in order to produce interesting results in the theory of hyperfields. For instance, we provide a criterion for deciding whether certain hyperfields cannot be obtained via Krasner’s quotient construction. We prove that any positive integer (larger than 1) can be realized as the characteristic of some infinite hyperfield and an analogous result for the C-characteristic. Finally, we study the (directed) graph associated with the strict partial order induced by a positive cone in a hyperfield in various examples.
MSC:
20N20; 06F99; 12J15

1. Introduction

In this paper, we study Krasner hyperfields. These structures are a generalization of the concept of the field, where the addition is allowed to be a multivalued operation, i.e., x + y in general denotes a subset and not only an element. Apart from the applications for which they have been introduced in [1] by Krasner, recently, these structures have arisen naturally in several mathematical contexts. For instance, Viro in [2] used hyperfields in tropical geometry and Lee in [3] studied these structures in connection to the model theory of valued fields. Regarding hyperfields, it is certainly also worth mentioning the work of Connes and Consani in number theory [4,5].
Since hyperfields represent a generalization of the concept of a field, it is natural to ask which classical notions and theorems of the theory of fields can be generalized to the theory of hyperfields. M. Marshall in [6] started the investigation towards a theory of real hyperfields, generalizing the Artin-Schreier theory of real fields (for a general reference on the latter, we refer the reader to [7]). The work of Marshall provided the basis for the investigations made later in [8] and in [9]. In the sections below, real hyperfields will be studied further.
Historically, a subhyperfield L of a hyperfield F is required to be closed under the multivalued addition in the sense that x + y L for all x , y L . However, Jun in (Definition 2.4) [10], felt the need for a less restrictive notion and started to talk about a multivalued operation, which can be “induced” by certain subsets. In Section 3, we take a model theoretical point of view (encoding the multivalued operation + via the ternary relation z x + y ) to justify Jun’s feeling and precisely define the notion of the multivalued operation induced by a subset (see also [9]). This leads us to the notion of relational subhyperfields. The interest for relational subhyperfields is motivated by the fact that they correspond to the submodels of hyperfields in a natural first-order language, which we describe in Section 3.
The notion of this characteristic is fundamental in classical field theory and, when it is finite, it can only be a prime number. Moreover, the characteristic of a field is preserved by subfields. In this paper, we will demonstrate that a natural generalization of the notion of characteristic for hyperfields (see Definition 3 below), does not have to behave in the same way: we prove that the characteristic of a hyperfield does not have to be preserved by relational subhyperfields (Example 13), and that any integer greater than 1 can be realized as the characteristic of some hyperfield (Theorem 3).
In addition, we study an alternative notion of the characteristic for hyperfields, known as the C-characteristic, which in the case of fields coincides with the usual characteristic. Moreover, this quantity is not preserved by relational subhyperfields (Example 14), and we prove in Theorem 4 that any positive integer can be realized as the C-characteristic of some real hyperfield. In addition, we demonstrate how useful the interplay between these two notions of characteristic can be by providing a criterion (Theorem 6) for deciding whather certain hyperfields cannot be obtained via Krasner’s quotient construction (see [11,12]). We apply this result to the finite real hyperfield of Example 4.
In Section 5, we define a strict partial order relation induced by a positive cone in a real hyperfield and study the associated directed graph in various interesting examples.

2. Preliminaries

In this section, we provide an overview of the definitions and facts that are necessary for the rest of the paper, with several examples.

2.1. Hyperfields

Let H be a non-empty set and P ( H ) be its power-set. A multivalued operation+ on H is a function which associates with every pair ( x , y ) H × H an element of P ( H ) , denoted by x + y . A hyperoperation + on H is a multivalued operation, such that x + y for all x , y H . If + is a multivalued operation on H , then for x H and A , B H , we set
A + B : = a A , b B a + b ,
A + x : = A + { x } and x + A : = { x } + A . If A or B is empty, then so is A + B .
A hypergroup can be defined as a non-empty set H with a multivalued operation +, which is associative (see Definition 1 (CH1) below) and reproductive (i.e., x + H = H + x = H for all x H ). This notion was first considered by F. Marty in [13,14,15]. Let us mention [16] for an extended historical overview and [17,18] for a description of some applications.
If ( H , + ) is a hypergroup, then it follows that + is a hyperoperation. Indeed, suppose that x + y = for some x , y H . Then,
H = x + H = x + ( y + H ) = ( x + y ) + H = + H = ,
which is excluded (cf. (Theorem 12) in [16]).
The following special class of hypergroups will be of interest for us.
Definition 1.
A canonical hypergroup is a tuple ( H , + , 0 ) , where H , + is a multivalued operation on H and 0 is an element of H such that the following axioms hold:
(CH1) 
+ is associative, i.e., ( x + y ) + z = x + ( y + z ) for all x , y , z H ,
(CH2) 
x + y = y + x for all x , y H ,
(CH3) 
for every x H , there exists a unique x H , such that 0 x + x (the element x will be denoted by x ),
(CH4) 
z x + y implies y z x : = z + ( x ) for all x , y , z H .
The axiom (CH4) is known as the reversibility axiom.
Remark 1.
Some authors (see e.g., (Definition 1.2) in [19]) define canonical hypergroups requiring explicitly that x + 0 = { x } for all x H . However, as already noted in (Section III, (b)) [12], this property follows from (CH3) and (CH4). Indeed, suppose that y x + 0 for some x , y H . Then, 0 y x by (CH4). Presently, y = x follows from the uniqueness required in (CH3). For this reason, we call 0 the neutral element for +.
Remark 2.
The multivalued operation of a canonical hypergroup ( H , + , 0 ) is reproductive. To observe this fix, a H . For x H + a , there exists h H , such that x h + a H , demonstrating that H + a H . For the other inclusion, take x H , then
x x + 0 x + ( a a ) = ( x a ) + a ,
so there exists h x a H , such that x h + a H + a . It follows, in particular, that + is a hyperoperation.
The following structures have been considered by Krasner in [1,11].
Definition 2.
A hyperfield is a tuple ( F , + , · , 0 , 1 ) , which satisfies the following axioms:
(HF1) 
( F , + , 0 ) is a canonical hypergroup;
(HF2) 
( F { 0 } , · , 1 ) is an abelian group and x · 0 = 0 · x = 0 for all x F ;
(HF3) 
the operation · is distributive with respect to +. That is, for all x , y , z F ,
x · ( y + z ) = x · y + x · z ,
where for x F and A F , we have set
x A : = { x a a A } .
We denote the multiplicative group of a hyperfield F by F × .
Remark 3.
One can think about other kinds of hyperfields by modifying the axioms that the additive hypergroup should fulfill. The hyperfields for which the additive hypergroup is a canonical hypergroup (as above) are commonly known as Krasner hyperfields. As we mentioned in the introduction, we will consider only these kinds of structures and call them simply hyperfields, as indicated in the above definition.
Remark 4.
The double distributivity law, i.e.,
( a + b ) ( c + d ) = a · c + a · d + b · c + b · d ,
does not hold in general in hyperfields. However, the fact that the inclusion
( a + b ) ( c + d ) c a + a d + b c + b d
holds is not difficult to verify from the definitions and has been known for long time. For instance, it was stated without proof in [12,20]. A proof has been written in (Theorem 4B) of [2].
By induction, it is straightforward to show that
( a 1 + + a n ) ( b 1 + + b m ) a 1 b 1 + a 1 b 2 + + a 1 b m + a 2 b 1 + + a n b m
for any natural numbers n , m .
Examples of hyperfields can be obtained in the following way. Let K be a field and G a subgroup of K × . For x K × , we denote by [ x ] G the coset x G K × / G . Further, let [ 0 ] G denote the singleton containing only 0 K . Then, the quotient hyperfield of the K modulo G is the set K G : = K × / G { [ 0 ] G } with the hyperoperation
[ x ] G + [ y ] G : = { [ x + y g ] G g G } ( x , y K )
and the operation
[ x ] G [ y ] G : = [ x y ] G ( x , y K ) .
This construction was demonstrated to always yield a hyperfield by Krasner himself in [11].
Not all hyperfields can be obtained in this way, i.e., there are hyperfields that are not quotient hyperfields. This has been demonstrated by Massouros in [12], who then improved his results in [21]. Afterwards, Baker and Jin in [22] have found the following theorem of Bergelson-Shapiro and Turnwald useful to prove that certain hyperfields cannot be obtained via Krasner’s quotient construction.
Theorem 1
(Theorem 1.3 in [23]; Theorem 1 in [24]). If F is an infinite field and G is a subgroup of F × of the finite index, then G G = F .
The next observation gives a necessary condition for a hyperfield to be a field. This fact is an immediate corollary of a result already noted in [20] (p. 369). We wish to state it for later reference and we will take the opportunity to write a quick proof.
Proposition 1
([20]). Let F be a hyperfield. If 1 1 = { 0 } , then F is a field.
Proof. 
By distributivity (HR3), our assumption implies that a a = { 0 } for all a F . Let a , b F × and take x , y a + b . Then
x y ( a + b ) ( a + b ) = ( a a ) + ( b b ) = { 0 } ,
so x = y and a + b is always a singleton in F. □
In the literature, one can find different interesting notions of the characteristic for hyperfields. Maybe the oldest is the one introduced by Mittas (a student of Krasner, see [20]). Later, Viro in [2] highlighted two other possible such notions. All these coincide with the usual characteristic of fields when the addition of the hyperfield under consideration is singlevalued (i.e., the hyperfield is in fact a field). However, they can be different in the general case. In this paper, we focus on the latter two notions, highlighted by Viro and which appear also in the work of P. Gładki [8] as well as in [4,5].
Definition 3.
Let F be a hyperfield. We set 1 × F 1 : = { 1 } and for n 2
n × F 1 : = 1 + + 1 n t i m e s .
If there is no risk of confusion, we simply write n × 1 in place of n × F 1 .
(i) 
The minimal n N such that 0 n × F 1 is called the characteristic of F. We denote this number by char F . If no such number exists, we set char F = .
(ii) 
The minimal n N such that 1 ( n + 1 ) × F 1 is called the C-characteristic of F. We denote this number by C-char F . If no such number exists, we set C-char F = .
Remark 5.
(i) 
Usually if the characteristic is not finite, then one sets it to be 0. We set it to be ∞ in this case because then some results below can be stated in a clearer way (cf. Proposition 2 and Proposition 4).
(ii) 
Note that in any field, the C-characteristic is equal to the characteristic.
(iii) 
For any hyperfield F we have that C-char F char F . Indeed, if 0 n × F 1 , then
( n + 1 ) × F 1 = n × F 1 + 1 = a n × F 1 ( a + 1 ) 0 + 1 = { 1 } ,
so C-char F n .
Let us describe some examples of finite hyperfields that will be of interest for us.
Example 1.
The sign hyperfield S is the set { 1 , 0 , 1 } with the hyperoperation and operation defined by the following tables:
+01−1
0 { 0 } { 1 } { 1 }
1 { 1 } { 1 } { 1 , 0 , 1 }
−1 { 1 } { 1 , 0 , 1 } { 1 }
·01−1
0000
101−1
−10−11
As it was noted in, e.g., [25], (Page 22 (b)) this hyperfield is isomorphic to the quotient hyperfield of an ordered field (e.g., the field R of real numbers) over the multiplicative subgroup given by its positive cone (in the example of real numbers that is the multiplicative subgroup R > 0 of positive real numbers). This hyperfield has the C-characteristic 1 and characteristic ∞.
Example 2.
This example is the hyperfield generated by the algorithm presented in [26] and called H F 521 . It has five elements { 0 , 1 , 1 , a , a } and its multiplicative group is isomorphic to Z 4 . The table for the hyperoperation is as follows:
+01−1a a
0 { 0 } { 1 } { 1 } { a } { a }
1 { 1 } { 1 , a , a } { 0 , 1 , 1 , a , a } { 1 , 1 , a , a } { 1 , 1 , a , a }
−1 { 1 } { 0 , 1 , 1 , a , a } { 1 , a , a } { 1 , 1 , a , a } { 1 , 1 , a , a }
a { a } { 1 , 1 , a , a } { 1 , 1 , a , a } { 1 , 1 , a } { 0 , 1 , 1 , a , a }
a { a } { 1 , 1 , a , a } { 1 , 1 , a , a } { 0 , 1 , 1 , a , a } { 1 , 1 , a }
As it was noted in [26], this hyperfield is isomorphic to the quotient hyperfield of the finite field with 29 elements F 29 over the multiplicative subgroup of F 29 × generated by 7. This hyperfield has C-characteristic 1 and characteristic 4.
Example 3.
This example is the hyperfield generated by the algorithm presented in [26] and called H F 56 . It has five elements, { 0 , 1 , 1 , a , a } . The table for the hyperoperation is as follows:
+01 1 a a
0 { 0 } { 1 } { 1 } { a } { a }
1 { 1 } { 1 , a , a } { 0 , a , a } { 1 , 1 , a , a } { 1 , 1 , a , a }
1 { 1 } { 0 , a , a } { 1 , a , a } { 1 , 1 , a , a } { 1 , 1 , a , a }
a { a } { 1 , 1 , a , a } { 1 , 1 , a , a } { 1 , 1 , a } { 0 , 1 , 1 }
a { a } { 1 , 1 , a , a } { 1 , 1 , a , a } { 0 , 1 , 1 } { 1 , 1 , a }
The multiplicative group is isomorphic to Z 2 × Z 2 .
Note that this hyperfield is not a quotient hyperfield. Indeed, since its multiplicative group is not cyclic, it cannot be a quotient of a finite field. Moreover, 1 1 does not coincide with the whole hyperfield and thus Theorem 1 ensures that it cannot be a quotient of an infinite field. We observe that this hyperfield has the C-characteristic 2 and characteristic 3.
Example 4.
Consider the set F = { 0 , 1 , 1 , a , a , a 2 , a 2 } and its subset P : = { 1 , a , a 2 } . We define on F the following hyperaddition:
+01 1 a a a 2 a 2
0 { 0 } { 1 } { 1 } { a } { a } { a 2 } { a 2 }
1 { 1 } { a , a 2 } F { 1 , 1 } P F { 0 } P F { 0 }
1 { 1 } F { 1 , 1 } { a , a 2 } F { 0 } P F × P
a { a } P F { 0 } { 1 , a 2 } F { a , a } P F { 0 }
a { a } F { 0 } P F { a , a } { 1 , a 2 } F { 0 } P
a 2 { a 2 } P F { 0 } P F { 0 } { 1 , a } F { a 2 , a 2 }
a 2 { a 2 } F { 0 } P F { 0 } P F { a 2 , a 2 } { 1 , a }
The multiplicative group is isomorphic to Z 6 . One can demonstrate that F is a hyperfield with straightforward direct computations. In Section 2.2, below, we will study some properties of the subset P. Moreover, we will prove that this cannot be obtained with Krasner’s quotient construction. Note that F has the C-characteristic 2 and its characteristic is ∞.

2.2. Real Hyperfields

The Artin-Schreier theory of ordered fields, which led Artin to his solution of Hilbert’s 17th problem (see [7] for details), was generalised to hyperfields in [6]. Let us recall some basic facts and definitions.
Definition 4.
Let F be a hyperfield. A subset P F is called a positive cone in F if
(P1) 
P + P P , ;
(P2) 
P · P P , ;
(P3) 
P P = , ;
(P4) 
P P = F × . .
A hyperfield F is called real if it admits a positive cone.
Note that 1 P for every positive cone P in a hyperfield F. Indeed, from the axioms, either 1 or 1 belongs to P, but not both. If 1 P , then 1 = ( 1 ) · ( 1 ) P again by the axioms. Hence, 1 cannot be in P, implying our assertion. This implies that the characteristic of a real hyperfield must be , since P + P P and 0 P .
Example 5.
The sign hyperfield S introduced in Example 1 above is real with the positive cone { 1 } . This is clearly the unique possible positive cone of S .
Example 6.
The hyperfield that we have introduced in Example 4 is real with the positive cone P : = { 1 , a , a 2 } . Again, this can be observed by straightforward computations.
Example 7.
The hyperfield which we have introduced in Example 2 is not real. Indeed, if P would be a positive cone, then since 1 P we must have 1 + 1 P . On the other hand, 1 + 1 = { 1 , a , a } and by the axioms only one among a and a can belong to P.
A similar reasoning yields that the hyperfield that we have introduced in Example 3 is not real.
Let us now briefly recall some results which have been proved in [9]. As in that paper, we will denote by X ( F | G ) the set of all positive cones in F, which contain some subset G of F and by X ( F ) the set of all positive cones in F.
Theorem 2
([9]). Let P be a positive cone of a field K and assume that a multiplicative subgroup G of K is contained in P. Consider the quotient hyperfield K G = { [ x ] G x K } .
(i) 
The set P G : = { [ x ] G x P } is a positive cone of K G .
(ii) 
If Q is a positive cone in K G , then P : = { x K [ x ] G Q } is a positive cone in K.
(iii) 
| X ( K G ) | = | X ( K | G ) | .
Example 8.
Consider the quotient hyperfield F : = Q ( Q × ) 2 , where ( Q × ) 2 is the set of nonzero squares in Q . The set Q + : = ( Q × ) 2 of the sums of nonzero squares in Q is the unique positive cone of Q . Hence, by assertion ( i i i ) of Theorem 2, F is real and has a unique positive cone P ( Q × ) 2 = { [ x ] ( Q × ) 2 x Q + } .

3. On Relational Subhyperfields

From the point of view of model theory (for a general reference, see, e.g., [27]), standard operations are usually encoded via binary function symbols. The same is not possible for multivalued operations, since function symbols are classically interpreted in a structure as functions with values in the universe of the structure and not in its power-set. Nevertheless, as it was observed in [3], we can use the ternary relation z x + y to encode a multivalued operation +. Thus, a hyperfield is naturally a structure on the first-order language having two constant symbols 0 , 1 for the neutral elements, a binary function symbol for the multiplication and a ternary relation symbol to encode the hyperoperation. Considering hyperfields as structures on this language, the general model theoretical notion of the submodel leads to the following definition (we provide more details in Remark 7, below).
Definition 5.
Let F be a hyperfield. A subset L F is a relational subhyperfield of F if 0 L , L { 0 } is a (multiplicative) subgroup of F { 0 } and with the induced multivalued operation, which is defined as
x + L y : = ( x + F y ) L ( x , y L )
we have that ( L , 0 , 1 , · , + L ) is a hyperfield.
Remark 6.
Note that a priori, the multivalued operation induced by a subset L of a hyperfield F might not be a hyperoperation, as it may admit empty values, i.e., ( x + F y ) L = may hold for some x , y L . If the latter is the case, then ( L , 0 , 1 , · , + L ) is certainly not a hyperfield; in particular, L would not be a relational subhyperfield of F, by definition.
Remark 7.
Presently, we will motivate the study of the notion introduced in Definition 5 above. A first-order language L consists of relation, function and constant symbols. A structure on L is (informally) a universe (i.e., a non-empty set) where any (well-formed) expression over L is interpreted (for a formal definition, see, e.g., (Section 1.5) in [27]). A first-order theory T over L is a list of axioms, i.e., expressions, which can be true or false when interpreted in a certain structure. A structure in which all the axioms of T are true is called a model of T . For example, the additive group of integers or the cyclic group of order 5 are models of the theory of groups, as is any other group. The field of rational numbers or the field of complex numbers are models of the theory of fields, as is any other field. Complete graphs or star graphs are models of the theory of graphs, as is any other graph.
Given a structure S on L and a non-empty subset A of S, it is possible to restrict to A the interpretations in S of the symbols of L . In this way, A itself becomes a structure on L , and A is called a substructure of S (cf. (Section 2.3) in [27]). One of the main differences between an n-ary ( n N ) relation symbol, interpreted in S as a relation R S n and an n-ary function symbol, interpreted in S as a function f : S n S , is that, when restricted to A, the latter has to satisfy the requirement f ( a ¯ ) A for all a ¯ A n ; because an n-ary function symbol must, by definition, be interpreted on A as a function f : A n A . On the other hand, the restricted relation on A is just defined to be R A n , and there are no further requirements to be satisfied.
With the notation introduced above, let us stress that under the assumption that S is a model of T , it does not follow in general that A is a model of T too. For example, we may restrict the operations of the field of real numbers to the set of integers Z , but we do not obtain a field. If the substructure A happens to be itself a model of T , then it is called a submodel of S. For example, the field of rational numbers is a submodel of the field of real numbers. If the axioms of T are all (equivalent to) universal axioms (i.e., they can be written using only the quantifier), then substructures are automatically submodels (this is a consequence of, e.g., (Theorem 3.3.3) in [27]).
Presently, let T hf be the theory given by the axioms of hyperfields (see Definitions 2 and 1) written, encoding the symbol + with the ternary relation z x + y . Then, a hyperfield F is a model of T hf and L is a relational subhyperfield of F if and only if L is a submodel of F.
In mathematics, it is customary to call subobjects the submodels of a model of the theory of (those) objects. For example, subgroups are submodels of a group; subfields are submodels of a field; subgraphs are submodels of a graph. However, subhyperfields are historically defined as subsets L of a hyperfield ( F , 0 , 1 , · , + ) , such that 0 , 1 L , x 1 L for all x L { 0 } , x y L and x + y L for all x , y L (cf. [12,20,21]). This definition can be traced back to the definition of the subhypergroup already present in, e.g., Definition 2 and the subsequent remark in [28].
While it is clear that any subhyperfield L of a hyperfield F is a relational subhyperfield of F with + L = + , there are examples of relational subhyperfields L , which do not satisfy the condition x + y L for all x , y L (see Examples 9 and 10, below). Thus, in this setting and perhaps for historical reasons, the use of the prefix “sub” seems to not match the common practice. Nevertheless, our point of view is based on the choice of encoding hyperoperations with relations; thus, we chose the name relational subhyperfield to distinguish our notion from the traditional one.
Example 9.
Consider the hyperfield F : = H F 521 of Example 2 and its subset L : = { 1 , 0 , 1 } . Equip L with the multivalued operation + L , as in Definition 5. Then, L is the sign hyperfield (cf. Example 1); in particular, it is a relational subhyperfield of F. Note that 1 L but 1 + F 1 = { 1 , a , a } L .
Example 10.
Consider the hyperfield F : = H F 56 of Example 3 and its subset L : = { 1 , 0 , 1 } . Equip L with the multivalued operation + L , as in Definition 5. Then, L is the the finite field with 3 elements F 3 ; in particular, it is a relational subhyperfield of F. Note that 1 L but 1 + F 1 = { 1 , a , a } L .
One might think that the subset { 1 , 0 , 1 } is a relational subhyperfield of any hyperfield. The next examples demonstrate that this is not the case.
Example 11.
Let F be a field (considered as a hyperfield) with char F > 3 . Then, L : = { 1 , 0 , 1 } is not a relational subhyperfield of F, since 1 , 0 , 1 1 + 1 and so ( 1 + 1 ) L = .
Example 12.
Consider the hyperfield F from Example 4 and its subset L : = { 1 , 0 , 1 } . Then, 1 + L 1 = and thus L is not a relational subhyperfield of F.
The following easy observation will be useful later.
Lemma 1.
Let F be a hyperfield and L be a relational subhyperfield of F. For all n N , we have that
n × L 1 n × F 1 .
Proof. 
Let us show this by induction on n. The base step is clear. For the induction step, given n > 1 , we compute
n × L 1 = x I n 1 ( L ) x + L 1 = x I n 1 ( L ) ( x + F 1 ) L x I n 1 ( L ) ( x + F 1 ) x I n 1 ( F ) ( x + F 1 ) = n × F 1 ,
where we have used the induction hypothesis ( n 1 ) × L 1 ( n 1 ) × F 1 . □

3.1. Characteristic of Relational Subhyperfields

It is not difficult to observe that if K is a field, considered as a hyperfield, then all relational subhyperfields of K are (traditional) subhyperfields of K and they coincide with the subfields of K. In field theory, the characteristic of a subfield coincides with the characteristic of the upper field. Nevertheless, in the multivalued setting, the same might not hold.
Example 13.
Consider the hyperfield F = H F 521 from Example 2. We have observed that char F = 4 and that the sign hyperfield S is a relational subhyperfield of F (cf. Example 9). Since S is real, we have that char S = . Thus, the strict inequality char F < char S holds.
On the basis of Lemma 1, we can demonstrate that the characteristic of a hyperfield is not greater than the characteristic of any of its relational subhyperfields.
Proposition 2.
Let F be a hyperfield and L be a relational subhyperfield of F. Then, char F char L .
Proof. 
Directly from Lemma 1, we can argue that if char L < , then also char F < and char F char L . Otherwise, char L = is automatically not smaller than char F . □
As we have observed in Example 13, the strict inequality might occur. In that example, we considered the hyperfield H F 521 , which has characteristic 4. We now prove that that is the minimal characteristic that a hyperfield can have in order to produce such a situation.
Proposition 3.
Let F be a hyperfield and L be a relational subhyperfield of F. If char F { 2 , 3 } , then char L = char F .
Proof. 
As we will observe, this follows from the fact that, since L is a relational subhyperfield of F, we have that 0 , 1 L .
Assume first that char F = 2 . By assumption, we have 0 1 + F 1 and since 0 L , we also have 0 ( 1 + F 1 ) L = 1 + L 1 , showing that char L = 2 = char F in this case.
Now assume that char F = 3 . This means that 0 1 + F 1 + F 1 and hence 1 1 + F 1 . Since 1 L , we obtain that 1 ( 1 + F 1 ) L = 1 + L 1 and 0 1 + L 1 + L 1 follows, since 0 L . Hence, char L 3 = char F . By Proposition 2, we obtain the equality. □

3.2. C-Characteristic of Relational Subhyperfields

A result analogous to Proposition 2 for the C-characteristic follows similarly as above from Lemma 1.
Proposition 4.
Let F be a hyperfield and L be a relational subhyperfield of F. Then, C-char F C-char L .
Proof. 
By Lemma 1, we have that if C-char L < , then also C-char F < and C-char F C-char L . Otherwise, C-char L = is automatically not smaller than C-char F . □
Also for C-characteristics, the strict inequality might hold, as the following example shows.
Example 14.
Consider the hyperfield F = H F 56 from Example 3. We have observed that C-char F = 2 and that the finite field F 3 of cardinality 3 is a relational subhyperfield of F (cf. Example 10). We have that
C-char F 3 = 3 > 2 = C-char F .
Let F be a hyperfield and L be a relational subhyperfield of F. Again, similarly as we observed for the characteristic, since 1 L , we have that if C-char F = 1 , then C-char L = 1 as well. Let us state this result.
Proposition 5.
Let F be a hyperfield with C-char F = 1 and L be a relational subhyperfield of F. Then, C-char L = C-char F .
Thus, in Example 14, the C-characteristic of F has the minimal value which can produce the strict inequality.

4. Realizing Characteristics and C-Characteristics

In this section, we deal with the problem of realizing a given positive integer as the characteristic or the C-characteristic of some hyperfield.

4.1. On the Characteristic

In classical field theory, the characteristic of a field, if finite, can only be a prime number. In contrast, we demonstrate below that any positive integer larger than 1 can be realized as the characteristic of some hyperfield. For a group G and x 1 , . . . , x n G , we will denote by x 1 , . . . , x n the subgroup of G generated by x 1 , . . . , x n .
Theorem 3.
For every natural number n N > 1 , there exists an infinite quotient hyperfield F, such that char F = n .
Proof. 
We are going to demonstrate that for every natural number n N , the quotient hyperfield F = Q n has characteristic n + 1 . Observe that
0 = 1 + . . . + 1 n   times n , so   [ 0 ] n ( n + 1 ) × [ 1 ] n .
Hence, char F n + 1 . If n = 1 , then char F = 2 . Let n > 1 and suppose that char F = k < n + 1 , i.e.,
[ 0 ] n k × [ 1 ] n ,   where   1 < k n .
Then, there exist x i Z , i { 1 , . . . , k } , such that
0 = ( n ) x 1 + . . . + ( n ) x k .
Let N = min { x 1 , . . . , x k } and denote m i : = x i N . Then
0 = ( n ) m 1 + . . . + ( n ) m k ,
where m i N { 0 } and 1 < k n . Observe that
( n ) 2 l 1 ( mod n + 1 )   and   ( n ) 2 l + 1 1 ( mod n + 1 )
for every l N . Thus, the left side of the Equation (2) is congruent to 0 modulo n + 1 , while the right side is congruent to k modulo n + 1 . Hence,
0 k ( mod n + 1 ) ,
which is a contradiction, since 1 < k n . As a consequence, we obtain that F has characteristic n + 1 . □
Let us now demonstrate that finite hyperfields of even cardinality must have characteristic 2.
Proposition 6.
Let F be a finite hyperfield of even cardinality. Then, char F = 2 .
Proof. 
Assume that F is a finite hyperfield, such that char F > 2 . Then, 1 1 and thus a a for all a F × . Therefore, | F × | must be even, and hence | F | is odd. □
If we restrict our attention to hyperfields obtained with the quotient construction, then we can make the following observations.
Lemma 2.
Let K be a field and G a subgroup of K × . Then, char K G char K .
If we consider quotient hyperfields K G , constructed with respect to a finite group G, then by looking at the proper divisors of the cardinality of G, it is possible to bound from above the characteristic of K G .
Proposition 7.
Let K be a field and G be a finite subgroup of K × . If n N > 1 divides the cardinality of G, then char K G n .
Proof. 
The group G is a finite subgroup of the multiplicative group of a field; thus, it is cyclic. Therefore, if n divides | G | , then there exists an element g G of order n. Hence, g = { 1 , g , . . . , g n 1 } and | g | = n . Since
0 = g n 1 = ( g 1 ) ( 1 + g + g 2 + . . . + g n 1 )
and g 1 , we obtain that
1 + g + g 2 + . . . + g n 1 = 0 .
We conclude that 0 n × [ 1 ] K G , so char F n . □
Conversely, sometimes from the characteristic of K G it is possible to deduce information on the divisors of | G | .
Lemma 3.
Let K be a field such that 1 1 and G are a finite subgroup of K × . If char K G = 2 , then the cardinality of G is even.
Proof. 
Since G is a finite subgroup of the multiplicative group of a field, it is cyclic. Let g be a generator of G. If char K G = 2 , then 0 [ 1 ] G + [ 1 ] G . Hence [ 1 ] G = [ 1 ] G = [ 1 ] G , so 1 G . We conclude that there is a positive integer k N , such that k < | G | and g k = 1 . Then, 1 = ( 1 ) 2 = g 2 k , hence | G | = 2 k is even. □
Remark 8.
The above result does not hold if 1 = 1 in K, since in that case the quotient hyperfield K G would have characteristic 2 for any multiplicative subgroup G of K × .
Combining Proposition 7 and Lemma 3, we derive the following result.
Corollary 1.
Let K be a field such that 1 1 and G are a finite subgroup of K × . Then, the quotient hyperfield K G has characteristic 2 if and only if | G | is even.

4.2. On the C-Characteristic

We now demonstrate that any positive integer can be realized as the C-characteristic of some real hyperfield.
Theorem 4.
For every natural number n N , there exists an infinite real hyperfield F, such that C-char F = n .
Proof. 
We are going to demonstrate that for every positive integer n N , the quotient hyperfield F = Q n + 1 is real and has C-char F = n . First, observe that
n + 1 = 1 + . . . + 1 n + 1   times , so [ 1 ] n + 1 ( n + 1 ) × [ 1 ] n + 1 .
Hence, C-char F n . If n = 1 , then C-char F = 1 . Let n > 2 . and suppose that C-char F < n , i.e.,
[ 1 ] n + 1 k × [ 1 ] n + 1 ,   where   2 k < n .
Then, there exist x i Z , i { 1 , . . . , k + 1 } , such that
( n + 1 ) x k + 1 = ( n + 1 ) x 1 + . . . + ( n + 1 ) x k .
Let N = min { x 1 , . . . , x k + 1 } and denote m i : = x i N . Then,
( n + 1 ) m k + 1 = ( n + 1 ) m 1 + . . . + ( n + 1 ) m k ,
where m i N { 0 } and 2 k n . We obtain that
( n + 1 ) m 1 + . . . + ( n + 1 ) m k ( n + 1 ) m k + 1 = 0 .
Presently, since for any m N { 0 } , we have
( n + 1 ) m 1 ( mod n ) ,
the left hand side of the Equation (3) is congruent to
1 + . . . + 1 ( k   times ) 1 = k 1
modulo n, while the right hand side is congruent to 0 modulo n. Hence,
k 1 0 ( mod n ) ,
which is a contradiction, since 2 k n . Hence, C-char F = n must hold.
Consider now the set of natural numbers
S : = { ( n + 1 ) p + 1 p N } .
By definition, for s , t S we have that [ s ] n + 1 = [ t ] n + 1 if and only if there exists some g n + 1 such that s = g t . Suppose that g 1 . Without loss of generality, we can assume that g = ( n + 1 ) m for some m N (if not, we apply the following reasoning to the equality t = g 1 s ). Since s 1 ( mod n + 1 ) and g t 0 ( mod n + 1 ) , we obtain a contradiction. Hence, [ s ] n + 1 = [ t ] n + 1 if and only if s = t ; thus,
{ [ ( n + 1 ) p + 1 ] n + 1 p N }
is an infinite subset of F, implying that F is infinite. Moreover, the set
P n + 1 : = { [ x ] n + 1 x > 0 }
is a positive cone in F by Theorem 2. □
Let us now demonstrate that a finite hyperfield F must satisfy C-char F < .
Proposition 8.
Let F be a finite hyperfield of cardinality n > 1 , which is not the field F 2 . Then, C-char F 2 n 3 .
Proof. 
Let F F 2 be a finite hyperfield of cardinality n > 1 . If 1 + 1 = { 0 } , then by Proposition 1, F is a field of characteristic 2, so n 4 and thus C-char F = 2 2 n 3 . If 1 1 + 1 , then C-char F = 1 2 n 3 . Otherwise, let a 1 + 1 . Since F × is an abelian group of cardinality n 1 , by Remark 4, we have that
1 = a n 1 ( 1 + 1 ) n 1 2 ( n 1 ) × F 1
and hence C-char F 2 n 3 . □
From Proposition 7 and Remark 5, the following result follows immediately.
Proposition 9.
Let K be a field and G a finite subgroup of K × . If n N > 1 divides the cardinality of G, then C-char K G n .
An ordered field has to be infinite. This is a consequence of the compatibility of the order relation induced by the positive cone, with the addition of the field (see Section 5, below). However, we have observed that there are real hyperfields, which are finite (cf. Example 1 and Example 4). The following result shows that we can construct finite real hyperfields with the C-characteristic 1 of any odd cardinality. Note that a finite real hyperfield has to have an odd number of elements by Proposition 6.
Let p be a prime number. In the proof of the next result, we will use the p-adic valuation v p on the field of rational numbers Q . Let us briefly recall how is that is defined (for more details on valuations, we refer to [29]). Let v p ( 0 ) : = , and for a b Q × , write
a b : = p ν a b ,
where ν Z and a , b Z are not divisible by p. Define v p ( a b ) : = ν . Thus, v p is a map from Q to Z { } .
Theorem 5.
For every odd number n 3 , there exists a finite real hyperfield F with C-char F = 1 , such that | F | = n .
Proof. 
Consider the field of rational numbers Q , a positive integer k N and the subgroup of Q × :
G k : = { x Q v p ( x ) 0 ( mod k ) and x > 0 }
where v p is the p-adic valuation on Q , for some prime number p. We are going to show that the quotient hyperfield Q G k is a finite, real hyperfield with C-characteristic 1 and cardinality 2 k + 1 . First, observe that G k Q + ; thus, Q G k is real by Theorem 2. Moreover, the index ( Q + : G k ) = k , so ( Q × : G k ) = 2 k and | Q G k | = 2 k + 1 . Observe also that
1 = 1 p k + p k 1 p k G k + G k ,
hence [ 1 ] G k 2 × [ 1 ] G k , which means that C-char Q G k = 1 . □
The following result provides a criterion for deciding whether certain hyperfields cannot be obtained via Krasner’s quotient construction.
Theorem 6.
Every finite hyperfield F with char F = and C-char F > 1 is not a quotient hyperfield.
Proof. 
Consider a finite hyperfield, which is a quotient hyperfield K G . Observe first that if char K G = , then char K = by Lemma 2. Hence, K must be infinite. On the other hand, since K G is finite, G has a finite index in K × . From Theorem 1, we obtain that G G = K , so in particular [ 1 ] G [ 1 ] G [ 1 ] G . From the reversibility axiom, we obtain that [ 1 ] G [ 1 ] G + [ 1 ] G . This shows that C-char K G = 1 . □
In particular, the hyperfield that we have introduced in Example 4 cannot be obtained with Krasner’s quotient construction.

5. The Strict Partial Order Induced by a Positive Cone

We begin this section recalling the following definition.
Definition 6.
A strict partial order is a set S with an binary relation <, which is:
(O1) 
irreflexive ( x x for all x S );
(O2) 
asymmetric ( x < y implies y x for all x , y S );
(O3) 
transitive ( x < y and y < z imply x < z for all x , y , z S ).
A strict partial order ( S , < ) is called a strict linear order if for all x , y S one has x < y , y < x or x = y .
In the theory of ordered fields, any positive cone P induces a strict linear order. This is defined as follows: x < y if and only if y x P . In the hyperfield case, one can define the relation x < y as y x P . One then obtains a strict partial order. Indeed, x x because 0 P and if x < y , then y < x cannot hold since P P = . In order to show transitivity, take x , y , z F , such that x < y and y < z . We have to demonstrate that x < z . Since y x , z y P and P + P P , we obtain that
z x y y + z x = ( y x ) + ( z y ) P .
Nevertheless, this strict partial order does not have to be linear, as the following example shows.
Example 15.
Consider the quotient hyperfield Q ( Q × ) 2 with its unique positive cone
P : = { [ x ] ( Q × ) 2 x Q + } .
Observe that since 1 = 2 · 1 2 1 · 1 2 and 2 = 1 · 2 2 2 · 1 2 , we have that
[ 1 ] ( Q × ) 2 [ 2 ] ( Q × ) 2 [ 1 ] ( Q × ) 2 a n d [ 2 ] ( Q × ) 2 [ 1 ] ( Q × ) 2 [ 2 ] ( Q × ) 2 .
Therefore, both [ 2 ] ( Q × ) 2 [ 1 ] ( Q × ) 2 and [ 1 ] ( Q × ) 2 [ 2 ] ( Q × ) 2 contain elements of P and thus [ 1 ] ( Q × ) 2 and [ 2 ] ( Q × ) 2 are incomparable with respect to the order relation associated to P, since P P = .
In an ordered field K, the order relation < associated to a positive cone P is compatible with the addition of K in the sense that a < b implies that a + c < b + c for all a , b , c K . In the next example, we consider a real hyperfield F, such that a < b and a + c = b + c for some a , b , c F , where < is the order induced by a positive cone of F.
Example 16.
Consider the sign hyperfield S and its unique positive cone P = { 1 } . Observe that 0 < 1 , but 0 + 1 = { 1 } and 1 + 1 = { 1 } .
We now note that in the case of the sign hyperfield S , the strict partial order relation induced by its positive cone P = { 1 } is a strict linear order.
At this point, let us consider another example of the real hyperfield.
Example 17
(Example 3.6 in [9]). Consider the following cartesian product { 1 , 1 } × Γ , where ( Γ , + , 0 , < ) is an ordered abelian group. Denote F : = { 1 , 1 } × Γ { 0 } . Then, the tuple ( F , , · , 0 , ( 1 , 0 ) ) is a hyperfield, with the hyperaddition defined as follows:
x 0 = 0 x : = { x } x F ( 1 , γ 1 ) ( 1 , γ 2 ) : = { ( 1 , min { γ 1 , γ 2 } ) } γ 1 , γ 2 Γ ( 1 , γ 1 ) ( 1 , γ 2 ) : = { ( 1 , min { γ 1 , γ 2 } ) } γ 1 , γ 2 Γ ( 1 , γ 1 ) ( 1 , γ 2 ) : = { ( 1 , γ 1 ) } γ 1 < γ 2 Γ ( 1 , γ 1 ) ( 1 , γ 2 ) : = { ( 1 , γ 2 ) } γ 1 > γ 2 Γ ( 1 , γ ) ( 1 , γ ) : = { ( e , δ ) e { 1 , 1 } , δ γ } { 0 } γ Γ
The result of the group multiplication · by 0 is defined to be 0, and for nonzero elements of F, we set:
( s 1 , γ 1 ) · ( s 2 , γ 2 ) = ( s 1 s 2 , γ 1 + γ 2 ) .
Moreover, { ( 1 , γ ) γ Γ } is a positive cone in F.
Remark 9.
The hyperfield F from the previous example is a quotient hyperfield. It is obtained as R E + ( R ) , where R is a real closed field and E + ( R ) is the group of totally positive units with respect to the natural valuation associated with the unique positive cone of R. For more details, we refer the reader to [9].
One can observe that the positive cone of the real hyperfield that we have introduced in the above example also induces a strict linear order relation.
The property that the sign hyperfield and the real hyperfield of Example 17 have in common is that they are stringent hyperfields.
Definition 7
([30]). A Krasner hyperfield F is said to be stringent if for all x , y F , we have that x + y is a singleton unless y = x .
In fact, we have the following general result.
Proposition 10.
Let F be a stringent real hyperfield with positive cone P. Then, the relation
a < b b a P ( a , b F )
is a strict linear order relation on F.
Proof. 
Take two distinct elements a b of F. Then, b a = { c } for some c F × . Therefore, either c P , in which case a < b , or c P , in which case b < a . Hence, a and b are comparable and < is indeed a linear order. □
To any strict partial order one can easily associate a directed graph. Let ( S , < ) be a strict partial order. The (directed) graph associated to < has S as its set of vertices, and an edge goes from a vertex a to a vertex b precisely when a < b . The reader should note that in the following illustrations, we do not draw the edges that can be deduced from the transitivity of <. For instance, for S = { a , b , c } with a < b < c , we draw the following graph
Mathematics 11 00779 i001
instead of
Mathematics 11 00779 i002
In the case of stringent real hyperfields, we obtain a linear order by Proposition 10. The directed graph obtained in this case can be found in Figure 1 below.
In the case described in Example 15, the directed graph associated to the strict partial order induced by the positive cone is illustrated in Figure 2 below.
Indeed, in that case, one can demonstrate that if a , b P are two distinct elements, then they are not comparable.
In the following example, we consider a more complex situation.
Example 18.
Consider the field of rational functions over the real numbers R ( X ) . This field admits infinitely many positive cones. Below, we define a specific one, but our reasoning would apply to any of them. Every rational function h R ( X ) can be written uniquely in the following form:
h = x k f g ,   where   f ( 0 ) , g ( 0 ) 0 , k Z .
We consider the positive cone P : = { h R ( X ) f ( 0 ) g ( 0 ) > 0 } . We set U : = { h R ( X ) k = 0 } and ( R ( X ) × ) 2 : = { h R ( X ) h = h 1 2 + + h n 2 f o r s o m e h 1 , , h n R ( X ) × , n N } . Consider the quotient hyperfield F : = R ( X ) E + , where E + : = U ( R ( X ) × ) 2 . In particular, E + P , since sums of non-zero squares are contained in any positive cones, and from Theorem 2 we obtain that F is real with the positive cone P E + = { [ h ] E + h P } .
Take two elements [ h 1 ] , [ h 2 ] F , such that
h 1 = x k 1 f 1 g 1 , h 2 = x k 2 f 2 g 2   with   f 1 ( 0 ) g 1 ( 0 ) > 0 , f 2 ( 0 ) g 2 ( 0 ) > 0 .
First, assume that k 1 k 2 . Without a loss of generality, let k 1 > k 2 . We compute
h 2 h h 1 = x k 2 f 2 g 1 g x k 1 k 2 f 1 g 2 f g 1 g 2 g , where   h = f g E + .
Then
( f 2 g 1 g x k 1 k 2 f 1 g 2 f ) ( 0 ) ( g 1 g 2 g ) ( 0 ) = f 2 ( 0 ) g 2 ( 0 ) > 0 .
Hence [ h 2 ] [ h 1 ] P E + , so [ h 2 ] > [ h 1 ] . Now assume that k : = k 1 = k 2 . We have
h 2 h h 1 = x k f 2 g 1 g f 1 g 2 f g 1 g 2 g , where   h = f g E + .
Take h = f g , such that g ( 0 ) = 1 and f ( 0 ) < ( f 2 g 1 ) ( 0 ) ( f 1 g 2 ) ( 0 ) . Then
( f 2 g 1 g f 1 g 2 f ) ( 0 ) ( g 1 g 2 g ) ( 0 ) > 0 .
Hence, ( [ h 2 ] [ h 1 ] ) P E + . On the other hand, let g ( 0 ) = 1 and f ( 0 ) > ( f 2 g 1 ) ( 0 ) ( f 1 g 2 ) ( 0 ) . Then
( f 2 g 1 g f 1 g 2 f ) ( 0 ) ( g 1 g 2 g ) ( 0 ) < 0 .
Hence, ( [ h 2 ] [ h 1 ] ) P E + , so ( [ h 1 ] [ h 2 ] ) P E + . This means that [ h 1 ] and [ h 2 ] are incomparable with respect to the partial order induced by P E + .
We illustrate in Figure 3 below the graph associated to the strict partial order induced by P on R ( X ) .
The nodes situated above the central node labelled by 0 correspond to elements of P. The nodes below correspond to elements of P . Each level of this graph, which is above the central node labelled by 0, corresponds to an integer k. For instance, the level of the node labelled by 1 consists of all the nodes situated on the left and on the right of the node labelled by 1 and corresponds to the integer k = 0 . The levels below this level correspond to positive integers k > 0 and the levels above to negative integers k < 0 . Similarly, each level below the central node labelled by 0 correspond to an integer. There are no edges between any two nodes of the same level, as they are incomparable. If two nodes are in different levels, then they are connected in the upwards direction.

6. Further Research

In this paper, we have studied the notion of the positive cone in hyperfields. We have investigated the (directed) graph associated to the strict partial order induced by a positive cone in a hyperfield in some examples. What we have observed suggests a particular structure of this graph (that of a linear order and that of a star, as in Example 15, or a combination of these two, as in Example 18).
Moreover, we have considered the characteristic and the C-characteristic of hyperfields, and we have demonstrated how these interact to produce interesting results in the theory of hyperfields. In particular, we have obtained Theorem 6, which gives a criterion for deciding whether a given finite hyperfield cannot be obtained via Krasner’s quotient construction.
We have demonstrated that any positive integer larger than 1 can be realized as the characteristic of an infinite hyperfield (Theorem 3). We ask if it is possible to realize any characteristic with finite hyperfields as well. To try to answer this question, we have initially focused on the finite hyperfields of the form ( F p ) G and developed an algorithm to compute their characteristic. At this point, we can provide the data in Table 1 below.
The characteristic of a hyperfield of the form ( F p ) G depends on p and on the multiplicative subgroup G of F p × . Since G is a cyclic group, we conclude that char ( F p ) G depends on the prime number p and on the choice of a divisor d of p 1 . This means that the number N of possible hyperfields increases very fast with p. For example, in the case of characteristic 12, before finding the hyperfield ( F 62323 ) 28216 , the algorithm would a priori have to generate and check the hyperfields corresponding to 6262 prime numbers, which gives a total of N = 449,569 possibilities. Nevertheless, we can use Proposition 7 to substantially reduce the number of cases to be considered.
For example, if we are looking for a hyperfield of characteristic 12, then we would assume that char ( F p ) G = 12 , which by Proposition 7 cannot hold if | G | is divisible by some prime number < 12 . Hence, we can restrict our attention to those prime numbers p, such that p 1 is divisible at least by one prime number 13 . Moreover, for these primes p, we can restrict our choice of the divisor of p 1 to those d, which are not divisible by primes < 12 . These restrictions reduce the number of hyperfields to be checked by the algorithm to 9871, which is approximately 2.19% of N.
Remark 10.
We know that char ( F p ) G 14 for all prime numbers p 160,000.
An analogous problem can be posed for the realization of C-characteristics, as Theorem 5 provides only infinite hyperfields. For the hyperfields of the form ( F p ) G , our algorithm provided the data in Table 2 below.
Remark 11.
We know that C-char ( F p ) G 12 for all prime numbers is p 152897 .
Our algorithm does not consider hyperfields of the form ( F p k ) G with k > 1 .
Another natural question is if it is possible to somehow generalise Example 4 to construct finite real hyperfields of cardinality > 7 with C-characteristic > 1 , thus providing further examples of non-quotient hyperfields.

Author Contributions

Conceptualization, D.E.K., A.L. and H.S.; methodology, D.E.K., A.L. and H.S.; investigation, D.E.K., A.L. and H.S.; writing—original draft preparation, D.E.K., A.L. and H.S.; writing—review and editing, D.E.K., A.L. and H.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to express their gratitude to Franz-Viktor and Katarzyna Kuhlmann and to the anonymous referees for their suggestions and remarks which helped to improve the paper significantly. Many thanks also to Irina Cristea for encouraging us to write this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Krasner, M. Approximation des corps valués complets de caractéristique p ≠ 0 par ceux de caractéristique 0. In Colloque D’algèbre Supérieure, tenu à Bruxelles du 19 au 22 Décembre 1956; Centre Belge de Recherches Mathématiques, Établissements Ceuterick: Louvain, Belgium; Librairie Gauthier-Villars: Paris, France, 1957; pp. 129–206. [Google Scholar]
  2. Viro, O. Hyperfields for Tropical Geometry I. Hyperfields and dequantization. arXiv 2010, arXiv:1006.3034. [Google Scholar]
  3. Lee, J. Hyperfields, truncated DVRs, and valued fields. J. Number Theory 2020, 212, 40–71. [Google Scholar] [CrossRef]
  4. Connes, A.; Consani, C. From monoids to hyperstructures: In search of an absolute arithmetic. In Casimir Force, Casimir Operators and the Riemann Hypothesis; Walter de Gruyter: Berlin, Germany, 2010; pp. 147–198. [Google Scholar]
  5. Connes, A.; Consani, C. The hyperring of adèle classes. J. Number Theory 2011, 131, 159–194. [Google Scholar] [CrossRef]
  6. Marshall, M. Real reduced multirings and multifields. J. Pure Appl. Algebra 2006, 205, 452–468. [Google Scholar] [CrossRef]
  7. Lam, T.Y. Orderings, valuations and quadratic forms. In CBMS Regional Conference Series in Mathematics; American Mathematical Society: Providence, RI, USA, 1983; Volume 52, pp. vii+143. [Google Scholar] [CrossRef]
  8. Gładki, P.; Marshall, M. Orderings and signatures of higher level on multirings and hyperfields. J. K-Theory 2012, 10, 489–518. [Google Scholar] [CrossRef]
  9. Kuhlmann, K.; Linzi, A.; Stojałowska, H. Orderings and valuations in hyperfields. J. Algebra 2022, 611, 399–421. [Google Scholar] [CrossRef]
  10. Jun, J. Algebraic geometry over hyperrings. Adv. Math. 2018, 323, 142–192. [Google Scholar] [CrossRef]
  11. Krasner, M. A class of hyperrings and hyperfields. Internat. J. Math. Math. Sci. 1983, 6, 307–311. [Google Scholar] [CrossRef]
  12. Massouros, C.G. Methods of constructing hyperfields. Internat. J. Math. Math. Sci. 1985, 8, 725–728. [Google Scholar] [CrossRef]
  13. Marty, F. Sur une généralization de la notion de groupe. In Proceedings of the Huitiéme Congrès des Mathématiciens Scand, Stockholm, Sweden, 14–18 August 1934; pp. 45–49. [Google Scholar]
  14. Marty, F. Rôle de la notion de hypergroupe dans l’étude de groupes non abéliens. C. R. Acad. Sci. 1935, 201, 636–638. [Google Scholar]
  15. Marty, F. Sur les groupes et hypergroupes attaches à une fraction rationnelle. Ann. Sci. École Norm. Sup. 1936, 53, 83–123. [Google Scholar] [CrossRef] [Green Version]
  16. Massouros, C.; Massouros, G. An Overview of the Foundations of the Hypergroup Theory. Mathematics 2021, 9, 1014. [Google Scholar] [CrossRef]
  17. Linzi, A.; Cristea, I. Dependence Relations and Grade Fuzzy Set. Symmetry 2023, 15, 311. [Google Scholar] [CrossRef]
  18. Corsini, P.; Leoreanu, V. Applications of Hyperstructure Theory; Advances in Mathematics (Dordrecht); Kluwer Academic Publishers: Dordrecht, The Netherlands, 2003; Volume 5, pp. xii+322. [Google Scholar] [CrossRef]
  19. Tolliver, J. An equivalence between two approaches to limits of local fields. J. Number Theory 2016, 166, 473–492. [Google Scholar] [CrossRef]
  20. Mittas, J. Sur les hyperanneaux et les hypercorps. Math. Balkanica 1973, 3, 368–382. [Google Scholar]
  21. Massouros, C.G. On the theory of hyperrings and hyperfields. Algebra i Logika 1985, 24, 728–742, 749. [Google Scholar] [CrossRef]
  22. Baker, M.; Jin, T. On the structure of hyperfields obtained as quotients of fields. Proc. Am. Math. Soc. 2021, 149, 63–70. [Google Scholar] [CrossRef]
  23. Bergelson, V.; Shapiro, D.B. Multiplicative subgroups of finite index in a ring. Proc. Am. Math. Soc. 1992, 116, 885–896. [Google Scholar] [CrossRef]
  24. Turnwald, G. Multiplicative subgroups of finite index in a division ring. Proc. Am. Math. Soc. 1994, 120, 377–381. [Google Scholar] [CrossRef]
  25. Massouros, G.; Massouros, C. Hypercompositional Algebra, Computer Science and Geometry. Mathematics 2020, 8, 1338. [Google Scholar] [CrossRef]
  26. Ameri, R.; Eyvazi, M.; Hoskova-Mayerova, S. Advanced results in enumeration of hyperfields. AIMS Math. 2020, 5, 6552–6579. [Google Scholar] [CrossRef]
  27. Prestel, A.; Delzell, C.N. Mathematical Logic and Model Theory; A Brief Introduction, Expanded Translation of the 1986 German; Universitext; Springer: London, UK, 2011; pp. x+193. [Google Scholar] [CrossRef]
  28. Krasner, M. Sur la primitivité des corps P-adiques. Mathematika 1937, 13, 72–191. [Google Scholar]
  29. Engler, A.J.; Prestel, A. Valued Fields; Springer Monographs in Mathematics; Springer: Berlin, Germany, 2005; pp. x+205. [Google Scholar]
  30. Bowler, N.; Su, T. Classification of doubly distributive skew hyperfields and stringent hypergroups. J. Algebra 2021, 574, 669–698. [Google Scholar] [CrossRef]
Figure 1. The directed graph associated to a strict linear order.
Figure 1. The directed graph associated to a strict linear order.
Mathematics 11 00779 g001
Figure 2. The directed graph associated to the strict partial order induced by the positive cone described in Example 15.
Figure 2. The directed graph associated to the strict partial order induced by the positive cone described in Example 15.
Mathematics 11 00779 g002
Figure 3. The graph associated to the strict partial order induced by P on R ( X ) .
Figure 3. The graph associated to the strict partial order induced by P on R ( X ) .
Mathematics 11 00779 g003
Table 1. Finite hyperfields of non-prime characteristic 12 .
Table 1. Finite hyperfields of non-prime characteristic 12 .
char ( F p ) G pG | G |
429 16 7
6199 125 11
82179 2118 11
92707 1085 11
107151 5825 11
1262,323〈28,216〉13
Table 2. Finite hyperfields of non-prime C-characteristic 10 .
Table 2. Finite hyperfields of non-prime C-characteristic 10 .
C-char ( F p ) G pG | G |
4151 59 5
6953 879 7
815137 11803 11
926951 1202 11
1044221 31076 11
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.

Share and Cite

MDPI and ACS Style

Kędzierski, D.E.; Linzi, A.; Stojałowska, H. Characteristic, C-Characteristic and Positive Cones in Hyperfields. Mathematics 2023, 11, 779. https://doi.org/10.3390/math11030779

AMA Style

Kędzierski DE, Linzi A, Stojałowska H. Characteristic, C-Characteristic and Positive Cones in Hyperfields. Mathematics. 2023; 11(3):779. https://doi.org/10.3390/math11030779

Chicago/Turabian Style

Kędzierski, Dawid Edmund, Alessandro Linzi, and Hanna Stojałowska. 2023. "Characteristic, C-Characteristic and Positive Cones in Hyperfields" Mathematics 11, no. 3: 779. https://doi.org/10.3390/math11030779

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop