Question: is np closed under union?
Answer: NP is the class of languages with polynomial-size membership proofs. P ⊆ NP still holds: If I can decide membership in polynomial time, I do not need a certificate. NP is closed under union, intersection, and concatenation; but is not known to be closed under complement.