Diagrams for Positive Bases
Diagrams for Positive Bases
复制标题
正碱基图
DOI:
10.1112/jlms/s2-4.1.165
复制
发表时间:
1971
影响因子:
1.2
通讯作者:
G. C. Shephard
中科院分区:
文献类型:
--
作者:
G. C. Shephard
The theory of positive bases is a useful tool in the study of convexity. In this paper we describe a representation of a positive basis of a finite-dimensional linear space, which is analogous to that of a poly tope by a Gale diagram (see [4, §5.4 and §6.3; 7, Chapter 3]). The basic idea is implicit in the work of Chandler Davis [2] but, as we now have the advantage of experience in the use of diagram techniques in the study of polytopes, we are able to use the method in a much more powerful manner. Many of the basic results about positive bases, when expressed in terms of diagrams, become obvious geometric statements. For example, the fact that if X is a positive basis of R n , then card X < 2n (see [2; Theorem 6.7]) is equivalent, in the diagram of X, to the statement that every A>polytope has at least k + l vertices (see Theorem 4). Again, we shall show how a diagram enables us to pick out from X, in a very simple manner, all its subsets which span minimal subspaces. (For the definition of " minimal subspace " see §2.) Besides reducing the labour of proving many standard results, the use of a diagram gives much greater insight into the structure of a positive basis. It seems possible that this technique will prove a powerful tool in future investigations. I am indebted to Dr. P. McMullen for his comments on an early version of this paper, and, in particular, for drawing my attention to the use of diagrams in proving one of Reay's theorems (Theorem 10).