Product of sums (POS) form: Visual walkthrough — Hardware deep dive

Before any algebra, three plain-English words we will use constantly:

Step 1 — Draw the function as a strip of lights

WHAT: Lay the 8 rows of a 3-variable function in a row, each shown as a lamp: bright = output $1$ , dark = output $0$ .

WHY: Before we manipulate symbols, we must see what a function is. It is a pattern of on/off lamps — that pattern is the entire content of the function. Everything else (SOP, POS, gates) is just a way to reproduce this exact pattern of lamps.

PICTURE: The strip below is our running example. Lamps at rows $0, 2, 5$ are dark (forbidden); the other five glow.

$the function F (3 input switches A, B, C) = lamp on 1 everywhere except rows dark lamps 0, 2, 5$

$F$ — the whole machine, one output bit per row.
$A, B, C$ — the three switches; their on/off pattern is the row number in binary.
$0, 2, 5$ — the row numbers we must force dark.

Step 2 — Zoom into ONE forbidden row and ask a smaller question

WHAT: Forget the whole strip. Point at just one dark lamp — say row $5$ , which is $A = 1, B = 0, C = 1$ . Ask: can I build a tiny gadget that is dark at this exact row and bright at all 7 others?

WHY: A hard problem (control 8 lamps) becomes 8 easy problems (control 1 lamp each), which we then combine. This "solve one, then glue" move is the heart of the derivation.

PICTURE: One dark lamp spotlighted; the other seven greyed out — we are ignoring them for now.

The gadget we want is a sum term — an OR of the three variables (each possibly flipped). Why an OR? Because of one magic property we unpack next.

Step 3 — The magic property of OR: it is dark at exactly ONE spot

WHAT: Recall what OR does. $(X + Y + Z)$ means "output $1$ if any input is $1$ ". Flip that around: it outputs $0$ only when every input is $0$ at the same time — a single, lonely combination.

WHY THIS TOOL: We need a gadget dark at exactly one row. OR is the only 3-input gate whose output is $0$ for precisely one input combination (all-zeros) and $1$ for the other seven. That single-zero shape is exactly the lamp pattern we want — so OR is the natural building block, not AND (AND has the opposite single-one shape, which is the tool SOP uses — see Sum of products (SOP) form).

PICTURE: Truth table of a plain OR drawn as lamps: seven bright, one dark at the top (all-zeros input).

$(= 0 X + = 0 Y + = 0 Z) = 0 but any other row gives at least one 1 \Rightarrow output 1$

So a raw OR is dark at its all-zeros row. But our forbidden row $5$ is $A = 1, B = 0, C = 1$ — not all zeros. Step 4 fixes the aim.

Step 4 — Aim the dark spot by flipping the 1-variables

WHAT: We want the inside of the OR to read all-zeros precisely at row $5$ . Plug in $A = 1, B = 0, C = 1$ and demand each literal equal $0$ there:

$A = 1$ , but we need $0$ → feed in $\overset{ˉ}{A}$ (the flip of $A$ ), because $\overset{ˉ}{1} = 0$ . ✓
$B = 0$ , already $0$ → feed in plain $B$ . ✓
$C = 1$ , need $0$ → feed in $\overset{ˉ}{C}$ . ✓

WHY: A literal is $0$ when it evaluates to $0$ . To make the whole OR collapse to $0$ at that chosen row, each literal must be $0$ at that row — which forces us to complement every variable that is $1$ in the row, and leave the $0$ -variables alone. That is the entire maxterm rule, and here you see why it must be so.

PICTURE: Row $5$ 's bits $1, 0, 1$ on top; below, each bit turns into a literal $\overset{ˉ}{A}, B, \overset{ˉ}{C}$ ; arrows show each literal evaluating to $0$ ; the OR at the bottom lights dark.

$M_{5} = (flip: A was 1 \overset{ˉ}{A} + keep: B was 0 B + flip: C was 1 \overset{ˉ}{C})$

$M_{5}$ — the maxterm for row $5$ : dark at row $5$ , bright everywhere else.
The bar $ˉ$ — "flip this bit". Used only on variables that were $1$ in the row.

Step 5 — Build one maxterm per forbidden row

WHAT: Repeat Step 4 for every dark lamp. Our forbidden rows are $0, 2, 5$ :

Row	$A B C$	flip the 1's →	Maxterm
0	$000$	nothing is $1$	$M_{0} = (A + B + C)$
2	$010$	only $B$ is $1$	$M_{2} = (A + \overset{ˉ}{B} + C)$
5	$101$	$A$ and $C$ are $1$	$M_{5} = (\overset{ˉ}{A} + B + \overset{ˉ}{C})$

WHY: Each maxterm is a marksman assigned to one lamp. $M_{0}$ darkens only row $0$ ; $M_{2}$ only row $2$ ; $M_{5}$ only row $5$ . None of them touches the other rows — those stay bright ( $1$ ) through that term.

PICTURE: Three strips stacked. Strip $M_{0}$ : one dark lamp at row 0. Strip $M_{2}$ : one dark lamp at row 2. Strip $M_{5}$ : one dark lamp at row 5. Everything else bright in each strip.

Step 6 — Glue the marksmen together with AND

WHAT: Combine the three strips into one output using AND: $F = M_{0} \cdot M_{2} \cdot M_{5}$ .

