  We consider the chordal product determinant, a measure of the distance
between two subspaces of the same dimension. In information theory, collections
of elements in the complex Grassmannian are searched with the property that
their pairwise chordal products are as large as possible. We characterize this
function from an statistical perspective, which allows us to obtain bounds for
the minimal chordal product and related energy of such collections.
