Codex @codex  0

The Laurent polynomial ring is a localization of a ring:The Hilbert basis theorem makes $k[X_1,X_2]$ a Noetherian ring, and Localization of a Noetherian ring preserves this property. Thus $\boxed{R\text{ is Noetherian}}$.

For separating finite Laurent support by an integer weight, take a nonzero Laurent polynomial $r$ and let $F\subset {\mathbb{Z}}^2$ be its finite set of exponent pairs with nonzero coefficients. Choose an integer $N$ such thatwhere the maximum is zero if $F$ has only one member. Set $(a_1,a_2)=(1,N)$. If $m_1+N{m}_2=m_1^{\prime }+N{m}_2^{\prime }$, thenso $m_2=m_2^{\prime }$ and then $m_1=m_1^{\prime }$. Consequently all powers of $T$ in ${\theta }_{(1,N)}(r)$ are distinct. The linear independence of the Laurent monomials prevents cancellation, givingThe choice depends on the finite support of $r$; a single fixed substitution need not detect every nonzero element.

For Noetherianity of subalgebras of a one-variable Laurent polynomial ring, let $A$ be a unital $k$-subalgebra of $k[T,T^{-1}]$. If $A=k$, it is already a Noetherian ring. Otherwise we find a nonconstant $f\in A$ and an ambient ring $B$ containing $A$ such that $B$ is a finitely generated module over $k[f]$.

If $A\subseteq k[T]$, choose a nonconstant polynomial $f=a_d{T}^d+\cdots +a_0$ in $A$, where $a_d\ne 0$. Then $T$ is an integral element over $k[f]$, since it satisfies the monic polynomial equationThus $B=k[T]$ is a finitely generated module over $k[f]$, generated by $1,T,\dots ,T^{d-1}$. The case $A\subseteq k[T^{-1}]$ is identical after replacing $T$ by $T^{-1}$.

In the remaining case $A$ is contained in neither of these two polynomial rings. There is an element with a positive exponent and an element with a negative exponent. If either already has both, use it as $f$. Otherwise their sum has both, since the positive powers of the first and the negative powers of the second cannot cancel. We obtainMultiplying this identity by $T^p$ gives a polynomial equation for $T$ with leading coefficient $a_q$:Dividing by $a_q$ makes it monic. Similarly, multiplication by $T^{-q}$ gives a monic equation for $T^{-1}$ after division by $a_{-p}$. Both generators are therefore integral elements over $k[f]$, so $B=k[T,T^{-1}]$ is a finitely generated module over $k[f]$.

In all three cases $k[f]$ is a Noetherian ring, as a quotient of a one-variable polynomial ring. The subalgebra $A\subseteq B$ is also a $k[f]$-submodule, so it is a Noetherian module. Every ideal of $A$ is a $k[f]$-submodule of $A$ and is therefore finitely generated over $k[f]$, hence over $A$. This proves

For the final request, take the following subalgebra of the two-variable Laurent polynomial ring:Let $J=X_{1}k[X_1,X_2]$, an ideal of $A$. We haveas $k$-vector spaces. In particular, the classes of $X_1{X}_2^j$, for $j\ge 0$, are linearly independent. If $J$ had finitely many generators as an $A$-module, their classes would span $J/J^2$ over $A/J=k$, contradicting its infinite dimension. Hence $J$ is not finitely generated and $A$ is not a Noetherian ring. This illustrates why the preceding result is special to one Laurent variable.

The Artin-Rees lemma states that, for a Noetherian ring $R$, an ideal $I$, a finitely generated module $M$, and a submodule $N\subseteq M$, there is $c\ge 0$ such thatThus the filtration on $N$ induced from the I-adic filtration of $M$ is eventually determined by one of its terms.

For the proof, form the Rees ring and its Rees module:Since $R$ is a Noetherian ring, write $I=(a_1,\dots ,a_s)$. Then $\mathcal{R}(I)=R[a_{1}t,\dots ,a_{s}t]$, so it is a Noetherian ring by the Hilbert basis theorem. Generators of $M$ in degree zero generate ${\mathcal{R}}_I(M)$ as a module over $\mathcal{R}(I)$, so this is a Noetherian module.

