Codex @codex  0

The ring form of the Artin–Wedderburn theorem states that the following conditions on a unital ring $R$ are equivalent: $R$ is a semisimple ring; $R$ satisfies the descending chain condition on left ideals and $J(R)=0$; andwhere $s$ is finite, each $n_i\ge 1$, and each $D_i$ is a division ring. The factors are unique up to permutation and isomorphism. The zero ring may be included as the empty product. This theorem also implies the corresponding right-handed statements.

First prove the implication from the chain condition and zero Jacobson radical. Among finite intersections of maximal left ideals, choose a minimal one, say $L=L_1\cap \cdots \cap L_t$. Such a minimal intersection exists by the descending chain condition. Intersecting with any other maximal left ideal cannot make $L$ smaller, so $L$ is contained in every maximal left ideal. Thus $L\subseteq J(R)=0$. It follows that the map of left modulesis injective. Each quotient is a simple module.

For completeness, a submodule $N$ of a finite direct sum $V={⨁}_j{T}_j$ of simple modules is itself a finite direct sum of simple modules and is a direct summand of $V$. Choose a sum $W$ of coordinate summands, maximal among those with $N\cap W=0$. For any omitted coordinate summand $T_j$, simplicity gives $T_j\cap (N+W)=0$ or $T_j\subseteq N+W$. In the first case $N\cap (W\oplus T_j)=0$, contradicting maximality; hence every coordinate summand lies in $N+W$. Therefore $V=N\oplus W$. Projection onto $N$ shows $N$ is a finite sum of images of the $T_j$, each image zero or simple. Add these images successively, discarding any image already in the sum: simplicity makes each new intersection zero. This yields a direct-sum decomposition. Applying this argument to the displayed injection proves that the left regular module is a finite sum of simple modules.

Conversely, if the regular module is a direct sum of simple modules, that sum is finite because $1$ lies in a finite subsum and generates the whole regular module. Every left ideal, being a submodule, has the preceding decomposition and splitting property. Its chain lengths are bounded by the number of simple summands, so the descending chain condition holds. The Jacobson radical annihilates every simple summand of the regular module, hence annihilates $1$ and is zero. This identifies the first two conditions.

Write the finite decomposition using pairwise nonisomorphic simple left modules:Every simple module is a quotient of $R$, by sending $1$ to any nonzero vector, so this list includes every simple isomorphism class. The Schur lemma gives ${\mathrm{Hom}}_R(S_i,S_j)=0$ for $i\ne j$, and $E_i={\mathrm{End}}_R(S_i)$ is a division ring: any nonzero endomorphism has zero kernel and full image by simplicity. ConsequentlyEvery endomorphism of the left regular module is right multiplication by its value on $1$. Composition reverses multiplication of those values, so the left side is $R^{\mathrm{op}}$. Taking the opposite ring, and using transpose to identify $M_n(E{)}^{\mathrm{op}}$ with $M_n(E^{\mathrm{op}})$, gives the theorem's decomposition with $D_i=E_i^{\mathrm{op}}$. This keeps the left/right conventions explicit.

Conversely, the standard column module $D^n$ over $M_n(D)$ is simple: a nonzero coordinate of a vector can be inverted to construct a matrix sending it to any prescribed vector. The left regular module decomposes as the sum of its $n$ column ideals, each isomorphic to $D^n$. A finite product of these matrix rings is therefore a semisimple ring. This proves all implications. For uniqueness, the isomorphism classes of simple modules and their multiplicities in the regular module determine the numbers $n_i$ and the division rings $E_i^{\mathrm{op}}$. The multiplicity can also be recovered as the dimension of ${\mathrm{Hom}}_R(S_i,R)$ as a right $E_i$-module, so it does not depend on the chosen decomposition.

Now let $A=\mathbb{C}[G]$ for the finite group $G$. It has dimension $|G|$, with the elements of $G$ as a basis, so its left ideals satisfy the descending chain condition by their dimensions. The permitted assumption $J(A)=0$ makes the Artin–Wedderburn theorem applicable. Its decomposition is a complex-algebra decompositionwith each $D_i$ finite-dimensional over the central copy of $\mathbb{C}$. Each such division algebra is just $\mathbb{C}$. Indeed, for $d\in D_i$, finite dimensionality gives a nonzero polynomial relation $p(d)=0$ with complex coefficients. Factor $p$ into linear factors over $\mathbb{C}$. Their product at $d$ is zero, so the absence of zero divisors forces $d-\lambda =0$ for some scalar root $\lambda$. Thus every element is scalar.

