A condition in the tree

 The Markov m-tuple:

(x1^2 + x2^2 + xm^2) = m times their product.

The m times, that is a required partition, m separate energy levels, m equivalent reconfigurations of the color operator. My goal was to get the handle on superposition within one M-tuple. This is where is connects.

So, take the operator for 1,y,z; The 1 is spin, there is only one configuration of the operator symmetrical; about spin. There are about a third of the configurations center around charge, and double that for the magnetic.  So, the partition ratio is an m-ary digit, it bumps around an imaginary center axis, in angle 1/m. There is a Markov matrix, a collapse of three Markov nodes and it should work a lot like the quark matrix.

That partition operator is hiding Planck deviations, spreading them around distinct kinetic axis and causing curvature. It manages the toe jam between Markov color layers.  

N, total Avogadro,  is not known, N suffers Planck's uncertainty, hence the kinetic energy and the color operators will be leaky.  If I look closely enough I will find two step jumps on that tree and find the jump distribution has to maximize entropy. I know where on the 3 tuples the quarks hang. But I always wish the young kids beat me to it.

m is a triple digit, it stays inside a three step orbit, never counts ,ore than one. Some how that fractional digit maintains three partitioned energy levels by optimum  placement of deviations and keeping Ito  conditions, over the finite round off sequence.  N uncertainty in self sampled systems makes for kinetic energy, the under sampling phenomena when there is no Godot.   Excess deviations in one configuration, restarts the operator about the current color. That is what makes kinetic energy, pushing the bulge around three different energy states, fooling each of them separately.

Note, I am still playing with my three adapting, partially connected binomials.  Take this path, seriously.  Connected, adapting binomials not necessarily fair coin tosses. It covers all the angles, so to speak. It does not fake being closed, corrals chaos as best known. The idea is that adding one more binomial is jump from an m tuple to an m+1 triple.  Each tie we add a relative prime we knock out one more moment in the system. So the relative base is going to be 1/m, or m, depending if you are going to one from zero or infinity.

Transitions on that tree has a minimal path, depending on how recent we dumped a Planck error.   Higher up the 3-tuples, the opportunities for stuffing Planck deviations without blowing a hole, increase. But there is a finite limit on any m-tuple tree, a point of maximum entropy that cannot be continued without another relative prime.