AuT and Universal expansion: 2 of 2; places and pies

It was asked, how do we get the base equation for compression and while it is covered, here is some additional explanation.
To understand how the F-series stacking affects this, let’s look at the F-series Stack.  This involves the consistent solution that means 1,11,111 leads to 2,22,222 and 3,33,333 and 5,55,555.  What this means is that the F-series remains in place no matter how many places are used; for example what we call the one’s place, the ten’s place (11) and the 100’s place 111.  However, we already know that the base 10 system is a fallacy in AuT.  The result is that the 1’s place corresponds to n=1 and the F-series equal to (0+1+1).  The 10’s place corresponds to n=2 and (1+1+2).  The 100’s place corresponds to N=3 and the base is (1+2+3) and the 1000’s place (1111) for ct 4 corresponds to N=4 and the base is (2+3+5).   Hence, unlike our simple algebra that we learn in school, the F-series universe has a base which changes for each place; starting with base 2, then base 4, then base 6, then base 10 and for ct5, base 16 (3+5+8).  Since the amount of information that changes for each place includes all of the information for each other place in the series it is raised to the power of 2^n to get the full compression required for each solution.

While this explains part of the equation, it doesn't explain curvature which comes from the development of pi (see the picture in formal press release) by defining the positive and negative quantum states which build out sequentially and offset to provide the pos-pos, pos-neg, neg-neg, neg-pos, before getting back to the beginning and building outward to progressively more complicated, or more multisided versions of the basic quantum elements which yields the different versions of pi

As shown by the figure below for ct2, this pi is considerably different from the circular version taht we are used to dealing with since in to dimensions, corresponding to two places of solution and a base of 4, pi has a considerably different makeup, presumably from the figure below a positive and a negative arm, which when folded yileds a positive/negative, negative positive fair which can be folded again (compressed again or solved for another "place" or "simultaneous coordinate" to ultimately yield the building block for quantum pi shown in the figure above.

                   One of the advantages of the intersecting F-series model is that it yields a fairly precise model and measure for compression.  While the “rate” of expansion is at approximately 161.8% for the F-series, the overlap aspect of compression occurs at a rate of approximately 55% of the "intersecting spirals" which would vary depending on the value informational compression of the F-series (1,11,111,etc) of pi affecting the intersection. 

            It is noteworthy that F(pix) diverges at this same rate initially on its way to a convergence at 1 (F(pix) begins convergence between .5555… and 140% and the overlap rate converges toward 0.552786405… and begins at 40%.

            The rates of the positive and negative aspects of pix isolated converge towards 1 from either side, the  from .777… and (1.2 if you use 1 as the initial positive) 1.08.

            Similarly, the positive and negative values of f(pluspix) vary from .555… toward 90% and from .42857 towards 90% respectively.

            All convergence are, of necessity infinite because of the definition of the equations.

            Similarly, the convergence of positive and negative values for pi can be treated this way:

            Using 1, the Positives converge towards zero from 1 (or .8 without 1) with a rate that begins at .80 and converges on 10% and the negatives begin at -1.333… and converges on -10%.  The difference in the rate of convergence of the positive an negative also converge on zero and start around 12.698% and move almost immediately to around 5.594%.

            These positive and negative results can be used in the algorithm to generate overlap, inflection points and compression.

            The algorithm suggested by the existence of inflection points of positive and negative results, whether with a spiral model or otherwise, is that the alternating solutions cause the overlap in conjunction with the f-series solutions to the length of any one solution.
Are you ready to order a book now?  Bring it by, I'll sign it!