Provide a rigorous theoretical explanation of the P vs NP problem. Differentiate between problems solvable in polynomial time and those whose solutions are verifiable in polynomial time. Discuss the catastrophic implications for cryptography, optimization, and mathematics if P were proven to equal NP, versus the status quo if P does not equal NP.