@Liad: f is in I := < f_i | i > iff. f is congruent 0 mod I.
f(x_1,...,x_n) = f( x_1, x_1^2, ..., x_1^n) mod I
So you now need to check that f(x_1, x_1^2 ..., x_1^n) = 0 mod I.
However, by your assumption on f, the mapping associated to f(x_1, x_1^2, ..., x_1^n) is the zero mapping, and since k is infinite it follows that f(x_1,...,x_1^n) is the zero polynomial (same argument as yesterday, k[x_1] -> Maps(k -> k) is injective.
Hence f = 0 mod I