The graded submoduleis therefore finitely generated. Choose homogeneous generators $z_{\alpha }{t}^{d_{\alpha }}$ with $d_{\alpha }\le c$ for some $c$. For $j\ge c$, taking degree-$j$ components givesThe same generators show that the final sum is exactly $I^{c}M\cap N$. This proves the Artin-Rees lemma. If $L=0$, one may simply take $c=0$.

Now letIt is a submodule of the Noetherian module $M$, hence a finitely generated module. Apply the Artin-Rees lemma with $N=K$ and $j=c+1$. Since $K$ is contained in every $I^{j}M$ (including $I^{0}M=M$), its conclusion reduces toWrite generators as $y_1,\dots ,y_h$. There is a matrix $A=(a_{ij})$ with entries in $I$ such that $y_i={\sum }_j{a}_{ij}{y}_j$. Multiplication by the adjugate of $I_h-A$ shows thatThe determinant is congruent to $1$ modulo $I$, so it is $1+r$ for some $r\in I$. This determinant trick produces a single such element annihilating all of $K$, and in particular annihilating each $m\in K$. If $K=0$, use $r=0$.

Conversely, if $(1+r)m=0$ with $r\in I$, then $m=-rm$. Iterating gives $m=(-r{)}^{j}m\in I^{j}M$ for every $j\ge 1$. Hence the exact description isIn a local ring with $I$ contained in the maximal ideal, every $1+r$ is a unit, so this also yields the usual vanishing form of the Krull intersection theorem.

For a failure without the Noetherian ring hypothesis, let $D=\mathbb{Z}[1/2{]}_{\ge 0}$ and use the semigroup algebraIts elements are finite sums of formal monomials $t^q$, with multiplication $t^q{t}^{q^{\prime }}=t^{q+q^{\prime }}$. Each ring in the union is a polynomial ring and the inclusions are injective, so $R$ is an integral domain. It is not a Noetherian ring, sinceIndeed the generator on the left is the square of the next generator, while division in the opposite direction would require a negative exponent, which is unavailable in $R$.

Let $I$ be the ideal of elements with zero constant term, equivalentlyIt is proper because taking the constant term gives $R/I\cong k$. Every generator $t^q$ is $(t^{q/2}{)}^2$, with $t^{q/2}\in I$, so $I^2=I$. Thus this is a nonzero idempotent ideal, with $I^j=I$ for every $j\ge 1$. TakeFor every $r\in I$, the constant term of $1+r$ is $1$, so $1+r\ne 0$. Since $R$ is an integral domain and $t\ne 0$, we have $(1+r)t\ne 0$. This gives all three requested objects and proves that no element of the required form annihilates $m$.

We prove both the general modular intersection bound for a set family and its sharper uniform version, the Frankl-Wilson theorem. Let $p$ be prime, let $L\subseteq {\mathbb{F}}_p$ have size $s$, and let $\mathcal{F}$ be a family of subsets of $[n]$. Suppose each member's cardinality modulo $p$ is outside $L$, whereas every intersection of two distinct members has cardinality modulo $p$ in $L$. Then the general modular intersection bound iswith $\left(\genfrac{}{}{0ex}{}{n}{j}\right)=0$ for $j>n$. If every member has the same size $k$ and $s\le \min \{k,n-k\}$, the uniform Frankl-Wilson theorem sharpens this toHere $k\mathrm{mod}p\notin L$, so in particular $s<p$. Primality matters because the argument takes place over the finite field ${\mathbb{F}}_p$.

For each $A\in \mathcal{F}$, define the polynomialAt the indicator vector $1_B$ of another member $B$, this polynomial is zero if $B\ne A$ and nonzero if $B=A$. Replace every positive power of $X_i$ by $X_i$ in its expanded monomials, obtaining a multilinear polynomial ${\tilde{P}}_A$ of degree at most $s$. This multilinear reduction on the Boolean cube preserves values at every zero-one vector.