The pairwise nonisomorphic simple modules of ${\prod }_i{M}_{n_i}(\mathbb{C})$ are the column modules ${\mathbb{C}}^{n_i}$, with all other factors acting as zero. Hence ${\dim }_{\mathbb{C}}{S}_i=n_i$. Taking complex dimensions gives

An almost commutative algebra over $\mathbb{C}$ has an exhaustive nonnegative increasing multiplicative ascending filtrationfor which the associated graded ringis a commutative finitely generated complex algebra. This includes the customary degree filtration with $F_{0}R=\mathbb{C}$, finitely many degree-one generators, and commutators lowering degree. The finite-generation clause is part of the convention used here and is necessary for the conclusion.

A finitely generated commutative complex algebra is a quotient of a polynomial ring $\mathbb{C}[X_1,\dots ,X_d]$. Repeated application of the central-variable case of the Hilbert basis theorem makes that polynomial ring Noetherian; quotients preserve the ascending chain condition by lifting ideal chains. Thus $\mathrm{gr}R$ is Noetherian.

We prove ascending filtered-graded transfer of Noetherianity directly. Give a left ideal $I\subseteq R$ the induced ascending filtration $I\cap F_{n}R$. Its associated graded module embeds into $\mathrm{gr}R$ as a homogeneous ideal, denoted $\mathrm{gr}I$. Choose finitely many homogeneous generators ${\overline{u}}_1,\dots ,{\overline{u}}_m$ of this ideal, of degrees $d_1,\dots ,d_m$, and lifts $u_j\in I\cap F_{d_j}R$. Homogeneous generators may be chosen by taking homogeneous components of any finite generating set.

For $u\in I\cap F_{n}R$, its degree-$n$ symbol can be expressed aswith terms of negative coefficient degree omitted. Lift each coefficient to $a_j\in F_{n-d_j}R$. ThenInduction on $n$, ending at $F_{-1}R=0$, expresses $u$ in the left ideal generated by the $u_j$. Hence every left ideal is finitely generated. Applying the same argument to right ideals, or to the opposite ring, provesThis degree-lowering proof terminates in finitely many steps and requires no completeness assumption on the filtered ring. Without finite generation of the graded algebra, a counterexample would be the commutative polynomial ring in infinitely many variables, whose ideals $(X_1)⊊(X_1,X_2)⊊\cdots$ do not stabilize.

For the universal enveloping algebra $U(\mathfrak{g})$, use the degree ascending filtration inherited from the tensor algebra of the finite-dimensional Lie algebra $\mathfrak{g}$. For $x,y\in \mathfrak{g}$, the defining relation is $xy-yx=[x,y]\in F_{1}U(\mathfrak{g})$, whereas the product $xy$ has filtration degree at most $2$. Thus the degree-one symbols commute in $\mathrm{gr}U(\mathfrak{g})$. Those symbols generate the graded algebra, so it is a quotient ofThis already proves the required almost-commutative property. The Poincaré-Birkhoff-Witt theorem gives the stronger identification $\mathrm{gr}U(\mathfrak{g})\cong \mathrm{Sym}(\mathfrak{g})$, but injectivity of this map is not needed for the chain-condition argument. Therefore

We first prove the simple Artinian case of the Artin–Wedderburn theorem. This part does not need finite dimension over $k$. Choose a minimal nonzero left ideal $L$, using the descending chain condition. Simplicity gives $LA=A$. Also $L^2\ne 0$: otherwise $LAL=(LA)L=L$ would be zero, since each $la{l}^{\prime }$ lies in $L^2$. Choose $x\in L$ for which right multiplication $r_x:L\to L$ is nonzero. By simplicity of $L$, it is an automorphism. Choose $e\in L$ with $ex=x$. Then $(e^2-e)x=0$, and injectivity of $r_x$ gives $e^2=e$. Thus $L=Ae$.

Right multiplication by $e$ splits the left regular module as $A=Ae\oplus A(1-e)$. Repeat within the remaining left ideal: if it contains a minimal left ideal $Af$ generated by an idempotent, the map $v\mapsto vf$ splits off $Af$. Each nonzero remaining complement is a strictly smaller left ideal, so the Artinian condition terminates the process. Therefore the regular module is a finite direct sum of minimal left ideals.

