Reducing the axioms of hypergroups, hyperfields, hypermomules and related structures. A new axiomatic basis for hypercompositional structures

This paper demonstrates that the axioms defining various hypercompositional structures, such as hypergroups and hyperfields, are not independent, and consequently proposes new, minimized definitions that reduce the necessary set of axioms.

The Gist

Imagine you are an architect designing a new type of building. For decades, architects have been using a specific blueprint that includes a massive, heavy steel beam in the foundation. Everyone agrees it's necessary, so they keep putting it in every single design.

But one day, a new architect (Christos Massouros) looks at the blueprint and says, "Wait a minute. If we look closely at how the walls and the roof are built, the steel beam is actually holding itself up! We don't need to bolt it in separately. In fact, if we remove the instruction to add that beam, the building still stands perfectly strong, and it's actually safer because we've removed a redundant piece."

That is essentially what this paper does, but instead of buildings, it's about mathematical structures called "Hypercompositional Structures."

Here is the breakdown of the paper's main ideas using simple analogies:

1. The Problem: Too Many Rules

In mathematics, we define things (like groups, rings, or fields) using a list of rules called axioms. Think of these axioms as the "rules of the game."

• Hypergroups, Hyperfields, and Hypermodules are complex versions of standard math objects.
• For a long time, mathematicians defined these structures with a list of 3 or 4 rules.
• The author discovered that some of these rules were redundant. They were like telling a driver: "1. Drive on the right side of the road. 2. Don't drive on the left side." Rule #2 is already implied by Rule #1. You don't need to write it down twice.

2. The Big Discovery: "The Empty Set" Mystery

The most significant finding in the paper concerns a rule that says: "The result of combining two things must never be empty."

• The Old Way: In standard definitions, mathematicians had to explicitly state: "When you combine element A and element B, you must get a result that isn't nothing (the empty set)." They treated this as a fundamental rule you had to memorize.
• The New Way: Massouros proves that if you have the other rules (like Associativity—how you group things—and Reproductivity—how you can reach every part of the set), the "non-empty" result happens automatically.
• The Analogy: Imagine a vending machine. The old rule was: "Rule 1: You must get a snack. Rule 2: The machine must be connected to a power source." The new proof shows that if the machine is connected to the power source and the gears are turning (the other rules), it is impossible for the machine to produce nothing. Therefore, you don't need to write "You must get a snack" as a separate rule; it's a guaranteed consequence of the machine working.

3. Cleaning Up the "Polysymmetrical" Structures

The paper also looks at a specific, fancy type of structure called a Polysymmetrical Hypergroup.

• These structures have a rule called Reversibility. It's like saying, "If you go from A to B, you can always find a way back."
• The author shows that in these specific structures, the ability to "go back" isn't a separate rule you have to enforce. It naturally emerges from the other rules (like having a "neutral" element, similar to zero in addition).
• The Result: They stripped away the "Reversibility" rule from the definition. The structure is still the same, but the definition is now shorter and cleaner.

4. Why Does This Matter? (The "Why Should I Care?" Section)

You might ask, "Why does it matter if we remove one rule from a math definition?"

• Conceptual Clarity: It stops us from confusing "rules" with "results." It helps mathematicians understand exactly what is the cause and what is the effect.
• Computer Science & Algorithms: This is the practical superpower. When you are writing a computer program to generate or check these mathematical structures, you have to check every single rule.
  • Old Way: The computer has to check 5 rules.
  • New Way: The computer only needs to check 3 rules. The other 2 are guaranteed to be true if the first 3 are.
  • The Benefit: This makes the computer run faster and allows researchers to find and classify all possible versions of these structures much more quickly. The paper mentions this helped them successfully map out all "hyperfields" of a certain size (order seven) much more efficiently.

Summary

Christos Massouros is acting like a mathematical minimalist. He is taking complex, heavy definitions of "Hyper-structures" and stripping away the unnecessary weight.

He proves that many of the rules we thought were essential are actually just side effects of the other rules. By removing these redundant rules, he creates a "New Axiomatic Basis"—a leaner, stronger, and more efficient foundation for this branch of mathematics. It's the difference between carrying a heavy backpack full of extra tools you don't need, versus carrying a sleek, essential toolkit that does the exact same job.

Technical Summary

Here is a detailed technical summary of the paper "Reducing the Axioms of Hypergroups, Hyperfields, Hypermodules and Related Structures: A New Axiomatic Basis for Hypercompositional Structures" by Christos G. Massouros.

1. Problem Statement

The paper addresses a foundational issue in Hypercompositional Algebra: the independence of axioms used to define various algebraic structures (hypergroups, hyperfields, hyperrings, hypermodules, etc.).

• The Issue: Many standard definitions in this field include axioms that are not logically independent. Specifically, the requirement that the result of a hypercomposition (the product of two elements) must be a non-empty set is often listed as a separate axiom.
• Historical Context: The paper notes that while F. Marty (1934) introduced hypergroups, the modern definitions are largely attributed to M. Krasner (1937/1939). These definitions typically include three axioms: non-emptiness of the product, associativity, and a reproductive property (or reversibility).
• The Goal: The author aims to prove that the "non-emptiness" axiom and the "reversibility" axiom are derivable from the remaining axioms (associativity and reproductivity/polysymmetry). Consequently, these conditions are redundant and should be removed from the primitive definitions to streamline the axiomatic basis.

