Matching works

7 works

math.AC — Commutative Algebra

Prime-Generated Localization Descent for Unique Factorization in Lean

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira

We give a source-grounded exposition of a Lean 4 formalization of prime-generated Nagata factoriality descent. A commutative noetherian integral domain is a unique factorization domain if a localization is a unique factorization domain and every denominator is exactly a finite product of prime elements belonging to the denominator submonoid. The formal statement works with an arbitrary algebra carrying Mathlib’s IsLocalization structure. We explain the two cases for an irreducible element, the multiset cancellation and splitting arguments, and the corollary for submonoids generated by arbitrary sets of primes. A registered polynomial corollary illustrates reuse of the descent package; its Laurent-polynomial premise is proved using Mathlib’s existing polynomial UFD instance, a dependency made explicit here. The exposition is tied to the registered source and dependency pins, distinguishes historical mechanical verification from manuscript review, and situates the development relative to an earlier Lean preprint and an Isabelle/HOL formalization. No new algebraic theorem or priority claim is asserted.

Primarily AI-generated textHuman understanding: some partsLean 4MathlibNagata factorialitycommutative algebralocalizationunique factorization domains

math.CO — Combinatorics

On a non-basis of the coinvariant algebra

Contributed by Darij Grinberg

A conjecture arising from a question of Procesi proposes a basis of the coinvariant algebra of SnS_n consisting of column-antisymmetrized monomials indexed by pairs of standard Young tableaux. We show that the proposed family need not even span an SnS_n-subrepresentation: for n=8n=8, a generator of degree 1515 is sent outside the span by the adjacent transposition (4,5)(4,5). The proof is an exact finite computation with an explicit separating functional, requiring neither a rank computation nor Gr\"obner reduction. We also retain an explicit relation for n=7n=7, where the basis assertion first fails, although the span is still invariant.

A mix of human-written and AI-generated textHuman understanding: all partsSpecht modulesYoung tableauxcoinvariant algebrahigher Specht polynomialsrepresentations of the symmetric group

math.RA — Rings and Algebras

A Universal Noncommutative Splitting Algebra for Polynomials

Contributed by Darij Grinberg

Let RR be a commutative ring. We show that every homogeneous polynomial f∈R[x1,…,xm]f\in R[x_{1},\ldots,x_{m}] of degree nn splits into a product of nn homogeneous linear forms over a suitable noncommutative ring extension SS of RR (that is, over a noncommutative RR-algebra SS whose structure morphism R→SR\rightarrow S is injective). The algebra SS is universal for such factorizations and is free as an RR-module. The proof uses Bergman's Diamond Lemma: we define SS by generators and relations, and the relations form a terminating reduction system that has no ambiguities and thus is confluent. An analogous result is also shown for inhomogeneous polynomials (with inhomogeneous factors). This easily follows from the homogeneous case by homogenizing and then setting the homogenizing variable equal to 11.

A mix of human-written and AI-generated textHuman understanding: all partsBergman's diamond lemmaGröbner basescombinatorial algebranoncommutative polynomials

math.AC — Commutative Algebra

Polynomials over Symmetric Polynomials

Contributed by Darij Grinberg

Let k\mathbf{k} be a commutative ring, and let the symmetric group Sn\mathfrak{S}_{n} act on $P=\mathbf{k}\left[ x_{1} ,x_{2},\ldots,x_{n} \right] $ by permuting the variables. We prove four results that are known (at least in the case when k\mathbf{k} is a field) but not easily found in the literature. First, the coinvariant algebra (the quotient of PP by the ideal generated by the symmetric polynomials with constant term 00) is a free k\mathbf{k}-module of rank n!n!, with the residue classes of the Artin monomials as a basis. Second, PP is a free module of rank n!n! over the ring PSnP^{\mathfrak{S}_{n}} of symmetric polynomials, again with the Artin monomials as a basis. Third, if n!n! is invertible in k\mathbf{k}, the coinvariant algebra is the regular $\mathbf{k}\left[ \mathfrak{S}_{n} \right] $-module. Fourth, under the same hypothesis, PP is a free left PSn[Sn]P^{\mathfrak{S}_{n}}\left[ \mathfrak{S}_{n} \right] -module of rank 11. The first result follows from an elementary normal-form lemma for monic polynomials with pairwise relatively prime leading monomials. The second is proved by lifting the Artin basis. For the third, we use orbit harmonics with a strongly discrete point orbit, and the fourth follows by equivariantly lifting a regular basis of the coinvariant algebra.

