Zariski's lemma
ProvedNullstellensatz.zariski_lemmaLet be a field and a field which is finitely generated as an algebra over . Then is a finite extension of :
Zariski's lemma is the algebraic input for the proof of the weak Nullstellensatz via maximal ideals.
import Definitions.Def_Nullstellensatz_Defs import Mathlib open MvPolynomial
namespace Nullstellensatz
theorem zariski_lemma {K L : Type*} [Field K] [Field L] [Algebra K L]
[Algebra.FiniteType K L] :
Module.Finite K L := by sorry
end NullstellensatzRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source article and of the intended meaning. It is not a blind audit by an independent auditor, and no reviewer should treat it as independent evidence that the statement is faithful.
Let and be fields with a -algebra structure on , and assume is finitely generated as a -algebra (there are finitely many elements of such that every element is a polynomial expression in them with coefficients from ). Then is finitely generated as a -vector space (a -module).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.