3.1.9 · D1Boolean Algebra & Logic Gates

Foundations — Sum of products (SOP) form

1,745 words8 min readBack to topic

Before you can read the parent note on SOP form, you must own every symbol it throws at you. This page builds each one from absolute zero, in the order they depend on each other. Nothing is used before it is drawn.


0. The atom: a bit (0 and 1)

The picture: a light switch. It is either OFF () or ON (). That is the entire universe we work in.

A variable like , , is just a named box that holds one bit. When we say "" we mean "the box called currently holds ON".


1. NOT — the flip ( )

Why the topic needs it: SOP terms must be able to say "this input was OFF". The only way to write " was " as something that equals 1 is to flip it: equals exactly when . That flip is the "zero gets a hat" rule in the parent note.

The picture: a switch wired to an inverter — press ON, the bulb goes OFF.


2. AND — everybody must agree ( , written by touching )

The picture: two switches wired in series (one after the other). Current reaches the bulb only if switch 1 AND switch 2 are both closed. Break either one and the bulb dies.

Why the topic needs it: each "row-detector" in SOP is an AND of literals. AND is the tool that answers the question "were ALL of these conditions true at once?" — no other single operation asks that.


3. OR — anybody will do ( )

The picture: two switches wired in parallel (side by side). Current has two paths to the bulb, so closing either switch lights it. Both open = dark.

Why the topic needs it: SOP glues the row-detectors together with OR. OR answers the question "did ANY winning combination happen?" — which is exactly what "the output is 1 on these rows" means.


4. Literal — a variable in either dress

Think of it as a switch you can wire "normally" (fires when pressed) or "inverted" (fires when not pressed). A product term is built entirely out of literals.


5. Truth table — the full behaviour chart

The picture: an odometer counting in binary. Two variables → rows: . Three variables → rows.

Why the topic needs it: SOP is read directly off this table — you pick the rows where the output is . See Truth Tables for the full construction.

Recall Why

rows? Each variable has 2 choices, and the choices are independent, so total combinations .


6. Putting the symbols in order — the minterm

Now that NOT, AND, OR, literal and truth table exist, the parent's central object costs nothing:


The shorthand

The large (sigma) is not arithmetic summation here — it means "OR all of these together", matching part 3.


How every foundation feeds SOP

Bit 0 or 1

Variable A B C

NOT bar flip

Literal plain or barred

AND product all true

Minterm one row detector

Truth table all rows

Rows where output is 1

OR sum any true

SOP form

Read it top-down: bits make variables; NOT and AND turn variables into minterms; the truth table tells you which minterms to build; OR joins them into SOP.


Equipment checklist

Test yourself — reveal only after answering aloud.

A bit can hold which values
only and , nothing else.
means
the opposite bit — NOT ; , (not "minus A").
AND () outputs when
every input is (all true); it matches arithmetic multiplication of 0s and 1s.
OR () outputs when
at least one input is ; note , not .
A literal is
a variable in plain () or complemented () form.
A truth table with variables has how many rows
, because each variable doubles the combinations.
A minterm is
an AND of every variable once; plain if the variable is in that row, barred if .
Why a minterm fires on exactly one row
its AND needs all its literals to be simultaneously, which happens for one input combination only.
means
OR together the minterms belonging to truth-table rows , , and .
Outer operator of SOP is
OR (the "sum").

Connections