A universal coefficient theorem for Gauss's lemma

DOI10.1216/JCA-2013-5-2-299zbMATH Open1271.13053arXiv1209.6307OpenAlexW2963881737WikidataQ124859056 ScholiaQ124859056MaRDI QIDQ357883FDOQ357883

Authors: William Messing, Victor Reiner 

Publication date: 14 August 2013

Published in: Journal of Commutative Algebra (Search for Journal in Brave)

Abstract: We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that whenever {A_i},{B_j},{C_k} are the coefficients of polynomials A(X),B(X),C(X) with C(X)=A(X)B(X) and 1 = a_0 A_0 +...+ a_m A_m = b_0 B_0 +...+ b_n B_n, then one also has 1 = c_0 C_0 +...+ c_{m+n} C_{m+n}.

Full work available at URL: https://arxiv.org/abs/1209.6307

Recommendations

• Generic Gaussian ideals
• Gauss's Lemma for Number Fields
• The Gaussian property for rings and polynomials
• GCD domains, Gauss' lemma, and contents of polynomials
• Gaussian polynomials

zbMATH Keywords

commutative ringspolynomialsGauss's lemma

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Polynomials, factorization in commutative rings (13P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cites Work

• The Theory of Representation for Boolean Algebras
• Nontrivial Uses of Trivial Rings
• Remarks on Divisors of Zero
• Sur la structure des anneaux absoluments plats commutatifs
• Six impossible rings
• The Power of the Ultrafilter Theorem
• Variants of RADO'S Selection Lemma and their Applications
• Krull Implies Zorn
• Title not available (Why is that?)
• A DIVISION ALGORITHM

Cited In (2)

• Gauss's Lemma for Number Fields
• An approximate universal coefficient theorem

This page was built for publication: A universal coefficient theorem for Gauss's lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q357883)