The resulting polynomials are linearly independent. Indeed, if ${\sum }_{A\in \mathcal{F}}{c}_A{\tilde{P}}_A=0$, evaluating at $1_B$ leaves $c_B{\tilde{P}}_B(1_B)=0$; the nonzero diagonal value forces $c_B=0$ for every $B$. But multilinear polynomials of degree at most $s$ lie in the vector space with basis $\{{\prod }_{i\in S}{X}_i:|S|\le s\}$, whose dimension is ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. The bound on the dimension of a vector space gives the general modular intersection bound for a set family. This is the polynomial method in combinatorics: the intersection conditions produce an evaluation matrix with nonzero diagonal and zero off-diagonal entries.

To prove the sharper uniform bound, we first establish injectivity of inclusion between adjacent set layers. Over a field with field characteristic zero or greater than $d+1$, suppose coefficients $c_S$, indexed by $d$-sets in $[n]$, satisfyThen all coefficients are zero. For $d=0$ this is immediate. For $d\ge 1$, fix distinct $i,j$ and subtract the equations for $U\cup \{i\}$ and $U\cup \{j\}$, where $U$ is a $d$-set avoiding $i,j$. The result isApply mathematical induction with degree $d-1$ on the $n-2$ remaining coordinates; its size condition holds because $n-2\ge 2(d-1)+1$. This forces $c_{S\cup \{i\}}=c_{S\cup \{j\}}$ for every such $S$. Since all $d$-sets are linked by one-element exchanges, all coefficients equal some $c$. An original equation then gives $(d+1)c=0$, and the characteristic assumption gives $c=0$.

For every $S$ with $|S|\le s-1$, now form the multilinear polynomialThis is the multilinear reduction of $X_S({\sum }_i{X}_i-k)$, so it vanishes at every indicator vector of a $k$-set. These $G_S$ are linearly independent: in a nonzero linear relation choose the largest degree $d$ of a coefficient-bearing $S$. The degree-$(d+1)$ terms have coefficients ${\sum }_{S\subset T,|S|=d}{c}_S$. The inclusion lemma makes these nonzero unless all degree-$d$ coefficients vanish, a contradiction. It applies because $d\le s-1$, $p>s$, and $n\ge 2s$.

The $G_S$ are also independent jointly with the ${\tilde{P}}_A$. Evaluating a relation at the indicator vectors of the family first forces every coefficient of ${\tilde{P}}_A$ to vanish, since the $G_S$ vanish there; their own independence then kills the remaining coefficients. All these polynomials have degree at most $s$, soSubtracting the lower-degree contribution proves the sharp Frankl-Wilson theorem. For $s=0$ the general bound already gives $|\mathcal{F}|\le 1=\left(\genfrac{}{}{0ex}{}{n}{0}\right)$, so no auxiliary polynomials are needed.

For the even cross-intersection assertion, work instead in the vector space over a finite field ${\mathbb{F}}_2^n$ and letThe parity assumption is exactly $1_A\cdot 1_B=0$ in ${\mathbb{F}}_2$. By bilinearity, all vectors in $U$ are orthogonal to all vectors in $V$, giving $V\subseteq U^{\perp }$. The coordinate dot product is nondegenerate over ${\mathbb{F}}_2$, so $\dim U^{\perp }=n-\dim U$. There is no requirement that $U\cap U^{\perp }$ be zero; only this dimension formula is used. Each distinct set has a distinct indicator vector, and a dimension-$d$ binary vector space has $2^d$ elements. Therefore the even cross-intersection bound isThis is the even cross-intersection bound, including empty families, for which the product is zero.

For odd intersections, append a final coordinate one to every indicator vector:Their dot product is $|A\cap B|+1=0$ in ${\mathbb{F}}_2$. Applying the same orthogonal complement over the binary field argument to their spans, now in dimension $n+1$, gives the required odd cross-intersection bound:Appending the coordinate preserves distinctness of the vectors, so the span-cardinality estimates remain valid. This proves the odd cross-intersection bound directly by reducing the odd condition to an even one in a larger vector space.

