We give a reduction from {\sc clique} to establish that sparse pca is np-hard. The reduction has a gap which we use to exclude an →