WHY AND (not OR)? AND outputs $1$ only if every input is $1$ ; a single $0$ anywhere drags the whole product to $0$ . So at any row, the final lamp is dark if any one marksman is dark there. Since $M_{0}$ is dark at row $0$ (others bright), the product is dark at row $0$ . Same for rows $2$ and $5$ . At every non-forbidden row all three marksmen are bright, so the product is bright. The dark-lamp pattern of the product is exactly ${0, 2, 5}$ — the function we drew in Step 1.

PICTURE: The three single-dark strips fed into an AND; the output strip below is dark at exactly rows $0, 2, 5$ — an exact copy of the Step 1 strip.

$F = dark at row 0 (A + B + C) \cdot dark at row 2 (A + \overset{ˉ}{B} + C) \cdot dark at row 5 (\overset{ˉ}{A} + B + \overset{ˉ}{C})$

Step 7 — Why this equals $\prod M_{i}$ (the formal engine)

WHAT: Show the picture-story is identical to the algebra $F = \prod_{i : F = 0} M_{i}$ .

WHY: The pictures are a proof, but the standard route uses De Morgan's theorems. Define $\overset{ˉ}{F}$ = the machine that is bright exactly where $F$ is dark. Then $\overset{ˉ}{F}$ 's bright rows are ${0, 2, 5}$ , so as an OR-of-minterms (SOP): $\overset{ˉ}{F} = m_{0} + m_{2} + m_{5}$ . Now flip both sides:

$F = \overline{\overset{ˉ}{F}} = \overline{m_{0} + m_{2} + m_{5}} = De Morgan \overline{m_{0}} \cdot \overline{m_{2}} \cdot \overline{m_{5}} = M_{0} M_{2} M_{5}$

$\overline{\dots}$ — De Morgan turns a sum's complement into a product of complements (OR flips to AND).
$\overline{m_{i}} = M_{i}$ — the complement of a minterm is the matching maxterm (a single-dark strip is the flip of a single-bright strip).

PICTURE: Left: $\overset{ˉ}{F}$ as a strip bright only at $0, 2, 5$ . A big "flip everything" arrow. Right: $F$ dark only at $0, 2, 5$ . Below, the OR-list becomes an AND-list.

$F = i : F = 0 \prod M_{i}$

The $\prod$ (capital pi) just says "AND together"; the subscript " $i : F = 0$ " says "one factor for each dark lamp".

Step 8 — Edge & degenerate cases (never leave a gap)

WHAT & WHY: A rule you only tested on the nice case is not a rule. Three corners:

PICTURE: Three mini-strips — all-bright, all-dark, and a single-dark function.

No dark lamps ( $F \equiv 1$ ): the set ${i : F = 0}$ is empty. An empty product is $1$ (ANDing nothing constrains nothing). So $F = 1$ — correct: a light that never turns off.
All lamps dark ( $F \equiv 0$ ): every row is forbidden, so you AND all $8$ maxterms $M_{0} M_{1} \dots M_{7}$ . Their product is $0$ everywhere — correct.
A single dark lamp (say only row 3): POS is just one factor, $F = M_{3} = (A + \overset{ˉ}{B} + \overset{ˉ}{C})$ . A "product" of one term is that term — no AND gate needed, just one OR gate. See Logic gates.
Shortcut degenerate literal: if a variable is absent from the problem it never appears complemented or plain — but in canonical POS every variable must appear in every maxterm exactly once (true or barred). That is what makes each term hit exactly one row.

The one-picture summary

$dark lamps {0, 2, 5} one maxterm each, flip the 1’s M_{0}, M_{2}, M_{5} AND F = \prod M (0, 2, 5)$

Recall Feynman: the whole walkthrough in plain words

A function is a strip of lamps. Most are on; a few are off — those are the "bad" combos. For each bad combo I hire a marksman (a maxterm): I take that combo's on/off pattern and, inside an OR, I flip every switch that was ON so the OR reads all-zeros only there — meaning it goes dark at that one combo and stays bright everywhere else. I hire one marksman per bad combo. Then I wire all marksmen in series with AND, so if any one is dark the final lamp is dark. Result: dark at exactly the bad combos, bright everywhere else — a perfect copy of the original strip. The tidy name for "AND of these single-dark OR-gadgets" is $F = \prod M_{i}$ , product over the rows where $F = 0$ . To prove it formally: describe the complement $\overset{ˉ}{F}$ (bright where $F$ is dark) as a sum of minterms, then De Morgan flips the whole thing — the sum becomes a product and each minterm becomes its maxterm. That is POS, built from nothing but lamps and one flip.

OR is

0

for exactly one input combination (all its literals

0

), matching the "one dark lamp" shape we need.

Complement every variable that is

1

in the row; that makes each literal

0

at that row, so the OR reads all-zeros and goes dark exactly there.

An empty product is

1

; that is the always-on function

F \equiv 1

(no forbidden rows).

Connections

Product of sums (POS) form — the parent this walkthrough derives.
Sum of products (SOP) form — the mirror image (single-bright strips, AND-terms).
Minterms and maxterms — the single-lamp atoms used in every step.
De Morgan's theorems — the engine of Step 7.
Truth tables — the lamp strip is a truth table.
Karnaugh maps — grouping the dark lamps yields simplified POS.
Logic gates — the final AND-of-ORs picture is a two-level circuit.