D321 · Symbol Reference

The Decoder Ring
for Math Symbols

Every symbol explained with a shape-based memory hook. Click any card to unlock the full breakdown.

Set Theory ∪ ∩ ∈ ⊆ ∅ A'
∪
Union
\cup
Everything in A, or B, or both
memory hook + examples
🪣 Shape Hook: "U = United bucket" The ∪ looks like a bucket or cup. It collects everything — pour both sets in, keep everything. No throwing anything away.
Examples
{1,2,3} ∪ {3,4,5} = {1,2,3,4,5} → dump both buckets together (no duplicates)
A ∪ A' = U → A plus everything-not-A = the whole universe
A ∪ ∅ = A → A plus nothing = still just A
∩
Intersection
\cap
Only what's in BOTH A and B
memory hook + examples
⛺ Shape Hook: "∩ = tent / roof — only what shelters under BOTH" Flip the ∪ upside down. Now it's a tent or an arch. It only protects what's underneath both sets. If something is only in A but not B, it's out in the rain.
Examples
{1,2,3} ∩ {3,4,5} = {3} → only 3 lives in both sets
A ∩ A' = ∅ → A AND not-A simultaneously = nothing can satisfy that
A ∩ U = A → A overlapping with everything = still just A
∈
Element of
\in
This thing IS inside that set
memory hook + examples
🚪 Shape Hook: "∈ = a thing walking through a door into a set" It's like a warped "E" or an arrow pointing right into a curved wall. The thing on the left is entering the set on the right. It belongs there.
Examples
3 ∈ {1, 2, 3, 4} → "3 is a member of this set" ✓
(x, y) ∈ Knows → "the pair (x,y) exists in the Knows relation"
5 ∉ {1, 2, 3} → ∉ = NOT element of (door is blocked)
⊆
Subset of
\subseteq
Every item in A is also in B
memory hook + examples
🐣 Shape Hook: "⊆ = a smaller C inside a bigger one, with a floor" The curve opens toward the bigger set. Think of it like ≤ but for sets — "contained in or equal to." The line under it means "or exactly equal." ⊂ (no line) means strictly smaller.
Examples
{1,2} ⊆ {1,2,3,4} → every item in the left set is in the right set ✓
A ⊆ U → any set is a subset of the universal set
M ∩ A ⊆ M → American mathematicians are still mathematicians
A′
Complement
A' \text{ or } \bar{A}
Everything in U that is NOT in A
memory hook + examples
🔄 Memory Hook: "The ' flips the set inside-out" The apostrophe (prime) after a set name means: take the whole universe U and remove A. What's left is A'. Also written as Ā (A with a bar on top) or ¬A in logic.
Examples
If A = {cats}, then A' = {everything that is NOT a cat} → dogs, tables, stars, you... everything except cats
A ∪ A' = U     A ∩ A' = ∅ → A and not-A together = everything; A and not-A overlap = nothing
(A')' = A → flip it twice = back to the original (double complement)
∅
Empty Set
\emptyset
The set that contains nothing
memory hook + examples
🚫 Shape Hook: "∅ = a zero with a slash — zero things inside" Also written as {} or { }. It's a valid set — it just happens to be completely empty. Think of it as an empty box. Very different from 0 (which is a number, not a set).
Examples
A ∩ A' = ∅ → nothing can be in A AND not-A at the same time
A ∪ ∅ = A → adding nothing to A changes nothing
A ∩ ∅ = ∅ → intersecting with nothing gives nothing
Logic Connectives → ↔ ∧ ∨ ¬
→
Implies / If…Then
\rightarrow
If A is true, then B must be true
memory hook + examples
🚦 Memory Hook: "The arrow FORCES traffic one way" A → B means: if you're in A, you must end up in B. It's a one-way guarantee. It doesn't say anything about what happens if you're NOT in A.

Critical translation: A → B = A' ∪ B ("either A is false, or B is true — one of those must hold")
Examples
"It rains" → "the ground is wet" → If it rained, ground must be wet. (Ground could be wet for other reasons too.)
A → B = A' ∪ B → this is the implication law — KEY for Q11!
A → B = B' → A' → contrapositive: same meaning, direction flipped (and both negated)
↔
Biconditional / If and only if
\leftrightarrow
A is true exactly when B is true
memory hook + examples
↔ Memory Hook: "Two-way street — both must agree" ↔ is two → arrows pointing both ways. A ↔ B means A → B AND B → A. They rise and fall together. If A is true, B is true. If A is false, B is false. Also called "iff" (if and only if).
Examples
A ↔ B = (A → B) ∩ (B → A) → both directions must hold
"You pass iff you score ≥ 60" → pass→score≥60 AND score≥60→pass (they're equivalent)
∧
Logical AND
\wedge \text{ or } \cdot
Both A and B must be true
memory hook + examples
🏔 Shape Hook: "∧ = a mountain — you need to climb BOTH sides" It looks like an uppercase A without the crossbar, or a mountain peak. Both conditions must be true to reach the top. In circuit diagrams this is the AND gate. In set theory, ∧ corresponds to ∩.
Examples
"Raining" ∧ "Cold" → bring umbrella AND coat → both must be true for the whole thing to be true
In sets: A ∧ B ≡ A ∩ B → AND in logic = intersection in set theory
∨
Logical OR
\vee \text{ or } +
At least one of A or B is true
memory hook + examples
🪂 Shape Hook: "∨ = a V or a parachute — either side can carry you" The opposite of ∧. Flip the mountain upside down — now it's a valley or a V. Either path works. Only fails if BOTH are false. In set theory, ∨ corresponds to ∪.
Examples
"Sunny" ∨ "Warm" → go outside → either one (or both!) being true is enough
In sets: A ∨ B ≡ A ∪ B → OR in logic = union in set theory
A → B = A' ∨ B = A' ∪ B → implication uses OR/union under the hood
¬
Logical NOT
\neg \text{ or } ' \text{ or } \bar{A}
Flips true↔false
memory hook + examples
↩ Memory Hook: "¬ = a hook that pulls things back to the opposite" ¬A means "not A." In set notation it's A' (prime) or Ā (bar). They all mean the same thing: flip it. True becomes false, false becomes true. In 1's complement binary, NOT flips every bit.
Examples
¬True = False    ¬False = True → complete reversal
¬A = A' = Ā → all three notations mean the same thing
De Morgan: ¬(A ∧ B) = ¬A ∨ ¬B → NOT(A AND B) = NOT-A OR NOT-B
💡
Quick cheat: De Morgan's Laws These let you "push" a NOT inside parentheses. The rules: flip ∩↔∪ and distribute the NOT.
(A ∩ B)' = A' ∪ B'    "NOT(both) = NOT-A or NOT-B"  |  (A ∪ B)' = A' ∩ B'    "NOT(either) = NOT-A and NOT-B"
Relational Algebra π σ ⋈ ×
🎓
Your Professor's Trick (expanded) Think of a database table as a spreadsheet. Columns are the types of data (Name, Age, City). Rows are the actual records (Alice, 30, NYC). Relational algebra operators let you slice and dice those tables.
π
Projection
\pi
Pick which COLUMNS you want
memory hook + examples
📊 Your Professor's Hook: "π = pick columns" π projects down onto selected columns — like a projector shining light only on part of the table. The subscript tells you which columns to keep. You get back a narrower table (fewer columns), same rows.

Think of π like SELECT in SQL — "give me only these fields."
Examples
π₁(Knows) → keep only column 1 (the "knower") from the Knows relation
π_{Name,Age}(People) → from the People table, return only the Name and Age columns
π₁(Knows ⋈ (A ∩ M)) → after joining, grab just the first column = the "people who know American mathematicians"
σ
Selection
\sigma
Filter which ROWS you want
memory hook + examples
🔍 Your Professor's Hook: "σ = search rows (like a sieve)" σ looks like a 6 with a slash — imagine it as a filter or sieve. It keeps only the rows that pass a condition. You get back a shorter table (fewer rows), same columns.

Think of σ like WHERE in SQL — "only give me rows where this condition is true."
Examples
σ_{Age > 30}(People) → return only rows where Age > 30
σ_{City = "NYC"}(People) → return only New Yorkers from the People table
π_{Name}(σ_{Age>30}(People)) → first filter rows (σ), then pick columns (π) — like SQL WHERE then SELECT
⋈
Natural Join
\bowtie
Combine two tables on matching values
memory hook + examples
🎀 Shape Hook: "⋈ = bow-tie — two tables meet in the middle" The bowtie shape shows two things merging at a point. A join takes two relations (tables) and combines rows that "match" on shared columns or conditions. The result has columns from both tables.

Think of ⋈ like JOIN in SQL.
Examples
Knows ⋈ (A ∩ M) → pair up Knows with American Mathematicians — rows where the "known person" is in A∩M
Students ⋈ Grades → combine student info with their grades, matched by student ID
×
Cross Product / Cartesian Product
\times
Every possible pairing of rows from both tables
memory hook + examples
🎲 Memory Hook: "× = every combination, like a menu" A × B gives you every possible (a, b) pair where a is from A and b is from B. If A has 3 rows and B has 4 rows, A × B has 12 rows. It's used to define relations and joins in formal math. Also appears as U×U in the Knows relation definition.
Examples
{1,2} × {a,b} = {(1,a),(1,b),(2,a),(2,b)} → every combination of one item from each set
Knows ⊆ U × U → Knows is a subset of all possible (person, person) pairs
Quantifiers ∀ ∃
∀
For All / Universal Quantifier
\forall
This is true for EVERY single item
memory hook + examples
🔃 Shape Hook: "∀ = upside-down A — All starts with A" It's literally an upside-down A — for All. When you see ∀x, read it as "for every possible x." The statement after it must hold for every single member of the set, no exceptions.
Examples
∀x ∈ A: x is a person → every element of A is a person (no exceptions)
"Philosophers who ONLY know mathematicians" uses ∀ → for ALL y that p knows, y must be a mathematician
∃
There Exists / Existential Quantifier
\exists
At least one item makes this true
memory hook + examples
🔎 Shape Hook: "∃ = backwards E — Exists starts with E" It's a mirror-image E, for Exists. When you see ∃x, read it as "there is at least one x such that..." You only need ONE example where the condition is true for the whole statement to hold.
Examples
∃x ∈ A ∩ M: person knows x → "there is at least one American mathematician that this person knows"
∀ vs ∃: "All dogs bite" vs "Some dog bites" → ∀ needs every case to work; ∃ just needs one
🗺️
The Logic ↔ Set ↔ SQL Rosetta Stone
Logic Sets Plain English
A ∧ BA ∩ BA AND B (both)
A ∨ BA ∪ BA OR B (either)
¬AA'NOT A (flip it)
A → BA' ∪ BIf A then B
∀x P(x)every elementFor ALL x
∃x P(x)at least one elementThere EXISTS an x
π (projection)pick columnsSQL SELECT
σ (selection)filter rowsSQL WHERE