Artinian Gorenstein Algebra Isomorphism

• Artinian Gorenstein algebras are finite-dimensional, commutative local algebras characterized by a one-dimensional socle, underpinning their duality properties.
• The hypersurface criterion leverages nil-polynomials to establish affine equivalence, providing an efficient invariant for determining algebra isomorphism.
• Macaulay inverse systems, symmetric decompositions, and group-orbit methods work in tandem to offer robust computational tools for classifying these algebras.

An Artinian Gorenstein algebra is a commutative, associative local algebra over a field (characteristic zero or sufficiently large) with a unique maximal ideal and having finite dimension greater than one. The defining property is that the socle (annihilator of the maximal ideal) is one-dimensional, equivalent to the non-degeneracy of the trace pairing. Recent advances have yielded explicit, computable criteria for algebra isomorphism, grounded in the geometry of associated algebraic hypersurfaces and the structure of Macaulay inverse systems. These geometric and duality-based characterizations connect deep properties of such algebras to group actions, canonical forms, and stratifications, providing practical invariants and algorithms for classification.

1. Definitions and Fundamental Properties

Let $A$ be a local, commutative, Artinian $k$-algebra ($\dim_k A > 1$), with maximal ideal $\mathfrak m$. The socle is $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$, and $A$ is Gorenstein if $\dim_k \Soc(A) = 1$. For socle degree $v$ (the maximal $p$ with $\mathfrak m^p \ne 0$), $k$0. The non-degeneracy condition is equivalently that any $k$1-linear projection $k$2 yields a non-degenerate bilinear form via $k$3 (Isaev, 2012, Isaev, 2015).

2. Hypersurface Criterion for Isomorphism

To each such $k$4 and admissible linear projection $k$5 (with $k$6), construct $k$7 so that $k$8. The nil-polynomial

$k$9

defines an algebraic hypersurface $\dim_k A > 1$0. The main result is: $\dim_k A > 1$1 if and only if $\dim_k A > 1$2 and $\dim_k A > 1$3 are affinely equivalent via some affine bijection $\dim_k A > 1$4; moreover, if the map is linear, it is already an algebra isomorphism (Isaev, 2012, Isaev, 2015). Necessity follows since any isomorphism induces affine equivalence by translation; sufficiency proceeds via block-diagonal reduction and compatibility of the polynomial components on $\dim_k A > 1$5 and $\dim_k A > 1$6.

3. Macaulay Inverse Systems and Duality

An Artinian Gorenstein algebra $\dim_k A > 1$7 with embedding dimension $\dim_k A > 1$8 may be represented as $\dim_k A > 1$9, with an associated Macaulay inverse system—a degree-$\mathfrak m$0 polynomial $\mathfrak m$1 such that $\mathfrak m$2. The nil-polynomial $\mathfrak m$3 restricted to suitable subspaces recovers precisely the inverse system: for a complement $\mathfrak m$4 to $\mathfrak m$5 inside a hyperplane in $\mathfrak m$6, the restriction $\mathfrak m$7 gives $\mathfrak m$8 (Isaev, 2012, Isaev, 2015). The affine-hypersurface criterion thus offers a computational alternative to inverse system comparison, as the latter requires checking for equivalence under $\mathfrak m$9.

4. Symmetric Decomposition of the Associated Graded Algebra

For $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$0, the chain of ideals $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$1 gives subquotients $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$2, each a reflexive $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$3-module with a perfect symmetric pairing. The resulting symmetric decomposition of the Hilbert function,

$\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$4

(where $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$5 is the Hilbert function of $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$6) serves as an isomorphism invariant and detects fine structure, such as interior zeroes indicating non-cyclic modules (Iarrobino et al., 2018). The Macaulay dual generator $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$7 admits normal forms such that each degree block $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$8 involves only the least number of variables, aligning variable blocks with the recursive structure of $\Soc(A) = \{ u \in A : u \mathfrak m = 0 \}$9.

5. Group-Orbit Methods, Normal Forms, and Classification Algorithms

The isomorphism problem translates into orbit equivalence under $A$0 acting on the dual $A$1 of $A$2 via $A$3. For generators $A$4, $A$5 in $A$6, $A$7 and $A$8 are isomorphic precisely when $A$9 and $\dim_k \Soc(A) = 1$0 are $\dim_k \Soc(A) = 1$1-equivalent (Jelisiejew, 2015). Explicit formulas for the action involve contraction: $\dim_k \Soc(A) = 1$2 where $\dim_k \Soc(A) = 1$3, and $\dim_k \Soc(A) = 1$4 denotes divided-power monomials. Analyzing tangent spaces of orbits gives a handle on deformation, rigidity, and obstruction theory.

Tests for isomorphism involve reducing generators to normal forms, computing symmetric decompositions, and matching dual generator blocks up to individual $\dim_k \Soc(A) = 1$5 actions per stratification level (Iarrobino et al., 2018). For instance, algebras with Hilbert function $\dim_k \Soc(A) = 1$6 exhibit finitely many isomorphism types, explicitly enumerated, while functions like $\dim_k \Soc(A) = 1$7 yield parametric families indexed by field elements (Jelisiejew, 2015).

6. Applications and Illustrative Examples

The hypersurface criterion allows efficient distinction in families where traditional inverse systems require intricate coordinate changes. For example, the one-parameter family $\dim_k \Soc(A) = 1$8 admits an explicit classification: $\dim_k \Soc(A) = 1$9 if and only if $v$0, computable directly via nil-polynomials and hypersurface equivalence (Isaev, 2012). In nonnegatively graded cases, affine equivalence of hypersurfaces reduces to linear equivalence, further streamlining the process.

Connected sums and non-canonical cases are detected by analyzing the decomposition invariants and dual generator blocks—if, for instance, $v$1 displays a single nonzero entry, the algebra decomposes (after appropriate change of variables) as a connected sum (Iarrobino et al., 2018).

7. Computational Perspective and Classification Schemes

By leveraging the hypersurface, symmetric decomposition, and group-orbit approaches, classification is tractable for small Hilbert function profiles, either finitely or parametrically. The synthesis of methods—coordinate projection, stratification, duality, and group action—has led to effective computational criteria, supplanting purely combinatorial or ad hoc methods in many cases (Isaev, 2012, Isaev, 2015, Iarrobino et al., 2018, Jelisiejew, 2015).

Approach	Main Invariant	Computational Steps
Affine hypersurface	Nil-polynomial $v$2, $v$3	Compute $v$4, test affine eq.
Macaulay inverse system	Polynomial $v$5 in dual variables	Transform $v$6, check $v$7 eq.
Symmetric decomposition	Hilbert function tuples $v$8	Decompose, analyze blocks
Group-orbit method	$v$9-orbit representatives	Apply automorphisms and units

Each framework provides explicit techniques and invariants, with the hypersurface approach often yielding streamlined computations, the inverse system encoding classical Gorenstein duality, and the symmetric decomposition detecting connected sums and non-cyclic phenomena.