is maximal
ProvedNullstellensatz.vanishingIdeal_singletonLet be algebraically closed and . Then
and this ideal is a maximal ideal of .
Formalization Note. The statement is kept in the article's setting ( algebraically closed), although neither part needs that hypothesis.
import Definitions.Def_Nullstellensatz_Defs import Mathlib open MvPolynomial
namespace Nullstellensatz
theorem vanishingIdeal_singleton {K : Type*} [Field K] [IsAlgClosed K] {n : ℕ}
(a : Fin n → K) :
vanishingIdeal {a} = pointIdeal a ∧ (pointIdeal a).IsMaximal := 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 be an algebraically closed field, , . Two claims: (1) the ideal of all polynomials with equals the ideal generated by ; (2) this ideal is maximal (proper, and no proper ideal strictly contains it). For the ideal is the zero ideal of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.