An algorithmic version of Zariski's lemma

DOI10.1007/978-3-030-80049-9_46MaRDI QIDQ2117812zbMATH OpenOpenAlexFDO

Authors Franziskus Wiesnet

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-80049-9_46

zbMATH Keywords

computational algebraconstructive algebraprogram extractionproof miningZariski's lemma

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Algebraic field extensions (12F05) Elementary questions in algebraic geometry (14A25)

Review text

The author gives an elementary and constructive proof of Zariski's lemma. Zariski's lemma: Let \(K\) be a field and \(R\) be an algebra over \(K\) which is a field. If \(R=K[x_1,\ldots,x_n]\), for \(x_1,\ldots,x_n\in R\), then \(x_1,\ldots,x_n\) are algebraic over \(K\), i.e., there are \(f_1,\ldots,f_n\in K[X]\setminus K\) with \(f_i(x_i)=0\). In fact, in the proof of Theorem 1, by induction on \(n\), he finds the polynomial \(f_i\). The author gives a computational interpretation of Zariski's lemma and uses his constructive proof to develop an algorithm which realizes the computational interpretation. For the entire collection see [Zbl 1482.68017].

Recommendations

• Revisiting Zariski main theorem from a constructive point of view
• A simple proof of Zariski's lemma
• Suslin's lemma for rings containing an infinite field
• scientific article; zbMATH DE number 21625
• scientific article; zbMATH DE number 1163435

Cites work

• A course in constructive algebra
• A new proof of Hilbert’s Nullstellensatz
• A Note on Zariski's Lemma
• A simple proof of Zariski's lemma
• An algorithmic approach to the existence of ideal objects in commutative algebra
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
• Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
• Elementare Algebraische Geometrie
• scientific article; zbMATH DE number 193903 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• Minlog -- a tool for program extraction supporting algebras and coalgebras
• PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
• Proofs and computations

Cited in

(9)

• A universal algorithm for Krull's theorem
• Radical theory of Scott-open filters
• scientific article; zbMATH DE number 1824111 (Why is no real title available?)
• An algorithmic version of the blow-up lemma
• A version of Zabrodsky’s lemma
• A simple proof of Zariski's lemma
• The Jacobson radical for an inconsistency predicate
• A constructive proof of the general Nullstellensatz for Jacobson rings
• Constructive analysis of maximal ideals in \(\mathbb{Z}[X]\) by the material interpretation

Describes a project that uses

Uses Software

• Minlog

This page was built for publication: An algorithmic version of Zariski's lemma

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