Intuition The one core idea
A Boolean function is a lamp that is either ON (1 ) or OFF (0 ) for every possible setting of its switches. Product of Sums (POS) describes that lamp by listing the few settings that turn it OFF and wiring one "guard" per bad setting so that any single guard tripping forces the lamp off.
This page builds every symbol the POS note leans on — from the digit 0 all the way to the giant ∏ — with a picture for each. If a word in the parent note ever made you pause, its meaning is built here, in order, from nothing.
Definition Bit-ordering convention (used everywhere below)
Throughout this page the leftmost variable is the most significant bit (MSB) . So in a 3 -variable function we always write the switches in the order A B C , with A carrying the biggest weight and C the smallest. Keep this order fixed — it is what makes a row's number well-defined (section 5).
We also read them as words: 1 = true / ON / yes , and 0 = false / OFF / no . Same idea, different costume.
A variable (like A , B , C ) is a named switch that holds one Boolean value. Right now it might be 0 ; a moment later 1 .
Picture: a labelled toggle switch. Its position is its value.
Why the topic needs it: a Boolean function's inputs are its variables. POS points at specific rows, and a row is nothing but a particular setting of these named switches — so we cannot even name a "bad row" without variables to hold its values.
Definition Complement (the bar)
The bar on top, A ˉ , means "==the opposite of A =". If A = 1 then A ˉ = 0 ; if A = 0 then A ˉ = 1 .
Picture: below. The bar is a mirror that flips the lamp.
Figure s01 — the bar as a mirror. The figure shows two situations stacked. Top row: a switch A = 1 (glowing amber lamp) reflected across the dashed cyan "mirror" into A ˉ = 0 (dark lamp). Bottom row: A = 0 (dark) reflects into A ˉ = 1 (glowing). The amber arrow is the act of flipping. Read it as: the bar takes whatever the lamp is doing and swaps it.
Intuition Why the bar matters for POS
Building a maxterm is all about flipping : you write A ˉ exactly when the switch A is ON in the bad row. Without the bar you cannot force a term to 0 . Look at the mirror in the figure — the whole POS trick is choosing which literals to reflect.
A literal is just "a variable, possibly barred": A is a literal, A ˉ is a literal. That is the smallest brick.
The plus and dot signs in ( A + B + C ) and M 0 ⋅ M 2 are not ordinary arithmetic. They are logic gates.
⋅ (or nothing at all)
A ⋅ B (often just A B ) is 1 only when every input is 1 . If any input is 0 , the result is 0 .
Picture: two switches in series — the current must pass through both.
Why the topic needs it: POS ANDs its sum terms together. Because any single 0 drags an AND to 0 , ANDing lets each term "veto" the output at its own bad row while staying out of the way everywhere else.
Figure s02 — OR is parallel, AND is series. Top half: two switches A and B on parallel wires feeding one lamp — either switch closing completes a path, so the lamp lights easily (shown ON). Bottom half: the same two switches on a single series wire — the current must pass through both , so if either is open the lamp is dark (shown OFF). This picture is the physical meaning of the two formulas that follow.
+ is not addition
Why it feels wrong: 1 + 1 should be 2 . The fix: here 1 + 1 = 1 — OR saturates at 1 . There is no "2 " in a two-value world; the lamp is just ON.
A row is one complete choice of values for every variable, e.g. A = 1 , B = 0 , C = 1 (written in our fixed A B C order).
Picture: all the toggle switches frozen in one snapshot.
With 3 variables there are 2 × 2 × 2 = 8 possible rows. With n variables, 2 n rows.
A truth table is the full list of every row paired with the output the function gives there. See Truth tables .
Picture: a ledger — left columns are switch positions, the last column is the lamp.
Why the topic needs it: POS reads its recipe off this table by pointing at the rows where the last column is 0 .
Each row also gets a number . We get it by reading the switch values as a binary number using the convention from the very top: A (leftmost) is the high bit, C (rightmost) the low bit.
A = 1 , B = 0 , C = 1
1 ⋅ 4 + 0 ⋅ 2 + 1 ⋅ 1 = 4 + 0 + 1 = 5 . This is row 5 — the row that produced M 5 in the parent note.
Figure s03 — reading a row as a number. Three cyan-outlined buckets are labelled with the switch values A = 1 , B = 0 , C = 1 and their place-values 4 , 2 , 1 . A bucket is filled amber only when its switch is 1 (so the A and C buckets glow, the B bucket stays empty). The amber tallies below add to the single number written at the bottom: 4 + 0 + 1 = 5 . This is precisely how a switch-snapshot becomes one index.
Intuition Why numbers at all?
Instead of writing "the row where A = 1 , B = 0 , C = 1 " we just say "5 ". The shorthand ∏ M ( 0 , 2 , 5 ) is only readable once you can turn a switch-snapshot into a single number. The figure shows the place values doing exactly that.
These are the atoms behind both forms — Minterms and maxterms is their home page.
m i (small m )
An AND of every variable, each appearing once. Which form of each literal? Use the plain literal A where the variable is 1 in row i , and the barred literal A ˉ where it is 0 . Chosen this way, every literal in the AND is 1 only at row i , so the whole AND is 1 at row i and 0 at every other row.
Picture: a spotlight aimed at one single row of the table.
Example: for row A = 1 , B = 0 , C = 1 the minterm is m 5 = A B ˉ C (plain A , barred B , plain C ).
M i (big M )
An OR of every variable, each appearing once. Which form of each literal? This is the mirror of the minterm rule: use the barred literal A ˉ where the variable is 1 in row i , and the plain literal A where it is 0 . Chosen this way, every literal in the OR is 0 only at row i , so the whole OR is 0 at row i and 1 at every other row.
Picture: the whole table lit, with one single row punched dark.
Example: for row A = 1 , B = 0 , C = 1 the maxterm is M 5 = A ˉ + B + C ˉ (barred A , plain B , barred C ).
Why the topic needs it: POS is a product of maxterms — one "dark punch" per row where the function is 0 .
Common mistake Confusing which is which
Fix: big M / Max term is mostly 1 (its max is what you see); small m / min term is mostly 0 with one lonely 1 . POS uses M . Note the literal rules are opposites: minterm bars the 0 s, maxterm bars the 1 s.
F ˉ
F ˉ is a new function that is 1 wherever F = 0 , and 0 wherever F = 1 . The whole lamp-ledger flipped.
Picture: photographic negative of the truth table's output column.
Why the topic needs it: the parent's key derivation writes F ˉ as a sum of minterms (its 1 -rows are F 's 0 -rows), then flips back with De Morgan's theorems to land on the POS.
∏ (capital Pi)
∏ means "==AND all of these together=", just as it says "multiply all of these" in ordinary maths. Here multiply is AND.
Picture: a chain of AND gates linking every listed maxterm in series.
i : F = 0 ∏ M i reads: "AND together the maxterm M i for each row i where F = 0 ."
Shorthand: ∏ M ( 0 , 2 , 5 ) just lists those row numbers.
∑ (capital Sigma)
∑ is the twin of ∏ : it means "==OR all of these together=" (its everyday job is "add them all", and here addition is OR). So ∑ m i is a chain of ORs over the listed minterms — a sum of products. See Sum of products (SOP) form .
Worked example Watch the flip happen (rows
0 , 2 , 5 have F = 0 )
F ˉ is 1 exactly at rows 0 , 2 , 5 , so as a sum of minterms:
F ˉ = m 0 + m 2 + m 5 .
Now flip both sides and let De Morgan turn the outer OR into an AND of complements:
F = m 0 + m 2 + m 5 = m 0 ⋅ m 2 ⋅ m 5 .
Each m i is the maxterm M i (a minterm complemented is a maxterm — an AND-of-literals becomes, by De Morgan, an OR-of-flipped-literals):
F = M 0 ⋅ M 2 ⋅ M 5 = ∏ M ( 0 , 2 , 5 ) .
Why this is the whole point: a sum of minterms of F ˉ mechanically becomes a product of maxterms of F . The F = 0 rows we started with are exactly the row numbers in ∏ M .
Function complement F-bar
Cover the right side and answer each. If any stumps you, re-read its section above before opening the POS note .
What are the only two values a Boolean quantity can take? 0 and 1 (OFF and ON) — nothing in between.
What does the bar in A ˉ do? Flips the value: A ˉ = 0 when A = 1 , and A ˉ = 1 when A = 0 .
When is an OR (+ ) equal to 0 ? Only when every input inside it is 0 .
When is an AND (⋅ ) equal to 0 ? When any single input is 0 .
Does 1 + 1 = 2 in Boolean algebra? No — OR saturates, so 1 + 1 = 1 .
Which variable is the most significant bit in a row? The leftmost one — we fix the order A B C with A as MSB.
How do you turn the row A = 1 , B = 0 , C = 1 into a row number? 1 ⋅ 4 + 0 ⋅ 2 + 1 ⋅ 1 = 5 .
In a minterm, which literals are barred? The variables that are 0 in that row (so every literal is 1 there).
In a maxterm M i , which literals are barred? The variables that are 1 in that row (so every literal is 0 there).
What is a maxterm M i in one line? An OR of all variables that is 0 at exactly row i and 1 everywhere else.
How does F ˉ relate to F ? F ˉ is 1 exactly where F = 0 (the flipped output column).
Read ∏ M ( 0 , 2 , 5 ) aloud. AND together the maxterms for rows 0 , 2 and 5 — the rows where F = 0 .
Which term is mostly 1 : minterm m i or maxterm M i ? The maxterm M i (big M , mostly 1 ).