An arithmetical theorem for partially ordered sets

The simplest multiplicative systems in which arithmetical ideas can be defined are semigroups. For such systems irreducible (prime) elements can be introduced and conditions under which the fundamental theorem of arithmetic holds have been investigated (Clifford (3)). After identifying associates, the elements of the semigroup form a partially ordered set with respect to the ordinary division relation. This suggests the possibility of an analogous arithmetical result for abstract partially ordered sets. Although nothing corresponding to product exists in a partially ordered set, there is a notion similar to g.c.d. This is the meet operation, defined as greatest lower bound. Thus irreducible elements, namely those elements not expressible as meets of proper divisors can be introduced. The assumption of the ascending chain condition then implies that each element is representable as a reduced meet of irreducibles. The central problem of this thesis is to determine conditions on the structure of the partially ordered set in order that each element have a unique such representation.

Part I contains preliminary results and introduces the principal tools of the investigation. In the second part, basic properties of the lattice of ideals and the connection between its structure and the irreducible decompositions of elements are developed. The proofs of these results are identical with the corresponding ones for the lattice case (Dilworth (2)). The last part contains those results whose proofs are peculiar to partially ordered sets and also contains the proof of the main theorem.

On an embedding property of generalized Carter subgroups

If E and F are saturated formations, we say that E is strongly contained in F if for any solvable group G with E-subgroup, E, and F-subgroup, F, some conjugate of E is contained in F. In this paper, we investigate the problem of finding the formations which strongly contain a fixed saturated formation E.

Our main results are restricted to formations, E, such that E = {G|G/F(G) ϵT}, where T is a non-empty formation of solvable groups, and F(G) is the Fitting subgroup of G. If T consists only of the identity, then E=N, the class of nilpotent groups, and for any solvable group, G, the N-subgroups of G are the Carter subgroups of G.

We give a characterization of strong containment which depends only on the formations E, and F. From this characterization, we prove:

If T is a non-empty formation of solvable groups, E = {G|G/F(G) ϵT}, and E is strongly contained in F, then

(1) there is a formation V such that F = {G|G/F(G) ϵV}.

(2) If for each prime p, we assume that T does not contain the class, S_p’, of all solvable p’-groups, then either E = F, or F contains all solvable groups.

This solves the problem for the Carter subgroups.

We prove the following result to show that the hypothesis of (2) is not redundant:

If R = {G|G/F(G) ϵS_r’}, then there are infinitely many formations which strongly contain R.