Theorems · Theorem · commutative algebra
Submodule.exists_minimal_isPrimary_decomposition_of_isPrimary_decomposition
∀ {R : Type u_1} {M : Type u_2} [inst : CommSemiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M]
{N : Submodule R M} {s : Finset (Submodule R M)},
s.inf id = N →
(∀ ⦃J : Submodule R M⦄, J ∈ s → J.IsPrimary) →
∃ t,
t.inf id = N ∧
(∀ ⦃J : Submodule R M⦄, J ∈ t → J.IsPrimary) ∧
(↑t).Pairwise (Function.onFun (fun x1 x2 => x1 ≠ x2) fun J => (J.colon Set.univ).radical) ∧
∀ ⦃J : Submodule R M⦄, J ∈ t → ¬(t.erase J).inf id ≤ J- Defined in
- Mathlib.RingTheory.Lasker
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- CommSemiringstatement and proof · cited by 10,911
- SetLike.coestatement and proof · cited by 8,199
- Submodulestatement and proof · cited by 7,192
- Idealstatement and proof · cited by 4,748
- Set.univstatement and proof · cited by 3,945
- Function.onFunstatement and proof · cited by 570
- Finset.erasestatement and proof · cited by 455
- Set.Pairwisestatement and proof · cited by 321
- Finset.infstatement and proof · cited by 219
Cited by2
Results whose statement or proof uses this declaration.
- Submodule.IsLasker.exists_isMinimalPrimaryDecompositionproof · cited by 2
- Ideal.exists_minimal_isPrimary_decomposition_of_isPrimary_decompositionproof · cited by 0