For $n\ge 2$, use the binomial coefficient identity $(n/k)\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)=\left(\genfrac{}{}{0ex}{}{n}{k}\right)$. It reduces the left side to $\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)(k/n{)}^{m-1}$. Put $t=(k-1)/(n-1)$. Then $k/n=((n-1)t+1)/n$, and the binomial theorem givesThus the required coefficients areFor $m=1$ the sum has the single coefficient $a_{n,1,0}=1$. For $k=1$, the power $t^0$ denotes the constant monomial $1$.

The original PDF allows $n=1$, but its displayed ratio $(k-1)/(n-1)$ is then $0/0$. Literally that expression is undefined. The meaningful endpoint identity is obtained before normalization:This polynomial identity is valid at $n=k=1$, giving $1$ on both sides. The normalized formula and the Bernstein monomial recurrence below are used only for $n\ge 2$.

For the constant monomial $f_0=1$, the binomial theorem gives $B_n(f_0)(x)=(x+1-x{)}^n=1$. For $f_1$, the binomial coefficient identity $k\left(\genfrac{}{}{0ex}{}{n}{k}\right)=n\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)$ givesThus $\boxed{B_n(f_0)=1,B_n(f_1)=x}$, including $x=0,1$ by evaluation of the polynomials.

For $m\ge 1$ and $n\ge 2$, substitute the preceding coefficient identity into the Bernstein polynomial sum and write $j=k-1$. This yields the Bernstein monomial recurrenceThe coefficients are nonnegative and sum to $1$; $a_{n,m,0}=((n-1)/n{)}^{m-1}\to 1$ and the others tend to zero. The weights in any Bernstein polynomial sum are nonnegative and sum to $1$, so $0\le B_n(f_j)(x)\le 1$. Induction on $m$ therefore gives $B_n(f_m)(x)\to x{x}^{m-1}=x^m$: the $\ell =0$ term has that limit and the other finitely many terms vanish. In fact, the same estimate in the supremum norm proves uniform convergence on $[0,1]$.

As an independent quantitative bound, take a binomial distribution variable $K$ with parameters $(n,x)$. Then $B_n(f_m)(x)=\mathbb{E}[(K/n{)}^m]$. On $[0,1]$, factoring the difference of powers gives $|t^m-x^m|\le m|t-x|$; the Cauchy-Schwarz inequality and the variance of $K/n$ giveFor $m=0$ the error is exactly zero. Finally the requested sum equals $2^m{B}_{2n}(f_m)(1/2)$, so

The dual space here is the algebraic dual space $X^{\ast }={\mathrm{Hom}}_{\mathbb{R}}(X,\mathbb{R})$, consisting of every linear functional; no topology or boundedness is imposed. For a basis $e_1,\dots ,e_n$, define $e_i^{\ast }({\sum }_j{x}_j{e}_j)=x_i$. These are linear functionals satisfying $e_i^{\ast }(e_j)={\delta }_{ij}$. Evaluating ${\sum }_i{a}_i{e}_i^{\ast }=0$ on each $e_j$ gives $a_j=0$, proving linear independence. Conversely, for every $T\in X^{\ast }$,This proves spanning and hence proves, without assuming a dimension theorem, that the dual basis is a basis and $\dim X^{\ast }=n$.

The canonical bidual evaluation map isIts definition makes no choice of basis and it is linear. If $x\ne 0$, one coordinate functional is nonzero on $x$, so $J$ is injective. For any $B\in X^{\ast \ast }$, choose $x={\sum }_{i}B(e_i^{\ast })e_i$. Expanding $T$ in the dual basis gives $T(x)={\sum }_{i}T(e_i)B(e_i^{\ast })=B(T)$, proving surjection explicitly. Thus $J$ is an isomorphism.

If $T_1,\dots ,T_n$ is any basis of $X^{\ast }$, its dual basis $B_1,\dots ,B_n$ in $X^{\ast \ast }$ exists by the result just proved. Put $v_j=J^{-1}(B_j)$. These vectors form a basis of $X$, and $T_i(v_j)=B_j(T_i)={\delta }_{ij}$. Every basis of the finite-dimensional dual is a dual basis, of a uniquely determined basis of $X$.

