Moreau Decomposition Theorem applied Danskin Envelope Theorem applied NP-Complete Language Criterion for P = NP applied CNF-SAT Is NP-Complete applied Downward Closure of $\mathrm{P}$ Under Polynomial-Time Many-One Reductions applied Cayley-Hamilton Formula for the Matrix Exponential applied State-Space Realization Transfer Function Formula applied Polynomial-Time Algorithm for an NP-Hard Language Implies $P = NP$ applied