posted 18 Jan 2024
Schwartz-Zippel Lemma
In one of the motivating problems for this course, we discussed utilizing a nondeterministic algorithm to check whether two polynomials are identical.
Schwartz-Zippel Lemma
Suppose is a degree polynomial in
Let be randomly drawn from
Then,
(sketch)
We prove the lemma via induction.
Let be the base case, a degree polynomial has at most real roots, so the probability that hits a root is at most
Otherwise, write
Since the above is nonzero, there exists a nonzero with degree Take the largest
By induction,
Then, is a polynomial with degree , we have that
Through union bound, we have that