is also a valid phrase formed by taking the difference of two overlapping phrases, which makes k 1 a valid binary split point for n. This makes T 1 either an edge formed by the binary split at k 1 , or not a minimal phrase.
whenever we have two minimal edges, both consist of a binary split.