Consider the lattice L of the contradictions of a simple graph G (as sets of vertex pairs) with respect to inclusion. Let n≥1 be an arbitrary integer. Show that the identity x⋀(i=0⋁nyi)=j=0⋁nx⋀0≤i≤n,i=j⋁yi holds if and only if G has no cycle of size at least n+2 .
Let K be a convex cone in the n -dimensional real vector space Rn , and consider the sets A=K∪(−K) and B=(Rn∖A)∪{0} ( 0 is the origin). Show that one can find two subspaces in Rn such that together they span Rn , and one of them lies in A and the other lies in B .
Let U be a real normed space such that, for an finite-dimensional, real normed space X,U contains a subspace isometrically isomorphic to X . Prove that every (not necessarily closed) subspace V of U of finite codimension has the same property. (We call V of finite codimension if there exists a finite-dimensional subspace N of U such that V+N=U .)