Corollary 6.1:

Any irreducible hole or twist in M implies P ≠ NP under polynomial embeddings.

Application(s):

Computational Complexity: Classify NP-hardness via genus and curvature rather than search trees.