Chapter 9, Part 1 - Unclear Proof


In in the 20th minute Guy prooves that every f can be expressed as a sum of its minterms.
In the second part, assuming f(v) = 0 (when v is a binary string), Guy claims that for every p in Min(f), the truth assignment for p is 0, hence the sum of all minterms is 0 as well.

But, if p belongs to Min(f) - doesn’t it implies that the truth assignment for p is 1?
We defined Min(f) as the set of all p’s that output 1.

Can you help me understand this confusing part?


BTW if I may ask to update the English-Hebrew glossary so we can gain a deeper understanding of the new definition and terms (examples: preimage, minterm, product etc.)

A minterm is satisfied by exactly one truth assignment.
Min(f) is the set of all minterms p_v , where f(v)=1.
Gloassary updated.