Weak solutions to flow equations

Some exflow conditions exciting work on  continuous equations of two sided flow. Relates to what we do, I read a bit, and the proof seems to be analogous with sandbox. They deal with non compressible fluids. We don't.


Does the new proof use rational approximation, tending toward the limit? Yes, in a way that we might do with generators that have increasing rank.  As rank increases, is there systematic decrease in bit error. A systematic decrease means a minimum path, making the series of generator changes unique.

Time, in this case, is a recursive algorithm that systematically subdivides index space. That would be a polynomial that follows the current index space and can be systematically morphed into another polynomial which increasingly subdivides indices. Look at the equivalent polynomial that tracks the path of bit error as rank increases, see if that polynomial blows up. If not, your recursive algorithm is working.

Now this is the part where I decide, does it matter? Yes, kind of interesting. But I am not the pro,  I went as far as reviewing the Napier-Stokes, and understanding this as yet another sphere packing where we relate actions in a volume to measurements on the surface.  Now and then I will thumb through the proof, mainly top find ideas to steal, for us sandboxers.