---
title: Double Extension Method in AS Regular Algebras
url: https://www.emergentmind.com/topics/double-extension-method
type: topic
---

# Double Extension Method in AS Regular Algebras

The double extension method, in the setting of 4-generator Artin–Schelter regular algebras of type \((14641)\), is the structural framework that presents an algebra as a double Ore extension \(R_P[y_1,y_2;\sigma,\delta,\tau]\) of a 2-dimensional Artin–Schelter regular algebra \(R\), furnishes a PBW basis, and makes explicit center computations possible [2601.18928]. In this role it links the Zhang–Zhang classification of regular algebras to family-by-family rewriting, commutation, and centrality calculations, and it yields concrete centers, explicit central subalgebras, and applications to the Zariski cancellation problem.

## 1. Definition and basic data

In the corrected Zhang–Zhang sense used in the center-computation literature, let \(R\) be a subalgebra of a \(\Bbbk\)-algebra \(B\). A **right double extension** of \(R\) is an algebra generated by \(R\) and two new variables \(y_1,y_2\) such that \(B\) is generated by \(R,y_1,y_2\); the new generators satisfy
\[
y_2y_1=p_{12}y_1y_2+p_{11}y_1^2+\tau_1y_1+\tau_2y_2+\tau_0,
\]
where \(p_{12},p_{11}\in\Bbbk\) and \(\tau_i\in R\); \(B\) is free as a left \(R\)-module with basis
\[
\{y_1^i y_2^j\mid i,j\ge 0\};
\]
and the mixed products are controlled by a matrix homomorphism \(\sigma\) and a \(\sigma\)-derivation \(\delta\) through
\[
\begin{bmatrix}y_1 & y_2\end{bmatrix}r
=
\sigma(r)\begin{bmatrix}y_1 & y_2\end{bmatrix}
+\delta(r),
\qquad r\in R.
\]
If, in addition, \(p_{12}\neq 0\), \(B\) is free as a right \(R\)-module with basis \(\{y_2^iy_1^j\}\), and the left/right \(R\)-spans match, then it is called simply a **double extension** [2601.18928].

The package
\[
\{P,\sigma,\delta,\tau\},\qquad P=(p_{12},p_{11}),
\]
is the **DE-data**, with \(P\) the parameter and \(\tau\) the tail. A particularly important special case is the **trimmed** double extension, where
\[
\delta=0,\qquad \tau=0.
\]
This trimmed case is central in the analysis of regular algebras of type \((14641)\), because many classified examples admit presentations of this form.

## 2. Type \((14641)\) and the classification framework

The type \((14641)\) designation refers to connected graded Artin–Schelter regular algebras of global dimension \(4\) with four degree-one generators whose minimal resolution has Betti numbers
\[
0\to B(-4)\to B(-3)^{\oplus 4}\to B(-2)^{\oplus 6}\to B(-1)^{\oplus 4}\to B\to \Bbbk\to 0.
\]
The numerical pattern \((1,4,6,4,1)\) is therefore the homological signature of the class under study [2601.18928].

Zhang and Zhang showed that many such algebras arise as double extensions \(R_P[y_1,y_2;\sigma,\delta,\tau]\) where \(R\) is a 2-dimensional Artin–Schelter regular algebra. When \(R\) is 2-dimensional regular, the double extension is itself strongly Noetherian, Auslander regular, Cohen–Macaulay, a domain, and Koszul. Within this framework, the classification used in the center paper consists of **26 families** \(\mathbb A,\dots,\mathbb Z\), and a key structural point is that many algebras of type \((14641)\) can be presented as trimmed double extensions [2601.18928].

This classification-theoretic role is what makes the method more than a presentation device. It provides a uniform language for moving from the homological classification of regular algebras to explicit structural invariants such as the center.

## 3. Presentation, System C, and relation to iterated Ore extensions

For double extensions over
\[
R=\Bbbk_Q[x_1,x_2],
\]
the defining relations are written in the form
\[
x_2x_1=q_{11}x_1^2+q_{12}x_1x_2,
\qquad
y_2y_1=p_{11}y_1^2+p_{12}y_1y_2,
\]
together with four mixed relations
\[
\begin{aligned}
y_1x_1 &= a_{1111}x_1y_1+a_{1112}x_2y_1+a_{1211}x_1y_2+a_{1212}x_2y_2,\\
y_1x_2 &= a_{1121}x_1y_1+a_{1122}x_2y_1+a_{1221}x_1y_2+a_{1222}x_2y_2,\\
y_2x_1 &= a_{2111}x_1y_1+a_{2112}x_2y_1+a_{2211}x_1y_2+a_{2212}x_2y_2,\\
y_2x_2 &= a_{2121}x_1y_1+a_{2122}x_2y_1+a_{2221}x_1y_2+a_{2222}x_2y_2.
\end{aligned}
\]
These coefficients are encoded in the matrix \(\Sigma\) [2601.18928].

