The Primordial Algebra: The {-1, 0, 1} Generation and C-Closure Theorem

1. Introduction

The integers $\{-1,0,+1\}$ appear throughout mathematics as a distinguished set: the digits of balanced ternary [5], the truth values of three-valued logic [4], and the eigenvalues of fundamental physical operators [8]. This ubiquity is not coincidental. We demonstrate that this set is not merely useful but necessary—it is the unique finite algebra satisfying the minimal requirements for a self-consistent generative system.

Our approach begins not with numbers but with states: conditions of being that precede quantification. From three primordial states and the demand that their interactions be closed, total, and stable, exactly one algebra emerges, aligning with broader mathematical structures [6,7].

2. The Primordial States

2.1. Before Number

Prior to arithmetic and quantity, there exist three fundamental conditions of being:

Definition 2.1

(Primordial States). The three primordial states are:

1 

${\sigma }_{+}$ (Creation): The condition of arising.

2 

${\sigma }_{-}$ (Destruction): The condition of passing.

3 

${\sigma }_0$ (Potential): The condition of poise, neither arising nor passing.

These are modes of becoming, describing the fundamental relations to existence.

2.2. The Interaction Constraints

When two states interact, a state must result. We impose three constraints:

Axiom 1

(Closure). For any two states ${\sigma }_a,{\sigma }_b$, their interaction produces a state in the set:

$$\forall {\sigma }_a,{\sigma }_b\in \{{\sigma }_{+},{\sigma }_0,{\sigma }_{-}\}:{\sigma }_a\circ {\sigma }_b\in \{{\sigma }_{+},{\sigma }_0,{\sigma }_{-}\}$$

Axiom 2

(Totality). Every interaction is defined, with no undefined combinations.

Axiom 3

(Stability). The system neither collapses to a single state nor proliferates without bound.

Lemma 2.2

(Cancellation is Forced). Under Axioms 1–3, there must exist a pair of distinct non-neutral elements whose interaction yields the neutral state ${\sigma }_0$. Specifically, stability forces

$${\sigma }_{+}\circ {\sigma }_{-}={\sigma }_0.$$

Proof. 

Suppose, for contradiction, that no interaction of two distinct non-neutral states yields ${\sigma }_0$. Consider the possible outputs of ${\sigma }_{+}\circ {\sigma }_{-}$:

Case 1: ${\sigma }_{+}\circ {\sigma }_{-}={\sigma }_{+}$. Then by closure, iterating ${\sigma }_{+}\circ {\sigma }_{+}\circ \dots$ produces unbounded “positive” accumulation, violating stability.

Case 2: ${\sigma }_{+}\circ {\sigma }_{-}={\sigma }_{-}$. By symmetry with Case 1, this leads to unbounded “negative” accumulation.

Case 3: ${\sigma }_{+}\circ {\sigma }_{+}={\sigma }_{+}$ and ${\sigma }_{-}\circ {\sigma }_{-}={\sigma }_{-}$ with ${\sigma }_{+}\circ {\sigma }_{-}\in \{{\sigma }_{+},{\sigma }_{-}\}$. Then the non-neutral states form a closed subsystem excluding ${\sigma }_0$, and iterative self-composition proliferates without returning to neutral—violating stability.

In all cases, the absence of cancellation produces either unbounded growth or permanent exclusion of the neutral state. Therefore, stability requires ${\sigma }_{+}\circ {\sigma }_{-}={\sigma }_0$. □

2.3. The Critical Property: Cancellation

The interaction ${\sigma }_{+}\oplus {\sigma }_{-}={\sigma }_0$ is therefore derived, not postulated. Cancellation preserves information conservation (no net gain or loss of “being”) and maintains symmetry under inversion. Lemma 2.2 establishes that any algebra satisfying closure, totality, and stability must exhibit this property.

3. The Emergence of Number

3.1. The Mapping to Algebra

We map states to symbols for manipulation:

$$\begin{array}{cc}\hfill {\sigma }_0& \mapsto 0\hfill \\ \hfill {\sigma }_{+}& \mapsto +1\hfill \\ \hfill {\sigma }_{-}& \mapsto -1\hfill \end{array}$$

This preserves interactions:

• $(+1)+(-1)=0$ (cancellation)
• $(+1)\times (-1)=-1$ (sign rule)
• $0\times x=0$ (absorption)

3.2. The Algebraic Axioms

The primordial constraints translate to algebraic requirements:

Axiom 4

(Additive Identity). S contains $e_0$ such that $\forall x\in S$, $x+e_0=x$. Thus $e_0=0\in S$.

Axiom 5

(Multiplicative Identity). S contains $e_1\ne e_0$ such that $\forall x\in S$, $x·e_1=x$. Thus $e_1=1\in S$.

Axiom 6

(Additive Inverse of Multiplicative Identity). S contains $e_{-1}$ such that $e_1+e_{-1}=e_0$. Thus $e_{-1}=-1\in S$.

Lemma 3.1

(Two Elements are Insufficient). No two-element set satisfies Axioms 4–6.

Proof. 

Any two-element set drawn from $\{-1,0,+1\}$ lacks at least one required element:

• $\{0,1\}$: Missing $-1$; fails Axiom 6 (no additive inverse of 1).
• $\{0,-1\}$: Missing 1; fails Axiom 5 (no multiplicative identity).
• $\{1,-1\}$: Missing 0; fails Axiom 4 (no additive identity).

□

Lemma 3.2

(Four Elements Overdetermine the System). No four-element algebra satisfies Axioms 1–6 while maintaining closure and stability.

Proof. 

Suppose $T=\{0,1,-1,x\}$ with $x\notin \{0,1,-1\}$. By totality, x must interact with all elements of T. Consider the required interactions:

Case 1: If $x+0=x$ (identity), $x·1=x$ (identity), and $x+(-x)=0$ (inverse), then we require $-x\in T$. If $-x=x$, then $x+x=0$, so $2x=0$, implying $x=0$—contradiction. If $-x\ne x$, then $-x\in \{0,1,-1\}$, so $x\in \{0,-1,1\}$—contradiction.

Case 2: If x acts as an absorbing element ($x\circ y=x$ for some operations), then repeated application collapses the algebra toward $\left\{x\right\}$, violating stability.

Case 3: If x interacts to produce only elements of $\{0,1,-1\}$, then x is algebraically redundant—it adds no new structure and can be removed without loss.

No consistent role for a fourth element exists. □

Theorem 3.3

(Uniqueness of the Minimal Set). The unique finite set satisfying Axioms 4–6 is $S=\{-1,0,+1\}$.

Proof. 

Axioms 4–6 require exactly three distinct elements: 0 (additive identity), 1 (multiplicative identity), and $-1$ (additive inverse of 1). Lemma 3.1 excludes smaller sets. Lemma 3.2 excludes larger sets. Therefore $S=\{-1,0,+1\}$ is unique. □

3.3. Self-Regeneration

Definition 3.4

(Self-Regenerating Algebra). A finite algebra A is self-regenerating if every element of A is the output of some binary operation on two distinct elements of A.

Theorem 3.5

(Self-Regeneration of S). $S=\{-1,0,+1\}$ is self-regenerating. No proper subset of S is self-regenerating under addition.

Proof. 

Under addition of distinct pairs:

$$\begin{array}{cc}\hfill (-1)+0& =-1\hfill \\ \hfill (-1)+1& =0\hfill \\ \hfill 0+1& =1\hfill \end{array}$$

Each element is produced exactly once. For $\{0,1\}$: only $0+1=1$ and $0\times 1=0$ are available; 0 is never produced by addition of distinct elements. Similarly, $\{0,-1\}$ fails. Only S regenerates all its elements through distinct-pair operations. □

4. The Completion Sequence

4.1. Non-Closure as Generative Mechanism

S is closed under multiplication but not under addition: $1+1=2\notin S$. This additive non-closure is not a defect but the engine of generation.

4.2. The Extension Chain

Theorem 4.1

(The Completion Sequence). The unique chain of field extensions forced by successive closure demands is:

$$S\to \mathbb{Z}\to \mathbb{Q}\to \mathbb{R}\to \mathbb{C}$$

Proof. 

Each extension addresses a specific non-closure:

• $S\to \mathbb{Z}$: Iterated addition generates all integers.
• $\mathbb{Z}\to \mathbb{Q}$: Demanding multiplicative inverses (division) generates rationals.
• $\mathbb{Q}\to \mathbb{R}$: Demanding metric completeness (Cauchy sequence convergence) generates reals.
• $\mathbb{R}\to \mathbb{C}$: Demanding algebraic closure (roots of all polynomials) forces $i=\sqrt{-1}$.

□

Figure 1. The Completion Sequence.