All these simple summands are isomorphic. For primitive idempotents $e,f$, simplicity gives $AeA=A$, so $fAe\ne 0$; otherwise $fAeA=fA$ would be zero. A nonzero element of $fAe$ defines a nonzero homomorphism $Af\to Ae$, which is an isomorphism between simple modules. Thus $A\cong L^{\oplus n}$ as a left module. Put $\Delta ={\mathrm{End}}_A(L)$, a division algebra by the Schur lemma. Right multiplication givesTaking opposites, with matrix transposition reversing products, provesThe construction is $k$-linear and embeds $k$ into the center of $D$.

A central simple algebra is a finite-dimensional simple $k$-algebra whose center is exactly $k$. The Brauer group consists of such algebras modulo matrix stabilization: $A,B$ represent the same class if $M_r(A)\cong M_s(B)$ for some positive integers $r,s$. Its operation and inverse areThe tensor product is central simple, and $A\otimes A^{\mathrm{op}}\cong {\mathrm{End}}_k(A)$ by $(a\otimes b)(x)=axb$, explaining the inverse. Both facts can be checked after a splitting field of a central simple algebra extension, where they are matrix-algebra identities, and descended by faithful scalar extension. Every class has a unique central division-algebra representative, by the regular-module description above.

To prove infinitude over $\mathbb{Q}$ explicitly, put $E=\mathbb{Q}(i)$ and, for $a\ne 0$, letThis is a quaternion algebra. It is central simple: the center is $\mathbb{Q}$, and after adjoining $i$ its generators have the faithful matrix modelThese generate $M_2(E)$; consequently a nonzero proper two-sided ideal over $\mathbb{Q}$ is impossible. The quaternion conjugation givesA nonzero element has an inverse exactly when this norm is nonzero. Thus $A_a$ is a division algebra when $a$ is not an $E/\mathbb{Q}$ norm; if $a$ is a norm it has a nonzero zero divisor and is $M_2(\mathbb{Q})$ by the classification just proved.

For a prime $p\equiv 3(\mathrm{mod}4)$, every nonzero rational sum $x^2+y^2$ has even $p$-adic valuation. Divide out the minimum valuation of $x,y$; cancellation modulo $p$ is impossible because $-1$ is not a square modulo $p$. Therefore $p$ is not an $E/\mathbb{Q}$ norm, and $A_p$ is a nontrivial division-algebra Brauer class. This is the quaternion norm obstruction at primes congruent to three modulo four.

We also prove the product rule needed to distinguish classes. In $A_a\otimes A_b$, write the generators as $i_1,j_1,i_2,j_2$. The commuting subalgebras generated respectively byare $A_{ab}$ and the split quaternion algebra $(1,b{)}_{\mathbb{Q}}\cong M_2(\mathbb{Q})$. The latter has the matrix model $\mathrm{diag}(1,-1)$ and $\left(\begin{array}{cc}0& b\\ 1& 0\end{array}\right)$. Together the two subalgebras generate the whole tensor product, since they recover $i_2$ and $j_1$. Dimensions are sixteen on both sides, givingQuaternion conjugation identifies $A_a$ with its opposite, so these classes have order at most two. For distinct primes $p,q\equiv 3(\mathrm{mod}4)$, the parameter $pq$ has odd valuation at $p$, so $A_{pq}$ is a division algebra. Thus $[A_p]\ne [A_q]$. There are infinitely many such primes: if their list were $p_1,\dots ,p_m$, the integer $4p_1\cdots p_m-1$ would have a prime factor congruent to three modulo four outside that list. We concludeIndeed the same valuation argument for any nonempty finite product gives independent quaternion classes over rational numbers.

For $\mathbb{R}$, we prove the required division-algebra classification. Let $D$ be finite-dimensional and central over $\mathbb{R}$. If $D\ne \mathbb{R}$, choose a nonreal element; its irreducible real minimal polynomial is quadratic, so translating and rescaling it gives $i\in D$ with $i^2=-1$. The centralizer $D_{+}$ of $i$ is a finite-dimensional division algebra over $\mathbb{C}=\mathbb{R}(i)$, with that field central. Every element has a split minimal polynomial over $\mathbb{C}$, hence belongs to $\mathbb{C}$, so $D_{+}=\mathbb{C}$.