The structure theorem states that these relations define a right double extension precisely when the **System C** constraints hold,
\[
\text{(C1)}\text{--}\text{(C6)}\qquad\text{and}\qquad \det\Sigma\neq 0.
\]
The system comes from enforcing compatibility of the mixed relations with multiplicativity of \(\sigma\) and with the quadratic relations in \(R\) and among \(y_1,y_2\). In this formulation, \(\det\Sigma\neq 0\) is the algebraic condition ensuring that the extension is genuinely “double,” while the parameters
\[
P=(p_{12},p_{11}),\qquad Q=(q_{12},q_{11})
\]
control whether one has a nontrivial deformation, and whether the algebra is an iterated Ore extension or not [2601.18928].

The framework is broader than iterated Ore extensions. If \(\sigma_{12}=0\), then the double extension can be written as an iterated Ore extension \(R[y_1;\sigma_1,d_1][y_2;\sigma_2,d_2]\); similarly, if \(\sigma_{21}=0\) and \(p_{11}=0\), one can present it in the opposite order. The double extension method is therefore a genuine enlargement of the iterated Ore extension formalism rather than a reformulation of it.

## 4. Computational realization: PBW, Gröbner–Shirshov, and SageMath

The computational force of the method lies in the PBW control it imposes. In the center computations, the procedure is to start from a known double extension family from Zhang–Zhang, put the algebra into PBW form using the ordering
\[
x_1 < x_2 < y_1 < y_2,
\]
compute rewriting rules and normal forms, derive commutation formulas for powers of generators, and use those formulas to identify central elements and central subalgebras. The paper derives general recursions for
\[
y_sx_t^n,\qquad y_s^n x_t,
\]
and analogous formulas for powers of \(x_1\) and \(x_2\), which are then specialized family by family [2601.18928].

SageMath is used to automate PBW reduction and commutator computations. The implementation uses a free algebra on \(x_1,x_2,y_1,y_2\), rewriting rules encoding the defining relations, a normal-form routine that repeatedly reduces “bad pairs,” and a commutator routine computing
\[
[u,v]=uv-vu
\]
and reducing the result to PBW form. The center must be computed case by case, and the symbolic expansions in the general parameter-dependent case become very large; SageMath is therefore part of the proof strategy, not merely an expository aid [2601.18928].

A complementary computational approach is provided by the finite Gröbner–Shirshov basis analysis of regular double extension algebras of type \((14641)\). There the algebras are presented as quotient algebras of a free associative algebra, the degree-lexicographic order on \(X^*\) is fixed by
\[
y_1\prec y_2\prec x_1\prec x_2,
\]
and finite GS bases are computed for 12 families,
\[
\mathbb{A},\mathbb{B},\mathbb{D},\mathbb{E},\mathbb{G},\mathbb{K},\mathbb{L},\mathbb{Q},\mathbb{R},\mathbb{V},\mathbb{X},\mathbb{Y}.
\]
By the Composition–Diamond lemma, this yields PBW bases
\[
\operatorname{Irr}(S)=\{y_1^{i_1}y_2^{i_2}x_1^{i_3}x_2^{i_4}\mid i_1,i_2,i_3,i_4\ge 0\},
\]
showing that finite GS bases and PBW normal forms are tightly aligned with the double extension viewpoint [2509.05583].

## 5. Centers, central subalgebras, and cancellation

The main structural payoff of the method is the explicit determination of centers and central subalgebras under parameter restrictions. Representative outcomes are summarized below [2601.18928].

| Family | Parameter regime | Center or central subalgebra |
|---|---|---|
| \(\mathbb A\) | — | \(Z(A)=\Bbbk[x_1]\) |
| \(\mathbb C,\mathbb E,\mathbb F,\mathbb I,\mathbb J,\mathbb S,\mathbb T,\mathbb U\) | — | \(Z(A)=\Bbbk\) |
| \(\mathbb D\) | \(p=\pm1\) | \(Z(A)=\Bbbk[x_1^2,\; y_2^2+p\,y_1^2]\) |
| \(\mathbb G\) | \(p\) not a root of unity | \(Z(A)=\Bbbk\) |
| \(\mathbb G\) | \(p^n=1,\ n\ge 3\) | \(Z(A)=\Bbbk[x_1^n]\) |
| \(\mathbb O\) | \((1-f)^n=1\) | \(\Bbbk[(x_1^2-fx_2^2)^n]\subseteq Z(A)\) |
| \(\mathbb W\) | \((1+f)^n=1\) | \(Z(A)=\Bbbk[(x_1^2+fx_2^2)^n,\,(y_1^2+y_2^2)^n]\) |
| \(\mathbb Z\) | \((1+f)^n=1\) | \(Z(A)=\Bbbk[(x_1^2+x_2^2)^n,\,(y_2^2+fy_1^2)^n]\) |

