Submodule

The definition of a block given here is really a bottom-up definition, building large blocks fran smaller subblocks. When one actually constructs a block structured program, one proceeds top-down - first defining the role of the outermost block (what process it is to realize), then that of its immediate subblocks, and so forth. A single node (labelled by a process for which one intends to build a submodule) can be considered a block. The equivalence of the top-down and bottom-up definitions can be justified by the block replacement lemma, stated without proof. 

Modules Design-time units of development work Design decisions hidden in work units (packages) refinements used for submodule decompositions justifications, including rationale for choices made and choices rejected... 

CdTe (thin film submodule) 10,6 AIGaAs/GaAs 28,6... 

The first assertion follows from (3.5) because every BH is free, being a submodule of a free module. If tKs) is an isomorphism It follows from (3.3) that KH - ZJ+1 is free, conversely, If Hi is free then, by (3.4), ti(s)... 

Consider the module consisting of all lists of the form (ej, e2 2,..., r 5Bt) where the e, are integers and, ..., is a set of chemical elements sufficient for the universe of discourse. This may consist of atomic species, indecomposable molecules or radicals. We note in passing that this is the direct sum of the t submodules for which... 

Proof. Considering that intersections of submodules are submodules, this follows from Theorem 8.1.1 together with Lemma 8.1.3. 

A submodule L of the 17-module M different from M is called maximal if L and M are the only submodules of M containing L (as a subset). 

The 77-module M is called irreducible if 0 is a maximal submodule of M. Note that 0 is not an irreducible 77-module. 

Let us now assume that K + L = M, and let II be a submodule of M such that K C H. Then, referring to the group correspondence we obtain from Lemma 2.2.1 that... 

The module M is called completely reducible if, for each submodule L of M, there exists a submodule K of M such that K L = M. 

Since M is assumed to be completely reducible, there exists a submodule H of M such that H K = M. 

Proof. Let m be an element in M 0. Then, by Zorn s Lemma, there exists a maximal element L in the set of all submodules of M not containing m. Since M is assumed to be completely reducible, M possesses a submodule K such that K L = M. 

---