Figure 1. The Completion Sequence.

4.3. Termination

Theorem 4.2

(Termination at $\mathbb{C}$). The extension sequence halts at $\mathbb{C}$.

Proof. 

By the Fundamental Theorem of Algebra, $\mathbb{C}$ is algebraically closed: every non-constant polynomial with complex coefficients has a root in $\mathbb{C}$. Thus $\overline{\mathbb{C}}=\mathbb{C}$, and no further algebraic extension is required. □

5. The Termination Certificate

Definition 5.1

(Termination Certificate). A termination certificate for the completion sequence is a minimal non-trivial identity in $\mathbb{C}$ that:

¹ 

Connects the algebraic forcing element (i) with the analytic forcing elements (e, π);

2 

Resolves entirely to elements of the generating set S.

Theorem 5.2

(Euler’s Identity as Termination Certificate). The identity

$$e^{i\pi }+1=0$$

is the termination certificate for the completion sequence.

Proof. 

The identity connects:

• e: forced by analytic completeness as ${lim}_{n\to \infty }{(1+1/n)}^n$;
• $\pi$: forced as the period of the complex exponential $e^{ix}$;
• i: forced by algebraic closure as $\sqrt{-1}$.

Resolution to S: We have $e^{i\pi }=-1\in S$, $1\in S$, and thus:

$$e^{i\pi }+1=(-1)+1=0\in S$$

The completed system expresses its fundamental relation using only the primordial alphabet. □

Corollary 5.3

(The Ouroboros Property). The completion sequence begins with S containing 0 and terminates with an identity resolving to 0. The algebra returns to its origin.

6. The Central Theorem

Definition 6.1

(Complete and Generative). A finite algebra A is complete before extension if it contains all required identity and inverse elements. It is generative after extension if its radical closure produces a strictly larger algebraically closed field.

Theorem 6.2

(The Primordial Algebra Theorem). $S=\{-1,0,+1\}$ is the unique finite algebra that is complete before extension and generative after extension.

Proof. Completeness :

S contains 0 (additive identity), 1 (multiplicative identity), and $-1$ (additive inverse of 1, and the unique non-trivial involution satisfying $x^2=1$).

Generativity: Under radical closure:

• $\sqrt{0}=0\in S$ (closed)
• $\sqrt{1}=\pm 1\in S$ (closed)
• $\sqrt{-1}=i\notin \mathbb{R}$ (escapes to $\mathbb{C}$)

Exclusion of alternatives:

• $\{0,1\}$: Closed under radicals ($\sqrt{0}=0$, $\sqrt{1}=1$). Never escapes. Not generative.
• $\{0,-1\}$: Generates i via $\sqrt{-1}$, but then $i^4=1$ forces inclusion of 1. Not complete before extension.

Only S satisfies both properties. □

7. Structural Correspondences

The primordial algebra exhibits isomorphism with several established structures:

• Balanced Ternary: S is the digit set of balanced ternary, the most efficient integer numeral system by radix economy [5].
• Three-Valued Logic: $S\cong \{\mathrm{True},\mathrm{Unknown},\mathrm{False}\}$ in Łukasiewicz and Kleene logics [4].
• Primitive Involution: $-1$ is the unique element $x\in \mathbb{Z}\setminus \left\{1\right\}$ satisfying $x^2=1$, generating all reflection symmetries.
• CPT Symmetry: The ${\sigma }_{+}/{\sigma }_{-}$ opposition corresponds to charge conjugation in quantum field theory; ${\sigma }_0$ corresponds to the vacuum state [8].

8. Conclusion

We have established that:

• Three primordial states and the demand for closure, totality, and stability force a unique algebra (Lemmas 2.2, 3.1, 3.2; Theorem 3.3).
• This algebra is self-regenerating: every element is produced by operations on distinct elements (Theorem 3.5).
• The completion sequence $S\to \mathbb{Z}\to \mathbb{Q}\to \mathbb{R}\to \mathbb{C}$ is forced by successive closure demands and terminates at $\mathbb{C}$ (Theorems 4.1, 4.2).
• Euler’s Identity serves as the termination certificate, resolving the completed system to the primordial alphabet (Theorem 5.2).
• $S=\{-1,0,+1\}$ is the unique algebra that is complete before extension and generative after it (Theorem 6.2).

The primordial algebra is not constructed but derived. From states to numbers to fields to closure, the path is forced at every step.