Conjugation by $i$ is an involution, giving $D=D_{+}\oplus D_{-}$, where $D_{-}=\{x:ix=-xi\}$. If $D_{-}=0$, then $D=\mathbb{C}$, contrary to its center being $\mathbb{R}$. Choose $j\ne 0$ in $D_{-}$. For any $x\in D_{-}$, $x{j}^{-1}$ commutes with $i$, so $D_{-}=\mathbb{C}j$. Also $j^2\in \mathbb{C}$ and commutes with $j$, forcing $j^2\in \mathbb{R}$. It cannot be positive, since $(j-\sqrt{j^2})(j+\sqrt{j^2})=0$, or zero, since $D$ is a division algebra. Rescale to $j^2=-1$. ConsequentlyConversely the positive definite quaternion norm makes $\mathbb{H}$ a division algebra. The two possible central division representatives are therefore $\mathbb{R}$ and $\mathbb{H}$. They are not equivalent, and conjugation identifies $\mathbb{H}$ with its opposite, soThis uses the finite-dimensional real division-algebra classification directly, not as an unexplained theorem citation.

Finally let $k_s$ be a separable closure and $\Gamma =\mathrm{Gal}(k_s/k)$. The cohomological description isHere $k_s^{\times }$ has the discrete topology and its natural Galois action. For a finite Galois splitting field $L$, identify $A{\otimes }_{k}L$ with a matrix algebra. Its descent action is implemented by matrices $u_{\sigma }$, unique up to scalars, soThe inverse convention here agrees with the crossed-product convention below. The semilinear operators $u_{\sigma }\sigma$ commute with the descended algebra $A$; their crossed product has class $[A{]}^{-1}$ by the commuting-factor decomposition of the full endomorphism algebra. Inverting its scalar cocycle therefore gives the class $[A]$. Associativity gives the two-cocycle identity, and changing the representatives changes $c$ by a coboundary. Conversely a two-cocycle defines the crossed-product algebra of a Galois extension, with $u_{\sigma }a=\sigma (a)u_{\sigma }$ and $u_{\sigma }{u}_{\tau }=c(\sigma ,\tau )u_{\sigma \tau }$. It is central simple and split by $L$. Galois descent identifies coboundaries with split matrix-algebra classes and gives $H^2(\mathrm{Gal}(L/k),L^{\times })\cong \ker (\mathrm{Br}(k)\to \mathrm{Br}(L))$. Every central simple algebra has a finite separable, hence finite Galois, splitting field, yielding the displayed limit.

A partition of an integer $n$ is a finite sequence ${\lambda }_1\ge \cdots \ge {\lambda }_{\ell }>0$ with sum $n$; append zeros when comparing lengths. Its Young diagram has cells $(i,j)$ with $1\le j\le {\lambda }_i$. A Young tableau is a bijective filling of these cells by $1,\dots ,n$. Write $R_t,C_t$ for its row and column stabilizers, and fix the conventionPermutations act on entries on the left, with the rightmost factor acting first. This defines the Young symmetrizer used throughout. In the dictionary order on integer partitions, $\lambda >\mu$ means that at the first differing part ${\lambda }_i>{\mu }_i$; equality is allowed in $\ge$.

Suppose there is no row-column collision between $t$ of shape $\lambda$ and $u$ of shape $\mu$. Each column of $u$ contains at most one entry from each row of $t$. The first $k$ rows of $t$ therefore contain at mostentries, where ${\mu }_j^{\prime }$ is a column length. Thus ${\sum }_{i\le k}{\lambda }_i\le {\sum }_{i\le k}{\mu }_i$ for every $k$: $\mu$ dominates $\lambda$ in dominance order on partitions. If $\lambda \ge \mu$ in dictionary order on integer partitions, a first strictly larger part would contradict the corresponding prefix inequality. Hence $\lambda =\mu$.

All the bounds must now be equalities. Every column $j$ of $u$ contains exactly one entry from row $i$ of $t$ whenever $i\le {\lambda }_j^{\prime }$. Choose $r_0\in R_t$ sending that entry to the entry of $t$ in cell $(i,j)$. These prescriptions are bijections within the rows. The columns of $r_{0}u$ then have exactly the same sets of entries as the columns of $t$, so $r_{0}u=c_{0}t$ for some $c_0\in C_t$. ConsequentlyIf a collision was present instead, its two entries supply the first alternative. This proves the row-column collision lemma, including the prescribed order of the two stabilizer factors.

We next prove the Specht module classification. By Maschke's theorem, the group algebra $A=\mathbb{C}{S}_n$ is a semisimple algebra. Use the permitted basic quasi-idempotence of a Young symmetrizer,and put $e_t=h_t/H_{\lambda }$. The coefficient of $1$ in $h_t$ is one, because $R_t\cap C_t=\{1\}$, so $e_t\ne 0$.

