Mathematical writing uses a dense symbolic language that can feel impenetrable at first glance. This page is a plain-English reference for every major symbol and convention used throughout this knowledge base. Bookmark it — you will want to come back.
Before diving into specific symbols, here are the patterns that recur everywhere.
Quantifier structure. Most definitions and theorems follow a template:
"For all \(\ldots\), there exists \(\ldots\) such that \(\ldots\)."
This is the backbone of rigorous mathematics. The order matters: "for every \(\varepsilon > 0\) there exists a \(\delta > 0\)" is fundamentally different from "there exists a \(\delta > 0\) such that for every \(\varepsilon > 0\)." The first says "no matter how tight your demand, I can meet it." The second says "I have one fixed answer that works universally."
"If and only if" (iff). Written \(\iff\) or abbreviated "iff," this means two statements are logically equivalent — each one implies the other. When you see "A if and only if B," read it as "A and B are the same condition, just phrased differently."
Subscripts and superscripts. These are labels, not operations:
\(x_n\) — the \(n\)-th element of a sequence (a label)
\(x^2\) — \(x\) raised to the power 2 (an operation)
\(f^{-1}\) — the inverse of \(f\) (not "f to the negative one")
\(a_i^{(k)}\) — the \(i\)-th element in the \(k\)-th iteration (two labels)
Context tells you which meaning applies. When in doubt, look at how the surrounding text uses it.
Parentheses, brackets, braces.
Notation
Typical Meaning
\((a, b)\)
Ordered pair, open interval, or point — depends on context
\([a, b]\)
Closed interval (includes endpoints)
\(\{a, b, c\}\)
A set (unordered collection)
\(f(x)\)
Function \(f\) applied to input \(x\)
\(\langle a, b \rangle\)
Inner product, or sometimes an ordered pair in algebra
These symbols form the language in which all mathematical statements are written. See Layer 0 — Logic for the full treatment.
Symbol
KaTeX
Name
Read As
Example
\(\lnot P\)
\lnot P
Negation
"not P"
\(\lnot\)(it is raining) = it is not raining
\(P \land Q\)
P \land Q
Conjunction
"P and Q"
(it is raining) \(\land\) (I have an umbrella)
\(P \lor Q\)
P \lor Q
Disjunction
"P or Q" (inclusive)
(it is sunny) \(\lor\) (it is windy) — could be both
\(P \to Q\)
P \to Q
Implication
"if P then Q"
(it rains) \(\to\) (the ground is wet)
\(P \leftrightarrow Q\)
P \leftrightarrow Q
Biconditional
"P if and only if Q"
(x is even) \(\leftrightarrow\) (x is divisible by 2)
\(\forall x\)
\forall x
Universal quantifier
"for all x" / "for every x"
\(\forall x \in \mathbb{R},\ x^2 \geq 0\) — every real number squared is non-negative
\(\exists x\)
\exists x
Existential quantifier
"there exists an x"
\(\exists x \in \mathbb{Z},\ x^2 = 4\) — some integer squares to 4
\(\exists! x\)
\exists! x
Unique existence
"there exists exactly one x"
\(\exists! x,\ 2x = 6\) — exactly one solution
\(\Gamma \vdash \varphi\)
\Gamma \vdash \varphi
Syntactic entailment
"from Γ we can derive φ"
The symbol \(\vdash\) means "proves" within a formal system
\(\mathcal{M} \models \varphi\)
\mathcal{M} \models \varphi
Semantic entailment
"M satisfies / models φ"
The symbol \(\models\) means "makes true" in a structure
\(\therefore\)
\therefore
Therefore
"therefore"
\(P \to Q,\ P\ \therefore\ Q\)
Implication vs. Equivalence
\(P \to Q\) is a one-way street: if P is true, Q must be true, but Q being true tells you nothing about P. \(P \leftrightarrow Q\) is two-way: they are true together or false together.
These symbols denote the standard number systems, each extending the previous one. The double-struck (blackboard bold) typeface signals "this is a standard number set." See Layer 2 — Number Systems.
Symbol
KaTeX
Name
Contains
Why It Exists
\(\mathbb{N}\)
\mathbb{N}
Natural numbers
\(\{0, 1, 2, 3, \ldots\}\)
Counting
\(\mathbb{Z}\)
\mathbb{Z}
Integers
\(\{\ldots, -2, -1, 0, 1, 2, \ldots\}\)
\(\mathbb{N}\) cannot express \(3 - 5\)
\(\mathbb{Q}\)
\mathbb{Q}
Rationals
All fractions \(\frac{p}{q}\) with \(q \neq 0\)
\(\mathbb{Z}\) cannot express \(\frac{1}{3}\)
\(\mathbb{R}\)
\mathbb{R}
Real numbers
All points on the number line
\(\mathbb{Q}\) has "gaps" (e.g., \(\sqrt{2} \notin \mathbb{Q}\))
Analysis makes calculus rigorous by replacing intuition about "approaching" and "infinitely small" with precise logical statements. See Layer 5 — Analysis.
Symbol
KaTeX
Name
Read As
Example
\(\lim_{x \to a} f(x) = L\)
\lim_{x \to a} f(x) = L
Limit
"the limit of f(x) as x approaches a is L"
\(\lim_{x \to 0} \frac{\sin x}{x} = 1\)
\(\varepsilon\)
\varepsilon
Epsilon
"epsilon" — an arbitrarily small positive number
"For every \(\varepsilon > 0\)" means "no matter how tiny the tolerance"
\(\delta\)
\delta
Delta
"delta" — a response to epsilon
"there exists \(\delta > 0\)" means "I can find a matching tolerance"
\(f'(x)\) or \(\frac{df}{dx}\)
f'(x) or \frac{df}{dx}
Derivative
"f prime of x" / "d-f d-x"
Rate of change of f at the point x
\(\frac{\partial f}{\partial x}\)
\frac{\partial f}{\partial x}
Partial derivative
"partial f partial x"
Rate of change of f with respect to x, holding other variables fixed
\(\int_a^b f(x)\, dx\)
\int_a^b f(x)\, dx
Definite integral
"the integral of f from a to b"
Area under the curve of f between a and b
\(\oint_C f\, dz\)
\oint_C f\, dz
Contour integral
"the contour integral of f along C"
Integral along a closed curve in the complex plane
\(\nabla f\)
\nabla f
Gradient
"del f" / "the gradient of f"
Vector of all partial derivatives — points "uphill"
\(\nabla^2 f\)
\nabla^2 f
Laplacian
"the Laplacian of f"
Sum of second partial derivatives — measures "curvature"
\(\sum_{i=1}^{n} a_i\)
\sum_{i=1}^{n} a_i
Summation
"the sum of a-i from i equals 1 to n"
\(\sum_{i=1}^{3} i = 1 + 2 + 3 = 6\)
\(\prod_{i=1}^{n} a_i\)
\prod_{i=1}^{n} a_i
Product
"the product of a-i from i equals 1 to n"
\(\prod_{i=1}^{3} i = 1 \cdot 2 \cdot 3 = 6\)
\(\infty\)
\infty
Infinity
"infinity"
Not a number — a shorthand for "grows without bound"
The Epsilon-Delta Pattern
The most important pattern in analysis: "\(\forall \varepsilon > 0,\ \exists \delta > 0\) such that \(\ldots\)" This says: "You name any tolerance (\(\varepsilon\)), no matter how small. I can find a matching tolerance (\(\delta\)) that makes the statement work." It is a challenge-response game — the definition is satisfied if you (the prover) can always respond to any challenge.
Category theory studies mathematical structure at the highest level of abstraction — objects and the arrows between them. See Layer 8 — Category Theory.
Symbol
KaTeX
Name
Read As
Example
\(\mathcal{C}\)
\mathcal{C}
Category
"C" (a category)
Set (sets and functions), Grp (groups and homomorphisms)
\(\text{Ob}(\mathcal{C})\)
\text{Ob}(\mathcal{C})
Objects
"the objects of C"
In Set: all sets
\(\text{Hom}(A, B)\)
\text{Hom}(A, B)
Morphisms / Hom-set
"the morphisms from A to B"
In Set: all functions from set A to set B
\(f: A \to B\)
f: A \to B
Morphism
"f is a morphism from A to B"
Same arrow notation as functions — intentionally
\(F: \mathcal{C} \to \mathcal{D}\)
F: \mathcal{C} \to \mathcal{D}
Functor
"F is a functor from C to D"
A "structure-preserving map" between categories
\(\eta: F \Rightarrow G\)
\eta: F \Rightarrow G
Natural transformation
"eta is a natural transformation from F to G"
A "systematic way" to convert one functor into another
\(F \dashv G\)
F \dashv G
Adjunction
"F is left adjoint to G"
The deepest notion of "duality" between two functors
The Hierarchy of Arrows
Category theory builds in layers: morphisms (arrows between objects) functors (arrows between categories) natural transformations (arrows between functors). Each level studies "maps between the things at the previous level."
A working reference of essential terms spanning all nine layers of the mathematical hierarchy. Terms are grouped alphabetically; hover-tooltip definitions are provided at the bottom for use across the knowledge base.
A group \((G, \ast)\) in which the operation is commutative: \(a \ast b = b \ast a\) for all \(a, b \in G\).
Adjunction
A pair of functors \(F \dashv G\) related by a natural bijection \(\text{Hom}(F(A), B) \cong \text{Hom}(A, G(B))\). The most fundamental relationship between categories.
Algebraic Closure
A field extension in which every non-constant polynomial has a root. \(\mathbb{C}\) is the algebraic closure of \(\mathbb{R}\).
Axiom
A statement accepted without proof that serves as a starting point for a deductive system.
Axiom of Choice
For any collection of non-empty sets, there exists a function selecting one element from each set. Equivalent to Zorn's lemma and the well-ordering theorem.
A measure of the "size" of a set. Two sets have equal cardinality if a bijection exists between them.
Category
A collection of objects and morphisms (arrows) between them, equipped with composition and identity morphisms satisfying associativity and identity laws.
Coherence Thesis
The meta-analytical claim that mathematics is one unified system — not a collection of independent disciplines — evidenced by constant recurrence, bridge theorems, and the forced hierarchy.
Cauchy Sequence
A sequence \((a_n)\) in a metric space where for every \(\varepsilon > 0\) there exists \(N\) such that \(d(a_m, a_n) < \varepsilon\) for all \(m, n > N\).
Commutative Ring
A ring in which multiplication is commutative: \(ab = ba\).
Compactness
A topological property generalizing closed and bounded subsets of \(\mathbb{R}^n\); equivalently, every open cover admits a finite subcover.
Completeness
(Analysis) A metric space in which every Cauchy sequence converges. (Logic) A property of a deductive system in which every semantically valid formula is provable.
Complex Number
An element of \(\mathbb{C} = \{a + bi \mid a, b \in \mathbb{R}\}\), where \(i^2 = -1\).
Conjecture
A mathematical statement believed to be true but not yet proven.
Continuity
A function \(f\) is continuous at \(a\) if \(\lim_{x \to a} f(x) = f(a)\). Intuitively, small changes in input produce small changes in output.
Convergence
A sequence \((a_n)\) converges to \(L\) if for every \(\varepsilon > 0\) there exists \(N\) such that (
Corollary
A result that follows directly from a theorem with little or no additional proof.
A partition of \(\mathbb{Q}\) into two non-empty sets \((A, B)\) where every element of \(A\) is less than every element of \(B\) and \(A\) has no greatest element. Used to construct \(\mathbb{R}\).
Derivative
The instantaneous rate of change of \(f\) at \(x\): \(f'(x) = \lim_{h \to 0} \frac{f(x+h) - f(x)}{h}\).
Diffeomorphism
A smooth bijection between manifolds whose inverse is also smooth; the natural notion of equivalence in differential geometry.
Distribution
A probability measure on a measurable space describing the likelihood of outcomes for a random variable.
A scalar \(\lambda\) such that \(Av = \lambda v\) for some non-zero vector \(v\) (the eigenvector) and linear map \(A\).
Epsilon-Delta Definition
The rigorous definition of limits: for every \(\varepsilon > 0\), there exists \(\delta > 0\) such that closeness in input (\(\delta\)) guarantees closeness in output (\(\varepsilon\)).
Existential Quantifier
The symbol \(\exists\), meaning "there exists" or "for some." Used to assert that at least one object satisfies a condition.
A function \(f\) where \(f(a) = f(b) \implies a = b\). Also called "one-to-one."
Integral
The Riemann or Lebesgue integral measures the "accumulated value" of a function over a domain. \(\int_a^b f(x)\,dx\).
Irrational Number
A real number that cannot be expressed as a ratio of integers. Examples: \(\sqrt{2}\), \(\pi\), \(e\).
Isomorphism
A bijective homomorphism — a structure-preserving map with a structure-preserving inverse. Two objects are isomorphic if they are "algebraically the same."
A topological space that locally resembles \(\mathbb{R}^n\). Smooth manifolds carry differentiable structure.
Measure
A function assigning a non-negative extended real number to subsets of a space, generalizing length, area, and volume. Must be countably additive.
Monad
An endofunctor \(T: \mathcal{C} \to \mathcal{C}\) equipped with unit and multiplication natural transformations satisfying associativity and identity laws. In programming, structures computation with effects (e.g., Haskell's IO, Maybe).
Morphism
An arrow in a category — a generalization of "structure-preserving map" that abstracts functions, homomorphisms, and continuous maps.
A measurable function from a probability space to \(\mathbb{R}\) (or \(\mathbb{R}^n\)).
Ring
A set equipped with two operations (addition and multiplication) where addition forms an abelian group, multiplication is associative, and multiplication distributes over addition.
A collection \(\mathcal{F}\) of subsets of \(\Omega\) closed under complement and countable union. Defines which events can be assigned probability or measure.
Surjection
A function \(f: A \to B\) where every element of \(B\) is the image of at least one element of \(A\). Also called "onto."
A propositional formula that is true under every truth-value assignment. Example: \(P \lor \lnot P\).
Theorem
A mathematical statement proven true within a formal system.
Topology
The study of properties preserved under continuous deformations. A topology on a set \(X\) is a collection of "open" subsets closed under arbitrary unions and finite intersections.
Transcendental Number
A real or complex number that is not a root of any non-zero polynomial with integer coefficients. Examples: \(\pi\), \(e\).
Tree
A connected acyclic graph. Equivalently, a graph on \(n\) vertices with exactly \(n - 1\) edges and no cycles.
A set \(V\) over a field \(F\) equipped with addition and scalar multiplication satisfying eight axioms (closure, associativity, distributivity, identity elements, inverses).