Fair enough about asymptotics not being tight (so technically it is right to say it is O(n^3)), but the text is misleading as written, as you notice.  An interesting open theoretical question is whether matrix inversion really is that much harder than addition (i.e., how close to O(n^2) can it get?).