Skip to content
BetterDL

Implicate

Also called: implicates, prime implicate, prime implicates

A sum term that is 0 only on rows where the function is 0: the POS counterpart of an implicant. A prime implicate cannot lose any literal.

An implicate is the dual of an implicant. A sum term S is an implicate of F if S = 0 forces F = 0. In other words, every row where S is 0 is a 0 of F. (Equivalently, F implies S: whenever F = 1, S = 1.)

A prime implicate is an implicate that stops being one if you remove any literal. Removing a literal from a sum doubles the rows where it is 0, and for a prime implicate that always takes in a 1 of F.

They play exactly the role for POS that prime implicants play for SOP:

  • Every factor of a minimal pos is a prime implicate.
  • You find them by combining adjacent maxterms, the 0s of F.
  • You then choose a cheapest set that covers every 0.

So on a Karnaugh map, grouping the 0s finds prime implicates, just as grouping the 1s finds prime implicants. Many courses simply say "group the 0s" and skip the word, but you will meet it in textbooks.

Worked example

Example

Testing a sum term

F(A, B, C) = ΠM(0, 2). Is an implicate? Is it prime?

  1. 1.

    is 0 when A = 0 and C = 0: pattern 0-0, rows 0 and 2.

  2. 2.

    Both are 0s of F, so is an implicate.

  3. 3.

    Drop C: A is 0 on rows 0–3, but rows 1 and 3 are 1s of F. Drop A: C is 0 on rows 0, 2, 4, 6, but 4 and 6 are 1s.

  4. 4.

    So is a prime implicate, and here F = .

Common mistakes

  • Reading a sum term's zero rows with product polarity.

  • Mixing up the roles: implicants cover 1s (for SOP), implicates cover 0s (for POS).

Practice Implicate

Interactive questions with instant feedback and a worked solution for every wrong answer.

Learn it step by step

Implicate is taught in Boolean Simplification.