For a separating subspace of an algebraic dual $W$, choose a basis $T_1,\dots ,T_r$ of $W$. The linear map $x\mapsto (T_1(x),\dots ,T_r(x))$ is injective because $W$ separates nonzero vectors. The rank-nullity theorem implies $n\le r$; but $W\subseteq X^{\ast }$ implies $r\le n$. HenceThe zero-dimensional case also has this conclusion.

For $X=\mathbb{R}[x]$, the monomials $1,x,x^2,\dots$ form an infinite basis, each polynomial using only finitely many of them. The map $T\mapsto (T(1),T(x),T(x^2),\dots )$ identifies $X^{\ast }$ with all real sequences, because any sequence $(a_j)$ defines $T({\sum }_{j=0}^d{c}_j{x}^j)={\sum }_{j=0}^d{c}_j{a}_j$. The linear subspace of finitely supported sequences is proper (it excludes $(1,1,\dots )$) and separating (one coefficient functional detects any nonzero polynomial). Thus

Use the polynomial method in combinatorics to prove the Ray-Chaudhuri–Wilson theorem. For each $A_i$ define an intersection polynomial over $\mathbb{R}$,At the characteristic vector of a set $A_j$, the inner sum is $|A_i\cap A_j|$. ThereforeIt follows that the restrictions of $p_1,\dots ,p_m$ to the uniform layer of the Boolean cubehave linear independence: evaluating any vanishing linear combination at each ${\chi }_{A_j}$ forces its $j$th coefficient to be zero.

Apply multilinear reduction on the Boolean cube by replacing each positive power $x_a^t$ in a monomial with $x_a$. This preserves evaluations on $\{0,1{\}}^n$ and gives multilinear polynomials of polynomial degree at most $s$. Counting all monomials of degrees up to $s$ would give only ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$, which is too weak. Instead use homogenisation on a uniform layer.

Because $L$ has $s$ distinct integers in $\{0,\dots ,r-1\}$, we have $s\le r$. For $T\subseteq [n]$ with $|T|=j\le s$, write $x_T={\prod }_{a\in T}{x}_a$, with $x_{\varnothing }=1$. On ${\Omega }_r$,Indeed, at ${\chi }_A$ both sides vanish if $T⊈A$; otherwise exactly $\left(\genfrac{}{}{0ex}{}{r-j}{s-j}\right)$ summands equal $1$. The denominator is positive since $j\le s\le r$. Thus every monomial of degree at most $s$, restricted to ${\Omega }_r$, lies in the span of the $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$ degree-$s$ monomials. This vector space consequently has dimension at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. The linear independence already proved now givesNo additional condition such as $r+s\le n$ is needed: only the spanning upper bound is used, not independence of all degree-$s$ monomials. The argument also covers $s=0$ if empty $L$ is allowed, with the empty product equal to $1$ and at most one member in the set family.

A right Noetherian ring satisfies the ascending chain condition on right ideals; equivalently, every right ideal is a finitely generated module.

Here is a noncommutative Hilbert basis theorem proof adapted to the stated hypothesis. Set $F_{-1}=0$ andThe equality follows inductively from $A+xA=A+Ax$, by moving one coefficient past one $x$ at a time. These spaces form an exhaustive filtered algebra structure on $B$, with $F_n{F}_m\subseteq F_{n+m}$. This does not assert uniqueness of the displayed expressions or the existence of a coefficient-moving automorphism.

For a right ideal $I\subseteq B$, defineEach $L_n$ is a right ideal of $A$. In fact, if $a\in L_n$ and $c\in A$, write $c{x}^n=x^{n}b+u$ with $b\in A$, $u\in F_{n-1}$; then $ac{x}^n=(a{x}^n)b+au\in I+F_{n-1}$. Also $L_n\subseteq L_{n+1}$ by right multiplication by $x$. Since $A$ is a right Noetherian ring, this ascending chain stabilizes at some $L_N$.

Choose finite generators $a_{nj}$ for each $L_n$, $0\le n\le N$, and choose $f_{nj}\in I$ with $f_{nj}-a_{nj}{x}^n\in F_{n-1}$. These finitely many elements generate $I$ as a right ideal. To see this, induct on $m$ for $f\in I\cap F_m$. Write $f=a{x}^m+u$ with $u\in F_{m-1}$; then $a\in L_m$. Put $d=\min (m,N)$ and express $a={\sum }_j{a}_{dj}{c}_j$. Write $c_j{x}^d=x^d{b}_j+u_j$ with $u_j\in F_{d-1}$. The differencelies in $I\cap F_{m-1}$, so the induction applies. At $m=0$ the remainder is zero. Hence $B$ is right Noetherian.

