The following theorem provides further insight into what takes place at peak complexity of closed system.
What this shows is that at peak complexity, the number of entries of the adjacency matrix in C=f(S; E), i.e. n, starts to decrease. NB, we’re not saying that the maximum value of complexity corresponds to a global maximum. Basically, before a peak in complexity is reached, the system is building up structure. The moment complexity peaks, structure starts to dissolve.