2. Methodology

The author employs rigorous algebraic proofs based on set theory and the properties of mappings from Cartesian products to power sets. The methodology involves:

• Logical Derivation: Demonstrating that assuming the negation of the "non-emptiness" condition (i.e., assuming a product is empty) leads to a contradiction (usually that the entire set is empty) when combined with other axioms like associativity and reproductivity.
• Structural Analysis: Examining specific structures (Hypergroups, Polysymmetrical Hypergroups, Hyperfields, Hyperrings, Hypermodules) to identify which axioms imply others.
• Counter-Example Analysis: Investigating why standard ring-theoretic constructions (like the Dorroh extension) fail in the hypercompositional context, highlighting the unique behavior of hyperoperations.

3. Key Contributions and Results

A. Reduction of Axioms in Hypergroups

• Theorem: In a hypergroup defined by associativity and the reproductive axiom ($xH = Hx = H$), the result of the hypercomposition of any two elements is always non-empty.
• Proof Logic: If $xy = \emptyset$, then by associativity and reproductivity, $H = xH = x(yH) = (xy)H = \emptyset H = \emptyset$. This contradicts the definition of a hypergroup as a non-empty set.
• Impact: The definition of a hypergroup (and related structures like semihypergroups, HV-groups, and almost-hypergroups) no longer requires an explicit axiom stating that $ab \neq \emptyset$. This condition is a theorem, not a postulate.

B. Reduction in Multiplicative Hyperrings

• Context: Multiplicative hyperrings have an abelian group under addition and a semihypergroup under multiplication.
• Result: The paper proves that in a multiplicative hyperring, the non-emptiness of the multiplicative product is implied by the distributive laws and the group properties of the additive part.
• Refinement: The definition is simplified by removing the explicit non-emptiness constraint on the multiplicative semihypergroup.

C. Reduction in Polysymmetrical Hypergroups

• Context: These structures (introduced by J. Mittas) include associativity, commutativity, identity, polysymmetry (existence of inverses), and reversibility.
• Result: The axiom of reversibility (if $z \in xy$, then $x \in zy'$ and $y \in z'x$) is shown to be a consequence of the other axioms (associativity, commutativity, identity, and polysymmetry).
• Impact: The definition of M-polysymmetrical hypergroups is reduced from 5 axioms to 4, as reversibility is no longer independent.

D. Reduction in Hyperfields and Hyperrings

• Context: Hyperfields (Krasner's definition) require a canonical hypergroup for addition, which includes a reversibility axiom.
• Result: The paper proves that in a hyperfield, the reversibility axiom is equivalent to the identity $-(x+y) = -x - y$. Since distributivity in a hyperfield implies this identity, reversibility is redundant.
• Impact: The definition of a hyperfield can be simplified by removing the explicit reversibility postulate. The same logic applies to unitary hyperrings.

E. Reduction in Hypermodules and Vector Hyperspaces

• Context: A hypermodule is traditionally defined over a unitary hyperring with an additive structure that is a "canonical hypergroup" (implying reversibility).
• Result: Due to the distributive property of the hyperring, the additive structure of a hypermodule automatically satisfies the conditions of a canonical hypergroup.
• Impact: The requirement that the additive part be a "canonical hypergroup" is redundant; it suffices to require a commutative normal hypergroup with a neutral element and unique inverses. The reversibility property follows automatically.

F. Limitations of Standard Constructions

• The paper demonstrates that the Dorroh extension (a method to embed a ring without identity into one with identity) fails for hyperrings.
• Reason: When extending a hyperring, the induced multiplication becomes a hypercomposition that is not necessarily associative. Thus, the resulting structure is not a hyperring (nor even a superring), indicating that embedding theorems for rings do not directly translate to hypercompositional structures.

4. Significance

• Logical Rigor: The paper clarifies the distinction between postulates (primitive assumptions) and theorems (derived properties). By removing redundant axioms, the foundational definitions of hypercompositional algebra are made more precise.
• Conceptual Clarity: It resolves historical ambiguities regarding the attribution of definitions (e.g., Marty vs. Krasner) and corrects the record on which axioms are truly necessary.
• Computational Applications: The author argues that a minimized axiomatic basis is crucial for computational mathematics. Fewer axioms reduce the computational overhead required for algorithms that construct, classify, and verify finite hypercompositional structures. The paper cites the successful construction of all hyperfields of order seven as a practical application of this streamlined approach.
• Generalization: The results unify the treatment of various structures (hypergroups, hyperrings, hypermodules), showing that the redundancy of the "non-emptiness" and "reversibility" axioms is a universal property of these systems rather than an isolated feature.

Conclusion

Christos G. Massouros successfully demonstrates that the standard definitions of hypergroups, hyperfields, and related structures contain redundant axioms. By proving that the non-emptiness of hyperproducts and the reversibility property are logical consequences of associativity and reproductivity/distributivity, the paper proposes a new, minimal axiomatic basis. This refinement strengthens the theoretical framework of Hypercompositional Algebra and facilitates more efficient algorithmic processing of these structures.