Provide a comprehensive theoretical analysis of the P vs NP problem. Define the classes P and NP formally, explain the concept of polynomial time reduction, and discuss the implications of P either equaling or not equaling NP for cryptography, optimization, and mathematical proof verification.