If you are a big enough fool to have looked at OO, and in particular the first step, you know that the analysis is independent of any implementation.

Therefore the analysis (OOA) is independent also of the language used for the analysis. This kind of recursion is (like a Moebius transformation) a fundamental property of computational "objects' which are subject to such rules of analysis.

All objects in OO are in a problem domain which is bounded by the problem class, and by the classes of machine available to encode the implementation. Encoding the Moebius transformation is an implementation of an OO analysis - which is encoded in a language which is freely chosen (does this sound familiar?).

So far the score is: one determined critic with nothing meaningful to say, a masked man from Los Alamos, and a math undergrad who went looking for math, and couldn't find it!

Here's the thing though - the cube is always mathematical, you can disagree with it, but it only has ONE solution, all the same. There is no math in a cube either, for the mathematically confused. This is located in a neural network between your ears.