The Setting
Take a simple graph on a finite vertex set , with edge set , and place on each edge a subspace of a finite-dimensional vector space over a field . A vertex sees only the subspaces on the edges at , and every edge is seen from its two endpoints. The question is how large the dimension of the span of all the can be against the dimensions of the spans seen at the vertices, and what the families look like for which the comparison is tight.
Local Spans and Independence
The local span at a vertex is the subspace of spanned by the subspaces on the edges at : (1)✦ The local dimensions and the global dimension of the family are (2)
A family of subspaces of is independent if each member meets the sum of the other members only in the zero space, (3) in which case is a direct sum, written . Members equal to never break independence.
The Claim
Theorem 1. Let be a simple graph on a finite vertex set with edge set , let be a finite-dimensional vector space over a field , and let be a family of subspaces of , with local dimensions and global dimension as in (2). Then (4)✦ If the family is not independent, then (5)✦ If equality holds in (4), then the family is independent: (6)✦
In the paper, the result reads: for subspaces assigned to distinct pairs of a simple graph, with and as in (2), , and if the nonzero do not form a direct sum.
What Is Checked
The claims (4), (5) and (6) are stated over any family of subspaces of a finite-dimensional vector space over a field indexed by the edges of a simple graph on a finite vertex set, and over the local spans (1) of that family at the vertices.