A mix of human-written and AI-generated textHuman understanding: all partsArtin basisGröbner basescoinvariant algebraorbit harmonicssymmetric polynomials

math.AC — Commutative Algebra

Splitting a Polynomial into Linear Factors after an Injective Ring Extension

Contributed by Darij Grinberg

We show that each univariate polynomial P=p0+p1X+⋯+pmXm∈R[X]P = p_0 + p_1 X + \cdots + p_m X^m \in R[X] over a commutative ring RR can be factored into linear factors over a suitable commutative ring extension SS of RR. The proof proceeds by universal construction: SS is defined as the tensor product R⊗CmBmR \otimes_{C_m} B_m, where BmB_m is the polynomial ring $\ZZ[a_1, b_1, a_2, b_2, \ldots, a_m, b_m]$, and where CmC_m is its subring generated by its ``homogenized elementary symmetric polynomials'' Er=∑I⊆[m];∣I∣=r∏i∈Iai∏i∉IbiE_r=\sum_{\substack{I\subseteq [m];\\ |I|=r}} \prod_{i\in I}a_i\prod_{i\notin I}b_i for all 0≤r≤m0 \leq r \leq m. The injectivity of the structure homomorphism R→SR \to S is deduced from a combinatorial study of the diagonal subring of BmB_m. In the process, a homogeneous variant of the Garsia--Stanton basis is constructed, and some classical properties of symmetric polynomials are recovered.

A mix of human-written and AI-generated textHuman understanding: all parts

math.AC — Commutative Algebra

Graded absolute integral closures and Picard groups

Contributed by Akhil Mathew

We deduce from Bhatt's graded Cohen--Macaulay and vanishing results that an integer-graded absolute integral closure of a weighted polynomial ring over Zp\Z_p, modulo pp, is free with basis degrees smaller than the sum of the weights. A direct pp-adic expansion turns this degree bound into a uniform solution of the cusp relation modulo nilpotents. Consequently every ring RR admits a faithfully flat algebra with seminormal reduction, and every invertible R[T]R[T]-module becomes free after a faithfully flat extension of RR, answering a question of Drinfeld.

Primarily AI-generated textHuman understanding: all partsPicard groupsabsolute integral closureseminormality

math.AG — Algebraic Geometry

Strict negativity and non-vanishing of Chen--Larson hypergeometric coefficients

Contributed by Johannes Schmitt

Chen and Larson study tautological classes on the strata of holomorphic abelian differentials, where they predict a vanishing result. Using known tautological relations on the moduli space of curves, they reduce this prediction to the non-vanishing of certain coefficients of a quotient of hypergeometric generating series, treating the residue classes g≡0,2(mod3)g\equiv0,2\pmod3 and g≡1(mod3)g\equiv1\pmod3 through two separate series; they verify the non-vanishing by computer for small genus. We prove it in general: in both cases the relevant coefficient is non-vanishing for every genus and every stratum, and in the first case it has, more strongly, a uniform strict sign. Along the way we correct an error in the Chen--Larson derivation of the g≡1(mod3)g\equiv1\pmod3 series, where a constant of the underlying relation of Ionel had inadvertently been changed. The paper falls into two parts. Part~I gives the mathematical proofs; Part~II documents the Lean~4 and Mathlib formalization --- whose only non-standard trust assumption is the compiler invoked by \code{native\_decide} for the large finite computations --- together with the long-horizon, multi-model generative-AI process that produced the proofs, exposed false intermediate routes, and uncovered the error in the printed Proposition~5.2 relation noted above.

Primarily AI-generated textHuman understanding: not declaredpower seriestautological classes

Advanced search

Text
Human understanding
Linked formalizations