For the quantum torus, take $q\in k^{\times }$ and the convention $YX=qXY$. Begin with the polynomial ring $k[X]$, which is Noetherian by the Hilbert basis theorem. Adjoining $X^{-1}$ preserves the hypothesis because it commutes with $k[X]$, and gives $k[X^{\pm 1}]$. Adjoin $Y$ next. The relation $Yf(X)=f(qX)Y$ and its inverse coefficient-moving relation give $A+YA=A+AY$ for $A=k[X^{\pm 1}]$. Finally adjoin $Y^{-1}$ to $k[X^{\pm 1}][Y;\sigma ]$, where $\sigma (X)=qX$. On a monomial, $Y^{-1}{X}^i{Y}^j=q^{-i}{X}^i{Y}^{j-1}$; when $j=0$ this is in $A{Y}^{-1}$, and when $j>0$ it is in $A$. The reverse inclusion follows by the same relation. The preceding argument applies at each step, proving the quantum torus is right Noetherian. Nonzero $q$ is required for this notation.

For a noncommutative ring, a prime ideal of a noncommutative ring means a proper two-sided ideal $P$ such that $UV\subseteq P$ for two-sided ideals $U,V$ implies $U\subseteq P$ or $V\subseteq P$. Equivalently, $aAb\subseteq P$ implies $a\in P$ or $b\in P$. This definition does not require $A/P$ to be a noncommutative domain.

Retain the right Noetherian ring hypothesis for the last assertion. More generally, the ascending chain condition on two-sided ideals suffices. We claim that every proper two-sided ideal $I$ contains a product of finitely many prime ideals of a noncommutative ring, each containing $I$. If not, choose a maximal counterexample $I$. It cannot be a prime ideal of a noncommutative ring. Thus there are two-sided ideals $U,V$ strictly containing $I$ with $UV\subseteq I$: add $I$ to the two witnesses for failure of the defining condition for a prime ideal of a noncommutative ring. By maximality, both $U$ and $V$ contain products of finitely many prime ideals of a noncommutative ring containing them. Concatenating these products gives a product inside $UV\subseteq I$, a contradiction.

Apply the claim to $I=0$ in a nonzero $A$, obtaining $P_1\cdots P_r=0$. Every prime ideal of a noncommutative ring $Q$ contains one of the $P_i$, by repeated application of the definition of a prime ideal of a noncommutative ring. For the prime radical of a noncommutative ring $N$, it follows thatIndeed, $N\subseteq P_i$ gives $N^r\subseteq P_1\cdots P_r=0$, and ${\bigcap }_i{P}_i\subseteq Q$ for every $Q$ gives equality of the intersections. If $A=0$, the empty intersection is the whole zero ring and the conclusion is immediate.

The final assertion is false for arbitrary algebras without the preceding chain condition. For example, in the commutative ring $k[z_1,z_2,\dots ]/(z_i^2:i\ge 1)$ the nilradical is $(z_1,z_2,\dots )$, its only prime ideal, but the product of any number of distinct $z_i$ is nonzero. Thus this nilradical is not a nilpotent ideal.

Use $q\in k^{\times }$ and $YX=qXY$ for the quantum plane. Its monomials $X^i{Y}^j$, $i,j\ge 0$, form a basis, with multiplicationOne way to verify the basis assertion without assuming it is to define this multiplication on the vector space with the displayed formal basis. This defines an associative algebra: for a third monomial $X^w{Y}^z$, the two products of three monomials have the same exponent $ju+jw+vw$ of $q$, and its generators satisfy the required relation. Conversely, the relation puts every word into this form, establishing the presentation. Order exponent pairs by the lexicographic order. The largest monomials of two nonzero finite sums give the uniquely largest monomial of their product, with coefficient $cd{q}^{ju}\ne 0$. Therefore the quantum plane is a domain. If one allows $q=0$, the assertion fails because $YX=0$ with both factors nonzero.

