We introduce a novel take on sum-of-squares that is able
to reason with complex numbers and still make use of polynomial inequalities.
This proof system might be of independent interest since it
allows to represent multivalued domains both with Boolean and Fourier
encoding. We show degree and size lower bounds in this system for a
natural generalization of knapsack: the vanishing sums of roots of unity.
These lower bounds naturally apply to polynomial calculus as-well.