The sets of compressible elements

Look at:
(1+x^n)^2 - (1-x^-n)^2 = L

The terms on the left, what are they? Two things, a compact representation of the probability tree, and two bubbles, one slightly compressed and one slightly expanded. They are set up to maintain the equipartition by the constrained flow balance.

So the flow condition implies a fractal knowledge of the graph that is maintained by exchanges. The indices,n, are the number of compressible modes available to the set of bubble.  But set theory is maintained as long as the compression of the queues follows the compressed mode.  This is the key in going from probability of picking a graph to probability of passing a node on a graph. its is the key element in the toe when the information contrivance is removed.  We need the set theory for this.

Echanges are 'paced' to maintain set types.  The pacing is done by the second derivative of Tanh and Coth, these are partial elements. They pace the balance equation between two surfaces, and that makes sequential causal, we get space and time; and we get sequence spectrums.