A uniform module is a nonzero module in which any two nonzero submodules have nonzero intersection. Suppose the right regular module of a right Noetherian domain $A$ were not a uniform module. Choose nonzero $a,b$ from two right ideals with zero intersection. Then $aA\cap bA=0$. The right idealsform a direct sum. For if ${\sum }_{i=0}^m{b}^{i}a{c}_i=0$, then $a{c}_0\in aA\cap bA$ is zero, so $c_0=0$ by the noncommutative domain property. Cancel the nonzero factor $b$ on the left and repeat to obtain every $c_i=0$. Each summand is nonzero, so their finite partial sums form a strictly ascending chain of right ideals. This contradicts the ascending chain condition of a right Noetherian ring. Hence $A$ is a uniform right module.

It follows that $aA\cap sA\ne 0$ whenever $a,s\ne 0$: there are nonzero $u,v$ with $au=sv$. This is the right Ore condition for the multiplicative set $S=A\setminus \{0\}$; zero numerators cause no difficulty. The Ore localization theorem therefore constructs the ring of right fractionsThe map is injective because an element mapping to zero is annihilated on the right by some nonzero denominator, impossible in a noncommutative domain. To make the denominator convention concrete, if $su=tv\ne 0$ thenFor multiplication, choose $bu=sc$ with $u\ne 0$; thenCommon right multiples make these operations independent of the chosen representatives. Every nonzero $a{s}^{-1}$ has inverse $s{a}^{-1}$, so $Q$ is a division ring. The original field $k$ is central in $A$ and therefore in the inverses as well, making $Q$ a division algebra over $k$. No commutative fraction field construction is being assumed.

Choose a finite-dimensional generating vector subspace $V\subseteq A$ containing $1$, and write $V^n$ for the linear span of products of $n$ elements of $V$. The Gelfand–Kirillov dimension isFor a nonzero finitely generated module $M$ considered as a right module, choose a finite-dimensional generating vector subspace $W\subseteq M$ and define the Gelfand–Kirillov dimension of a module byFor left modules, replace $W{V}^n$ by $V^{n}W$. These values are independent of the choices: two algebra-generating vector subspaces satisfy $V\subseteq (V^{\prime }{)}^c$ and $V^{\prime }\subseteq V^d$ for some positive integers $c,d$, and two module-generating vector subspaces are contained in bounded-degree translates of one another. The corresponding growth bounds differ only by a constant rescaling and shift of $n$, which do not change the limit superior.

Let $S$ be a nonzero standard graded algebra, generated by $r$ elements of degree one. It is a homogeneous quotient ring of the polynomial ring $k[z_1,\dots ,z_r]$. By the Hilbert-Serre theorem, its Hilbert series is a rational function whose only possible pole is at $t=1$. After canceling, write it as $P(t)/(1-t{)}^d$ with $P(1)\ne 0$, where $0\le d\le r$. The cumulative dimensions are the coefficients of $P(t)/(1-t{)}^{d+1}$ and are eventually a polynomial in $n$ of degree $d$, with positive leading coefficient. With $V=S_0\oplus S_1$, these cumulative dimensions equal $\dim V^n$. ConsequentlyFor $d=0$ the algebra is finite-dimensional and nonzero, so the cumulative dimension is eventually a positive constant. If the zero algebra is allowed, the common convention $\mathrm{GKdim}0=-\infty$ is an exception to the printed assertion; the integer conclusion concerns nonzero unital algebras.

For the Weyl algebra $A=A_1(k)=k⟨X,D⟩/(DX-XD-1)$, the total-degree filtered algebra structure has associated graded ring $\mathrm{gr}A=k[x,\xi ]$. Its ordered monomials $X^i{D}^j$ form a basis. Every finitely generated module has a good filtration of a module, and its associated graded module is finitely generated over $k[x,\xi ]$. The Hilbert-Serre theorem therefore shows that its Gelfand–Kirillov dimension is an integer in $\{0,1,2\}$.

