Results 1-3 of 79
The set 5) may be finite or infinite, but a linear combination (see 99) must have
only a finite number of nonzero terms. If the subspace spanned by the set 5) is U
itself, then S) is called a spanning set or generating system of U. If U is spanned
The most general finite distributive lattice may be constructed by a simple
generalization of Skolem's theorem. Namely, L is assumed to be any finite
distributive lattice, and A is assumed to be the set of all properly join-irreducible
elements of L; ...
If a group G is generated by r elements, G = ( bt, □ • • , br), and if for a fixed n, x" =
1 for every element of G, is G necessarily finite? If Fr = (^a„ • □ □ , ar~) is the free
group with r generators and if K= Kn is the subgroup of F generated by x" for ...
What people are saying - Write a review
The New Encyclopaedia Britannica (Encyclopaedia)User Review - Not Available - Book Verdict
For virtually all its 238 years,Britannica has ruled the shelves as a peerless general encyclopedia. Reviewers have consistently given it high marks for most of the 12 criteria identified inKister's ... Read full review