Primary decomposition: Compatibility, independence and linear growth
نویسندگان
چکیده
منابع مشابه
Primary Decomposition: Compatibility, Independence and Linear Growth
For finitely generated modules N ( M over a Noetherian ring R, we study the following properties about primary decomposition: (1) The Compatibility property, which says that if Ass(M/N) = {P1, P2, . . . , Ps} and Qi is a Pi-primary component of N ( M for each i = 1, 2, . . . , s, then N = Q1 ∩Q2 ∩ · · · ∩Qs; (2) For a given subset X = {P1, P2, . . . , Pr} ⊆ Ass(M/N), X is an open subset of Ass(...
متن کاملThe Compatibility, Independence, and Linear Growth Properties
The first part is about primary decomposition. After reviewing the basic definitions, we survey the compatibility, independence, and linear growth properties that have been known. Then, we prove the linear growth property of primary decomposition for a new family of modules. In the remaining sections, we study secondary representation, which can be viewed as a dual of primary decomposition. Cor...
متن کاملPrimary Decomposition Ii: Primary Components and Linear Growth
We study the following properties about primary decomposition over a Noetherian ring R: (1) For finitely generated modules N ⊆ M and a given subset X = {P1, P2, . . . , Pr} ⊆ Ass(M/N), we define an X-primary component of N ( M to be an intersection Q1 ∩ Q2 ∩ · · · ∩ Qr for some Pi-primary components Qi of N ⊆ M and we study the maximal X-primary components of N ⊆ M ; (2) We give a proof of the ...
متن کاملWronskians and Linear Independence
Obviously, a family of linearly dependent functions has a zero Wronskian. Many standard textbooks on differential equations (e.g., [10, Chap. 5, §5.2], [22, Chap. 1, §4], [9, Chap. 3, §7]) contain the following warning: linearly independent functions may have an identically zero Wronskian! This seems to have been pointed out for the first time by Peano [20, 21], who gave the example of the pair...
متن کاملThe critical independence number and an independence decomposition
An independent set Ic is a critical independent set if |Ic|−|N(Ic)| ≥ |J | − |N(J)|, for any independent set J . The critical independence number of a graph is the cardinality of a maximum critical independent set. This number is a lower bound for the independence number and can be computed in polynomial-time. Any graph can be decomposed into two subgraphs where the independence number of one s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2001
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-01-06284-0