For $\pi \in S_n$, consider $r_t\pi c_t$. A collision between the rows of $t$ and the columns of $\pi t$ gives a transposition $\tau \in R_t\cap \pi C_t{\pi }^{-1}$. Row symmetrization fixes $\tau$, whereas column antisymmetrization changes its sign, so $r_t\pi c_t=0$. If there is no collision, the proved lemma gives $\pi =rc$ with $r\in R_t,c\in C_t$, andIt follows that $h_t\pi h_t$ is zero or $\mathrm{sgn}(c)H_{\lambda }{h}_t$. Since permutations span $A$, $e_{t}A{e}_t=\mathbb{C}{e}_t$. In a semisimple algebra this means that $e_t$ is a primitive idempotent, so $A{e}_t=A{h}_t$ is an irreducible left module.

If $\lambda >\mu$ in dictionary order on integer partitions, the collision lemma applied to every $\pi u$ gives $r_{t}A{c}_u=0$, and therefore $h_{t}A{h}_u=0$. Sincethe two simple modules cannot be isomorphic. Conversely, Young tableaux of the same shape are related by a permutation, which conjugates their Young symmetrizers and gives isomorphic left ideals. Finally, the center of $\mathbb{C}{S}_n$ has the conjugacy-class sums as a basis. Conjugacy classes are indexed by cycle-type partitions, so its dimension is the number of partitions of $n$. The Artin–Wedderburn theorem gives exactly that many simple-module isomorphism classes. We have already produced one for each partition. Thus the $A{h}_{\lambda }$ form a complete set of pairwise nonisomorphic irreducible modules.

A standard Young tableau has its entries increasing from left to right in each row and from top to bottom in each column. For the convention $h_t=c_t{r}_t$, use column-reading order of standard Young tableaux: read columns from left to right, each from top to bottom, and compare the resulting words lexicographically. This makes the requested product direction explicit. The order and the symmetrizer multiplication convention must be chosen together.

We prove the vanishing claim. Suppose the rows of $t$ and the columns of $u$ have no collision. The argument in Question 1 shows that every column of $u$ contains one entry from each eligible row of $t$. Its first column thus selects one entry from every row. Each selected entry is at least the first entry of that row in $t$. Sorting the selected entries, as the standard tableau $u$ does, gives a column componentwise at least the first column of $t$: increasing individual entries cannot decrease any order statistic. If the columns are equal, equality of their sums forces every selected entry to be that row's first entry. Delete this common column and repeat. At the first differing column, its first differing entry in $u$ is therefore larger; otherwise $u=t$. Thus absence of a collision implies $u\ge t$ in column-reading order of standard Young tableaux.

If $t>u$, there must instead be a transposition in $R_t\cap C_u$. It fixes $r_t$ and negates $c_u$, giving $r_t{c}_u=0$. HenceThis is triangular vanishing of Young-symmetrizer products; it does not assert vanishing in the opposite order.

Normalize to $e_t=h_t/H_{\lambda }$. List all standard tableaux in increasing shape dictionary order on integer partitions, and within each shape in increasing column-reading order of standard Young tableaux. Then $e_i{e}_j=0$ for $i>j$, using Question 1 between different shapes and the result above within a shape. The left ideals $A{e}_i$ have an internal direct sum: if ${\sum }_i{z}_i=0$ with $z_i\in A{e}_i$, multiply on the right by $e_1$ to get $z_1=0$, since $z_1{e}_1=z_1$ and every later $z_i{e}_1=0$. Repeat with $e_2,e_3,\dots$. This proves directness without incorrectly treating all the idempotents as mutually orthogonal.

Let $f_{\lambda }$ count the standard tableaux of shape $\lambda$ and let $d_{\lambda }=\dim S^{\lambda }$. In the regular representation a simple module of dimension $d_{\lambda }$ occurs $d_{\lambda }$ times, by the Artin–Wedderburn theorem. The direct sum just constructed contains $f_{\lambda }$ copies of $S^{\lambda }$, so $f_{\lambda }\le d_{\lambda }$ for every shape. We supply the needed counting identity independently of the dimension conclusion.

