mathlib documentation

ring_theory.nilpotent

Nilpotent elements #

Main definitions #

def is_nilpotent {R : Type u} [has_zero R] [has_pow R ] (x : R) :
Prop

An element is said to be nilpotent if some natural-number-power of it equals zero.

Note that we require only the bare minimum assumptions for the definition to make sense. Even monoid_with_zero is too strong since nilpotency is important in the study of rings that are only power-associative.

Equations
theorem is_nilpotent.mk {R : Type u} [has_zero R] [has_pow R ] (x : R) (n : ) (e : x ^ n = 0) :
theorem is_nilpotent.zero {R : Type u} [monoid_with_zero R] :
theorem is_nilpotent.neg {R : Type u} {x : R} [ring R] (h : is_nilpotent x) :
@[simp]
theorem is_nilpotent_neg_iff {R : Type u} {x : R} [ring R] :
theorem is_nilpotent.map {R S : Type u} [monoid_with_zero R] [monoid_with_zero S] {r : R} {F : Type u_1} [monoid_with_zero_hom_class F R S] (hr : is_nilpotent r) (f : F) :
@[class]
structure is_reduced (R : Type u_1) [has_zero R] [has_pow R ] :
Prop

A structure that has zero and pow is reduced if it has no nonzero nilpotent elements.

Instances
@[protected, instance]
@[protected, instance]
theorem is_nilpotent.eq_zero {R : Type u} {x : R} [has_zero R] [has_pow R ] [is_reduced R] (h : is_nilpotent x) :
x = 0
@[simp]
theorem is_nilpotent_iff_eq_zero {R : Type u} {x : R} [monoid_with_zero R] [is_reduced R] :
theorem is_reduced_of_injective {R S : Type u} [monoid_with_zero R] [monoid_with_zero S] {F : Type u_1} [monoid_with_zero_hom_class F R S] (f : F) (hf : function.injective f) [is_reduced S] :
theorem commute.is_nilpotent_add {R : Type u} {x y : R} [semiring R] (h_comm : commute x y) (hx : is_nilpotent x) (hy : is_nilpotent y) :
theorem commute.is_nilpotent_mul_left {R : Type u} {x y : R} [semiring R] (h_comm : commute x y) (h : is_nilpotent x) :
theorem commute.is_nilpotent_mul_right {R : Type u} {x y : R} [semiring R] (h_comm : commute x y) (h : is_nilpotent y) :
theorem commute.is_nilpotent_sub {R : Type u} {x y : R} [ring R] (h_comm : commute x y) (hx : is_nilpotent x) (hy : is_nilpotent y) :
def nilradical (R : Type u_1) [comm_semiring R] :

The nilradical of a commutative semiring is the ideal of nilpotent elements.

Equations
theorem mem_nilradical {R : Type u} {x : R} [comm_semiring R] :
theorem nilradical_eq_Inf (R : Type u_1) [comm_semiring R] :
nilradical R = Inf {J : ideal R | J.is_prime}
theorem nilpotent_iff_mem_prime {R : Type u} {x : R} [comm_semiring R] :
is_nilpotent x ∀ (J : ideal R), J.is_primex J
theorem nilradical_le_prime {R : Type u} [comm_semiring R] (J : ideal R) [H : J.is_prime] :
@[simp]
theorem nilradical_eq_zero (R : Type u_1) [comm_semiring R] [is_reduced R] :
@[simp]
theorem algebra.is_nilpotent_lmul_left_iff (R : Type u) {A : Type v} [comm_semiring R] [semiring A] [algebra R A] (a : A) :
@[simp]
theorem algebra.is_nilpotent_lmul_right_iff (R : Type u) {A : Type v} [comm_semiring R] [semiring A] [algebra R A] (a : A) :