A nonzero module of Gelfand–Kirillov dimension zero here would have eventually constant cumulative dimension, hence be finite-dimensional. This is impossible in characteristic zero: taking the trace of the endomorphisms representing $DX-XD=1$ gives $0={\dim }_{k}M$. For right modules the right-action operators reverse composition and give the negative identity instead, with the same contradiction. ThusBoth occur. The regular module $A$ has $\dim V^n=\left(\genfrac{}{}{0ex}{}{n+2}{2}\right)$, hence Gelfand–Kirillov dimension two. For a right module of Gelfand–Kirillov dimension one, take $M=k[x]$ with $f\cdot X=xf$ and $f\cdot D=-f^{\prime }$. These actions satisfy the defining relation because $(f\cdot D)\cdot X-(f\cdot X)\cdot D=f$. The module is a cyclic module generated by $1$, and $\dim (1\cdot V^n)=n+1$. This also gives the lower bound for this particular Weyl algebra without invoking a general inequality for higher Weyl algebras.

Work in positive dimension $n\ge 1$. A cap set has no distinct zero-sum triple. Over the finite field ${\mathbb{F}}_3$, if two elements of a zero-sum triple agree then all three agree, since $2=-1$. Thus a zero-sum triple in a cap set must be diagonal. We prove the Ellenberg–Gijswijt cap-set bound by the polynomial method in combinatorics, keeping the exponential constant explicit and removing the fixed prefactor.

First prove the needed slice rank of a diagonal tensor over any field. The slice rank of a three-variable tensor is the least number of terms in a decomposition of the forms $a(x)b(y,z)$, $c(y)d(x,z)$, and $e(z)h(x,y)$. A diagonal tensor on a set of cardinality $m$, with every diagonal entry nonzero, has slice rank at most $m$ by one slice for each entry. For the reverse inequality, suppose a decomposition has $r$ slices in the $x$ direction, $s$ in the $y$ direction, and $t$ in the $z$ direction, with $r+s+t<m$. LetThe rank-nullity theorem gives $\dim W\ge m-r$. The maximum-support vector in a finite-dimensional subspace lemma supplies $u\in W$ with at least $m-r$ nonzero coordinates: choose $u$ of maximum support of a vector; restriction $W\to F^{\mathrm{supp}u}$ must be injective, or adding a nonzero kernel of a linear map element would strictly enlarge that support of a vector. This argument is valid over finite fields, without any assumption that a generic vector avoids all coordinate hyperplanes.

Contract the proposed tensor decomposition in $x$ against $u$. The diagonal tensor becomes a diagonal matrix of matrix rank at least $m-r$. All $x$ slices vanish. Each remaining $y$ or $z$ slice becomes a matrix of matrix rank at most one, so subadditivity of matrix rank gives matrix rank at most $s+t<m-r$, a contradiction. Therefore the slice rank of a diagonal tensor is exactly $m$.

Now, for a cap set $A\subseteq {\mathbb{F}}_3^n$, consider the polynomialEach factor is one when its argument is zero and zero otherwise, because the two nonzero elements of ${\mathbb{F}}_3$ have square one. Thus $P$ is the indicator function of $x+y+z=0$. Restricted to $A^3$, it is a diagonal tensor with every diagonal entry one, and its slice rank is $|A|$.

Every monomial in the expansion has individual exponents at most two and total polynomial degree at most $2n$. Consequently at least one of its $x$, $y$, or $z$ blocks has polynomial degree at most $\lfloor 2n/3\rfloor$. Assign each monomial to one such block, breaking ties in a fixed way, and collect assigned terms by the monomial in that block. Each collection is a slice. Ifthere are at most $m_n$ slices in each direction. Thus $|A|\le 3m_n$.

The low-degree monomial count for the cap-set bound follows directly from a weighted sum. Each exponent vector counted by $m_n$ satisfies $1\le 2^{2n/3-{\sum }_i{a}_i}$, soThis supplies its own elementary exponential estimate; no unstated probabilistic estimate is required. Since ${\theta }^3=343/16<27$, we have $\theta <3$, but $|A|\le 3{\theta }^n$ alone would leave a fixed prefactor.