The general pattern is explicit: when parameters are generic, meaning not roots of unity or avoiding special values like \(0,\pm1,2\), the center collapses to \(\Bbbk\); special parameter values produce larger centers generated by explicit homogeneous invariants. This suggests that the double extension presentation isolates the precise commutation regimes in which nontrivial central generators survive.

The family \(\mathbb D\) is the standard worked example. Under \(p=\pm1\), the defining relations are
\[
x_2x_1=-x_1x_2,\qquad y_2y_1=py_1y_2,
\]
\[
y_1x_1=-p\,x_1y_1,\qquad y_1x_2=-x_2y_1+x_1y_2,
\]
\[
y_2x_1=px_1y_2,\qquad y_2x_2=x_1y_1+x_2y_2.
\]
The proof that
\[
Z(\mathbb D)=\Bbbk[x_1^2,\; y_2^2+p\,y_1^2]
\]
proceeds by direct commutator computation in PBW normal form. The key central candidates are
\[
x_1^2,\qquad z=y_2^2+p\,y_1^2,
\]
and bihomogeneous degree arguments together with a PBW basis calculation show that every central element is a polynomial in these two generators [2601.18928].

The center computations also feed into cancellation theory. The standard notions recalled in the paper are: **cancellative**, \(A[t]\cong B[t]\Rightarrow A\cong B\); **strongly cancellative**, the same statement with several variables; and **universally cancellative**, stability under a broader tensoring condition. A key theorem used there is that if \(Z(A)=\Bbbk\), then \(A\) is universally cancellative. Consequently, every family in the center table with \(Z(A)=\Bbbk\) provides a new universally cancellative example [2601.18928].

## 6. Broader mathematical uses of double extension

The phrase **double extension** is used in several adjacent literatures, but with different formal meanings. In Poisson algebra, a **Poisson double extension** is defined as a Poisson-theoretic analogue of a double Ore extension, and suitable double Ore extensions are shown to be deformation quantizations of Poisson double extensions. In that setting the polynomial ring \(R[y_1,y_2]\) carries a Poisson bracket whose form mirrors the DE-data, and the construction clarifies the relation between double Ore extensions, semiclassical limits, modular derivations, and iterated Poisson polynomial extensions [1606.02410].

In the theory of restricted Lie (super)algebras with a non-degenerate invariant symmetric bilinear form, the double extension method enlarges
\[
a
\quad\text{to}\quad
g=\Bbb K x\oplus a\oplus \Bbb K x^*
\]
by means of a central extension and a derivation. The bracket is modified by a central \(2\)-cocycle, \(x\) is central, and \(x^*\) acts by a derivation \(\mathscr D\). Under the appropriate \(p\)-property, the extension is restricted, and conversely any restricted NIS-(super)algebra with non-trivial center arises as such a \(\mathscr D\)-extension subject to an extra condition on the central element [1810.03086].

A closely parallel construction appears for multiplicative restricted Hom-Lie algebras. There the enlarged algebra is
\[
L=\Bbb F e^*\oplus V\oplus \Bbb F e,
\]
with \(e\) central, \(e^*\) acting by a restricted derivation \(\mathscr D\), and the bracket on \(V\) corrected by the cocycle \(B_V(\mathscr D(x),y)e\). The method preserves restrictedness under a \(p\)-property hypothesis, and every irreducible restricted quadratic Hom-Lie algebra with nonzero center is proved to be the double extension of another restricted quadratic Hom-Lie algebra [2401.08592].

For commutative \(n\)-ary superalgebras with a skew-symmetric invariant form, the method is recast in the derived bracket formalism. The central theorem states that any irreducible but not simple algebra is isomorphic to a generalized double extension, and hence such algebras can be built inductively by orthogonal sums and generalized double extensions [1611.09412]. In flat pseudo-Riemannian \(F\)-Lie algebras, an analogous extension
\[
\mathfrak g=\mathbb R a\oplus B\oplus \mathbb R d
\]
is reconstructed from a smaller algebra \(B\) using cocycles \(u,v\), a derivation \(D\), and parameters \(a_0,b_0,\mu,\lambda,\beta\), yielding generation theorems in the Lorentzian and \((2,n-2)\)-signature settings [2405.02130].

Across these settings, the common feature is not a single universal definition, but a recurrent structural pattern: an algebra is enlarged in two coupled directions, and the enlarged presentation becomes the mechanism for classification, normal-form control, or the computation of structural invariants.

Source: https://www.emergentmind.com/topics/double-extension-method