🔢 mathematics

Algebraic $n$ -Valued Monoids on $\mathbb{C}P^1$ , Discriminants and Projective Duality

This paper establishes connections between algebraic $n$ -valued monoids, discriminants, and projective duality by demonstrating how these concepts induce a shift operation on coset monoids, map Fermat curves to specific addition law polynomials, and prove that addition laws derived from cubic curves are polynomial rather than series-based.

Original authors: Victor Buchstaber, Mikhail Kornev

Published 2026-05-07

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Victor Buchstaber, Mikhail Kornev

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are playing with a set of magical, multi-colored marbles. In the normal world, if you put two marbles together, you get exactly one result. But in the world of this paper, the authors are exploring a strange universe where putting two things together doesn't just give you one thing—it gives you a whole bag of possibilities at once.

This paper is about Algebraic n-Valued Monoids. Let's break that down into everyday language:

1. The Magic Bag (n-Valued Groups)

Think of a standard math operation like addition: $2 + 3 = 5$ . That's a "1-valued" operation; one input pair gives one output.

Now, imagine a "2-valued" operation. If you combine 2 and 3, you don't get just 5. You get a bag containing two numbers, say $\{5, 7\}$ . If you combine them again, you get a bag of four numbers, and so on.

The Paper's Claim: The authors are studying these "magic bags" (called n-valued monoids) where the rules of combining things are consistent (associative) and have a "neutral" starting point (like zero in normal math).
The Twist: They aren't just making these up randomly. They are finding that these complex, multi-outcome rules are secretly hiding inside the geometry of curves (specifically, cubic curves like the ones used in elliptic curve cryptography).

2. The Shape-Shifting Curves

The authors use a tool called Projective Duality.

The Analogy: Imagine you have a sculpture (a curve). If you shine a light on it from a specific angle, it casts a shadow. Now, imagine that the "shadow" isn't just a flat shape, but a completely new sculpture that holds the same information but looks totally different.
The Discovery: The paper shows that if you take a specific type of curve (a Fermat curve, which looks like $x^n + y^n = z^n$ ) and cast its "dual shadow," you get a new curve.
The Shift: Here is the magic trick: When you take this new shadow curve and apply a simple flip (a Möbius transformation, which is like turning a map inside out), the new curve describes a smaller version of the magic bag.
- A curve describing a "3-valued" bag (3 outcomes) transforms into a curve describing a "2-valued" bag.
- A "4-valued" bag becomes a "3-valued" bag.
- It's like a mathematical ladder where climbing down one rung simplifies the complexity of the operation.

3. The "Polynomial" vs. "Infinite Series" Surprise

In advanced math, when dealing with complex curves (like elliptic curves), the rules for adding points are usually written as infinite series (like a recipe that goes on forever: $1 + x + x^2 + x^3 + \dots$ ).

The Paper's Claim: The authors discovered that for these specific "n-valued" groups, the rules are much simpler. They are defined by polynomials (finite recipes like $x^2 + 2x + 1$ ).
Why it matters: This is a huge simplification. It means these complex multi-outcome systems are actually governed by neat, finite algebraic formulas, not messy infinite ones.

4. The "Singular" Cases (Cracks in the Mirror)

The paper also looks at what happens when the curves get "broken" or "cracked" (mathematicians call these nodal or cuspidal cases).

