Convexity in cristallographical lattices

A subset of a (cristallographical) lattice ⁿ is called convex whenever it is the intersection of the lattice with a convex set of the affine space containing ⁿ. We give a characterization of the convex sets which is intrinsic to the lattice and do the same for other related notions, e.g. the boundary of a convex set of ⁿ. A statement analogous to Helly's theorem is also proved.