I-filtrations of modules

This file contains the definitions and basic results around (stable) I-filtrations of modules.

Main results

• Ideal.Filtration: An I-filtration on the module M is a sequence of decreasing submodules N i such that ∀ i, I • (N i) ≤ N (i + 1). Note that we do not require the filtration to start from ⊤.
• Ideal.Filtration.Stable: An I-filtration is stable if I • (N i) = N (i + 1) for large enough i.
• Ideal.Filtration.submodule: The associated module ⨁ Nᵢ of a filtration, implemented as a submodule of M[X].
• Ideal.Filtration.submodule_fg_iff_stable: If F.N i are all finitely generated, then F.Stable iff F.submodule.FG.
• Ideal.Filtration.Stable.of_le: In a finite module over a noetherian ring, if F' ≤ F, then F.Stable → F'.Stable.
• Ideal.exists_pow_inf_eq_pow_smul: Artin-Rees lemma. given N ≤ M, there exists a k such that IⁿM ⊓ N = Iⁿ⁻ᵏ(IᵏM ⊓ N) for all n ≥ k.
• Ideal.iInf_pow_eq_bot_of_isLocalRing: Krull's intersection theorem (⨅ i, I ^ i = ⊥) for noetherian local rings.
• Ideal.iInf_pow_eq_bot_of_isDomain: Krull's intersection theorem (⨅ i, I ^ i = ⊥) for noetherian domains.

structure Ideal.Filtration {R : Type u_1} [CommRing R] (I : Ideal R) (M : Type u_3) [AddCommGroup M] [Module R M] : Type u_3

An I-filtration on the module M is a sequence of decreasing submodules N i such that I • (N i) ≤ N (i + 1). Note that we do not require the filtration to start from ⊤.

• N : ℕ → Submodule R M
• mono (i : ℕ) : self.N (i + 1) ≤ self.N i
• smul_le (i : ℕ) : I • self.N i ≤ self.N (i + 1)

theorem Ideal.Filtration.ext {R : Type u_1} {inst✝ : CommRing R} {I : Ideal R} {M : Type u_3} {inst✝¹ : AddCommGroup M} {inst✝² : Module R M} {x y : I.Filtration M} (N : x.N = y.N) : x = y

theorem Ideal.Filtration.pow_smul_le {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) (i j : ℕ) : I ^ i • F.N j ≤ F.N (i + j)

theorem Ideal.Filtration.pow_smul_le_pow_smul {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) (i j k : ℕ) : I ^ (i + k) • F.N j ≤ I ^ k • F.N (i + j)

theorem Ideal.Filtration.antitone {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) : Antitone F.N

def Ideal.trivialFiltration {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) (N : Submodule R M) : I.Filtration M

The trivial I-filtration of N.

Equations

• I.trivialFiltration N = { N := fun (x : ℕ) => N, mono := ⋯, smul_le := ⋯ }

@[simp]

theorem Ideal.trivialFiltration_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) (N : Submodule R M) (x✝ : ℕ) : (I.trivialFiltration N).N x✝ = N