The Analogy: Imagine a smooth, perfect circle. Now, pinch it until it has a sharp point or a self-intersection.
The Result: Even when the curve is broken, the "magic bag" rules still work, but they change form. The authors show that these broken curves correspond to specific, well-known mathematical structures (like the Chebyshev polynomials used in engineering and signal processing). They prove that even in these "broken" states, the system remains a valid "monoid" (a system with a neutral element and consistent rules), though it loses the ability to reverse operations (you can't always get back to the start).

5. The "Discriminant" Connection

Finally, the paper connects these shapes to Discriminants.

The Analogy: In algebra, a discriminant is like a "stress test" for an equation. It tells you if the equation has repeated roots (like if a bag of marbles has two identical marbles).
The Discovery: The authors prove that the rules for combining these "n-valued" numbers are exactly the same as the "stress test" (discriminant) of a specific field extension. It's as if the rule for "how to combine these numbers" is secretly the same as the rule for "how these numbers are related to each other."

Summary

In short, this paper is a map connecting three different worlds:

Multi-outcome math: Where $A + B$ gives you a list of answers, not just one.
Geometry: The shapes of curves and their "shadows" (duals).
Algebra: The specific formulas (polynomials) that govern them.

The authors show that if you take a curve, flip it over (duality), and turn it inside out (Möbius transformation), you can step down from a complex "n-outcome" system to a simpler "(n-1)-outcome" system. They also prove that these systems are governed by clean, finite formulas, making them much easier to understand than their single-outcome cousins on complex curves.

Technical Summary: Algebraic n-Valued Monoids on CP1, Discriminants and Projective Duality

Problem Statement

The paper addresses the structural relationship between the theory of algebraic $n$ -valued monoids and groups on the complex projective line $\mathbb{CP}^1$ and the theories of discriminants and projective duality. While previous works (e.g., [BGR26], [GRS26]) established connections between $n$ -valued group addition laws and discriminants, this work aims to systematically develop these connections using algebro-geometric methods, specifically avoiding the theory of elliptic functions. The authors seek to classify $n$ -valued coset structures derived from cubic curves, describe the behavior of these structures under projective duality, and elucidate the role of discriminants in defining the addition laws.

Methodology

The authors employ a combination of algebraic geometry, the theory of symmetric functions, and the theory of field extensions. Key methodological components include:

Coset Constructions: The primary construction involves taking a 1-valued algebraic monoid or group $M$ (often derived from the points of a cubic curve) and a finite subgroup $H$ of its automorphism group $\text{Aut}(M)$ . The resulting $n$ -valued structure is defined on the orbit space $M/H$ .
Algebraic Computation: Explicit polynomials defining the multiplication laws are derived using computer algebra systems (e.g., Wolfram Mathematica) and Vieta's formulas. This allows for the handling of high-degree symmetric polynomials without relying on elliptic function theory.
Projective Duality: The paper utilizes the theory of projective duality for hypersurfaces (referencing [GKZ94]) to map curves defined by addition laws to their duals. This involves analyzing the discriminants of polynomials and the geometry of the resulting dual varieties.
Field Extension Theory: The discriminants of the addition polynomials are interpreted as discriminants of specific field extensions, linking the algebraic structure of the monoids to classical number-theoretic invariants.

Key Contributions and Results

1. Classification of Coset $n$ -Valued Structures on $\mathbb{CP}^1$

The paper provides explicit polynomial descriptions for $n$ -valued addition laws derived from elliptic curves and singular cubics for $n = 2, 3, 4, 6$ .

Nonsingular Cubics:
- $n=2$ : The universal 2-valued group law $G_{\mathbb{CP}^1}(B_a)$ is shown to be a coset group $E\langle \sigma \rangle$ derived from an elliptic curve $E$ and the involution $\sigma: (\zeta, \eta) \mapsto (\zeta, -\eta)$ . The isomorphism class is determined by the $j$ -invariant of $E$ .
- $n=3, 4, 6$ : The paper constructs commutative, regular, involutive $n$ -valued coset groups $G_{3,c}(\mathbb{CP}^1)$ , $G_{4,b}(\mathbb{CP}^1)$ , and $G_{6,c}(\mathbb{CP}^1)$ corresponding to equianharmonic ( $j=0$ ) and harmonic ( $j=1728$ ) elliptic curves. The multiplication laws are given by explicit symmetric polynomials $p_{n,c}$ and $p_{4,b}$ .
Singular Cubics:
- Nodal Case: The coset group associated with a nodal cubic degenerates to a coset monoid $M_{\text{node}}(\mathbb{CP}^1)$ .
- Cuspidal Case: In the limit of singular parameters, the groups $G_{n}(\mathbb{CP}^1)$ for $n=2, 3, 4, 6$ degenerate to coset monoids $M_n(\mathbb{CP}^1)$ . Notably, the point $\infty$ becomes an absorbing element ( $\infty * x = [\infty, \dots, \infty]$ ), and the structure is no longer a group.

2. Projective Duality and Shift Operations

A central result is the identification of a "shift operation" within the family of algebraic $n$ -valued monoids $\{M_n(\mathbb{CP}^1)\}_{n \in \mathbb{N}}$ .

Duality Mapping: The curve $X_n = \{p_n(z; x, y) = 0\} \subset \mathbb{CP}^2$ , which encodes the $n$ -valued addition law, is mapped via projective duality to a curve $X_n^\vee$ .
Shift Mechanism: The composition of the projective duality $X_n \mapsto X_n^\vee$ followed by a Möbius transformation $(u, v, w) \mapsto (1/u, 1/v, 1/w)$ defines a shift operation $M_n(\mathbb{CP}^1) \mapsto M_{n-1}(\mathbb{CP}^1)$ .
Fermat Curves: Theorem 8 establishes that the projective dual of the Fermat curve $x^n + y^n = z^n$ is the curve defined by $p_{n-1}(z^n; x^n, y^n) = 0$ . This provides a concrete realization of the dual hypersurface as a polynomial equation.

3. Discriminants and Iterating Elements

Discriminant Properties: The paper demonstrates that the discriminant of the addition polynomial $P(z; x, y)$ carries structural information. For $n=2$ , the discriminant separates variables, a property that fails for $n \ge 3$ .
Iterating Elements: An element $w$ $w$ is "iterating" (or "doubling" for $n=2$ $n = 2$ ) if the multiset $w * m$ $w * m$ contains points of multiplicity $\ge 2$ $\geq 2$ . The paper classifies these elements for the constructed groups:
- For $n=2$ , the doubling points form a group isomorphic to the Klein four-group $\mathbb{Z}/2 \times \mathbb{Z}/2$ .
- For $n=3$ , the iterating elements form a diagonal construction of $\mathbb{Z}/3$ .
- For $n=4$ , they form a structure isomorphic to $\text{diag}_2((\mathbb{Z}/4)/\sigma)$ .
- For $n=6$ , the iterating elements do not form a subgroup.

4. Connection to Field Extensions

Proposition 15 establishes that the polynomial $p_n(z; x, y)$ is the minimal polynomial of the element $\theta = (\sqrt[n]{x} + \sqrt[n]{y})^n$ over the field $\mathbb{Q}(x, y)$ . Consequently, the discriminant of $p_n$ with respect to $z$ coincides with the discriminant of the field extension $\mathbb{Q}(x, y) \subset \mathbb{Q}(\theta)$ .

Significance and Claims

The authors claim several specific contributions to the field:

Polynomial vs. Series: Unlike addition laws on general cubic curves in the Weierstrass model, which are given by formal series (as noted in [BB11]), the $n$ -valued laws corresponding to elliptic curves derived via coset constructions are explicitly given by polynomials.
Algebro-Geometric Approach: The work provides a new proof for the classification of 2-valued groups on $\mathbb{CP}^1$ (previously obtained in [BGR26] using elliptic functions) using purely algebro-geometric methods and computer algebra.
Unification of Duality and Monoids: The paper clarifies the relationship between discriminants and projective duality (referencing [GKZ94]), showing how duality induces a shift in the index of $n$ -valued monoids.
Explicit Realization: The paper provides explicit polynomial equations for the duals of Fermat hypersurfaces, resolving the issue of representing these duals via irrational equations with polynomial ones.

The paper concludes by noting that while a full classification of $n$ -algebraic $n$ -valued groups is known for $n=3$ ([BK25]), no complete classification exists for $n > 3$ , and the results presented here serve as a foundational step in understanding these structures through the lens of discriminants and duality.