Proofs in Computer Science (Optional) · Certificates
Lesson 5
For example, like this: if you add these three inequalities with coefficients \(1,2,1\), you get the inequality \(0 \ge 1\). Farkas' lemma guarantees that such coefficients can be found for any inconsistent system. Such a set of coefficients can be considered a certificate or proof of the inconsistency of the system.