instance Ideal.Filtration.instMax {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : Max (I.Filtration M)

The sup of two I.Filtrations is an I.Filtration.

Equations

• Ideal.Filtration.instMax = { max := fun (F F' : I.Filtration M) => { N := F.N ⊔ F'.N, mono := ⋯, smul_le := ⋯ } }

instance Ideal.Filtration.instSupSet {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : SupSet (I.Filtration M)

The sSup of a family of I.Filtrations is an I.Filtration.

Equations

• Ideal.Filtration.instSupSet = { sSup := fun (S : Set (I.Filtration M)) => { N := sSup (Ideal.Filtration.N '' S), mono := ⋯, smul_le := ⋯ } }

instance Ideal.Filtration.instMin {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : Min (I.Filtration M)

The inf of two I.Filtrations is an I.Filtration.

Equations

• Ideal.Filtration.instMin = { min := fun (F F' : I.Filtration M) => { N := F.N ⊓ F'.N, mono := ⋯, smul_le := ⋯ } }

instance Ideal.Filtration.instInfSet {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : InfSet (I.Filtration M)

The sInf of a family of I.Filtrations is an I.Filtration.

Equations

• Ideal.Filtration.instInfSet = { sInf := fun (S : Set (I.Filtration M)) => { N := sInf (Ideal.Filtration.N '' S), mono := ⋯, smul_le := ⋯ } }

instance Ideal.Filtration.instTop {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : Top (I.Filtration M)

Equations

• Ideal.Filtration.instTop = { top := I.trivialFiltration ⊤ }

instance Ideal.Filtration.instBot {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : Bot (I.Filtration M)

Equations

• Ideal.Filtration.instBot = { bot := I.trivialFiltration ⊥ }

@[simp]

theorem Ideal.Filtration.sup_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F F' : I.Filtration M) : (F ⊔ F').N = F.N ⊔ F'.N

@[simp]

theorem Ideal.Filtration.sSup_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (S : Set (I.Filtration M)) : (sSup S).N = sSup (Ideal.Filtration.N '' S)

@[simp]

theorem Ideal.Filtration.inf_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F F' : I.Filtration M) : (F ⊓ F').N = F.N ⊓ F'.N

@[simp]

theorem Ideal.Filtration.sInf_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (S : Set (I.Filtration M)) : (sInf S).N = sInf (Ideal.Filtration.N '' S)

@[simp]

theorem Ideal.Filtration.top_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : ⊤.N = ⊤

@[simp]

theorem Ideal.Filtration.bot_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : ⊥.N = ⊥

@[simp]

theorem Ideal.Filtration.iSup_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {ι : Sort u_3} (f : ι → I.Filtration M) : (iSup f).N = ⨆ (i : ι), (f i).N

@[simp]

theorem Ideal.Filtration.iInf_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {ι : Sort u_3} (f : ι → I.Filtration M) : (iInf f).N = ⨅ (i : ι), (f i).N

instance Ideal.Filtration.instCompleteLattice {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : CompleteLattice (I.Filtration M)

Equations

• Ideal.Filtration.instCompleteLattice = Function.Injective.completeLattice Ideal.Filtration.N ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯

instance Ideal.Filtration.instInhabited {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} : Inhabited (I.Filtration M)

Equations

• Ideal.Filtration.instInhabited = { default := ⊥ }

def Ideal.Filtration.Stable {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) : Prop

An I filtration is stable if I • F.N n = F.N (n+1) for large enough n.

Equations

• F.Stable = ∃ (n₀ : ℕ), ∀ n ≥ n₀, I • F.N n = F.N (n + 1)

def Ideal.stableFiltration {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) (N : Submodule R M) : I.Filtration M

The trivial stable I-filtration of N.

Equations

• I.stableFiltration N = { N := fun (i : ℕ) => I ^ i • N, mono := ⋯, smul_le := ⋯ }

@[simp]

theorem Ideal.stableFiltration_N {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) (N : Submodule R M) (i : ℕ) : (I.stableFiltration N).N i = I ^ i • N

theorem Ideal.stableFiltration_stable {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) (N : Submodule R M) : (I.stableFiltration N).Stable

theorem Ideal.Filtration.Stable.exists_pow_smul_eq {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} (h : F.Stable) : ∃ (n₀ : ℕ), ∀ (k : ℕ), F.N (n₀ + k) = I ^ k • F.N n₀

theorem Ideal.Filtration.Stable.exists_pow_smul_eq_of_ge {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} (h : F.Stable) : ∃ (n₀ : ℕ), ∀ n ≥ n₀, F.N n = I ^ (n - n₀) • F.N n₀

theorem Ideal.Filtration.stable_iff_exists_pow_smul_eq_of_ge {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} : F.Stable ↔ ∃ (n₀ : ℕ), ∀ n ≥ n₀, F.N n = I ^ (n - n₀) • F.N n₀

theorem Ideal.Filtration.Stable.exists_forall_le {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F F' : I.Filtration M} (h : F.Stable) (e : F.N 0 ≤ F'.N 0) : ∃ (n₀ : ℕ), ∀ (n : ℕ), F.N (n + n₀) ≤ F'.N n

theorem Ideal.Filtration.Stable.bounded_difference {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F F' : I.Filtration M} (h : F.Stable) (h' : F'.Stable) (e : F.N 0 = F'.N 0) : ∃ (n₀ : ℕ), ∀ (n : ℕ), F.N (n + n₀) ≤ F'.N n ∧ F'.N (n + n₀) ≤ F.N n

def Ideal.Filtration.submodule {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) : Submodule (↥(reesAlgebra I)) (PolynomialModule R M)

The R[IX]-submodule of M[X] associated with an I-filtration.

Equations

• F.submodule = { carrier := {f : PolynomialModule R M | ∀ (i : ℕ), f i ∈ F.N i}, add_mem' := ⋯, zero_mem' := ⋯, smul_mem' := ⋯ }

@[simp]

theorem Ideal.Filtration.mem_submodule {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) (f : PolynomialModule R M) : f ∈ F.submodule ↔ ∀ (i : ℕ), f i ∈ F.N i

theorem Ideal.Filtration.inf_submodule {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F F' : I.Filtration M) : (F ⊓ F').submodule = F.submodule ⊓ F'.submodule

def Ideal.Filtration.submoduleInfHom {R : Type u_1} (M : Type u_2) [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) : InfHom (I.Filtration M) (Submodule (↥(reesAlgebra I)) (PolynomialModule R M))

Ideal.Filtration.submodule as an InfHom.

Equations

• Ideal.Filtration.submoduleInfHom M I = { toFun := Ideal.Filtration.submodule, map_inf' := ⋯ }

theorem Ideal.Filtration.submodule_closure_single {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) : AddSubmonoid.closure (⋃ (i : ℕ), ⇑(PolynomialModule.single R i) '' ↑(F.N i)) = F.submodule.toAddSubmonoid

theorem Ideal.Filtration.submodule_span_single {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) : Submodule.span (↥(reesAlgebra I)) (⋃ (i : ℕ), ⇑(PolynomialModule.single R i) '' ↑(F.N i)) = F.submodule

theorem Ideal.Filtration.submodule_eq_span_le_iff_stable_ge {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) (n₀ : ℕ) : F.submodule = Submodule.span (↥(reesAlgebra I)) (⋃ (i : ℕ), ⋃ (_ : i ≤ n₀), ⇑(PolynomialModule.single R i) '' ↑(F.N i)) ↔ ∀ n ≥ n₀, I • F.N n = F.N (n + 1)

theorem Ideal.Filtration.submodule_fg_iff_stable {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} (F : I.Filtration M) (hF' : ∀ (i : ℕ), (F.N i).FG) : F.submodule.FG ↔ F.Stable

If the components of a filtration are finitely generated, then the filtration is stable iff its associated submodule of is finitely generated.

theorem Ideal.Filtration.Stable.of_le {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} [IsNoetherianRing R] [Module.Finite R M] (hF : F.Stable) {F' : I.Filtration M} (hf : F' ≤ F) : F'.Stable

theorem Ideal.Filtration.Stable.inter_right {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} (F' : I.Filtration M) [IsNoetherianRing R] [Module.Finite R M] (hF : F.Stable) : (F ⊓ F').Stable

theorem Ideal.Filtration.Stable.inter_left {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {I : Ideal R} {F : I.Filtration M} (F' : I.Filtration M) [IsNoetherianRing R] [Module.Finite R M] (hF : F.Stable) : (F' ⊓ F).Stable

theorem Ideal.exists_pow_inf_eq_pow_smul {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) [IsNoetherianRing R] [Module.Finite R M] (N : Submodule R M) : ∃ (k : ℕ), ∀ n ≥ k, I ^ n • ⊤ ⊓ N = I ^ (n - k) • (I ^ k • ⊤ ⊓ N)

Artin-Rees lemma

theorem Ideal.mem_iInf_smul_pow_eq_bot_iff {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) [IsNoetherianRing R] [Module.Finite R M] (x : M) : x ∈ ⨅ (i : ℕ), I ^ i • ⊤ ↔ ∃ (r : ↥I), ↑r • x = x

theorem Ideal.iInf_pow_smul_eq_bot_of_isLocalRing {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) [IsNoetherianRing R] [IsLocalRing R] [Module.Finite R M] (h : I ≠ ⊤) : ⨅ (i : ℕ), I ^ i • ⊤ = ⊥

@[deprecated Ideal.iInf_pow_smul_eq_bot_of_isLocalRing (since := "2024-11-12")]

theorem Ideal.iInf_pow_smul_eq_bot_of_localRing {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (I : Ideal R) [IsNoetherianRing R] [IsLocalRing R] [Module.Finite R M] (h : I ≠ ⊤) : ⨅ (i : ℕ), I ^ i • ⊤ = ⊥

Alias of Ideal.iInf_pow_smul_eq_bot_of_isLocalRing.

theorem Ideal.iInf_pow_eq_bot_of_isLocalRing {R : Type u_1} [CommRing R] (I : Ideal R) [IsNoetherianRing R] [IsLocalRing R] (h : I ≠ ⊤) : ⨅ (i : ℕ), I ^ i = ⊥

Krull's intersection theorem for noetherian local rings.

@[deprecated Ideal.iInf_pow_eq_bot_of_isLocalRing (since := "2024-11-12")]

theorem Ideal.iInf_pow_eq_bot_of_localRing {R : Type u_1} [CommRing R] (I : Ideal R) [IsNoetherianRing R] [IsLocalRing R] (h : I ≠ ⊤) : ⨅ (i : ℕ), I ^ i = ⊥

Alias of Ideal.iInf_pow_eq_bot_of_isLocalRing.

---

Krull's intersection theorem for noetherian local rings.

theorem Ideal.isIdempotentElem_iff_eq_bot_or_top_of_isLocalRing {R : Type u_3} [CommRing R] [IsNoetherianRing R] [IsLocalRing R] (I : Ideal R) : IsIdempotentElem I ↔ I = ⊥ ∨ I = ⊤

Also see Ideal.isIdempotentElem_iff_eq_bot_or_top for integral domains.

@[deprecated Ideal.isIdempotentElem_iff_eq_bot_or_top_of_isLocalRing (since := "2024-11-12")]

theorem Ideal.isIdempotentElem_iff_eq_bot_or_top_of_localRing {R : Type u_3} [CommRing R] [IsNoetherianRing R] [IsLocalRing R] (I : Ideal R) : IsIdempotentElem I ↔ I = ⊥ ∨ I = ⊤

Alias of Ideal.isIdempotentElem_iff_eq_bot_or_top_of_isLocalRing.

---

Also see Ideal.isIdempotentElem_iff_eq_bot_or_top for integral domains.

theorem Ideal.iInf_pow_eq_bot_of_isDomain {R : Type u_1} [CommRing R] (I : Ideal R) [IsNoetherianRing R] [IsDomain R] (h : I ≠ ⊤) : ⨅ (i : ℕ), I ^ i = ⊥

Krull's intersection theorem for noetherian domains.