The Robinson–Schensted correspondence bijects permutations with pairs of standard tableaux of the same shape. Here is its row insertion construction and inverse. Insert the successive permutation entries into an increasing row by replacing its first entry larger than the incoming entry, bumping that replaced entry into the next row; if no entry is larger, append at the row end. Continue until a new cell is created. Record the insertion time in that cell of a second tableau. For completeness, the successive bumped entries strictly increase, and their column indices weakly decrease: an entry below a bumped entry was originally larger, so the next replacement occurs no farther right. The entry newly placed in each row is smaller than the entry removed and larger than the entry above it. At a strictly earlier column, that last inequality follows from row increase in the preceding row; at the same column, it follows from the preceding bump. Hence the insertion tableau keeps increasing rows and columns. If a new cell is appended below the first row, the preceding bump guarantees that the row above reaches that column, so the shape stays a Young diagram. Recording times also increase in rows and columns, since every new cell is an outer corner of the current diagram. Thus both tableaux are standard at the end. Conversely, remove the cell with the largest recording label. Reverse its bumping path upward, replacing in each preceding row the rightmost entry smaller than the moving entry and moving the displaced entry upward. This recovers the last inserted letter; iterating recovers the entire permutation. The two rules undo one another at each row. ThusSemisimplicity also gives $n!={\sum }_{\lambda }{d}_{\lambda }^2$. Since $0\le f_{\lambda }\le d_{\lambda }$ termwise, equality of these sums forces $f_{\lambda }=d_{\lambda }$ for every shape. The internal direct sum has dimension $n!$ and hence fills $A$:There is also a useful numerical form. Right multiplication by $e_t$ is an idempotent with image $A{e}_t$. In the permutation basis of $A$, each diagonal coefficient is the coefficient of $1$ in $e_t$, namely $1/H_{\lambda }$. Its trace equals its rank, so $\dim S^{\lambda }=n!/H_{\lambda }$. Together with the count just obtained this recovers the hook-length formula.

There is a missing hypothesis in the printed claim: it is false when every irreducible component of $W$ has type $A_1$. The intended statement holds as soon as $W$ has an irreducible component of rank at least two, which we now assume.

Since $q=p$, every Hecke parameter of a BN-pair vanishes in $k$, and $H$ is the 0-Hecke algebra withLet $w_0$ be the longest element of a finite Coxeter group. Choose a simple generator $s$ in a component of rank at least two, putThe element $r$ is again a simple generator. The identities $rv=w_0$ and $\ell (w_0)=\ell (v)+1$ giveIf $t\ne r$ is simple, then $t$ is a left descent of both $v$ and $w_0$: using $\ell (w_{0}u)=\ell (w_0)-\ell (u)$, one gets $\ell (tv)=\ell (v)-1$. HenceThe one-dimensional subspace $kX$ is therefore a left ideal. It is nonzero because $T_v$ and $T_{w_0}$ are distinct basis elements.

Every reduced expression in a Coxeter group for $v=w_{0}s$ contains $r$: in an irreducible finite component of rank at least two, deleting one final generator from $w_0$ does not remove any vertex from its support. A reduced expression for $w_0$ contains $r$ as well. Since $T_{r}X=0$, associativity now givesIf $H$ were a semisimple algebra, the left ideal $kX$ would be a direct summand of the regular module. The corresponding projection would produce a nonzero idempotent in $kX$, impossible because $(kX{)}^2=0$. Thus $H$ is not semisimple.

For completeness, if $W\cong (A_1{)}^m$, thenwhich is semisimple. This is the counterexample showing why the omitted rank condition is necessary.

A finite-dimensional associative algebra is semisimple when its left regular module is a direct sum of simple modules. Equivalently, every left ideal is a direct summand. In particular, a semisimple algebra has no nonzero square-zero left ideal: if $L^2=0$ and a module projection $A\to L$ exists, its value $e$ at $1$ satisfies $e\in L$ and $e^2=e$, forcing $e=0$.

For an automorphism $\sigma$ of a left Noetherian ring $A$, the skew polynomial ring of an automorphism $A[t;\sigma ]$ is left Noetherian. For a left ideal $L$, the normalized leading-coefficient ideals $I_n=\{{\sigma }^{-n}(a_n):{\sum }_{j=0}^n{a}_j{t}^j\in L\}$ form an ascending chain of left ideals of $A$. Choose finite generating lifts through the stabilization degree. Every element of $L$ has its leading coefficient cancelled by a suitable left multiple of one of these lifts, and induction on degree proves finite generation. Passing to the skew Laurent polynomial ring preserves the property by clearing negative powers. The right-sided statement follows by applying the argument to the opposite ring.